-
Notifications
You must be signed in to change notification settings - Fork 125
/
bslLib.ml
1583 lines (1431 loc) · 61.5 KB
/
bslLib.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
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 © 2011 MLstate
This file is part of OPA.
OPA is free software: you can redistribute it and/or modify it under the
terms of the GNU Affero General Public License, version 3, as published by
the Free Software Foundation.
OPA 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 Affero General Public License for
more details.
You should have received a copy of the GNU Affero General Public License
along with OPA. If not, see <http://www.gnu.org/licenses/>.
*)
(* CF mli *)
(* dependencies, refactoring *)
module Format = BaseFormat
module Hashtbl = BaseHashtbl
module List = BaseList
module String = BaseString
(* ast shorthand *)
module B = BslTypes
(* interfaces *)
module BI = BslInterface
(* alias *)
module IFormat = BslIncludeFormats.IFormat
(* debug *)
let debug fmt =
OManager.printf ("@{<cyan>[Bsl]@}@ @[<2>"^^fmt^^"@]@.")
(* template *)
(*
let _ =
#<If:BSL_VERBOSE $minlevel 1>
debug "do some %s of level %d@\n" "debug" 1
#<End>
in
*)
module HLParser =
struct
let nopos = FilePos.nopos "BslLib.HLParser"
let wrap_trx trx_rule str =
try
let n, d = trx_rule str in
if n < String.length str then None
else Some d
with
| BslTags.Exception _
| BslIncludeFormats.IFormat.Exception _
| Trx_runtime.SyntaxError _
-> None
let opalang_directive str =
match wrap_trx BslRegisterParser.parse_bslregisterparser_opalang str with
| Some d -> d
| None -> BslDirectives.Source (nopos, str)
let bypasslang_directive str =
match wrap_trx BslRegisterParser.parse_bslregisterparser_bypasslang str with
| Some d -> d
| None -> BslDirectives.Source (nopos, str)
let bslty str = wrap_trx BslRegisterParser.parse_bslregisterparser_bslty str
let mk_default_format = List.map
(fun (t, r , sep) -> t, Printf.sprintf "##format %s \"%s\"%s" t r
(if sep = "" then "" else (Printf.sprintf " \"%s\"" sep)))
let default_qml_format = mk_default_format
[
"function" ,"val #n = %%#k%% : #t" ,"";
"functions" ,"let #n = %%#k%% : #t in" ,"";
"bind-module" ,"#m = #m" ,"";
"bind" ,"#n = #n ; " ,"";
"import-module" ,"let #n = %%#k%% : #t in" ,"";
"in-module" ,"#{import-module}" ,"";
"sub-module" ,"let #m = \n#{#rec, import-module}\n { #{bind-module bind} } in" ,"";
"module" ,"val #m = \n#{ sub-module, import-module }\n { #{bind-module bind} }" ,"";
"plot_hierarchy" ,"module #m #{#rec}" ,"";
]
let default_opa_iformats = mk_default_format
[
"opa-function" ,"#n = %%#k%% : #t" ,"";
"opa-bind-module" ,"#m = #m" ,"";
"opa-bind" ,"#n = #n" ,"";
"opa-in-module" ,"#{opa-function}" ,"";
"opa-module" ,"#m = \n#{#rec opa-function}\n { #{opa-bind-module opa-bind} }" ,"";
]
let show_iformats fmt () =
List.iter (
fun (n, f) ->
Format.fprintf fmt " + format %S :@[<2>@\n%s@]@\n" n f
)
default_opa_iformats
let add_iformat list = List.iter (fun (_, f) -> let _ = opalang_directive f in ()) list
end
module Arg =
struct
module Arg = Base.Arg
let options = [
"--show-iformats",
Arg.Unit (fun () -> HLParser.show_iformats OManager.oformatter.contents (); exit 0),
" Show default formats for ##include directive (opa files)" ;
]
end
(** this is uggly, should be split, and goes into BslTypesUtils, at least in 3 pieces *)
let map_type_from_type_map_and_path type_path_map current_path ?(definition=false) (typ : BslTypes.t) =
let module_path = String.concat "." current_path in
let map_type_key name =
let parts = List.map String.lowercase (String.slice '.' name) in
let nkey = BslKey.normalize_string (String.concat "_" parts) in
let rec find_first_success rest_rev_path =
let nkey = String.concat "_" (List.rev_map String.lowercase (nkey::rest_rev_path)) in
let key = BslKey.normalize nkey in
let _ =
#<If:BSL_REGISTER $minlevel 5>
debug "try ukey \"%s\" for key \"%s\"" nkey name
#<End>
in
match BslKeyMap.find_opt key type_path_map with
| Some (_, _, type_value) -> Some (rest_rev_path, nkey, type_value)
| None -> (
match rest_rev_path with
| [] -> None
| _::q -> find_first_success q
)
in
let rec warning_other_success ?(accu=[]) rest_rev_path =
match rest_rev_path with
| [] ->
if accu = [] then () else (
OManager.printf
"%a@\nin module-path @{<bright>%s@}, reference to type @{<bright>%s@} is ambigues :@\nOther interpretation are @[<4>@\n%a@]@\n"
BslTypes.pp_context typ
module_path name
(Format.pp_list "@\n" (fun fmt t -> BslTypes.pp_context fmt (snd t))) accu;
OManager.error "Hint: You can precise the path to this type.@\n"
)
| _::rest_rev_path ->
let nkey = String.concat "_" (List.rev_map String.lowercase (nkey::rest_rev_path)) in
let key = BslKey.normalize nkey in
let _ =
#<If:BSL_REGISTER $minlevel 5>
debug "for the warning. try ukey \"%s\" for key \"%s\"" nkey name
#<End>
in
match BslKeyMap.find_opt key type_path_map with
| Some (_, _, type_value) ->
warning_other_success ~accu:((nkey, type_value)::accu) rest_rev_path
| None ->
warning_other_success ~accu rest_rev_path in
let _defkey, type_value =
match find_first_success (List.rev current_path) with
| Some (rest_path, defkey, type_value) -> warning_other_success rest_path; defkey, type_value
| None ->
OManager.printf "%a@\n" BslTypes.pp_context typ;
OManager.error
"In module-path @{<bright>%s@}@ the named-type %s is unbound@\n" module_path name
in
type_value in
let map = BslTypes.Walk.map_up
(function
| (B.External (_, n, vs)) as context ->
(** verification des parametres : juste un decompte *)
let maped = map_type_key n in (
match maped with
| B.External (_, _, vs') ->
let lena = List.length vs and lenb = List.length vs' in
if lena <> lenb then (
OManager.printf "%a@\n" BslTypes.pp_context context ;
OManager.printf "Conflict with this previous type definition:@\n%a@\n"
BslTypes.pp_context maped;
OManager.error
"The extern-type constructor %s expects %d argument(s),@ but is here applied to %d arguments@\n"
n lenb lena
)
else (BslTypes.specialize vs maped)
| typ2 ->
OManager.printf "%a@\n" BslTypes.pp_context context ;
OManager.printf "Conflict with this previous type definition:@\n%a@\n" BslTypes.pp_context typ2;
OManager.error "extern-type \"%s\" is no compatible with this type@\n" n
)
| t -> t)
in
if definition then
match typ with
| B.External _ -> typ
| _ ->
OManager.printf "%a@\n" BslTypes.pp_context typ ;
OManager.error "This kind of type is not allowed in an extern defintion"
else map typ
(* See the documentation in the interface and the manual *)
let meta_comment t = "(* "^t^" *)"
let meta_code = function
| BI.MetaCode t -> t
| BI.MetaComment t -> meta_comment t
(* IMPLEMENTATION OF BSL *)
(*
Bypass visibility. CF documentation
*)
module BypassVisibility :
sig
val declare_visibility : ObjectFiles.package_name -> BslPluginInterface.plugin_basename -> unit
val mem : ObjectFiles.package_name -> BslPluginInterface.plugin_basename -> bool
end =
struct
let visibility : (ObjectFiles.package_name, StringSet.t) Hashtbl.t = Hashtbl.create 16
let declare_visibility package_name plugin_basename =
let plugins = Option.default StringSet.empty (Hashtbl.find_opt visibility package_name) in
Hashtbl.replace visibility package_name (StringSet.add plugin_basename plugins)
let mem package_name plugin_basename =
try
let set = Hashtbl.find visibility package_name in
StringSet.mem plugin_basename set
with
| Not_found -> false
end
let declare_visibility = BypassVisibility.declare_visibility
(* BSL is a fonctor : see the manual *)
module MakeLibBSL
(ML_ITrans : BI.ML_ITRANS)
(ML_CTrans : BI.ML_CTRANS)
(JS_CTrans : BI.JS_CTRANS) :
BI.BSLINTROSPECTION with type ml_ctrans_env = ML_CTrans.env
and type js_ctrans_env = JS_CTrans.env
=
struct
type ml_ctrans_env = ML_CTrans.env
type js_ctrans_env = JS_CTrans.env
module Implementation =
struct
type function_name = string
type compiler_repr =
| Ident of Ident.t
| String of string
type compiled =
{
c_lang : BslLanguage.t;
c_type : BslTypes.t ;
c_tags : BslTags.t ;
compiler_repr : compiler_repr ;
origin_file : string;
is_transtype : bool;
module_name : string;
(* ext : string; *)
}
type interpreted =
{
i_lang : BslLanguage.t;
i_type : BslTypes.t;
i_tags : BslTags.t ;
obj : Obj.t;
}
type t = Compiled of compiled | Interpreted of interpreted
let lang = function
| Compiled c -> BslLanguage.formate `compiled c.c_lang
| Interpreted i -> BslLanguage.formate `interpreted i.i_lang
let trans_type = function
| Compiled c -> c.c_type
| Interpreted i -> i.i_type
let bsltags = function
| Compiled c -> c.c_tags
| Interpreted i -> i.i_tags
module CompiledFunction =
struct
let compiler_detailed_repr c = c.compiler_repr
let string_of_repr = function
| String s -> s
| Ident _ -> assert false (* this function isn't called in js
* and this branch is never executed in ml *)
let compiler_repr c = string_of_repr (compiler_detailed_repr c)
let origin_file c = c.origin_file
let is_transtype c = c.is_transtype
let origin_module c = c.module_name
end
let dynamic_repr i = assert (i.i_lang = BslLanguage.mli); i.obj
let pp_compiled_repr f = function
| String s -> Format.fprintf f "String \"%s\"" s
| Ident i -> Format.fprintf f "Ident %s" (Ident.to_string i)
let pp fmt = function
| Compiled c ->
Format.fprintf fmt
"impl:@{<red>%s@} (compiled)@[<4>@\nfile=%S@\nfun=%a@\ntype=%a@\nis_transtype:%b@\ntags=@[<2>%a@]@]"
(BslLanguage.to_string c.c_lang)
c.origin_file
pp_compiled_repr c.compiler_repr
BslTypes.pp c.c_type
c.is_transtype
BslTags.pp c.c_tags
| Interpreted i ->
Format.fprintf fmt
"impl:@{<red>%s@} (interpreted)@[<4>@\ntype=%a@\ntags=@[<2>%a@]@]"
(BslLanguage.to_string i.i_lang)
BslTypes.pp i.i_type
BslTags.pp i.i_tags
end
module ByPass =
struct
open Implementation
type t =
{
key : BslKey.t;
name : string;
def_type : BslTypes.t;
impl : Implementation.t list;
plugin_name : BslPluginInterface.plugin_basename ;
}
let key t = t.key
let skey t = BslKey.to_string t.key
let name t = t.name
let format t fmt =
let def = "(* format error *)" in
match HLParser.opalang_directive (Printf.sprintf "##include \"%s\" ." fmt) with
| BslDirectives.Directive (_, _, BslDirectives.Include (fmt, _)) -> (
match IFormat.fprinter_opt_of_fmt fmt with
| Some fprinter ->
fprinter (t.name, (BslKey.to_string t.key),
(Format.to_string BslTypes.pp t.def_type))
| None -> def
)
| _ -> def
let implementation t ~lang =
let rec find = function
| [] -> None
| t::q -> if BslLanguage.compare (Implementation.lang t) lang = 0 then Some t else find q
in find t.impl
let all_implementations t = t.impl
let compiled_implementation t ~lang =
let rec find = function
| [] -> None
| (Interpreted _)::q -> find q
| (Compiled c)::q -> if BslLanguage.compare c.c_lang lang = 0 then Some c else find q
in find t.impl
let interpreted_implementation t ~lang =
let rec find = function
| [] -> None
| (Compiled _)::q -> find q
| (Interpreted i)::q -> if BslLanguage.compare i.i_lang lang = 0 then Some i else find q
in find t.impl
let gen_lang f t =
let fold accu i = (f i)::accu in
List.fold_left fold [] t.impl
let langs = gen_lang Implementation.lang
let implemented_in t ~lang =
List.exists (fun v -> BslLanguage.compare lang (Implementation.lang v) = 0) t.impl
let implemented_in_any, implemented_in_all =
let mk f =
fun t ~lang ->
f (fun u -> List.exists (
fun v -> BslLanguage.compare u (Implementation.lang v) = 0
) t.impl) lang
in (mk List.exists), (mk List.for_all)
let definition_type t = t.def_type
end
module ByPassMap =
struct
type _module_table = (string * ((ByPass.t, _module_table) BI.kind)) list
type t =
{
(* unit = elt - optimisation of construct - deconstruct, this is a cache for the browser *)
elt_root : unit option;
types : (string * string list * BslTypes.t) list;
typesmap : BI.typesmap ; (** with module access *)
map : ByPass.t BslKeyMap.t; (** link with completes key-names *)
js_init : (BI.unicity_index * JsAst.code_elt) list;
ocaml_init : string;
root_node : _module_table;
ml_ctrans_env : ML_CTrans.env ;
js_ctrans_env : JS_CTrans.env
}
let empty () =
{
elt_root = None ;
types = [] ;
typesmap = BslKeyMap.empty ;
map = BslKeyMap.empty ;
js_init = [];
ocaml_init = "";
root_node = [] ;
ml_ctrans_env = ML_CTrans.empty () ;
js_ctrans_env = JS_CTrans.empty ()
}
let ml_ctrans_env t = t.ml_ctrans_env
let js_ctrans_env t = t.js_ctrans_env
let types t = t.types
let typesmap t = t.typesmap
let fold_types t fct acc = List.fold_left (fun acc (_, _, t) -> fct acc t) acc t.types
let opa_types t =
let buf = FBuffer.create 1024 in
let buf =
fold_types t (
fun buf t -> FBuffer.printf buf "%a@\n" BslTypesGeneration.Opa.pp_definition t
) buf
in
FBuffer.contents buf
(** Generated compiler needs some extra code (transcription of type) *)
let ocaml_init t = t.ocaml_init
let js_init t = t.js_init
let find_opt t ?lang key =
match BslKeyMap.find_opt key t.map with
| None -> None
| Some bypass ->
begin
match lang with
| None -> Some bypass
| Some lang ->
if ByPass.implemented_in_all bypass ~lang:[lang]
then Some bypass else None
end
let find_opt_implementation t ~lang key =
match BslKeyMap.find_opt key t.map with
| None -> None
| Some bypass -> ByPass.compiled_implementation bypass ~lang
let find_opt_interpreted_implementation t ~lang key =
match BslKeyMap.find_opt key t.map with
| None -> None
| Some bypass -> ByPass.interpreted_implementation bypass ~lang
let iter fct t = BslKeyMap.iter fct t.map
let fold fct t = BslKeyMap.fold fct t.map
let get_map t = t.map
(** Uncps the type of fun (remove extra continuation)*)
let uncps_type key def_type =
let error ty =
BslError.error (BslError.Context.type_ ty)
"%a\nBad typed %s [cps-bypass] must be of the form : ..., continuation(...) -> void" BslTypes.pp ty (BslKey.to_string key)
in
let rec uncps_type check def_type =
let rec aux = function
| BslTypes.OpaValue (_, t) -> aux t
| t -> t in
match def_type with
| BslTypes.Fun (pos1, args, BslTypes.Void _) ->
let args, ret = List.split_at (List.length args - 1) args in
let ret =
assert (List.length ret = 1);
List.hd ret
in
(match uncps_type false ret with
| BslTypes.External (_, "continuation", [ret] ) ->
let proj_args = List.map (uncps_type false) args in
BslTypes.Fun (pos1, proj_args, ret)
| _ -> error def_type
)
| BslTypes.Option (p, t) -> BslTypes.Option (p, uncps_type false t)
| BslTypes.OpaValue (p, t) -> BslTypes.OpaValue (p, uncps_type false t)
| BslTypes.External (p, s, t) -> BslTypes.External (p, s, List.map (uncps_type false) t)
| x when not check -> x
| _ -> error def_type
in uncps_type true def_type
let bypass_typer_factory build t key =
match BslKeyMap.find_opt key t.map with
| None -> None
| Some bypass ->
Return.set_checkpoint (fun label ->
let () =
if ObjectFiles.Arg.is_separated ()
then
(* check if the visibility is valid, if not warning *)
let package_name = ObjectFiles.get_current_package_name () in
let plugin = bypass.ByPass.plugin_name in
if not (BypassVisibility.mem package_name plugin)
then (
OManager.serror (
"The bypass @{<bright>%a@} is not visible from this package.@\n"^^
"@[<2>@{<bright>Hint@}:@\nadd an @{<bright>import-plugin %s@} in the package '@{<bright>%s@}'@]"
)
BslKey.pp key plugin package_name
;
Return.return label None
)
in
let impls = ByPass.all_implementations bypass in
let is_cps impl =
(Implementation.bsltags impl).BslTags.cps_bypass in
let is_cps =
List.fold_left
(fun cps impl ->
let icps = is_cps impl in
if cps != icps then
OManager.error
"Tag cps-bypass must be present on all implementation for %s"
(BslKey.to_string key)
else cps && icps)
(is_cps (List.hd impls)) (List.tl impls)
in
let def_type = (ByPass.definition_type bypass) in
let def_type =
if is_cps then uncps_type key def_type
else def_type
in
Return.return label (Some (build (def_type))))
let bypass_typer ?typeident t = bypass_typer_factory (BslTypes.to_ty ?typeident) t
let bsl_bypass_typer t = bypass_typer_factory (fun t -> t) t
let bsl_bypass_tags t ~lang key =
match BslKeyMap.find_opt key t.map with
| Some bypass -> (
match ByPass.implementation ~lang bypass with
| Some impl -> Some (Implementation.bsltags impl)
| None -> None
)
| None -> None
let bsl_bypass_cps t ~lang key =
let cps_key = Printf.sprintf "%s_cps" (BslKey.to_string key) in
let cps_key = BslKey.normalize cps_key in
match BslKeyMap.find_opt cps_key t.map with
| Some _ -> (
match bsl_bypass_tags t ~lang cps_key with
| Some tags when tags.BslTags.cps_bypass ->
let ty = Option.get (bsl_bypass_typer t key) in
let ty = BslTypes.purge_opavalue ty in
let ty_cps = Option.get (bsl_bypass_typer t cps_key) in
let ty_cps = BslTypes.purge_opavalue ty_cps in
if BslTypes.compare ~normalize:true ty ty_cps != 0 then
OManager.error
"Found cps bypass (%a) %a for %a but type is not compatible\nExp Type : %a\n\nCps type : %a\n%!"
BslLanguage.pp lang
BslKey.pp cps_key BslKey.pp key
BslTypes.pp ty BslTypes.pp ty_cps
else
Some cps_key
| Some _ ->
OManager.i_error
"Found cps bypass (%a) %a for %a but is not tagged as [cps-bypass]"
BslLanguage.pp lang
BslKey.pp cps_key BslKey.pp key
| None ->
OManager.i_error "The bypass %a was found but these tags was not found in lang %s" BslKey.pp cps_key (BslLanguage.to_string lang)
)
| None -> None
(* let bsl_bypass_cps t ~lang key = *)
module Browser =
struct
type bypass_library = (ByPass.t, string) BI.hierarchy
(*
This data structure simulate a file system.
Starting from each elt you can browse the all structure.
*)
type path_elt = Backward | Forward of string
type path = path_elt list
(* uniq identifiant for every module or function :
~/module1/module2/function or ~/module3 *)
type ('a, 'b) _kind_elt =
{
bymap : t;
name : string;
(* the reference is here for facility in rec construction *)
root : elt ref;
kind : ('a, 'b) BI.kind;
pwd : path;
}
and module_elt = elt list
and public_elt = (ByPass.t, module_elt) BI.kind
and elt = (ByPass.t, module_elt) _kind_elt
module Path =
struct
(* Note: optimisation with list :
the path are reversed in the implementation *)
type step = path_elt
let root = []
let is_root = function
| [] -> true
| _ -> false
let step s = Forward s
let backward = function
| [] -> []
| _::q -> q
let forward p = function
| Backward -> backward p
| forward -> forward::p
let build =
let rec aux accu = function
| [] -> Some accu
| ".."::q -> aux (backward accu) q
| s::q ->
let withchars chars s = List.exists (String.contains s) chars in
if withchars ['.'; '/'; '#'; '\\'] s
then None
else aux (forward accu (step s)) q
in aux []
let of_string s =
let elts =
String.slice_chars "~/,.#" s in
build elts
let to_string = function
| [] -> "/"
| els ->
let aux = function
| Backward -> ".."
| Forward s -> s in
let fold accu step = Printf.sprintf "%s/%s" (aux step) accu in
List.fold_left fold "" els
let to_list =
let rec aux = function
| Backward -> ".."
| Forward s -> s in
let fold accu step = (aux step)::accu in
List.fold_left fold []
let remove_backward init path =
let safe_forward p s = match p, s with
| Backward , [] -> []
| Backward, _::q -> q
| Forward s, tl -> s::tl
in
List.fold_right safe_forward (path@init) []
let cd elt path =
let safe_path = List.rev (remove_backward elt.pwd path) in
(* stoping fold_left *)
let rec stop_fold accu = function
| [] -> Some accu
| t::q ->
begin
match accu.kind with
| BI.Function _ -> None (* a function has no child *)
| BI.Module accu ->
begin
match List.find_opt (fun e -> String.compare e.name t = 0) accu with
| None -> None
| Some elt -> stop_fold elt q
end
end
in
stop_fold !(elt.root) safe_path
let pwd elt = elt.pwd
end
(* constructor of the data structure from the bypassmap struct *)
let init t = match t.elt_root with Some elt -> Obj.magic elt | None ->
let wait_root : elt ref = ref (Obj.magic ()) in (* Because it is not trivial to produce an empty elt *)
let rec aux path (name, kind) =
(* #<< debug browserstructure (sprintf "building init from %s (path=%s)" name (Path.to_string path)); >>#; *)
let pwd = Path.forward path (Path.step name) in
let maped_kind : (ByPass.t, module_elt) BI.kind =
match kind with
| BI.Function by -> BI.Function by
| BI.Module table -> BI.Module (List.map (aux pwd) table)
in
{ bymap = t; name = name ; root = wait_root ; kind = maped_kind ; pwd = pwd }
in
let root_children = List.map (aux Path.root) t.root_node in
let root = { bymap = t; name = "" ; root = wait_root ; kind = BI.Module root_children ; pwd = Path.root } in
wait_root := root;
root
let bymap elt = { elt.bymap with elt_root = Some (Obj.magic !(elt.root)) }
let root elt = !(elt.root)
let elt_name elt = elt.name
let elts e = e
let children = List.map (fun e -> e.name, e)
let is_root e = Path.is_root e.pwd
let parent e =
match Path.cd e [Backward] with
| Some e -> e
| None -> assert false (* Parent of root is root *)
let public_elt e = e.kind
(** Get Initial Code : this not include the types definition *)
let rec export_bypass elt =
(* #<< debug browserstructure (sprintf "export bypass from %s (%s)" elt.name (Path.to_string elt.pwd)); >>#; *)
match elt.kind with
| BI.Function by -> BI.HFunction by
| BI.Module m -> BI.HModule (elt.name, (List.map export_bypass (elts m))) (* elts : impl depends *)
let export_children elt =
(* #<< debug browserstructure (sprintf "export children of %s (%s)" elt.name (Path.to_string elt.pwd)); >>#; *)
match elt.kind with
| BI.Function by -> [BI.HFunction by]
| BI.Module m -> List.map export_bypass (elts m)
(* TODO : rewrite with Format *)
let include_format =
let default_sep = "\n" in
let fprint fprinter name by =
fprinter (name, (ByPass.skey by),
(Format.to_string BslTypesGeneration.Opa.pp (ByPass.definition_type by)))
in
let super_concat s f l = String.concat s (List.filter ((<>) "") (List.map f l))
in
let rec mfmt_printer mfmt (name, eltlist) =
super_concat "" (
function
| `Mfmt_name -> name
| `Mfmt_const s -> s
| `Mfmt_iter (mfmt_opt, fprinter, sep) ->
let mfmt = match mfmt_opt with Some mfmt -> mfmt | None -> mfmt in
super_concat (Option.default default_sep sep) (
function elt -> match elt.kind with
| BI.Function by -> fprint fprinter elt.name by
| BI.Module eltlist -> mfmt_printer mfmt (elt.name, eltlist)
) eltlist
) mfmt
in
fun elt fmt -> match elt.kind with
| BI.Function by -> (
match IFormat.fprinter_opt_of_fmt fmt with
| Some fprinter -> fprint fprinter elt.name by
| None -> assert false
(* TODO
Mathieu, Mon Aug 16 22:18:01 CEST 2010
After the refactoring of libbsl, I have no idea in what case
this could happens.
Please, when somebody find his way to this assert false,
provide an error message, or tell me how to reproduce.
Thx.
was : *)
(*
BslRegisterParser.error (sprintf "function \"%s\"\nThis path has type function but is here used with a module format" elt.name)
*)
)
| BI.Module eltlist -> mfmt_printer (IFormat.mfmt_of_fmt fmt) (elt.name, eltlist)
let preprocess_line t ~filename ~line input =
let comment fmt = let k s = "/* " ^ s ^ " */" in Printf.ksprintf k fmt in
let root = init t in
BslRegisterParserState.init_file ~filename ;
BslRegisterParserState.init_line ~line_number:line ;
match HLParser.opalang_directive input with
| BslDirectives.Source (_, s) -> s
| BslDirectives.Directive (_, _, BslDirectives.FormatDefinition name) ->
comment "##format %s = <abstr>" name
| BslDirectives.Directive (_, _, BslDirectives.Include (fmt, link)) -> (
match Path.of_string link with
| None -> comment "invalid path name : \"%s\"" link
| Some path -> (
match Path.cd root path with
| Some elt2 -> include_format elt2 fmt
| None -> comment "[!] module or function \"%s\" not found" link
)
)
| BslDirectives.Directive (pos, _, BslDirectives.IncludeType str) -> (
let regexp = Str.regexp str in
let buf = FBuffer.create 1024 in
let buf = fold_types t
(fun buf t ->
let name = match t with
| BslTypes.External (_, name, _) -> name
| _ ->
OManager.printf "Assertion Failure@\n%a%a@\n%!"
FilePos.pp_citation pos BslTypes.pp_context t;
assert false
in
if Str.string_match regexp name 0
then FBuffer.printf buf "%a@\n" BslTypesGeneration.Opa.pp_definition t else buf
) buf in
FBuffer.contents buf
)
end
end
(* The data here are managed with side effects with the functions register *)
(* <!> The types definitions are in a topologic order,
so we must use a SortedHashtbl (cf base) *)
(* ===================================================================================================== *)
type _imperativ_data_module = (string, (BslKey.t, _imperativ_data_module) BI.kind) Hashtbl.t (* *)
let _imperativ_module_table : _imperativ_data_module = Hashtbl.create 128 (* *)
let _bypass_table : (BslKey.t, ByPass.t) Hashtbl.t = Hashtbl.create 512 (* *)
let _types_table : (BslKey.t, (string * string list * BslTypes.t)) SortHashtbl.t = (* *)
SortHashtbl.create 128 (* *)
let _loaded : (string, unit) Hashtbl.t = Hashtbl.create 16 (* *)
(* ===================================================================================================== *)
(* The modules where are the side effects *)
module RegisterTable =
struct
open ByPassMap
type building_env =
{
ml_ctrans : ML_CTrans.env ;
js_ctrans : JS_CTrans.env ;
(* c_ctrans : C_CTrans.env ; *)
generated_ml : FBuffer.t ;
generated_js : (BI.unicity_index * JsAst.code_elt) list (*reversed*)(*FBuffer.t*) ;
(* generated_c : FBuffer.t ; *)
}
(* During the building of the bymap, we generate transcription code for qml2ocaml compilers and
for qml interpreters written in ocaml, with the informationn of type transcription in
the 2 spezialized modules in arg of the big functor MakeLibBSL *)
let identity_coerced _ = () (* todo : warning *)
let trans_name =
let fresh = ref (-1) in
(fun _name -> incr(fresh); Printf.sprintf "bslp%d" !fresh) (* todo voir pour le caractere compositionnel du truc...*)
let trans_ident key = Ident.source ("bsl_" ^ BslKey.to_string key)
let _meta_code_warning =
let __t = Hashtbl.create 10 in
(fun f typ ->
if Hashtbl.mem __t typ then () else
(Hashtbl.add __t typ ();
#<If:BSL_PROJECTION $minlevel 1>
debug "%a@\nSpecialized BSL : In your transtyping module@\nCTrans.%s returns (MetaCode \"\") on this type@\n"
BslTypes.pp_context typ f
#<Else>
ignore f; ignore typ
#<End>))
let re_compiled_generate_ml building bslkey bsltags impl (inputs : _ list option) output =
let env = building.ml_ctrans in
if BslTags.never_projected bsltags then building, None else
let trans_type = ref false in
let trans_output = ref false in
let ml_arg = Printf.sprintf "x%d" and ml_ret = "r" in
let proj_arg = Printf.sprintf "p%d" in
let env, (trans_out, typed_out) =
let env, maped_output = ML_CTrans.qml_of_ocaml ~bslkey ~bsltags ~env output (BI.MetaIdent ml_ret) in
env,
(match maped_output with
| None -> ml_ret, output
| Some (BI.MetaCode "") ->
(match output with B.OpaValue _ -> () | _ -> _meta_code_warning "qml_of_ocaml" output);
ml_ret, output
| Some (BI.MetaComment comment) ->
trans_output := true;
Printf.sprintf "%s (* : %s *)" ml_ret comment, output
| Some (BI.MetaCode conv) ->
trans_type:=true; trans_output := true;
conv, BslTypes.opavalue output
)
in
let new_impl = trans_name bslkey in
let buf = building.generated_ml in
match inputs with
| None ->
if !trans_type then
let buf = FBuffer.addln buf (Printf.sprintf "let %s = %s" new_impl trans_out) in
let type_of_new_impl = typed_out in
(* we must save the new generated function in ocaml init *)
{ building with
ml_ctrans = env ;
generated_ml = buf ;
},
Some (Implementation.String new_impl, type_of_new_impl)
else
{ building with ml_ctrans = env }, None
| Some inputs ->
let env, projected_args = List.fold_left_map_i
(fun i env typ ->
let param = ml_arg i in
let env, meta_code = ML_CTrans.ocaml_of_qml ~bslkey ~bsltags ~env typ (BI.MetaIdent param) in
env,(
match meta_code with
| None -> param, typ, None
| Some (BI.MetaCode "") ->
(match typ with B.OpaValue _ -> () | _ -> _meta_code_warning "ocaml_of_qml" typ);
param, typ, None
| Some (BI.MetaComment comment) ->
(Printf.sprintf "( %s (* : %s *) )" param comment), typ, None
| Some (BI.MetaCode conv) ->
trans_type:=true;
let p = proj_arg i in
p, BslTypes.opavalue typ, Some (Printf.sprintf " let %s = %s in" p conv) (* --- *)
)) env inputs in
let ml_ret2 = "r2" in
let ctrans_return = ML_CTrans.return bslkey bsltags env (BI.MetaIdent ml_ret2) in
let more_args = ML_CTrans.more_args bslkey bsltags env in
let more_code = ML_CTrans.more_code bslkey bsltags env in
let () =
if List.exists Option.is_some [ ctrans_return ; more_args ; more_code ]
then trans_type := true
in
if !trans_type
then
begin
let typed_args = List.map (fun (_, t, _) -> t) projected_args in
let formel_params = List.mapi (fun i _ -> ml_arg i) inputs in
let env, coercion = List.fold_left_map2
(fun env a t-> ML_CTrans.runtime_ocaml_coercion ~bslkey ~bsltags t ~env a) env formel_params typed_args in
let params =
if inputs = [] && more_args = None then "()"
else String.concat " " coercion in
let more_args = Option.default "" more_args in
let buf = FBuffer.printf buf "let %s %s %s =\n" new_impl params more_args in
let buf = Option.fold FBuffer.addln buf more_code in
(* projections : p_i *)
let buf =
let fold buf (_, _, var) = Option.fold FBuffer.addln buf var in
List.fold_left fold buf projected_args in
let buf =
let projected_args = (if inputs = [] then "()" else String.concat_map " " (fun (p, _, _) -> p) projected_args) in
let buf = FBuffer.printf buf " let %s = %s %s in\n" ml_ret impl projected_args in
if !trans_output then
let return =
match ctrans_return with
| None -> ml_ret2
| Some ret -> ret
in
FBuffer.addln buf (Printf.sprintf " let %s = %s in\n %s" ml_ret2 trans_out return)
else
let return =
match ML_CTrans.return bslkey bsltags env (BI.MetaIdent ml_ret) with
| None -> ml_ret
| Some ret -> ret
in
FBuffer.printf buf " %s\n" return in
let type_of_new_impl = BslTypes.Fun (BslTypes.pos typed_out, typed_args, typed_out) in
let buf = FBuffer.addln buf "" in
(* we must save the new generated function in ocaml init *)
{ building with
ml_ctrans = env ;
generated_ml = buf ;
},
Some (Implementation.String new_impl, type_of_new_impl)
end
else { building with ml_ctrans = env }, None
let re_compiled_generate_js building bslkey bsltags impl (inputs : _ list option) output : building_env * (Implementation.compiler_repr * BslTypes.t) option =
let impl = JsParse.String.expr ~globalize:true impl in
let env = building.js_ctrans in
if BslTags.never_projected bsltags then building, None else
let trans_type = ref false in
let js_arg = Printf.sprintf "x%d"
and js_ret = "by_ret" in