forked from HaxeFoundation/haxe
-
Notifications
You must be signed in to change notification settings - Fork 1
/
ast.ml
914 lines (849 loc) · 22.7 KB
/
ast.ml
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
(*
The Haxe Compiler
Copyright (C) 2005-2016 Haxe Foundation
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*)
type pos = {
pfile : string;
pmin : int;
pmax : int;
}
module IntMap = Map.Make(struct type t = int let compare a b = a - b end)
module Meta = struct
type strict_meta =
| Abi
| Abstract
| Access
| Accessor
| Allow
| Analyzer
| Annotation
| ArrayAccess
| Ast
| AstSource
| AutoBuild
| Bind
| Bitmap
| BridgeProperties
| Build
| BuildXml
| Callable
| Class
| ClassCode
| Commutative
| CompilerGenerated
| Const
| CoreApi
| CoreType
| CppFileCode
| CppInclude
| CppNamespaceCode
| CsNative
| Dce
| Debug
| Decl
| DefParam
| Delegate
| Depend
| Deprecated
| DirectlyUsed
| DynamicObject
| Enum
| EnumConstructorParam
| Event
| Exhaustive
| Expose
| Extern
| FakeEnum
| File
| Final
| FlatEnum
| Font
| Forward
| ForwardStatics
| From
| FunctionCode
| FunctionTailCode
| Generic
| GenericBuild
| GenericInstance
| Getter
| Hack
| HasUntyped
| HaxeGeneric
| HeaderClassCode
| HeaderCode
| HeaderInclude
| HeaderNamespaceCode
| HxGen
| IfFeature
| Impl
| PythonImport
| ImplicitCast
| Include
| InitPackage
| Internal
| IsVar
| JavaCanonical
| JavaNative
| JsRequire
| Keep
| KeepInit
| KeepSub
| LibType
| Meta
| Macro
| MaybeUsed
| MergeBlock
| MultiType
| Native
| NativeChildren
| NativeGen
| NativeGeneric
| NativeProperty
| NoCompletion
| NoDebug
| NoDoc
| NoExpr
| NoImportGlobal
| NonVirtual
| NoPackageRestrict
| NoPrivateAccess
| NoStack
| NotNull
| NoUsing
| Ns
| Objc
| Op
| Optional
| Overload
| PrivateAccess
| Property
| Protected
| Public
| PublicFields
| Pure
| QuotedField
| ReadOnly
| RealPath
| Remove
| Require
| RequiresAssign
| Resolve
| ReplaceReflection
| Rtti
| Runtime
| RuntimeValue
| SelfCall
| Setter
| SkipCtor
| SkipReflection
| Sound
| SourceFile
| StoredTypedExpr
| Strict
| Struct
| StructAccess
| SuppressWarnings
| This
| Throws
| To
| ToString
| Transient
| ValueUsed
| Volatile
| Unbound
| UnifyMinDynamic
| Unreflective
| Unsafe
| Usage
| Used
| Value
| Void
| Last
(* do not put any custom metadata after Last *)
| Dollar of string
| Custom of string
let has m ml = List.exists (fun (m2,_,_) -> m = m2) ml
let get m ml = List.find (fun (m2,_,_) -> m = m2) ml
let to_string_ref = ref (fun _ -> assert false)
let to_string (m : strict_meta) : string = !to_string_ref m
end
type keyword =
| Function
| Class
| Var
| If
| Else
| While
| Do
| For
| Break
| Continue
| Return
| Extends
| Implements
| Import
| Switch
| Case
| Default
| Static
| Public
| Private
| Try
| Catch
| New
| This
| Throw
| Extern
| Enum
| In
| Interface
| Untyped
| Cast
| Override
| Typedef
| Dynamic
| Package
| Inline
| Using
| Null
| True
| False
| Abstract
| Macro
type binop =
| OpAdd
| OpMult
| OpDiv
| OpSub
| OpAssign
| OpEq
| OpNotEq
| OpGt
| OpGte
| OpLt
| OpLte
| OpAnd
| OpOr
| OpXor
| OpBoolAnd
| OpBoolOr
| OpShl
| OpShr
| OpUShr
| OpMod
| OpAssignOp of binop
| OpInterval
| OpArrow
type unop =
| Increment
| Decrement
| Not
| Neg
| NegBits
type constant =
| Int of string
| Float of string
| String of string
| Ident of string
| Regexp of string * string
type token =
| Eof
| Const of constant
| Kwd of keyword
| Comment of string
| CommentLine of string
| Binop of binop
| Unop of unop
| Semicolon
| Comma
| BrOpen
| BrClose
| BkOpen
| BkClose
| POpen
| PClose
| Dot
| DblDot
| Arrow
| IntInterval of string
| Sharp of string
| Question
| At
| Dollar of string
type unop_flag =
| Prefix
| Postfix
type while_flag =
| NormalWhile
| DoWhile
type type_path = {
tpackage : string list;
tname : string;
tparams : type_param_or_const list;
tsub : string option;
}
and type_param_or_const =
| TPType of complex_type
| TPExpr of expr
and complex_type =
| CTPath of type_path
| CTFunction of complex_type list * complex_type
| CTAnonymous of class_field list
| CTParent of complex_type
| CTExtend of type_path list * class_field list
| CTOptional of complex_type
and func = {
f_params : type_param list;
f_args : (string * bool * complex_type option * expr option) list;
f_type : complex_type option;
f_expr : expr option;
}
and expr_def =
| EConst of constant
| EArray of expr * expr
| EBinop of binop * expr * expr
| EField of expr * string
| EParenthesis of expr
| EObjectDecl of (string * expr) list
| EArrayDecl of expr list
| ECall of expr * expr list
| ENew of type_path * expr list
| EUnop of unop * unop_flag * expr
| EVars of (string * complex_type option * expr option) list
| EFunction of string option * func
| EBlock of expr list
| EFor of expr * expr
| EIn of expr * expr
| EIf of expr * expr * expr option
| EWhile of expr * expr * while_flag
| ESwitch of expr * (expr list * expr option * expr option) list * expr option option
| ETry of expr * (string * complex_type * expr) list
| EReturn of expr option
| EBreak
| EContinue
| EUntyped of expr
| EThrow of expr
| ECast of expr * complex_type option
| EDisplay of expr * bool
| EDisplayNew of type_path
| ETernary of expr * expr * expr
| ECheckType of expr * complex_type
| EMeta of metadata_entry * expr
and expr = expr_def * pos
and type_param = {
tp_name : string;
tp_params : type_param list;
tp_constraints : complex_type list;
tp_meta : metadata;
}
and documentation = string option
and metadata_entry = (Meta.strict_meta * expr list * pos)
and metadata = metadata_entry list
and access =
| APublic
| APrivate
| AStatic
| AOverride
| ADynamic
| AInline
| AMacro
and class_field_kind =
| FVar of complex_type option * expr option
| FFun of func
| FProp of string * string * complex_type option * expr option
and class_field = {
cff_name : string;
cff_doc : documentation;
cff_pos : pos;
mutable cff_meta : metadata;
mutable cff_access : access list;
mutable cff_kind : class_field_kind;
}
type enum_flag =
| EPrivate
| EExtern
type class_flag =
| HInterface
| HExtern
| HPrivate
| HExtends of type_path
| HImplements of type_path
type abstract_flag =
| APrivAbstract
| AFromType of complex_type
| AToType of complex_type
| AIsType of complex_type
type enum_constructor = {
ec_name : string;
ec_doc : documentation;
ec_meta : metadata;
ec_args : (string * bool * complex_type) list;
ec_pos : pos;
ec_params : type_param list;
ec_type : complex_type option;
}
type ('a,'b) definition = {
d_name : string;
d_doc : documentation;
d_params : type_param list;
d_meta : metadata;
d_flags : 'a list;
d_data : 'b;
}
type import_mode =
| INormal
| IAsName of string
| IAll
type import = (string * pos) list * import_mode
type type_def =
| EClass of (class_flag, class_field list) definition
| EEnum of (enum_flag, enum_constructor list) definition
| ETypedef of (enum_flag, complex_type) definition
| EAbstract of (abstract_flag, class_field list) definition
| EImport of import
| EUsing of type_path
type type_decl = type_def * pos
type package = string list * type_decl list
exception Error of string * pos
let is_lower_ident i =
let rec loop p =
match String.unsafe_get i p with
| 'a'..'z' -> true
| '_' -> if p + 1 < String.length i then loop (p + 1) else true
| _ -> false
in
loop 0
let pos = snd
let rec is_postfix (e,_) op = match op with
| Increment | Decrement | Not -> true
| Neg | NegBits -> false
let is_prefix = function
| Increment | Decrement -> true
| Not | Neg | NegBits -> true
let base_class_name = snd
let null_pos = { pfile = "?"; pmin = -1; pmax = -1 }
let punion p p2 =
{
pfile = p.pfile;
pmin = min p.pmin p2.pmin;
pmax = max p.pmax p2.pmax;
}
let rec punion_el el = match el with
| [] ->
null_pos
| (_,p) :: [] ->
p
| (_,p) :: el ->
punion p (punion_el el)
let s_type_path (p,s) = match p with [] -> s | _ -> String.concat "." p ^ "." ^ s
let parse_path s =
match List.rev (ExtString.String.nsplit s ".") with
| [] -> failwith "Invalid empty path"
| x :: l -> List.rev l, x
let s_escape ?(hex=true) s =
let b = Buffer.create (String.length s) in
for i = 0 to (String.length s) - 1 do
match s.[i] with
| '\n' -> Buffer.add_string b "\\n"
| '\t' -> Buffer.add_string b "\\t"
| '\r' -> Buffer.add_string b "\\r"
| '"' -> Buffer.add_string b "\\\""
| '\\' -> Buffer.add_string b "\\\\"
| c when int_of_char c < 32 && hex -> Buffer.add_string b (Printf.sprintf "\\x%.2X" (int_of_char c))
| c -> Buffer.add_char b c
done;
Buffer.contents b
let s_constant = function
| Int s -> s
| Float s -> s
| String s -> "\"" ^ s_escape s ^ "\""
| Ident s -> s
| Regexp (r,o) -> "~/" ^ r ^ "/"
let s_access = function
| APublic -> "public"
| APrivate -> "private"
| AStatic -> "static"
| AOverride -> "override"
| ADynamic -> "dynamic"
| AInline -> "inline"
| AMacro -> "macro"
let s_keyword = function
| Function -> "function"
| Class -> "class"
| Static -> "static"
| Var -> "var"
| If -> "if"
| Else -> "else"
| While -> "while"
| Do -> "do"
| For -> "for"
| Break -> "break"
| Return -> "return"
| Continue -> "continue"
| Extends -> "extends"
| Implements -> "implements"
| Import -> "import"
| Switch -> "switch"
| Case -> "case"
| Default -> "default"
| Private -> "private"
| Public -> "public"
| Try -> "try"
| Catch -> "catch"
| New -> "new"
| This -> "this"
| Throw -> "throw"
| Extern -> "extern"
| Enum -> "enum"
| In -> "in"
| Interface -> "interface"
| Untyped -> "untyped"
| Cast -> "cast"
| Override -> "override"
| Typedef -> "typedef"
| Dynamic -> "dynamic"
| Package -> "package"
| Inline -> "inline"
| Using -> "using"
| Null -> "null"
| True -> "true"
| False -> "false"
| Abstract -> "abstract"
| Macro -> "macro"
let rec s_binop = function
| OpAdd -> "+"
| OpMult -> "*"
| OpDiv -> "/"
| OpSub -> "-"
| OpAssign -> "="
| OpEq -> "=="
| OpNotEq -> "!="
| OpGte -> ">="
| OpLte -> "<="
| OpGt -> ">"
| OpLt -> "<"
| OpAnd -> "&"
| OpOr -> "|"
| OpXor -> "^"
| OpBoolAnd -> "&&"
| OpBoolOr -> "||"
| OpShr -> ">>"
| OpUShr -> ">>>"
| OpShl -> "<<"
| OpMod -> "%"
| OpAssignOp op -> s_binop op ^ "="
| OpInterval -> "..."
| OpArrow -> "=>"
let s_unop = function
| Increment -> "++"
| Decrement -> "--"
| Not -> "!"
| Neg -> "-"
| NegBits -> "~"
let s_token = function
| Eof -> "<end of file>"
| Const c -> s_constant c
| Kwd k -> s_keyword k
| Comment s -> "/*"^s^"*/"
| CommentLine s -> "//"^s
| Binop o -> s_binop o
| Unop o -> s_unop o
| Semicolon -> ";"
| Comma -> ","
| BkOpen -> "["
| BkClose -> "]"
| BrOpen -> "{"
| BrClose -> "}"
| POpen -> "("
| PClose -> ")"
| Dot -> "."
| DblDot -> ":"
| Arrow -> "->"
| IntInterval s -> s ^ "..."
| Sharp s -> "#" ^ s
| Question -> "?"
| At -> "@"
| Dollar v -> "$" ^ v
let unescape s =
let b = Buffer.create 0 in
let rec loop esc i =
if i = String.length s then
()
else
let c = s.[i] in
if esc then begin
let inext = ref (i + 1) in
(match c with
| 'n' -> Buffer.add_char b '\n'
| 'r' -> Buffer.add_char b '\r'
| 't' -> Buffer.add_char b '\t'
| '"' | '\'' | '\\' -> Buffer.add_char b c
| '0'..'3' ->
let c = (try char_of_int (int_of_string ("0o" ^ String.sub s i 3)) with _ -> raise Exit) in
Buffer.add_char b c;
inext := !inext + 2;
| 'x' ->
let c = (try char_of_int (int_of_string ("0x" ^ String.sub s (i+1) 2)) with _ -> raise Exit) in
Buffer.add_char b c;
inext := !inext + 2;
| 'u' ->
let (u, a) =
try
(int_of_string ("0x" ^ String.sub s (i+1) 4), 4)
with _ -> try
assert (s.[i+1] = '{');
let l = String.index_from s (i+3) '}' - (i+2) in
let u = int_of_string ("0x" ^ String.sub s (i+2) l) in
assert (u <= 0x10FFFF);
(u, l+2)
with _ ->
raise Exit
in
let ub = UTF8.Buf.create 0 in
UTF8.Buf.add_char ub (UChar.uchar_of_int u);
Buffer.add_string b (UTF8.Buf.contents ub);
inext := !inext + a;
| _ ->
raise Exit);
loop false !inext;
end else
match c with
| '\\' -> loop true (i + 1)
| c ->
Buffer.add_char b c;
loop false (i + 1)
in
loop false 0;
Buffer.contents b
let map_expr loop (e,p) =
let opt f o =
match o with None -> None | Some v -> Some (f v)
in
let rec tparam = function
| TPType t -> TPType (ctype t)
| TPExpr e -> TPExpr (loop e)
and cfield f =
{ f with cff_kind = (match f.cff_kind with
| FVar (t,e) -> FVar (opt ctype t, opt loop e)
| FFun f -> FFun (func f)
| FProp (get,set,t,e) -> FProp (get,set,opt ctype t,opt loop e))
}
and ctype = function
| CTPath t -> CTPath (tpath t)
| CTFunction (cl,c) -> CTFunction (List.map ctype cl, ctype c)
| CTAnonymous fl -> CTAnonymous (List.map cfield fl)
| CTParent t -> CTParent (ctype t)
| CTExtend (tl,fl) -> CTExtend (List.map tpath tl, List.map cfield fl)
| CTOptional t -> CTOptional (ctype t)
and tparamdecl t =
{ tp_name = t.tp_name; tp_constraints = List.map ctype t.tp_constraints; tp_params = List.map tparamdecl t.tp_params; tp_meta = t.tp_meta }
and func f =
{
f_params = List.map tparamdecl f.f_params;
f_args = List.map (fun (n,o,t,e) -> n,o,opt ctype t,opt loop e) f.f_args;
f_type = opt ctype f.f_type;
f_expr = opt loop f.f_expr;
}
and tpath t = { t with tparams = List.map tparam t.tparams }
in
let e = (match e with
| EConst _ -> e
| EArray (e1,e2) -> EArray (loop e1, loop e2)
| EBinop (op,e1,e2) -> EBinop (op,loop e1, loop e2)
| EField (e,f) -> EField (loop e, f)
| EParenthesis e -> EParenthesis (loop e)
| EObjectDecl fl -> EObjectDecl (List.map (fun (f,e) -> f,loop e) fl)
| EArrayDecl el -> EArrayDecl (List.map loop el)
| ECall (e,el) -> ECall (loop e, List.map loop el)
| ENew (t,el) -> ENew (tpath t,List.map loop el)
| EUnop (op,f,e) -> EUnop (op,f,loop e)
| EVars vl -> EVars (List.map (fun (n,t,eo) -> n,opt ctype t,opt loop eo) vl)
| EFunction (n,f) -> EFunction (n,func f)
| EBlock el -> EBlock (List.map loop el)
| EFor (e1,e2) -> EFor (loop e1, loop e2)
| EIn (e1,e2) -> EIn (loop e1, loop e2)
| EIf (e,e1,e2) -> EIf (loop e, loop e1, opt loop e2)
| EWhile (econd,e,f) -> EWhile (loop econd, loop e, f)
| ESwitch (e,cases,def) -> ESwitch (loop e, List.map (fun (el,eg,e) -> List.map loop el, opt loop eg, opt loop e) cases, opt (opt loop) def)
| ETry (e,catches) -> ETry (loop e, List.map (fun (n,t,e) -> n,ctype t,loop e) catches)
| EReturn e -> EReturn (opt loop e)
| EBreak -> EBreak
| EContinue -> EContinue
| EUntyped e -> EUntyped (loop e)
| EThrow e -> EThrow (loop e)
| ECast (e,t) -> ECast (loop e,opt ctype t)
| EDisplay (e,f) -> EDisplay (loop e,f)
| EDisplayNew t -> EDisplayNew (tpath t)
| ETernary (e1,e2,e3) -> ETernary (loop e1,loop e2,loop e3)
| ECheckType (e,t) -> ECheckType (loop e, ctype t)
| EMeta (m,e) -> EMeta(m, loop e)
) in
(e,p)
let s_expr e =
let rec s_expr_inner tabs (e,_) =
match e with
| EConst c -> s_constant c
| EArray (e1,e2) -> s_expr_inner tabs e1 ^ "[" ^ s_expr_inner tabs e2 ^ "]"
| EBinop (op,e1,e2) -> s_expr_inner tabs e1 ^ " " ^ s_binop op ^ " " ^ s_expr_inner tabs e2
| EField (e,f) -> s_expr_inner tabs e ^ "." ^ f
| EParenthesis e -> "(" ^ (s_expr_inner tabs e) ^ ")"
| EObjectDecl fl -> "{ " ^ (String.concat ", " (List.map (fun (n,e) -> n ^ " : " ^ (s_expr_inner tabs e)) fl)) ^ " }"
| EArrayDecl el -> "[" ^ s_expr_list tabs el ", " ^ "]"
| ECall (e,el) -> s_expr_inner tabs e ^ "(" ^ s_expr_list tabs el ", " ^ ")"
| ENew (t,el) -> "new " ^ s_complex_type_path tabs t ^ "(" ^ s_expr_list tabs el ", " ^ ")"
| EUnop (op,Postfix,e) -> s_expr_inner tabs e ^ s_unop op
| EUnop (op,Prefix,e) -> s_unop op ^ s_expr_inner tabs e
| EFunction (Some n,f) -> "function " ^ n ^ s_func tabs f
| EFunction (None,f) -> "function" ^ s_func tabs f
| EVars vl -> "var " ^ String.concat ", " (List.map (s_var tabs) vl)
| EBlock [] -> "{ }"
| EBlock el -> s_block tabs el "{" "\n" "}"
| EFor (e1,e2) -> "for (" ^ s_expr_inner tabs e1 ^ ") " ^ s_expr_inner tabs e2
| EIn (e1,e2) -> s_expr_inner tabs e1 ^ " in " ^ s_expr_inner tabs e2
| EIf (e,e1,None) -> "if (" ^ s_expr_inner tabs e ^ ") " ^ s_expr_inner tabs e1
| EIf (e,e1,Some e2) -> "if (" ^ s_expr_inner tabs e ^ ") " ^ s_expr_inner tabs e1 ^ " else " ^ s_expr_inner tabs e2
| EWhile (econd,e,NormalWhile) -> "while (" ^ s_expr_inner tabs econd ^ ") " ^ s_expr_inner tabs e
| EWhile (econd,e,DoWhile) -> "do " ^ s_expr_inner tabs e ^ " while (" ^ s_expr_inner tabs econd ^ ")"
| ESwitch (e,cases,def) -> "switch " ^ s_expr_inner tabs e ^ " {\n\t" ^ tabs ^ String.concat ("\n\t" ^ tabs) (List.map (s_case tabs) cases) ^
(match def with None -> "" | Some def -> "\n\t" ^ tabs ^ "default:" ^
(match def with None -> "" | Some def -> s_expr_omit_block tabs def)) ^ "\n" ^ tabs ^ "}"
| ETry (e,catches) -> "try " ^ s_expr_inner tabs e ^ String.concat "" (List.map (s_catch tabs) catches)
| EReturn e -> "return" ^ s_opt_expr tabs e " "
| EBreak -> "break"
| EContinue -> "continue"
| EUntyped e -> "untyped " ^ s_expr_inner tabs e
| EThrow e -> "throw " ^ s_expr_inner tabs e
| ECast (e,Some t) -> "cast (" ^ s_expr_inner tabs e ^ ", " ^ s_complex_type tabs t ^ ")"
| ECast (e,None) -> "cast " ^ s_expr_inner tabs e
| ETernary (e1,e2,e3) -> s_expr_inner tabs e1 ^ " ? " ^ s_expr_inner tabs e2 ^ " : " ^ s_expr_inner tabs e3
| ECheckType (e,t) -> "(" ^ s_expr_inner tabs e ^ " : " ^ s_complex_type tabs t ^ ")"
| EMeta (m,e) -> s_metadata tabs m ^ " " ^ s_expr_inner tabs e
| _ -> ""
and s_expr_list tabs el sep =
(String.concat sep (List.map (s_expr_inner tabs) el))
and s_complex_type_path tabs t =
(String.concat "." t.tpackage) ^ if List.length t.tpackage > 0 then "." else "" ^
t.tname ^
match t.tsub with
| Some s -> "." ^ s
| None -> "" ^
s_type_param_or_consts tabs t.tparams
and s_type_param_or_consts tabs pl =
if List.length pl > 0
then "<" ^ (String.concat "," (List.map (s_type_param_or_const tabs) pl)) ^ ">"
else ""
and s_type_param_or_const tabs p =
match p with
| TPType t -> s_complex_type tabs t
| TPExpr e -> s_expr_inner tabs e
and s_complex_type tabs ct =
match ct with
| CTPath t -> s_complex_type_path tabs t
| CTFunction (cl,c) -> if List.length cl > 0 then String.concat " -> " (List.map (s_complex_type tabs) cl) else "Void" ^ " -> " ^ s_complex_type tabs c
| CTAnonymous fl -> "{ " ^ String.concat "; " (List.map (s_class_field tabs) fl) ^ "}";
| CTParent t -> "(" ^ s_complex_type tabs t ^ ")"
| CTOptional t -> "?" ^ s_complex_type tabs t
| CTExtend (tl, fl) -> "{> " ^ String.concat " >, " (List.map (s_complex_type_path tabs) tl) ^ ", " ^ String.concat ", " (List.map (s_class_field tabs) fl) ^ " }"
and s_class_field tabs f =
match f.cff_doc with
| Some s -> "/**\n\t" ^ tabs ^ s ^ "\n**/\n"
| None -> "" ^
if List.length f.cff_meta > 0 then String.concat ("\n" ^ tabs) (List.map (s_metadata tabs) f.cff_meta) else "" ^
if List.length f.cff_access > 0 then String.concat " " (List.map s_access f.cff_access) else "" ^
match f.cff_kind with
| FVar (t,e) -> "var " ^ f.cff_name ^ s_opt_complex_type tabs t " : " ^ s_opt_expr tabs e " = "
| FProp (get,set,t,e) -> "var " ^ f.cff_name ^ "(" ^ get ^ "," ^ set ^ ")" ^ s_opt_complex_type tabs t " : " ^ s_opt_expr tabs e " = "
| FFun func -> "function " ^ f.cff_name ^ s_func tabs func
and s_metadata tabs (s,e,_) =
"@" ^ Meta.to_string s ^ if List.length e > 0 then "(" ^ s_expr_list tabs e ", " ^ ")" else ""
and s_opt_complex_type tabs t pre =
match t with
| Some s -> pre ^ s_complex_type tabs s
| None -> ""
and s_opt_expr tabs e pre =
match e with
| Some s -> pre ^ s_expr_inner tabs s
| None -> ""
and s_func tabs f =
s_type_param_list tabs f.f_params ^
"(" ^ String.concat ", " (List.map (s_func_arg tabs) f.f_args) ^ ")" ^
s_opt_complex_type tabs f.f_type ":" ^
s_opt_expr tabs f.f_expr " "
and s_type_param tabs t =
t.tp_name ^ s_type_param_list tabs t.tp_params ^
if List.length t.tp_constraints > 0 then ":(" ^ String.concat ", " (List.map (s_complex_type tabs) t.tp_constraints) ^ ")" else ""
and s_type_param_list tabs tl =
if List.length tl > 0 then "<" ^ String.concat ", " (List.map (s_type_param tabs) tl) ^ ">" else ""
and s_func_arg tabs (n,o,t,e) =
if o then "?" else "" ^ n ^ s_opt_complex_type tabs t ":" ^ s_opt_expr tabs e " = "
and s_var tabs (n,t,e) =
n ^ s_opt_complex_type tabs t ":" ^ s_opt_expr tabs e " = "
and s_case tabs (el,e1,e2) =
"case " ^ s_expr_list tabs el ", " ^
(match e1 with None -> ":" | Some e -> " if (" ^ s_expr_inner tabs e ^ "):") ^
(match e2 with None -> "" | Some e -> s_expr_omit_block tabs e)
and s_catch tabs (n,t,e) =
" catch(" ^ n ^ ":" ^ s_complex_type tabs t ^ ") " ^ s_expr_inner tabs e
and s_block tabs el opn nl cls =
opn ^ "\n\t" ^ tabs ^ (s_expr_list (tabs ^ "\t") el (";\n\t" ^ tabs)) ^ ";" ^ nl ^ tabs ^ cls
and s_expr_omit_block tabs e =
match e with
| (EBlock [],_) -> ""
| (EBlock el,_) -> s_block (tabs ^ "\t") el "" "" ""
| _ -> s_expr_inner (tabs ^ "\t") e ^ ";"
in s_expr_inner "" e
let get_value_meta meta =
try
begin match Meta.get Meta.Value meta with
| (_,[EObjectDecl values,_],_) -> List.fold_left (fun acc (s,e) -> PMap.add s e acc) PMap.empty values
| _ -> raise Not_found
end
with Not_found ->
PMap.empty
(* Type path related functions *)
let rec string_list_of_expr_path_raise (e,p) =
match e with
| EConst (Ident i) -> [i]
| EField (e,f) -> f :: string_list_of_expr_path_raise e
| _ -> raise Exit
let expr_of_type_path (sl,s) p =
match sl with
| [] -> (EConst(Ident s),p)
| s1 :: sl ->
let e1 = (EConst(Ident s1),p) in
let e = List.fold_left (fun e s -> (EField(e,s),p)) e1 sl in
EField(e,s),p
let match_path recursive sl sl_pattern =
let rec loop sl1 sl2 = match sl1,sl2 with
| [],[] ->
true
(* always recurse into types of package paths *)
| (s1 :: s11 :: _),[s2] when is_lower_ident s2 && not (is_lower_ident s11)->
s1 = s2
| [_],[""] ->
true
| _,([] | [""]) ->
recursive
| [],_ ->
false
| (s1 :: sl1),(s2 :: sl2) ->
s1 = s2 && loop sl1 sl2
in
loop sl sl_pattern
let full_dot_path mpath tpath =
if mpath = tpath then
(fst tpath) @ [snd tpath]
else
(fst mpath) @ [snd mpath;snd tpath]