forked from cil-project/cil
-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathcparser.mly
1569 lines (1397 loc) · 58 KB
/
cparser.mly
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*(*
*
* Copyright (c) 2001-2003,
* George C. Necula <[email protected]>
* Scott McPeak <[email protected]>
* Wes Weimer <[email protected]>
* Ben Liblit <[email protected]>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. The names of the contributors may not be used to endorse or promote
* products derived from this software without specific prior written
* permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
**)
(**
** 1.0 3.22.99 Hugues Cass� First version.
** 2.0 George Necula 12/12/00: Practically complete rewrite.
*)
*/
%{
open Cabs
open Cabshelper
module E = Errormsg
let parse_error msg : unit = (* sm: c++-mode highlight hack: -> ' <- *)
E.parse_error msg
let print = print_string
(* unit -> string option *)
(*
let getComments () =
match !comments with
[] -> None
| _ ->
let r = Some(String.concat "\n" (List.rev !comments)) in
comments := [];
r
*)
(* cabsloc -> cabsloc *)
(*
let handleLoc l =
l.clcomment <- getComments();
l
*)
(*
** Expression building
*)
let smooth_expression lst =
match lst with
[] -> NOTHING
| [expr] -> expr
| _ -> COMMA (lst)
let currentFunctionName = ref "<outside any function>"
let announceFunctionName ((n, decl, _, _):name) =
!Lexerhack.add_identifier n;
(* Start a context that includes the parameter names and the whole body.
* Will pop when we finish parsing the function body *)
!Lexerhack.push_context ();
(* Go through all the parameter names and mark them as identifiers *)
let rec findProto = function
PROTO (d, args, _) when isJUSTBASE d ->
List.iter (fun (_, (an, _, _, _)) -> !Lexerhack.add_identifier an) args
| PROTO (d, _, _) -> findProto d
| PARENTYPE (_, d, _) -> findProto d
| PTR (_, d) -> findProto d
| ARRAY (d, _, _) -> findProto d
| _ -> parse_error "Cannot find the prototype in a function definition";
raise Parsing.Parse_error
and isJUSTBASE = function
JUSTBASE -> true
| PARENTYPE (_, d, _) -> isJUSTBASE d
| _ -> false
in
findProto decl;
currentFunctionName := n
let applyPointer (ptspecs: attribute list list) (dt: decl_type)
: decl_type =
(* Outer specification first *)
let rec loop = function
[] -> dt
| attrs :: rest -> PTR(attrs, loop rest)
in
loop ptspecs
let doDeclaration (loc: cabsloc) (specs: spec_elem list) (nl: init_name list) : definition =
if isTypedef specs then begin
(* Tell the lexer about the new type names *)
List.iter (fun ((n, _, _, _), _) -> !Lexerhack.add_type n) nl;
TYPEDEF ((specs, List.map (fun (n, _) -> n) nl), loc)
end else
if nl = [] then
ONLYTYPEDEF (specs, loc)
else begin
(* Tell the lexer about the new variable names *)
List.iter (fun ((n, _, _, _), _) -> !Lexerhack.add_identifier n) nl;
DECDEF ((specs, nl), loc)
end
let doFunctionDef (loc: cabsloc)
(lend: cabsloc)
(specs: spec_elem list)
(n: name)
(b: block) : definition =
let fname = (specs, n) in
FUNDEF (fname, b, loc, lend)
let doOldParDecl (names: string list)
((pardefs: name_group list), (isva: bool))
: single_name list * bool =
let findOneName n =
(* Search in pardefs for the definition for this parameter *)
let rec loopGroups = function
[] -> ([SpecType Tint], (n, JUSTBASE, [], cabslu))
| (specs, names) :: restgroups ->
let rec loopNames = function
[] -> loopGroups restgroups
| ((n',_, _, _) as sn) :: _ when n' = n -> (specs, sn)
| _ :: restnames -> loopNames restnames
in
loopNames names
in
loopGroups pardefs
in
let args = List.map findOneName names in
(args, isva)
let checkConnective (s : string) : unit =
begin
(* checking this means I could possibly have more connectives, with *)
(* different meaning *)
if (s <> "to") then (
parse_error "transformer connective must be 'to'";
raise Parsing.Parse_error
)
else ()
end
let int64_to_char value =
if (compare value (Int64.of_int 255) > 0) || (compare value Int64.zero < 0) then
begin
let msg = Printf.sprintf "cparser:intlist_to_string: character 0x%Lx too big" value in
parse_error msg;
raise Parsing.Parse_error
end
else
Char.chr (Int64.to_int value)
(* takes a not-nul-terminated list, and converts it to a string. *)
let rec intlist_to_string (str: int64 list):string =
match str with
[] -> "" (* add nul-termination *)
| value::rest ->
let this_char = int64_to_char value in
(String.make 1 this_char) ^ (intlist_to_string rest)
let fst3 (result, _, _) = result
let snd3 (_, result, _) = result
let trd3 (_, _, result) = result
(*
transform: __builtin_offsetof(type, member)
into : (size_t) (&(type * ) 0)->member
*)
let transformOffsetOf (speclist, dtype) member =
let rec addPointer = function
| JUSTBASE ->
PTR([], JUSTBASE)
| PARENTYPE (attrs1, dtype, attrs2) ->
PARENTYPE (attrs1, addPointer dtype, attrs2)
| ARRAY (dtype, attrs, expr) ->
ARRAY (addPointer dtype, attrs, expr)
| PTR (attrs, dtype) ->
PTR (attrs, addPointer dtype)
| PROTO (dtype, names, variadic) ->
PROTO (addPointer dtype, names, variadic)
in
let nullType = (speclist, addPointer dtype) in
let nullExpr = CONSTANT (CONST_INT "0") in
let castExpr = CAST (nullType, SINGLE_INIT nullExpr) in
let rec replaceBase = function
| VARIABLE field ->
MEMBEROFPTR (castExpr, field)
| MEMBEROF (base, field) ->
MEMBEROF (replaceBase base, field)
| INDEX (base, index) ->
INDEX (replaceBase base, index)
| _ ->
parse_error "malformed offset expression in __builtin_offsetof";
raise Parsing.Parse_error
in
let memberExpr = replaceBase member in
let addrExpr = UNARY (ADDROF, memberExpr) in
let sizeofType = [SpecType Tsizet], JUSTBASE in
let resultExpr = CAST (sizeofType, SINGLE_INIT addrExpr) in
resultExpr
%}
%token <string * Cabs.cabsloc> IDENT
%token <string * Cabs.cabsloc> QUALIFIER
%token <int64 list * Cabs.cabsloc> CST_CHAR
%token <int64 list * Cabs.cabsloc> CST_WCHAR
%token <string * Cabs.cabsloc> CST_INT
%token <string * Cabs.cabsloc> CST_FLOAT
%token <string * Cabs.cabsloc> CST_COMPLEX
%token <string * Cabs.cabsloc> NAMED_TYPE
/* Each character is its own list element, and the terminating nul is not
included in this list. */
%token <int64 list * Cabs.cabsloc> CST_STRING
%token <int64 list * Cabs.cabsloc> CST_WSTRING
%token EOF
%token<Cabs.cabsloc> CHAR INT BOOL DOUBLE FLOAT VOID INT64 INT32
%token<Cabs.cabsloc> INT128 FLOAT128 COMPLEX /* C99 */
%token<Cabs.cabsloc> GENERIC NORETURN /* C11 */
%token<Cabs.cabsloc> ENUM STRUCT TYPEDEF UNION
%token<Cabs.cabsloc> SIGNED UNSIGNED LONG SHORT
%token<Cabs.cabsloc> VOLATILE EXTERN STATIC CONST RESTRICT AUTO REGISTER
%token<Cabs.cabsloc> THREAD
%token<Cabs.cabsloc> SIZEOF ALIGNOF
%token EQ PLUS_EQ MINUS_EQ STAR_EQ SLASH_EQ PERCENT_EQ
%token AND_EQ PIPE_EQ CIRC_EQ INF_INF_EQ SUP_SUP_EQ
%token ARROW DOT
%token EQ_EQ EXCLAM_EQ INF SUP INF_EQ SUP_EQ
%token<Cabs.cabsloc> PLUS MINUS STAR
%token SLASH PERCENT
%token<Cabs.cabsloc> TILDE AND
%token PIPE CIRC
%token<Cabs.cabsloc> EXCLAM AND_AND
%token PIPE_PIPE
%token INF_INF SUP_SUP
%token<Cabs.cabsloc> PLUS_PLUS MINUS_MINUS
%token<Cabs.cabsloc> RPAREN
%token<Cabs.cabsloc> LPAREN RBRACE
%token<Cabs.cabsloc> LBRACE
%token LBRACKET RBRACKET
%token<Cabs.cabsloc> COLON
%token<Cabs.cabsloc> SEMICOLON
%token COMMA ELLIPSIS QUEST
%token<Cabs.cabsloc> BREAK CONTINUE GOTO RETURN
%token<Cabs.cabsloc> SWITCH CASE DEFAULT
%token<Cabs.cabsloc> WHILE DO FOR
%token<Cabs.cabsloc> IF
%token ELSE
%token<Cabs.cabsloc> ATTRIBUTE INLINE ASM TYPEOF REAL IMAG FUNCTION__ PRETTY_FUNCTION__ CLASSIFYTYPE
%token LABEL__
%token<Cabs.cabsloc> BUILTIN_VA_ARG ATTRIBUTE_USED
%token BUILTIN_VA_LIST
%token BLOCKATTRIBUTE
%token<Cabs.cabsloc> BUILTIN_TYPES_COMPAT BUILTIN_OFFSETOF
%token<Cabs.cabsloc> DECLSPEC
%token<string * Cabs.cabsloc> PRAGMA_LINE
%token<Cabs.cabsloc> PRAGMA
%token PRAGMA_EOL
/* sm: cabs tree transformation specification keywords */
%token<Cabs.cabsloc> AT_TRANSFORM AT_TRANSFORMEXPR AT_SPECIFIER AT_EXPR
%token AT_NAME
/* operator precedence */
%nonassoc IF
%nonassoc ELSE
%left COMMA
%right EQ PLUS_EQ MINUS_EQ STAR_EQ SLASH_EQ PERCENT_EQ
AND_EQ PIPE_EQ CIRC_EQ INF_INF_EQ SUP_SUP_EQ
%right QUEST COLON
%left PIPE_PIPE
%left AND_AND
%left PIPE
%left CIRC
%left AND
%left EQ_EQ EXCLAM_EQ
%left INF SUP INF_EQ SUP_EQ
%left INF_INF SUP_SUP
%left PLUS MINUS
%left STAR SLASH PERCENT CONST RESTRICT VOLATILE COMPLEX
%right EXCLAM TILDE PLUS_PLUS MINUS_MINUS CAST RPAREN ADDROF SIZEOF ALIGNOF IMAG REAL CLASSIFYTYPE
%left LBRACKET
%left DOT ARROW LPAREN LBRACE
%right NAMED_TYPE /* We'll use this to handle redefinitions of
* NAMED_TYPE as variables */
%left IDENT
/* Non-terminals informations */
%start interpret file
%type <Cabs.definition list> file interpret globals
%type <Cabs.definition> global
%type <Cabs.attribute list> attributes attributes_with_asm asmattr
%type <Cabs.statement> statement
%type <Cabs.constant * cabsloc> constant
%type <string * cabsloc> string_constant
%type <Cabs.expression * cabsloc> expression
%type <Cabs.expression> opt_expression
%type <Cabs.init_expression> init_expression
%type <Cabs.expression list * cabsloc> comma_expression
%type <Cabs.expression list * cabsloc> paren_comma_expression
%type <Cabs.expression list> arguments
%type <Cabs.expression list> bracket_comma_expression
%type <int64 list Queue.t * cabsloc> string_list
%type <int64 list * cabsloc> wstring_list
%type <Cabs.initwhat * Cabs.init_expression> initializer
%type <(Cabs.initwhat * Cabs.init_expression) list> initializer_list
%type <Cabs.initwhat> init_designators init_designators_opt
%type <spec_elem list * cabsloc> decl_spec_list
%type <typeSpecifier * cabsloc> type_spec
%type <Cabs.field_group list> struct_decl_list
%type <Cabs.name> old_proto_decl
%type <Cabs.single_name> parameter_decl
%type <Cabs.enum_item> enumerator
%type <Cabs.enum_item list> enum_list
%type <Cabs.definition> declaration function_def
%type <cabsloc * spec_elem list * name> function_def_start
%type <Cabs.spec_elem list * Cabs.decl_type> type_name
%type <Cabs.block * cabsloc * cabsloc> block
%type <Cabs.statement list> block_element_list
%type <string list> local_labels local_label_names
%type <string list> old_parameter_list_ne
%type <Cabs.init_name> init_declarator
%type <Cabs.init_name list> init_declarator_list
%type <Cabs.name> declarator
%type <Cabs.name * expression option> field_decl
%type <(Cabs.name * expression option) list> field_decl_list
%type <string * Cabs.decl_type> direct_decl
%type <Cabs.decl_type> abs_direct_decl abs_direct_decl_opt
%type <Cabs.decl_type * Cabs.attribute list> abstract_decl
/* (* Each element is a "* <type_quals_opt>". *) */
%type <attribute list list * cabsloc> pointer pointer_opt
%type <Cabs.cabsloc> location
%type <Cabs.spec_elem * cabsloc> cvspec
%%
interpret:
file EOF {$1}
;
file: globals {$1}
;
globals:
/* empty */ { [] }
| global globals { $1 :: $2 }
| SEMICOLON globals { $2 }
;
location:
/* empty */ { currentLoc () } %prec IDENT
/*** Global Definition ***/
global:
| declaration { $1 }
| function_def { $1 }
/*(* Some C header files ar shared with the C++ compiler and have linkage
* specification *)*/
| EXTERN string_constant declaration { LINKAGE (fst $2, (*handleLoc*) (snd $2), [ $3 ]) }
| EXTERN string_constant LBRACE globals RBRACE
{ LINKAGE (fst $2, (*handleLoc*) (snd $2), $4) }
| ASM LPAREN string_constant RPAREN SEMICOLON
{ GLOBASM (fst $3, (*handleLoc*) $1) }
| pragma { $1 }
/* (* Old-style function prototype. This should be somewhere else, like in
* "declaration". For now we keep it at global scope only because in local
* scope it looks too much like a function call *) */
| IDENT LPAREN old_parameter_list_ne RPAREN old_pardef_list SEMICOLON
{ (* Convert pardecl to new style *)
let pardecl, isva = doOldParDecl $3 $5 in
(* Make the function declarator *)
doDeclaration ((*handleLoc*) (snd $1)) []
[((fst $1, PROTO(JUSTBASE, pardecl,isva), [], cabslu),
NO_INIT)]
}
/* (* Old style function prototype, but without any arguments *) */
| IDENT LPAREN RPAREN SEMICOLON
{ (* Make the function declarator *)
doDeclaration ((*handleLoc*)(snd $1)) []
[((fst $1, PROTO(JUSTBASE,[],false), [], cabslu),
NO_INIT)]
}
/* transformer for a toplevel construct */
| AT_TRANSFORM LBRACE global RBRACE IDENT/*to*/ LBRACE globals RBRACE {
checkConnective(fst $5);
TRANSFORMER($3, $7, $1)
}
/* transformer for an expression */
| AT_TRANSFORMEXPR LBRACE expression RBRACE IDENT/*to*/ LBRACE expression RBRACE {
checkConnective(fst $5);
EXPRTRANSFORMER(fst $3, fst $7, $1)
}
| location error SEMICOLON { PRAGMA (VARIABLE "parse_error", $1) }
;
id_or_typename:
IDENT {fst $1}
| NAMED_TYPE {fst $1}
| AT_NAME LPAREN IDENT RPAREN { "@name(" ^ fst $3 ^ ")" } /* pattern variable name */
;
maybecomma:
/* empty */ { () }
| COMMA { () }
;
/* *** Expressions *** */
primary_expression: /*(* 6.5.1. *)*/
| IDENT
{VARIABLE (fst $1), snd $1}
| constant
{CONSTANT (fst $1), snd $1}
| paren_comma_expression
{PAREN (smooth_expression (fst $1)), snd $1}
| LPAREN block RPAREN
{ GNU_BODY (fst3 $2), $1 }
/*(* Next is Scott's transformer *)*/
| AT_EXPR LPAREN IDENT RPAREN /* expression pattern variable */
{ EXPR_PATTERN(fst $3), $1 }
| GENERIC LPAREN assignment_expression COMMA generic_assoc_list RPAREN {GENERIC ((fst $3), $5), $1}
;
/* (specifier, expression) list */
generic_assoc_list:
| generic_association {[$1]}
| generic_assoc_list COMMA generic_association {$3 :: $1}
/* specifier, expression */
generic_association:
| type_name COLON assignment_expression {($1, fst $3)}
| DEFAULT COLON assignment_expression {([SpecType Tdefault], JUSTBASE), fst $3}
postfix_expression: /*(* 6.5.2 *)*/
| primary_expression
{ $1 }
| postfix_expression bracket_comma_expression
{INDEX (fst $1, smooth_expression $2), snd $1}
| postfix_expression LPAREN arguments RPAREN
{CALL (fst $1, $3), snd $1}
| BUILTIN_VA_ARG LPAREN expression COMMA type_name RPAREN
{ let b, d = $5 in
CALL (VARIABLE "__builtin_va_arg",
[fst $3; TYPE_SIZEOF (b, d)]), $1 }
| BUILTIN_TYPES_COMPAT LPAREN type_name COMMA type_name RPAREN
{ let b1,d1 = $3 in
let b2,d2 = $5 in
CALL (VARIABLE "__builtin_types_compatible_p",
[TYPE_SIZEOF(b1,d1); TYPE_SIZEOF(b2,d2)]), $1 }
| BUILTIN_OFFSETOF LPAREN type_name COMMA offsetof_member_designator RPAREN
{ transformOffsetOf $3 $5, $1 }
| postfix_expression DOT id_or_typename
{MEMBEROF (fst $1, $3), snd $1}
| postfix_expression ARROW id_or_typename
{MEMBEROFPTR (fst $1, $3), snd $1}
| postfix_expression PLUS_PLUS
{UNARY (POSINCR, fst $1), snd $1}
| postfix_expression MINUS_MINUS
{UNARY (POSDECR, fst $1), snd $1}
/* (* We handle GCC constructor expressions *) */
| LPAREN type_name RPAREN LBRACE initializer_list_opt RBRACE
{ CAST($2, COMPOUND_INIT $5), $1 }
;
offsetof_member_designator: /* GCC extension for __builtin_offsetof */
| id_or_typename
{ VARIABLE ($1) }
| offsetof_member_designator DOT IDENT
{ MEMBEROF ($1, fst $3) }
| offsetof_member_designator bracket_comma_expression
{ INDEX ($1, smooth_expression $2) }
;
unary_expression: /*(* 6.5.3 *)*/
| postfix_expression
{ $1 }
| PLUS_PLUS unary_expression
{UNARY (PREINCR, fst $2), $1}
| MINUS_MINUS unary_expression
{UNARY (PREDECR, fst $2), $1}
| SIZEOF unary_expression
{EXPR_SIZEOF (fst $2), $1}
| SIZEOF LPAREN type_name RPAREN
{let b, d = $3 in TYPE_SIZEOF (b, d), $1}
| REAL cast_expression
{REAL (fst $2), $1}
| IMAG cast_expression
{IMAG (fst $2), $1}
| CLASSIFYTYPE cast_expression
{CLASSIFYTYPE (fst $2), $1}
| ALIGNOF unary_expression
{EXPR_ALIGNOF (fst $2), $1}
| ALIGNOF LPAREN type_name RPAREN
{let b, d = $3 in TYPE_ALIGNOF (b, d), $1}
| PLUS cast_expression
{UNARY (PLUS, fst $2), $1}
| MINUS cast_expression
{UNARY (MINUS, fst $2), $1}
| STAR cast_expression
{UNARY (MEMOF, fst $2), $1}
| AND cast_expression
{UNARY (ADDROF, fst $2), $1}
| EXCLAM cast_expression
{UNARY (NOT, fst $2), $1}
| TILDE cast_expression
{UNARY (BNOT, fst $2), $1}
| AND_AND IDENT { LABELADDR (fst $2), $1 }
;
cast_expression: /*(* 6.5.4 *)*/
| unary_expression
{ $1 }
| LPAREN type_name RPAREN cast_expression
{ CAST($2, SINGLE_INIT (fst $4)), $1 }
;
multiplicative_expression: /*(* 6.5.5 *)*/
| cast_expression
{ $1 }
| multiplicative_expression STAR cast_expression
{BINARY(MUL, fst $1, fst $3), snd $1}
| multiplicative_expression SLASH cast_expression
{BINARY(DIV, fst $1, fst $3), snd $1}
| multiplicative_expression PERCENT cast_expression
{BINARY(MOD, fst $1, fst $3), snd $1}
;
additive_expression: /*(* 6.5.6 *)*/
| multiplicative_expression
{ $1 }
| additive_expression PLUS multiplicative_expression
{BINARY(ADD, fst $1, fst $3), snd $1}
| additive_expression MINUS multiplicative_expression
{BINARY(SUB, fst $1, fst $3), snd $1}
;
shift_expression: /*(* 6.5.7 *)*/
| additive_expression
{ $1 }
| shift_expression INF_INF additive_expression
{BINARY(SHL, fst $1, fst $3), snd $1}
| shift_expression SUP_SUP additive_expression
{BINARY(SHR, fst $1, fst $3), snd $1}
;
relational_expression: /*(* 6.5.8 *)*/
| shift_expression
{ $1 }
| relational_expression INF shift_expression
{BINARY(LT, fst $1, fst $3), snd $1}
| relational_expression SUP shift_expression
{BINARY(GT, fst $1, fst $3), snd $1}
| relational_expression INF_EQ shift_expression
{BINARY(LE, fst $1, fst $3), snd $1}
| relational_expression SUP_EQ shift_expression
{BINARY(GE, fst $1, fst $3), snd $1}
;
equality_expression: /*(* 6.5.9 *)*/
| relational_expression
{ $1 }
| equality_expression EQ_EQ relational_expression
{BINARY(EQ, fst $1, fst $3), snd $1}
| equality_expression EXCLAM_EQ relational_expression
{BINARY(NE, fst $1, fst $3), snd $1}
;
bitwise_and_expression: /*(* 6.5.10 *)*/
| equality_expression
{ $1 }
| bitwise_and_expression AND equality_expression
{BINARY(BAND, fst $1, fst $3), snd $1}
;
bitwise_xor_expression: /*(* 6.5.11 *)*/
| bitwise_and_expression
{ $1 }
| bitwise_xor_expression CIRC bitwise_and_expression
{BINARY(XOR, fst $1, fst $3), snd $1}
;
bitwise_or_expression: /*(* 6.5.12 *)*/
| bitwise_xor_expression
{ $1 }
| bitwise_or_expression PIPE bitwise_xor_expression
{BINARY(BOR, fst $1, fst $3), snd $1}
;
logical_and_expression: /*(* 6.5.13 *)*/
| bitwise_or_expression
{ $1 }
| logical_and_expression AND_AND bitwise_or_expression
{BINARY(AND, fst $1, fst $3), snd $1}
;
logical_or_expression: /*(* 6.5.14 *)*/
| logical_and_expression
{ $1 }
| logical_or_expression PIPE_PIPE logical_and_expression
{BINARY(OR, fst $1, fst $3), snd $1}
;
conditional_expression: /*(* 6.5.15 *)*/
| logical_or_expression
{ $1 }
| logical_or_expression QUEST opt_expression COLON conditional_expression
{QUESTION (fst $1, $3, fst $5), snd $1}
;
/*(* The C spec says that left-hand sides of assignment expressions are unary
* expressions. GCC allows cast expressions in there ! *)*/
assignment_expression: /*(* 6.5.16 *)*/
| conditional_expression
{ $1 }
| cast_expression EQ assignment_expression
{BINARY(ASSIGN, fst $1, fst $3), snd $1}
| cast_expression PLUS_EQ assignment_expression
{BINARY(ADD_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression MINUS_EQ assignment_expression
{BINARY(SUB_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression STAR_EQ assignment_expression
{BINARY(MUL_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression SLASH_EQ assignment_expression
{BINARY(DIV_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression PERCENT_EQ assignment_expression
{BINARY(MOD_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression AND_EQ assignment_expression
{BINARY(BAND_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression PIPE_EQ assignment_expression
{BINARY(BOR_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression CIRC_EQ assignment_expression
{BINARY(XOR_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression INF_INF_EQ assignment_expression
{BINARY(SHL_ASSIGN, fst $1, fst $3), snd $1}
| cast_expression SUP_SUP_EQ assignment_expression
{BINARY(SHR_ASSIGN, fst $1, fst $3), snd $1}
;
expression: /*(* 6.5.17 *)*/
assignment_expression
{ $1 }
;
constant:
CST_INT {CONST_INT (fst $1), snd $1}
| CST_FLOAT {CONST_FLOAT (fst $1), snd $1}
| CST_COMPLEX {CONST_COMPLEX (fst $1), snd $1}
| CST_CHAR {CONST_CHAR (fst $1), snd $1}
| CST_WCHAR {CONST_WCHAR (fst $1), snd $1}
| string_constant {CONST_STRING (fst $1), snd $1}
| wstring_list {CONST_WSTRING (fst $1), snd $1}
;
string_constant:
/* Now that we know this constant isn't part of a wstring, convert it
back to a string for easy viewing. */
string_list {
let queue, location = $1 in
let buffer = Buffer.create (Queue.length queue) in
Queue.iter
(List.iter
(fun value ->
let char = int64_to_char value in
Buffer.add_char buffer char))
queue;
Buffer.contents buffer, location
}
;
one_string_constant:
/* Don't concat multiple strings. For asm templates. */
CST_STRING {intlist_to_string (fst $1) }
;
string_list:
one_string {
let queue = Queue.create () in
Queue.add (fst $1) queue;
queue, snd $1
}
| string_list one_string {
Queue.add (fst $2) (fst $1);
$1
}
;
wstring_list:
CST_WSTRING { $1 }
| wstring_list one_string { (fst $1) @ (fst $2), snd $1 }
| wstring_list CST_WSTRING { (fst $1) @ (fst $2), snd $1 }
/* Only the first string in the list needs an L, so L"a" "b" is the same
* as L"ab" or L"a" L"b". */
one_string:
CST_STRING {$1}
| FUNCTION__ {(Cabshelper.explodeStringToInts
!currentFunctionName), $1}
| PRETTY_FUNCTION__ {(Cabshelper.explodeStringToInts
!currentFunctionName), $1}
;
init_expression:
expression { SINGLE_INIT (fst $1) }
| LBRACE initializer_list_opt RBRACE
{ COMPOUND_INIT $2}
initializer_list: /* ISO 6.7.8. Allow a trailing COMMA */
initializer { [$1] }
| initializer COMMA initializer_list_opt { $1 :: $3 }
;
initializer_list_opt:
/* empty */ { [] }
| initializer_list { $1 }
;
initializer:
init_designators eq_opt init_expression { ($1, $3) }
| gcc_init_designators init_expression { ($1, $2) }
| init_expression { (NEXT_INIT, $1) }
;
eq_opt:
EQ { () }
/*(* GCC allows missing = *)*/
| /*(* empty *)*/ { () }
;
init_designators:
DOT id_or_typename init_designators_opt { INFIELD_INIT($2, $3) }
| LBRACKET expression RBRACKET init_designators_opt
{ ATINDEX_INIT(fst $2, $4) }
| LBRACKET expression ELLIPSIS expression RBRACKET
{ ATINDEXRANGE_INIT(fst $2, fst $4) }
;
init_designators_opt:
/* empty */ { NEXT_INIT }
| init_designators { $1 }
;
gcc_init_designators: /*(* GCC supports these strange things *)*/
id_or_typename COLON { INFIELD_INIT($1, NEXT_INIT) }
;
arguments:
/* empty */ { [] }
| comma_expression { fst $1 }
;
opt_expression:
/* empty */
{NOTHING}
| comma_expression
{smooth_expression (fst $1)}
;
comma_expression:
expression {[fst $1], snd $1}
| expression COMMA comma_expression { fst $1 :: fst $3, snd $1 }
| error COMMA comma_expression { $3 }
;
comma_expression_opt:
/* empty */ { NOTHING }
| comma_expression { smooth_expression (fst $1) }
;
paren_comma_expression:
LPAREN comma_expression RPAREN { $2 }
| LPAREN error RPAREN { [], $1 }
;
bracket_comma_expression:
LBRACKET comma_expression RBRACKET { fst $2 }
| LBRACKET error RBRACKET { [] }
;
/*** statements ***/
block: /* ISO 6.8.2 */
block_begin local_labels block_attrs block_element_list RBRACE
{!Lexerhack.pop_context();
{ blabels = $2;
battrs = $3;
bstmts = $4 },
$1, $5
}
| error location RBRACE { { blabels = [];
battrs = [];
bstmts = [] },
$2, $3
}
;
block_begin:
LBRACE {!Lexerhack.push_context (); $1}
;
block_attrs:
/* empty */ { [] }
| BLOCKATTRIBUTE paren_attr_list_ne
{ [("__blockattribute__", $2)] }
;
/* statements and declarations in a block, in any order (for C99 support) */
block_element_list:
/* empty */ { [] }
| declaration block_element_list { DEFINITION($1) :: $2 }
| statement block_element_list { $1 :: $2 }
/*(* GCC accepts a label at the end of a block *)*/
| IDENT COLON { [ LABEL (fst $1, NOP (snd $1),
snd $1)] }
| pragma block_element_list { $2 }
;
local_labels:
/* empty */ { [] }
| LABEL__ local_label_names SEMICOLON local_labels { $2 @ $4 }
;
local_label_names:
IDENT { [ fst $1 ] }
| IDENT COMMA local_label_names { fst $1 :: $3 }
;
statement:
SEMICOLON {NOP ((*handleLoc*) $1) }
| comma_expression SEMICOLON
{COMPUTATION (smooth_expression (fst $1), joinLoc (snd $1) $2)}
| block {BLOCK (fst3 $1, joinLoc (snd3 $1) (trd3 $1))}
| IF paren_comma_expression location statement location %prec IF
{IF (smooth_expression (fst $2), $4, NOP $1, joinLoc $1 $5, joinLoc (snd $2) $3)}
| IF paren_comma_expression location statement location ELSE statement location
{IF (smooth_expression (fst $2), $4, $7, joinLoc $1 $8, joinLoc (snd $2) $3)}
| SWITCH paren_comma_expression location statement location
{SWITCH (smooth_expression (fst $2), $4, joinLoc $1 $5, joinLoc (snd $2) $3)}
| WHILE paren_comma_expression location statement location
{WHILE (smooth_expression (fst $2), $4, joinLoc $1 $5, joinLoc (snd $2) $3)}
| DO statement WHILE paren_comma_expression SEMICOLON
{DOWHILE (smooth_expression (fst $4), $2, joinLoc $1 $5, joinLoc (snd $4) $5)}
| FOR LPAREN for_clause opt_expression
SEMICOLON opt_expression RPAREN statement location
{FOR ($3, $4, $6, $8, joinLoc $1 $9, joinLoc $2 $7)}
| IDENT COLON attribute_nocv_list location statement
{(* The only attribute that should appear here
is "unused". For now, we drop this on the
floor, since unused labels are usually
removed anyways by Rmtmps. *)
LABEL (fst $1, $5, joinLoc (snd $1) $4)}
| CASE expression COLON statement location
{CASE (fst $2, $4, joinLoc $1 $5, joinLoc $1 $3)}
| CASE expression ELLIPSIS expression COLON statement location
{CASERANGE (fst $2, fst $4, $6, joinLoc $1 $7, joinLoc $1 $5)}
| DEFAULT COLON statement location
{DEFAULT ($3, joinLoc $1 $4, joinLoc $1 $2)}
| RETURN SEMICOLON {RETURN (NOTHING, joinLoc $1 $2)}
| RETURN comma_expression SEMICOLON
{RETURN (smooth_expression (fst $2), joinLoc $1 $3)}
| BREAK SEMICOLON {BREAK (joinLoc $1 $2)}
| CONTINUE SEMICOLON {CONTINUE (joinLoc $1 $2)}
| GOTO IDENT SEMICOLON
{GOTO (fst $2, joinLoc $1 $3)}
| GOTO STAR comma_expression SEMICOLON
{ COMPGOTO (smooth_expression (fst $3), joinLoc $1 $4) }
| ASM asmattr LPAREN asmtemplate asmoutputs RPAREN SEMICOLON
{ ASM ($2, $4, $5, joinLoc $1 $7) }
| error location SEMICOLON { (NOP $2)}
;
for_clause:
opt_expression SEMICOLON { FC_EXP $1 }
| declaration { FC_DECL $1 }
;
declaration: /* ISO 6.7.*/
decl_spec_list init_declarator_list SEMICOLON
{ doDeclaration (joinLoc (snd $1) $3) (fst $1) $2 }
| decl_spec_list SEMICOLON
{ doDeclaration (joinLoc (snd $1) $2) (fst $1) [] }
;
init_declarator_list: /* ISO 6.7 */
init_declarator { [$1] }
| init_declarator COMMA init_declarator_list { $1 :: $3 }
;
init_declarator: /* ISO 6.7 */
declarator { ($1, NO_INIT) }
| declarator EQ init_expression
{ ($1, $3) }
;
decl_spec_list: /* ISO 6.7 */
/* ISO 6.7.1 */
| TYPEDEF decl_spec_list_opt { SpecTypedef :: $2, $1 }
| EXTERN decl_spec_list_opt { SpecStorage EXTERN :: $2, $1 }
| STATIC decl_spec_list_opt { SpecStorage STATIC :: $2, $1 }
| AUTO decl_spec_list_opt { SpecStorage AUTO :: $2, $1 }
| REGISTER decl_spec_list_opt { SpecStorage REGISTER :: $2, $1}
/* ISO 6.7.2 */
| type_spec decl_spec_list_opt_no_named { SpecType (fst $1) :: $2, snd $1 }
/* ISO 6.7.4 */
| INLINE decl_spec_list_opt { SpecInline :: $2, $1 }
| NORETURN decl_spec_list_opt { SpecNoreturn :: $2, $1 }
| cvspec decl_spec_list_opt { (fst $1) :: $2, snd $1 }
| attribute_nocv decl_spec_list_opt { SpecAttr (fst $1) :: $2, snd $1 }
/* specifier pattern variable (must be last in spec list) */
| AT_SPECIFIER LPAREN IDENT RPAREN { [ SpecPattern(fst $3) ], $1 }
;
/* (* In most cases if we see a NAMED_TYPE we must shift it. Thus we declare
* NAMED_TYPE to have right associativity *) */
decl_spec_list_opt:
/* empty */ { [] } %prec NAMED_TYPE
| decl_spec_list { fst $1 }
;
/* (* We add this separate rule to handle the special case when an appearance
* of NAMED_TYPE should not be considered as part of the specifiers but as
* part of the declarator. IDENT has higher precedence than NAMED_TYPE *)
*/
decl_spec_list_opt_no_named:
/* empty */ { [] } %prec IDENT
| decl_spec_list { fst $1 }
;
type_spec: /* ISO 6.7.2 */
VOID { Tvoid, $1}
| CHAR { Tchar, $1 }
| BOOL { Tbool, $1 }
| SHORT { Tshort, $1 }
| INT { Tint, $1 }
| LONG { Tlong, $1 }
| INT64 { Tint64, $1 }
| INT128 { Tint128, $1 }
| FLOAT { Tfloat, $1 }
| FLOAT128 { Tfloat128, $1 }
| DOUBLE { Tdouble, $1 }
/* | COMPLEX FLOAT { Tfloat, $2 } */
/* | COMPLEX FLOAT128{ Tfloat128, $2 } */
/* | COMPLEX DOUBLE { Tdouble, $2 } */
| SIGNED { Tsigned, $1 }
| UNSIGNED { Tunsigned, $1 }
| STRUCT id_or_typename
{ Tstruct ($2, None, []), $1 }
| STRUCT just_attributes id_or_typename
{ Tstruct ($3, None, $2), $1 }
| STRUCT id_or_typename LBRACE struct_decl_list RBRACE
{ Tstruct ($2, Some $4, []), $1 }
| STRUCT LBRACE struct_decl_list RBRACE
{ Tstruct ("", Some $3, []), $1 }
| STRUCT just_attributes id_or_typename LBRACE struct_decl_list RBRACE
{ Tstruct ($3, Some $5, $2), $1 }