forked from stan-dev/stanc3
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Ast_to_Mir.ml
887 lines (851 loc) · 34.1 KB
/
Ast_to_Mir.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
open Core_kernel
open Core_kernel.Poly
open Middle
let trans_fn_kind kind name =
let fname = Utils.stdlib_distribution_name name in
match kind with
| Ast.StanLib suffix -> Fun_kind.StanLib (fname, suffix, AoS)
| UserDefined suffix -> UserDefined (fname, suffix)
let without_underscores = String.filter ~f:(( <> ) '_')
let drop_leading_zeros s =
match String.lfindi ~f:(fun _ c -> c <> '0') s with
| Some p when p > 0 -> (
match s.[p] with
| 'e' | '.' -> String.drop_prefix s (p - 1)
| _ -> String.drop_prefix s p )
| Some _ -> s
| None -> "0"
let format_number s = s |> without_underscores |> drop_leading_zeros
let%expect_test "format_number0" =
format_number "0_000." |> print_endline ;
[%expect "0."]
let%expect_test "format_number1" =
format_number ".123_456" |> print_endline ;
[%expect ".123456"]
let rec op_to_funapp op args type_ =
let loc = Ast.expr_loc_lub args in
let adlevel = Ast.expr_ad_lub args in
Expr.
{ Fixed.pattern=
FunApp (StanLib (Operator.to_string op, FnPlain, AoS), trans_exprs args)
; meta= Expr.Typed.Meta.create ~type_ ~adlevel ~loc () }
and trans_expr {Ast.expr; Ast.emeta} =
let ewrap pattern =
Expr.
{ Fixed.pattern
; meta=
Typed.Meta.
{type_= emeta.Ast.type_; adlevel= emeta.ad_level; loc= emeta.loc} }
in
match expr with
| Ast.Paren x -> trans_expr x
| BinOp (lhs, And, rhs) -> EAnd (trans_expr lhs, trans_expr rhs) |> ewrap
| BinOp (lhs, Or, rhs) -> EOr (trans_expr lhs, trans_expr rhs) |> ewrap
| BinOp (lhs, op, rhs) -> op_to_funapp op [lhs; rhs] emeta.type_
| PrefixOp (op, e) | Ast.PostfixOp (e, op) -> op_to_funapp op [e] emeta.type_
| Ast.TernaryIf (cond, ifb, elseb) ->
Expr.Fixed.Pattern.TernaryIf
(trans_expr cond, trans_expr ifb, trans_expr elseb)
|> ewrap
| Variable {name; _} -> Var name |> ewrap
| IntNumeral x -> Lit (Int, format_number x) |> ewrap
| RealNumeral x -> Lit (Real, format_number x) |> ewrap
| ImagNumeral x -> Lit (Imaginary, format_number x) |> ewrap
| FunApp (fn_kind, {name; _}, args) | CondDistApp (fn_kind, {name; _}, args)
->
FunApp (trans_fn_kind fn_kind name, trans_exprs args) |> ewrap
| GetLP | GetTarget -> FunApp (StanLib ("target", FnTarget, AoS), []) |> ewrap
| ArrayExpr eles ->
FunApp (CompilerInternal FnMakeArray, trans_exprs eles) |> ewrap
| RowVectorExpr eles ->
FunApp (CompilerInternal FnMakeRowVec, trans_exprs eles) |> ewrap
| Indexed (lhs, indices) ->
Indexed (trans_expr lhs, List.map ~f:trans_idx indices) |> ewrap
| Promotion (e, ty, ad) -> Promotion (trans_expr e, ty, ad) |> ewrap
and trans_idx = function
| Ast.All -> All
| Ast.Upfrom e -> Upfrom (trans_expr e)
| Ast.Downfrom e -> Between (Expr.Helpers.loop_bottom, trans_expr e)
| Ast.Between (lb, ub) -> Between (trans_expr lb, trans_expr ub)
| Ast.Single e -> (
match e.emeta.type_ with
| UInt -> Single (trans_expr e)
| UArray _ -> MultiIndex (trans_expr e)
| _ ->
Common.FatalError.fatal_error_msg
[%message "Expecting int or array" (e.emeta.type_ : UnsizedType.t)] )
and trans_exprs exprs = List.map ~f:trans_expr exprs
let trans_sizedtype = SizedType.map trans_expr
let neg_inf =
Expr.
{ Fixed.pattern= FunApp (CompilerInternal FnNegInf, [])
; meta=
Typed.Meta.{type_= UReal; loc= Location_span.empty; adlevel= DataOnly}
}
let trans_arg (adtype, ut, ident) = (adtype, ident.Ast.name, ut)
let truncate_dist ud_dists (id : Ast.identifier)
(ast_obs : Ast.typed_expression) ast_args t =
let cdf_suffices = ["_lcdf"; "_cdf_log"] in
let ccdf_suffices = ["_lccdf"; "_ccdf_log"] in
let find_function_info sfx =
let possible_names = List.map ~f:(( ^ ) id.name) sfx in
match
List.find
~f:(fun (n, _) -> List.mem ~equal:String.equal possible_names n)
ud_dists
with
| Some (name, tp) -> (Ast.UserDefined FnPlain, name, tp)
| None ->
( Ast.StanLib FnPlain
, List.hd_exn possible_names
, if Stan_math_signatures.is_stan_math_function_name (id.name ^ "_lpmf")
then UnsizedType.UInt
else UnsizedType.UReal (* close enough *) ) in
let targetme loc e =
{ Stmt.Fixed.meta= loc
; pattern= TargetPE (Expr.Helpers.unary_op Operator.PMinus e) } in
let trunc cond_op extrema (x : Expr.Typed.t) y =
let smeta = x.meta.loc in
let ast_obs =
if UnsizedType.is_container ast_obs.Ast.emeta.type_ then
Ast.mk_typed_expression
~expr:
(FunApp
( Ast.StanLib FnPlain
, Ast.{name= extrema; id_loc= smeta}
, [ast_obs] ) )
~loc:smeta ~type_:UnsizedType.UReal ~ad_level:ast_obs.emeta.ad_level
else ast_obs in
{ Stmt.Fixed.meta= smeta
; pattern=
IfElse
( Expr.Helpers.binop (trans_expr ast_obs) cond_op x
, {Stmt.Fixed.meta= smeta; pattern= TargetPE neg_inf}
, Some y ) } in
let funapp meta kind name args =
Expr.{Fixed.pattern= FunApp (trans_fn_kind kind name, args); meta} in
let inclusive_bound tp (lb : Expr.Typed.t) =
if UnsizedType.is_int_type tp then
Expr.Helpers.binop lb Minus Expr.Helpers.one
else lb in
let size_adjust e =
if
(not (UnsizedType.is_container ast_obs.Ast.emeta.type_))
|| List.exists
~f:(fun (i : Ast.typed_expression) ->
UnsizedType.is_container i.emeta.type_ )
ast_args
then e
else
(* Container y but scalar args - need to multiply by size(y) *)
let trans_ast_obs = trans_expr ast_obs in
let type_ = {trans_ast_obs.meta with type_= UnsizedType.UReal} in
Expr.Helpers.binop e Times
(Expr.Helpers.internal_funapp FnLength [trans_ast_obs] type_) in
match t with
| Ast.NoTruncate -> []
| TruncateUpFrom lb ->
let fk, fn, tp = find_function_info ccdf_suffices in
let lb = trans_expr lb in
[ trunc Less "min" lb
(targetme lb.meta.loc
(size_adjust
(funapp lb.meta fk fn
(inclusive_bound tp lb :: trans_exprs ast_args) ) ) ) ]
| TruncateDownFrom ub ->
let fk, fn, _ = find_function_info cdf_suffices in
let ub = trans_expr ub in
[ trunc Greater "max" ub
(targetme ub.meta.loc
(size_adjust (funapp ub.meta fk fn (ub :: trans_exprs ast_args))) )
]
| TruncateBetween (lb, ub) ->
let fk, fn, tp = find_function_info cdf_suffices in
let lb, ub = (trans_expr lb, trans_expr ub) in
let expr args =
funapp ub.meta (Ast.StanLib FnPlain) "log_diff_exp"
[ funapp ub.meta fk fn (ub :: args)
; funapp ub.meta fk fn (inclusive_bound tp lb :: args) ] in
let statement =
match
List.findi
~f:(fun (_ : int) (e : Ast.typed_expression) ->
UnsizedType.is_container e.emeta.type_ )
ast_args
with
(* If any of the arguments (besides the data) are vectors, need to generate a loop
This can go away if https://github.com/stan-dev/stan/issues/1154 is implemented
*)
| Some (i, _) ->
let ast_args = trans_exprs ast_args in
(* avoid recomputing in each iteration of the loop *)
let temp_decls, ast_args, symbol_reset =
Stmt.Helpers.temp_vars ast_args in
let bound =
let e = List.nth_exn ast_args i in
Expr.Helpers.internal_funapp FnLength [e]
{e.meta with type_= UnsizedType.UInt} in
let bodyfn (idx : Expr.Typed.t) =
let args =
List.map
~f:(fun (e : Expr.Typed.t) ->
if UnsizedType.is_container e.meta.type_ then
Expr.Helpers.add_int_index e (Index.Single idx)
else e )
ast_args in
targetme ub.meta.loc (size_adjust (expr args)) in
let loop = Stmt.Helpers.mk_for bound bodyfn ub.meta.loc in
symbol_reset () ;
Stmt.{Fixed.pattern= Block (temp_decls @ [loop]); meta= loop.meta}
| None ->
targetme ub.meta.loc (size_adjust (expr (trans_exprs ast_args)))
in
[trunc Less "min" lb (trunc Greater "max" ub statement)]
let unquote s =
if s.[0] = '"' && s.[String.length s - 1] = '"' then
String.drop_suffix (String.drop_prefix s 1) 1
else s
let trans_printables mloc (ps : Ast.typed_expression Ast.printable list) =
List.map
~f:(function
| Ast.PString s ->
{ (Expr.Helpers.str (unquote s)) with
meta=
Expr.Typed.Meta.create ~type_:UReal ~loc:mloc ~adlevel:DataOnly ()
}
| Ast.PExpr e -> trans_expr e )
ps
(** These types signal the context for a declaration during statement translation.
They are only interpreted by trans_decl.*)
type transform_action = Check | Constrain | Unconstrain | IgnoreTransform
[@@deriving sexp]
type decl_context =
{transform_action: transform_action; dadlevel: UnsizedType.autodifftype}
let same_shape decl_id decl_var id var meta =
if UnsizedType.is_scalar_type (Expr.Typed.type_of var) then []
else
[ Stmt.
{ Fixed.pattern=
NRFunApp
( StanLib ("check_matching_dims", FnPlain, AoS)
, Expr.Helpers.
[str "constraint"; str decl_id; decl_var; str id; var] )
; meta } ]
let check_transform_shape decl_id decl_var meta = function
| Transformation.Offset e -> same_shape decl_id decl_var "offset" e meta
| Multiplier e -> same_shape decl_id decl_var "multiplier" e meta
| Lower e -> same_shape decl_id decl_var "lower" e meta
| Upper e -> same_shape decl_id decl_var "upper" e meta
| OffsetMultiplier (e1, e2) ->
same_shape decl_id decl_var "offset" e1 meta
@ same_shape decl_id decl_var "multiplier" e2 meta
| LowerUpper (e1, e2) ->
same_shape decl_id decl_var "lower" e1 meta
@ same_shape decl_id decl_var "upper" e2 meta
| Covariance | Correlation | CholeskyCov | CholeskyCorr | Ordered
|PositiveOrdered | Simplex | UnitVector | Identity ->
[]
let copy_indices indexed (var : Expr.Typed.t) =
if UnsizedType.is_scalar_type var.meta.type_ then var
else
match Expr.Helpers.collect_indices indexed with
| [] -> var
| indices ->
Expr.Fixed.
{ pattern= Indexed (var, indices)
; meta=
{ var.meta with
type_= Expr.Helpers.infer_type_of_indexed var.meta.type_ indices
} }
let extract_transform_args var = function
| Transformation.Lower a | Upper a -> [copy_indices var a]
| Offset a -> [copy_indices var a; {a with Expr.Fixed.pattern= Lit (Int, "1")}]
| Multiplier a -> [{a with pattern= Lit (Int, "0")}; copy_indices var a]
| LowerUpper (a1, a2) | OffsetMultiplier (a1, a2) ->
[copy_indices var a1; copy_indices var a2]
| Covariance | Correlation | CholeskyCov | CholeskyCorr | Ordered
|PositiveOrdered | Simplex | UnitVector | Identity ->
[]
let param_size transform sizedtype =
let rec shrink_eigen f st =
match st with
| SizedType.SArray (t, d) -> SizedType.SArray (shrink_eigen f t, d)
| SVector (mem_pattern, d) | SMatrix (mem_pattern, d, _) ->
SVector (mem_pattern, f d)
| SInt | SReal | SComplex | SRowVector _ | SComplexRowVector _
|SComplexVector _ | SComplexMatrix _ ->
Common.FatalError.fatal_error_msg
[%message
"Expecting SVector or SMatrix, got " (st : Expr.Typed.t SizedType.t)]
in
let rec shrink_eigen_mat f st =
match st with
| SizedType.SArray (t, d) -> SizedType.SArray (shrink_eigen_mat f t, d)
| SMatrix (mem_pattern, d1, d2) -> SVector (mem_pattern, f d1 d2)
| SInt | SReal | SComplex | SRowVector _ | SVector _ | SComplexRowVector _
|SComplexVector _ | SComplexMatrix _ ->
Common.FatalError.fatal_error_msg
[%message "Expecting SMatrix, got " (st : Expr.Typed.t SizedType.t)]
in
let k_choose_2 k =
Expr.Helpers.(binop (binop k Times (binop k Minus (int 1))) Divide (int 2))
in
match transform with
| Transformation.Identity | Lower _ | Upper _
|LowerUpper (_, _)
|Offset _ | Multiplier _
|OffsetMultiplier (_, _)
|Ordered | PositiveOrdered | UnitVector ->
sizedtype
| Simplex ->
shrink_eigen (fun d -> Expr.Helpers.(binop d Minus (int 1))) sizedtype
| CholeskyCorr | Correlation -> shrink_eigen k_choose_2 sizedtype
| CholeskyCov ->
(* (N * (N + 1)) / 2 + (M - N) * N *)
shrink_eigen_mat
(fun m n ->
Expr.Helpers.(
binop
(binop (k_choose_2 n) Plus n)
Plus
(binop (binop m Minus n) Times n)) )
sizedtype
| Covariance ->
shrink_eigen
(fun k -> Expr.Helpers.(binop k Plus (k_choose_2 k)))
sizedtype
let rec check_decl var decl_type' decl_id decl_trans smeta adlevel =
match decl_trans with
| Transformation.LowerUpper (lb, ub) ->
check_decl var decl_type' decl_id (Lower lb) smeta adlevel
@ check_decl var decl_type' decl_id (Upper ub) smeta adlevel
| _ when Transformation.has_check decl_trans ->
let check_id id =
let var_name = Fmt.str "%a" Expr.Typed.pp id in
let args = extract_transform_args id decl_trans in
Stmt.Helpers.internal_nrfunapp
(FnCheck {trans= decl_trans; var_name; var= id})
args smeta in
[check_id var]
| _ -> []
let check_sizedtype name st =
let check x = function
| {Expr.Fixed.pattern= Lit (Int, i); _} when float_of_string i >= 0. -> []
| n ->
[ Stmt.Helpers.internal_nrfunapp FnValidateSize
Expr.Helpers.
[ str name
; str (Fmt.str "%a" Pretty_printing.pp_typed_expression x); n ]
n.meta.loc ] in
let rec sizedtype = function
| SizedType.(SInt | SReal | SComplex) as t -> ([], t)
| SVector (mem_pattern, s) ->
let e = trans_expr s in
(check s e, SizedType.SVector (mem_pattern, e))
| SRowVector (mem_pattern, s) ->
let e = trans_expr s in
(check s e, SizedType.SRowVector (mem_pattern, e))
| SMatrix (mem_pattern, r, c) ->
let er = trans_expr r in
let ec = trans_expr c in
(check r er @ check c ec, SizedType.SMatrix (mem_pattern, er, ec))
| SComplexVector s ->
let e = trans_expr s in
(check s e, SizedType.SComplexVector e)
| SComplexRowVector s ->
let e = trans_expr s in
(check s e, SizedType.SComplexRowVector e)
| SComplexMatrix (r, c) ->
let er = trans_expr r in
let ec = trans_expr c in
(check r er @ check c ec, SizedType.SComplexMatrix (er, ec))
| SArray (t, s) ->
let e = trans_expr s in
let ll, t = sizedtype t in
(check s e @ ll, SizedType.SArray (t, e)) in
let ll, st = sizedtype st in
(ll, Type.Sized st)
let trans_decl {transform_action; dadlevel} smeta
(decl_type : Ast.typed_expression SizedType.t) transform identifier
initial_value =
let decl_id = identifier.Ast.name in
let rhs = Option.map ~f:trans_expr initial_value in
let size_checks, dt = check_sizedtype identifier.name decl_type in
let decl_adtype = dadlevel in
let decl_var =
Expr.
{ Fixed.pattern= Var decl_id
; meta=
Typed.Meta.create ~adlevel:dadlevel ~loc:smeta
~type_:(SizedType.to_unsized decl_type)
() } in
let decl =
Stmt.
{ Fixed.pattern=
Decl {decl_adtype; decl_id; decl_type= dt; initialize= true}
; meta= smeta } in
let rhs_assignment =
Option.map
~f:(fun e ->
Stmt.Fixed.
{pattern= Assignment ((decl_id, e.meta.type_, []), e); meta= smeta} )
rhs
|> Option.to_list in
if Utils.is_user_ident decl_id then
let constrain_checks =
match transform_action with
| Constrain | Unconstrain ->
Common.FatalError.fatal_error_msg
[%message "Constraints must use trans_sizedtype_decl instead"]
| Check ->
check_transform_shape decl_id decl_var smeta transform
@ check_decl decl_var dt decl_id transform smeta dadlevel
| IgnoreTransform -> [] in
size_checks @ (decl :: rhs_assignment) @ constrain_checks
else size_checks @ (decl :: rhs_assignment)
let unwrap_block_or_skip = function
| [({Stmt.Fixed.pattern= Block _; _} as b)] -> Some b
| [{pattern= Skip; _}] -> None
| x ->
Common.FatalError.fatal_error_msg
[%message "Expecting a block or skip, not" (x : Stmt.Located.t list)]
let rec trans_stmt ud_dists (declc : decl_context) (ts : Ast.typed_statement) =
let stmt_typed = ts.stmt and smeta = ts.smeta.loc in
let trans_stmt =
trans_stmt ud_dists {declc with transform_action= IgnoreTransform} in
let trans_single_stmt s =
match trans_stmt s with
| [s] -> s
| s -> Stmt.Fixed.{pattern= SList s; meta= smeta} in
let swrap pattern = [Stmt.Fixed.{meta= smeta; pattern}] in
let mloc = smeta in
match stmt_typed with
| Ast.Assignment {assign_lhs; assign_rhs; assign_op} ->
let rec get_lhs_base = function
| {Ast.lval= Ast.LIndexed (l, _); _} -> get_lhs_base l
| {lval= LVariable s; lmeta} -> (s, lmeta) in
let assign_identifier, lmeta = get_lhs_base assign_lhs in
let id_ad_level = lmeta.Ast.ad_level in
let id_type_ = lmeta.Ast.type_ in
let lhs_type_ = assign_lhs.Ast.lmeta.type_ in
let lhs_ad_level = assign_lhs.Ast.lmeta.ad_level in
let rec get_lhs_indices = function
| {Ast.lval= Ast.LIndexed (l, i); _} -> get_lhs_indices l @ i
| {Ast.lval= Ast.LVariable _; _} -> [] in
let assign_indices = get_lhs_indices assign_lhs in
let assignee =
{ Ast.expr=
( match assign_indices with
| [] -> Ast.Variable assign_identifier
| _ ->
Ast.Indexed
( { expr= Ast.Variable assign_identifier
; emeta=
{ Ast.loc= Location_span.empty
; ad_level= id_ad_level
; type_= id_type_ } }
, assign_indices ) )
; emeta=
{ Ast.loc= assign_lhs.lmeta.loc
; ad_level= lhs_ad_level
; type_= lhs_type_ } } in
let rhs =
match assign_op with
| Ast.Assign | Ast.ArrowAssign -> trans_expr assign_rhs
| Ast.OperatorAssign op ->
op_to_funapp op [assignee; assign_rhs] assignee.emeta.type_ in
Assignment
( ( assign_identifier.Ast.name
, id_type_
, List.map ~f:trans_idx assign_indices )
, rhs )
|> swrap
| Ast.NRFunApp (fn_kind, {name; _}, args) ->
NRFunApp (trans_fn_kind fn_kind name, trans_exprs args) |> swrap
| Ast.IncrementLogProb e | Ast.TargetPE e -> TargetPE (trans_expr e) |> swrap
| Ast.Tilde {arg; distribution; args; truncation} ->
let suffix =
Stan_math_signatures.dist_name_suffix ud_dists distribution.name in
let name = distribution.name ^ suffix in
let kind =
let possible_names =
List.map ~f:(( ^ ) distribution.name) Utils.distribution_suffices
|> String.Set.of_list in
if List.exists ~f:(fun (n, _) -> Set.mem possible_names n) ud_dists then
Fun_kind.UserDefined (name, FnLpdf true)
else StanLib (name, FnLpdf true, AoS) in
let add_dist =
Stmt.Fixed.Pattern.TargetPE
Expr.
{ Fixed.pattern= FunApp (kind, trans_exprs (arg :: args))
; meta=
Typed.Meta.create ~type_:UReal ~loc:mloc
~adlevel:(Ast.expr_ad_lub (arg :: args))
() } in
swrap add_dist @ truncate_dist ud_dists distribution arg args truncation
| Ast.Print ps ->
NRFunApp (CompilerInternal FnPrint, trans_printables smeta ps) |> swrap
| Ast.Reject ps ->
NRFunApp (CompilerInternal FnReject, trans_printables smeta ps) |> swrap
| Ast.IfThenElse (cond, ifb, elseb) ->
IfElse
( trans_expr cond
, trans_single_stmt ifb
, Option.map ~f:trans_single_stmt elseb )
|> swrap
| Ast.While (cond, body) ->
While (trans_expr cond, trans_single_stmt body) |> swrap
| Ast.For {loop_variable; lower_bound; upper_bound; loop_body} ->
let body =
match trans_single_stmt loop_body with
| {pattern= Block _; _} as b -> b
| x -> {x with pattern= Block [x]} in
For
{ loopvar= loop_variable.Ast.name
; lower= trans_expr lower_bound
; upper= trans_expr upper_bound
; body }
|> swrap
| Ast.ForEach (loopvar, iteratee, body) ->
let iteratee' = trans_expr iteratee in
let body_stmts =
match trans_single_stmt body with
| {pattern= Block body_stmts; _} -> body_stmts
| b -> [b] in
let decl_type =
match Expr.Typed.type_of iteratee' with
| UMatrix -> UnsizedType.UReal
| t -> Expr.Helpers.(infer_type_of_indexed t [Index.Single loop_bottom])
in
let decl_loopvar =
Stmt.Fixed.
{ meta= smeta
; pattern=
Decl
{ decl_adtype= Expr.Typed.adlevel_of iteratee'
; decl_id= loopvar.name
; decl_type= Unsized decl_type
; initialize= true } } in
let assignment var =
Stmt.Fixed.
{pattern= Assignment ((loopvar.name, decl_type, []), var); meta= smeta}
in
let bodyfn var =
Stmt.Fixed.
{ pattern= Block (decl_loopvar :: assignment var :: body_stmts)
; meta= smeta } in
Stmt.Helpers.[ensure_var (for_each bodyfn) iteratee' smeta]
| Ast.FunDef _ ->
Common.FatalError.fatal_error_msg
[%message
"Found function definition statement outside of function block"]
| Ast.VarDecl {decl_type; transformation; variables; is_global= _} ->
List.concat_map
~f:(fun {identifier; initial_value} ->
trans_decl declc smeta decl_type
(Transformation.map trans_expr transformation)
identifier initial_value )
variables
| Ast.Block stmts -> Block (List.concat_map ~f:trans_stmt stmts) |> swrap
| Ast.Profile (name, stmts) ->
Profile (name, List.concat_map ~f:trans_stmt stmts) |> swrap
| Ast.Return e -> Return (Some (trans_expr e)) |> swrap
| Ast.ReturnVoid -> Return None |> swrap
| Ast.Break -> Break |> swrap
| Ast.Continue -> Continue |> swrap
| Ast.Skip -> Skip |> swrap
let trans_fun_def ud_dists (ts : Ast.typed_statement) =
match ts.stmt with
| Ast.FunDef {returntype; funname; arguments; body} ->
[ Program.
{ fdrt=
(match returntype with Void -> None | ReturnType ut -> Some ut)
; fdname= funname.name
; fdsuffix= Fun_kind.(suffix_from_name funname.name |> without_propto)
; fdargs= List.map ~f:trans_arg arguments
; fdbody=
trans_stmt ud_dists
{transform_action= IgnoreTransform; dadlevel= AutoDiffable}
body
|> unwrap_block_or_skip
; fdloc= ts.smeta.loc } ]
| _ ->
Common.FatalError.fatal_error_msg
[%message "Found non-function definition statement in function block"]
let get_block block prog =
match block with
| Program.Parameters -> prog.Ast.parametersblock
| TransformedParameters -> prog.transformedparametersblock
| GeneratedQuantities -> prog.generatedquantitiesblock
let trans_sizedtype_decl declc tr name =
let check fn x n =
Stmt.Helpers.internal_nrfunapp fn
Expr.Helpers.
[str name; str (Fmt.str "%a" Pretty_printing.pp_typed_expression x); n]
n.meta.loc in
let grab_size fn n = function
| Ast.{expr= IntNumeral i; _} as s when float_of_string i >= 2. ->
([], trans_expr s)
| Ast.({expr= IntNumeral _; _} | {expr= Variable _; _}) as s ->
let e = trans_expr s in
([check fn s e], e)
| s ->
let e = trans_expr s in
let decl_id = Fmt.str "%s_%ddim__" name n in
let decl =
{ Stmt.Fixed.pattern=
Decl
{ decl_type= Sized SInt
; decl_id
; decl_adtype= DataOnly
; initialize= true }
; meta= e.meta.loc } in
let assign =
{ Stmt.Fixed.pattern= Assignment ((decl_id, UInt, []), e)
; meta= e.meta.loc } in
let var =
Expr.
{ Fixed.pattern= Var decl_id
; meta=
Typed.Meta.
{ type_= s.Ast.emeta.Ast.type_
; adlevel= s.emeta.ad_level
; loc= s.emeta.loc } } in
([decl; assign; check fn s var], var) in
let rec go n = function
| SizedType.(SInt | SReal | SComplex) as t -> ([], t)
| SVector (mem_pattern, s) ->
let fn =
match (declc.transform_action, tr) with
| Constrain, Transformation.Simplex ->
Internal_fun.FnValidateSizeSimplex
| Constrain, UnitVector -> FnValidateSizeUnitVector
| _ -> FnValidateSize in
let l, s = grab_size fn n s in
(l, SizedType.SVector (mem_pattern, s))
| SRowVector (mem_pattern, s) ->
let l, s = grab_size FnValidateSize n s in
(l, SizedType.SRowVector (mem_pattern, s))
| SComplexRowVector s ->
let l, s = grab_size FnValidateSize n s in
(l, SizedType.SComplexRowVector s)
| SComplexVector s ->
let l, s = grab_size FnValidateSize n s in
(l, SizedType.SComplexVector s)
| SMatrix (mem_pattern, r, c) ->
let l1, r = grab_size FnValidateSize n r in
let l2, c = grab_size FnValidateSize (n + 1) c in
let cf_cov =
match (declc.transform_action, tr) with
| Constrain, CholeskyCov ->
[ { Stmt.Fixed.pattern=
NRFunApp
( StanLib ("check_greater_or_equal", FnPlain, AoS)
, Expr.Helpers.
[ str ("cholesky_factor_cov " ^ name)
; str
"num rows (must be greater or equal to num cols)"
; r; c ] )
; meta= r.Expr.Fixed.meta.Expr.Typed.Meta.loc } ]
| _ -> [] in
(l1 @ l2 @ cf_cov, SizedType.SMatrix (mem_pattern, r, c))
| SComplexMatrix (r, c) ->
let l1, r = grab_size FnValidateSize n r in
let l2, c = grab_size FnValidateSize (n + 1) c in
(l1 @ l2, SizedType.SComplexMatrix (r, c))
| SArray (t, s) ->
let l, s = grab_size FnValidateSize n s in
let ll, t = go (n + 1) t in
(l @ ll, SizedType.SArray (t, s)) in
go 1
let trans_block ud_dists declc block prog =
let f stmt (accum1, accum2, accum3) =
match stmt with
| { Ast.stmt=
VarDecl {decl_type= type_; variables; transformation; is_global= true}
; smeta } ->
let outvars, sizes, stmts =
List.unzip3
@@ List.map
~f:(fun {identifier; initial_value} ->
let decl_id = identifier.Ast.name in
let transform = Transformation.map trans_expr transformation in
let rhs = Option.map ~f:trans_expr initial_value in
let size, type_ =
trans_sizedtype_decl declc transform identifier.name type_
in
let decl_adtype = declc.dadlevel in
let decl_var =
Expr.
{ Fixed.pattern= Var decl_id
; meta=
Typed.Meta.create ~adlevel:declc.dadlevel
~loc:smeta.Ast.loc
~type_:(SizedType.to_unsized type_)
() } in
let decl =
Stmt.
{ Fixed.pattern=
Decl
{ decl_adtype
; decl_id
; decl_type= Sized type_
; initialize= true }
; meta= smeta.loc } in
let rhs_assignment =
Option.map
~f:(fun e ->
Stmt.Fixed.
{ pattern= Assignment ((decl_id, e.meta.type_, []), e)
; meta= smeta.loc } )
rhs
|> Option.to_list in
let outvar =
( identifier.name
, Program.
{ out_constrained_st= type_
; out_unconstrained_st= param_size transform type_
; out_block= block
; out_trans= transform } ) in
let stmts =
if Utils.is_user_ident decl_id then
let constrain_checks =
match declc.transform_action with
| Constrain | Unconstrain ->
check_transform_shape decl_id decl_var smeta.loc
transform
| Check ->
check_transform_shape decl_id decl_var smeta.loc
transform
@ check_decl decl_var (Type.Sized type_) decl_id
transform smeta.loc declc.dadlevel
| IgnoreTransform -> [] in
(decl :: rhs_assignment) @ constrain_checks
else decl :: rhs_assignment in
(outvar, size, stmts) )
variables in
( outvars @ accum1
, List.concat sizes @ accum2
, List.concat stmts @ accum3 )
| stmt -> (accum1, accum2, trans_stmt ud_dists declc stmt @ accum3) in
Ast.get_stmts (get_block block prog) |> List.fold_right ~f ~init:([], [], [])
let stmt_contains_check stmt =
let is_check = function
| Fun_kind.CompilerInternal (Internal_fun.FnCheck _) -> true
| _ -> false in
Stmt.Helpers.contains_fn_kind is_check stmt
let migrate_checks_to_end_of_block stmts =
let checks, not_checks = List.partition_tf ~f:stmt_contains_check stmts in
not_checks @ checks
let gather_data (p : Ast.typed_program) =
let data = Ast.get_stmts p.datablock in
List.concat_map data ~f:(function
| {stmt= VarDecl {decl_type= sizedtype; transformation; variables; _}; _} ->
List.map
~f:(fun {identifier; _} ->
( SizedType.map trans_expr sizedtype
, Transformation.map trans_expr transformation
, identifier.name ) )
variables
| _ -> [] )
let trans_prog filename (p : Ast.typed_program) : Program.Typed.t =
let {Ast.functionblock; datablock; transformeddatablock; modelblock; _} = p in
let map f list_op =
Option.value_map ~default:[]
~f:(fun {Ast.stmts; _} -> List.concat_map ~f stmts)
list_op in
let grab_fundef_names_and_types = function
| {Ast.stmt= Ast.FunDef {funname; arguments= (_, type_, _) :: _; _}; _} ->
[(funname.name, type_)]
| _ -> [] in
let ud_dists = map grab_fundef_names_and_types functionblock in
let trans_stmt = trans_stmt ud_dists in
let get_name_size s =
match s.Ast.stmt with
| Ast.VarDecl {decl_type= st; variables; transformation; _} ->
List.map
~f:(fun {identifier; _} ->
(identifier.name, trans_sizedtype st, transformation) )
variables
| _ -> [] in
let input_vars =
map get_name_size datablock |> List.map ~f:(fun (n, st, _) -> (n, st)) in
let declc = {transform_action= IgnoreTransform; dadlevel= DataOnly} in
let datab = map (trans_stmt {declc with transform_action= Check}) datablock in
let _, _, param =
trans_block ud_dists
{transform_action= Constrain; dadlevel= AutoDiffable}
Parameters p in
(* Backends will add to transform_inits as needed *)
let transform_inits = [] in
let out_param, paramsizes, param_gq =
trans_block ud_dists {declc with transform_action= Constrain} Parameters p
in
let _, _, txparam =
trans_block ud_dists
{transform_action= Check; dadlevel= AutoDiffable}
TransformedParameters p in
let out_tparam, tparamsizes, txparam_gq =
trans_block ud_dists
{declc with transform_action= Check}
TransformedParameters p in
let out_gq, gq_sizes, gq_stmts =
trans_block ud_dists
{declc with transform_action= Check}
GeneratedQuantities p in
let output_vars = out_param @ out_tparam @ out_gq in
let prepare_data =
datab
@ ( map
(trans_stmt {declc with transform_action= Check})
transformeddatablock
|> migrate_checks_to_end_of_block )
@ paramsizes @ tparamsizes @ gq_sizes in
let modelb = map (trans_stmt {declc with dadlevel= AutoDiffable}) modelblock in
let log_prob =
param
@ (txparam |> migrate_checks_to_end_of_block)
@
match modelb with
| [] -> []
| hd :: _ -> [{pattern= Block modelb; meta= hd.meta}] in
let txparam_decls, txparam_checks, txparam_stmts =
txparam_gq
|> List.partition3_map ~f:(function
| {pattern= Decl _; _} as d -> `Fst d
| s when stmt_contains_check s -> `Snd s
| s -> `Trd s ) in
let compiler_if_return cond =
Stmt.Fixed.
{ pattern=
IfElse (cond, {pattern= Return None; meta= Location_span.empty}, None)
; meta= Location_span.empty } in
let iexpr pattern = Expr.{pattern; Fixed.meta= Typed.Meta.empty} in
let fnot e =
FunApp (StanLib (Operator.to_string PNot, FnPlain, AoS), [e]) |> iexpr in
let tparam_early_return =
let to_var fv = iexpr (Var (Flag_vars.to_string fv)) in
let v1 = to_var EmitTransformedParameters in
let v2 = to_var EmitGeneratedQuantities in
[compiler_if_return (fnot (EOr (v1, v2) |> iexpr))] in
let gq_early_return =
[ compiler_if_return
(fnot (Var (Flag_vars.to_string EmitGeneratedQuantities) |> iexpr)) ]
in
let generate_quantities =
param_gq @ txparam_decls @ tparam_early_return @ txparam_stmts
@ txparam_checks @ gq_early_return
@ migrate_checks_to_end_of_block gq_stmts in
let normalize_prog_name prog_name =
if String.length prog_name > 0 && not (Char.is_alpha prog_name.[0]) then
"_" ^ prog_name
else prog_name in
{ functions_block= map (trans_fun_def ud_dists) functionblock
; input_vars
; prepare_data
; log_prob
; generate_quantities
; transform_inits
; output_vars
; prog_name= normalize_prog_name !Typechecker.model_name
; prog_path= filename }