/
codegen.rml
2723 lines (2068 loc) · 81.1 KB
/
codegen.rml
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 PELAB, Linkoping University
This file is part of Open Source Modelica (OSM).
OSM 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.
OSM 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 Foobar; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*)
(**
** file: codegen.rml
** module: Codegen
** description: Generate code from DAE (Flat Modelica)
**
** RCS: $Id$
**
**)
(* ------------------------------------------------------------------------- *)
module Codegen :
with "dae.rml"
with "print.rml"
type Ident = string
type ReturnType = string
type FunctionName = string
type ArgumentDeclaration = string
type VariableDeclaration = string
type InitStatement = string
type Statement = string
type CleanupStatement = string
type ReturnTypeStruct = string list
datatype CFunction = CFUNCTION of
ReturnType *
FunctionName *
ReturnTypeStruct *
(ArgumentDeclaration list) *
(VariableDeclaration list) *
(InitStatement list) *
(Statement list) *
(CleanupStatement list)
relation generate_functions : DAE.DAElist => ()
end
(* ------------------------------------------------------------------------- *)
with "dump.rml"
with "debug.rml"
with "absyn.rml"
with "algorithm.rml"
with "classinf.rml"
with "exp.rml"
with "modutil.rml"
with "types.rml"
with "util.rml"
(* ------------------------------------------------------------------------- *)
val c_empty_function = CFUNCTION("","",[],[],[],[],[],[])
relation c_make_function : (ReturnType,
FunctionName,
ReturnTypeStruct,
ArgumentDeclaration list)
=> CFunction =
axiom c_make_function (rt,fn,rts,ads) => CFUNCTION(rt,fn,rts,ads,[],[],[],[])
end
relation c_add_variables : (CFunction, VariableDeclaration list) => CFunction =
rule list_append(vd,nvd) => vd'
--------------------------
c_add_variables (CFUNCTION(rt,fn,rts,ads,vd,is,st,cl),nvd)
=> CFUNCTION(rt,fn,rts,ads,vd',is,st,cl)
end
relation c_add_inits : (CFunction, InitStatement list) => CFunction =
rule list_append(is,nis) => is'
--------------------------
c_add_inits (CFUNCTION(rt,fn,rts,ads,vd,is,st,cl),nis)
=> CFUNCTION(rt,fn,rts,ads,vd,is',st,cl)
end
relation c_add_statements : (CFunction, Statement list) => CFunction =
rule list_append(st,nst) => st'
--------------------------
c_add_statements (CFUNCTION(rt,fn,rts,ads,vd,is,st,cl),nst)
=> CFUNCTION(rt,fn,rts,ads,vd,is,st',cl)
end
relation c_add_cleanups : (CFunction, CleanupStatement list) => CFunction =
rule list_append(cl,ncl) => cl'
--------------------------
c_add_cleanups (CFUNCTION(rt,fn,rts,ads,vd,is,st,cl),ncl)
=> CFUNCTION(rt,fn,rts,ads,vd,is,st,cl')
end
relation c_merge_fns : CFunction list => CFunction =
axiom c_merge_fns [] => c_empty_function
rule c_merge_fns r => cfn2 &
c_merge_fn(cfn1,cfn2) => cfn
----------------------
c_merge_fns cfn1::r => cfn
end
relation c_merge_fn : (CFunction, CFunction) => CFunction =
rule list_append(vd1,vd2) => vd &
list_append(is1,is2) => is &
list_append(st1,st2) => st &
list_append(cl1,cl2) => cl
-----------------------------
c_merge_fn (CFUNCTION(rt,fn,rts,ad,vd1,is1,st1,cl1),
CFUNCTION(_ , _, _ , _,vd2,is2,st2,cl2))
=> CFUNCTION(rt,fn,rts,ad,vd,is,st,cl)
end
relation c_move_statements_to_inits : CFunction => CFunction =
rule list_append(is,st) => is'
---------------------------
c_move_statements_to_inits CFUNCTION(rt,fn,rts,ad,vd,is,st,cl)
=> CFUNCTION(rt,fn,rts,ad,vd,is',[],cl)
end
relation c_print_functions : CFunction list => () =
axiom c_print_functions []
rule c_print_function(f) &
c_print_functions(r)
---------------------
c_print_functions f::r
end
relation c_print_function : CFunction => () =
rule Util.string_delimit_list(ad,", ") => args_str &
Util.string_append_list [rt," ",fn,"(",args_str,") {"] => stmt_str &
let i0 = 0 &
c_print_indented_list (rts,i0) => i1 & Print.print_buf "\n" &
c_print_indented (stmt_str,i1) => i2 & Print.print_buf "\n" &
c_print_indented_list (vd,i2) => i3 & Print.print_buf "\n" &
c_print_indented_list (is,i3) => i4 & Print.print_buf "\n" &
c_print_indented_list (st,i4) => i5 & Print.print_buf "\n" &
c_print_indented_list (cl,i5) => i6 & Print.print_buf "\n" &
c_print_indented ("}",i6) => i7 & Print.print_buf "\n"
-----------
c_print_function CFUNCTION(rt,fn,rts,ad,vd,is,st,cl)
rule Print.print_buf "# c_print_function_failed\n"
-----------
c_print_function _
end
relation c_print_indented_list : (string list, int) => int =
axiom c_print_indented_list ([],i) => i
rule c_print_indented(f,i) => i' & Print.print_buf "\n" &
c_print_indented_list(r,i') => i''
-----------------
c_print_indented_list(f::r,i) => i''
end
relation c_print_indented : (string, int) => int =
rule string_list str => strl &
c_next_level(strl,i) => i' &
c_this_level(strl,i) => it &
c_print_indent it &
Print.print_buf str
-----------
c_print_indented (str,i) => i'
end
relation c_next_level : (char list, int) => int =
axiom c_next_level ([],i) => i
rule list_string [f] => "{" &
int_add(i,2) => i' &
c_next_level(r,i') => i''
-----
c_next_level (f::r,i) => i'' (* { *)
rule list_string [f] => "}" &
int_sub(i,2) => i' &
c_next_level(r,i') => i''
-----
c_next_level (f::r,i) => i'' (* } *)
rule c_next_level(r,i) => i'
-----
c_next_level (_::r,i) => i'
end
relation c_this_level : (char list, int) => int =
rule list_string [f] => "#"
----
c_this_level(f::_,_) => 0
rule list_string [f] => "}" &
int_sub(i,2) => i'
----
c_this_level(f::_,i) => i'
axiom c_this_level(_,i) => i
end
relation c_print_indent : int => () =
axiom c_print_indent 0
rule Print.print_buf " " &
int_sub(i,1) => i' &
c_print_indent i'
----------------
c_print_indent i
end
(* ------------------------------------------------------------------------- *)
(*
generate_functions
generate_functions_elist
generate_functions_elist2
generate_params_type
generate_function
generate_result_struct
generate_return_defs
generate_return_decls
generate_return_decl
is_array
is_first_in_array
subs_is_one
dae_exp_type
dae_type_str
dae_short_type_str
exp_short_type_str
exp_type_str
generate_type
generate_return_type
flatten_array_type
generate_array_type
generate_array_return_type
print_int
print_star
generate_tuple_type
generate_simple_type
array_type_string
generate_function_name
generate_function_arg
generate_function_body_tuple
generate_alloc_outvars
generate_alloc_outvar
prefix_cr
generate_algorithms
generate_algorithms2
generate_algorithm
generate_algorithm_statements
generate_algorithm_statement
generate_range_expressions
generate_else
generate_vars
generate_var
is_var_q
generate_var_q
generate_var_q2
generate_result_vars
generate_result_var
generate_equations
generate_exp
get_array_dim
generate_expressions
generate_expression
generate_binary
generate_temp_decl
generate_scalar_lhs_cref
generate_rhs_cref
subs_to_scalar
generate_scalar_rhs_cref
generate_array_rhs_cref
generate_index_spec
generate_indices_array
generate_indices
generate_index_array
generate_index
indent_strings
ident_cstr
comp_ref_cstr
generate_lbinary
generate_lunary
generate_relation
generate_matrix
generate_read_call_write
invar_names
generate_read
generate_write
is_rcw_output
is_rcw_input
*)
(* ------------------------------------------------------------------------- *)
relation generate_functions : DAE.DAElist => () =
rule Debug.fprintln ("cgtr", "generate_functions") &
generate_functions_elist elist => cfns &
Print.print_buf "#include \"modelica.h\"\n" &
c_print_functions cfns &
Print.print_buf "\n"
------------------------------
generate_functions DAE.DAE(elist)
rule Print.print_buf "# generate_functions failed\n"
--------------------------------------
generate_functions _
end
relation generate_functions_elist : DAE.Element list => CFunction list =
rule Debug.fprintln ("cgtr", "generate_functions_elist") &
DAE.get_matching(els,DAE.is_function) => fns &
generate_functions_elist2 fns => cfns
----------------------------
generate_functions_elist els => cfns
end
relation generate_functions_elist2 : DAE.Element list => CFunction list =
rule Debug.fprintln ("cgtr", "generate_functions_elist2")
----------------------------------------------------
generate_functions_elist2 [] => []
rule Debug.fprintln ("cgtr", "generate_functions_elist2") &
generate_function f => cfns1 &
generate_functions_elist2 rest => cfns2 &
list_append(cfns1,cfns2) => cfns
----------------------------
generate_functions_elist2 f :: rest => cfns
end
relation generate_params_type : Ident => string =
rule string_append (n, "_params") => s
---------------------------------
generate_params_type n => s
end
relation generate_function : DAE.Element => CFunction list =
rule generate_function_name fpath => fn_name_str &
Debug.fprintl ("cg", ["generating function ", fn_name_str, "\n"]) &
DAE.get_output_vars dae => outvars &
DAE.get_input_vars dae => invars &
generate_result_struct (outvars,fpath) => struct_strs &
generate_return_type fpath => retstr &
Util.list_map(args, generate_function_arg) => arg_strs &
c_make_function(retstr, fn_name_str, struct_strs,arg_strs)=> head_cfn &
generate_function_body_tuple(fpath, dae, restype) => body_cfn &
c_merge_fn(head_cfn,body_cfn) => cfn &
generate_read_call_write(fn_name_str,outvars,retstr,invars) => rcw_fn
---------------------------
generate_function DAE.FUNCTION(fpath,
DAE.DAE(dae),
Types.T_FUNCTION(args,restype))
=> [cfn,rcw_fn]
rule generate_functions_elist daelist => cfns
----------------------
generate_function DAE.COMP(n, DAE.DAE(daelist)) => cfns
rule Print.print_buf "# generate_function failed\n"
------------------------------------
generate_function _ => fail
end
relation generate_result_struct : (DAE.Element list, Absyn.Path)
=> string list =
rule generate_return_type fpath => ptname &
generate_return_decls outvars => (var_strs,var_names) &
generate_return_defs (ptname,var_names,1) => defs &
indent_strings var_strs => var_strs' &
Util.string_append_list(["typedef struct ",ptname,"_s"]) => first_row &
Util.string_append_list(["} ",ptname,";"]) => last_row &
Util.list_flatten([defs,[first_row,"{"],var_strs',[last_row]]) => strs
-----------------------------------------
generate_result_struct (outvars, fpath) => strs
(*
rule DAE.get_vars ( daelist, DAE.is_parameter ) => params &
list_length params => nbrparams &
int_le (nbrparams, 0) => true &
Print.print_buf "#-- no params in " &
Print.print_buf n &
Print.print_buf "\n"
-----------------------------------------
generate_params_struct (daelist, n)
*)
end
relation generate_return_defs : (string, string list, int) => string list =
axiom generate_return_defs (_,[],_) => []
rule int_string i => i_str &
Util.string_append_list(["#define ",tn,"_",i_str," ",f]) => f' &
int_add(i,1) => i' &
generate_return_defs (tn,r,i') => r'
----
generate_return_defs (tn,f::r,i) => f'::r'
end
relation generate_return_decls : DAE.Element list => (string list,
string list) =
axiom generate_return_decls [] => ([],[])
rule generate_return_decl first => ("",_) &
generate_return_decls rest => (rs,rd)
------------------
generate_return_decls first :: rest => (rs,rd)
rule generate_return_decl first => (fs,fd) &
generate_return_decls rest => (rs,rd)
------------------
generate_return_decls first :: rest => (fs::rs,fd::rd)
end
relation generate_return_decl: DAE.Element => (string, string) =
rule is_array id => is_a &
is_first_in_array id => true &
dae_type_str (typ,is_a) => typ_str &
comp_ref_cstr id => (id_str,_) &
Util.list_map(inst_dims,dim_string) => dim_strs &
Util.string_delimit_list(dim_strs,", ") => dims_str &
Util.string_append_list([typ_str," ",id_str,";",
" /* [",dims_str,"] */"])
=> decl_str
---------------------------------------------------
generate_return_decl (DAE.VAR(id, DAE.VARIABLE, DAE.OUTPUT, typ, NONE,inst_dims))
=> (decl_str,id_str)
rule is_array id => is_a &
is_first_in_array id => true &
dae_type_str (typ,is_a) => typ_str &
comp_ref_cstr id => (id_str,_) &
Util.string_append_list([typ_str," ",id_str,";"]) => decl_str &
Print.print_buf "# default/init values not implemented yet: " &
Exp.print_exp_str e => str & Print.print_buf str &
Print.print_buf "\n"
-----------
generate_return_decl (DAE.VAR(id,
DAE.VARIABLE,
DAE.OUTPUT,
typ,
SOME(e),
_))
=> (decl_str,id_str)
axiom generate_return_decl (_) => ("","")
end
relation is_array : Exp.ComponentRef => bool =
axiom is_array Exp.CREF_IDENT(_,[]) => false
axiom is_array Exp.CREF_IDENT(_,_::_) => true
axiom is_array Exp.CREF_QUAL(_,_::_,_) => true
rule is_array cref => b
------------------
is_array Exp.CREF_QUAL(_,[],cref) => b
end
relation is_first_in_array : Exp.ComponentRef => bool =
axiom is_first_in_array Exp.CREF_IDENT(_,[]) => true
rule subs_is_one subs => b
---------------------
is_first_in_array Exp.CREF_IDENT(_,subs) => b
rule is_first_in_array cref => b
---------------------------
is_first_in_array Exp.CREF_QUAL(_,[],cref) => b
rule subs_is_one subs => b1 &
is_first_in_array cref => b2 &
bool_and(b1,b2) => b
------------------------------
is_first_in_array Exp.CREF_QUAL(_,subs,cref) => b
end
relation subs_is_one : Exp.Subscript list => bool =
axiom subs_is_one [] => true
rule subs_is_one r => b
------------------
subs_is_one Exp.INDEX(Exp.ICONST(1))::r => b
axiom subs_is_one _::_ => false
end
relation dae_exp_type : DAE.Type => Exp.Type =
axiom dae_exp_type DAE.INT => Exp.INT
axiom dae_exp_type DAE.REAL => Exp.REAL
axiom dae_exp_type DAE.STRING => Exp.STRING
axiom dae_exp_type DAE.BOOL => Exp.BOOL
end
relation dae_type_str : (DAE.Type, bool) => string =
rule dae_exp_type t => t' &
exp_type_str (t',a) => str
--------------------------
dae_type_str (t,a) => str
end
relation dae_short_type_str : DAE.Type => string =
rule dae_exp_type t => t' &
exp_short_type_str t' => str
--------------------------
dae_short_type_str t => str
end
relation exp_short_type_str : Exp.Type => string =
axiom exp_short_type_str Exp.INT => "integer"
axiom exp_short_type_str Exp.REAL => "real"
axiom exp_short_type_str Exp.STRING => "string"
axiom exp_short_type_str Exp.BOOL => "boolean"
axiom exp_short_type_str Exp.OTHER => "other"
end
relation exp_type_str : (Exp.Type, bool) => string =
rule exp_short_type_str t => tstr &
string_append("modelica_",tstr) => str
-----------
exp_type_str (t, false) => str
rule exp_short_type_str t => tstr &
string_append(tstr,"_array") => str
-----------
exp_type_str (t, true) => str
end
relation generate_type : Types.Type => string =
rule Debug.fprintln ("cgtr", "generate_type") &
generate_tuple_type tys => ty_str
---------------------------
generate_type Types.T_TUPLE(tys) => ty_str
rule Debug.fprintln ("cgtr", "generate_type") &
flatten_array_type tys => (arrayty, dims) &
generate_array_type (arrayty, dims) => ty_str
-----------------------------------
generate_type (tys as Types.T_ARRAY(_,_)) => ty_str
axiom generate_type Types.T_INTEGER => "modelica_integer"
axiom generate_type Types.T_REAL => "modelica_real"
axiom generate_type Types.T_STRING => "modelica_string"
axiom generate_type Types.T_BOOL => "modelica_boolean"
rule Print.print_buf "#-- generate_type failed: " &
Types.print_type ty & Print.print_buf "\n"
--------------------------------
generate_type ty => fail
end
relation generate_return_type : Absyn.Path => string =
rule generate_function_name fpath => fstr &
string_append (fstr, "_rettype" ) => res
--------------------------
generate_return_type fpath => res
end
relation flatten_array_type : Types.Type => (Types.Type, int list) =
rule Debug.fprintln ("cgtr", "flatten_array_type1") &
flatten_array_type ty => (ty', dimlist')
--------------------------------------
flatten_array_type Types.T_ARRAY(Types.DIM(NONE), ty)
=> (ty', dimlist')
rule Debug.fprintln ("cgtr", "flatten_array_type2") &
flatten_array_type ty => (ty', dimlist) &
list_append (dimlist,[dim]) => dimlist'
--------------------------------------
flatten_array_type Types.T_ARRAY(Types.DIM(SOME(dim)), ty)
=> (ty', dimlist')
axiom flatten_array_type ty => (ty, [])
end
relation generate_array_type : (Types.Type, int list) => string =
rule array_type_string ty => str
--------------------------
generate_array_type (ty, dims) => str
end
relation generate_array_return_type : (Types.Type, int list) => string =
rule array_type_string ty => ty_str
-------------------------------
generate_array_return_type (ty, dims) => ty_str
end
relation print_int : int => () =
rule int_string i => str &
Print.print_buf str
---------
print_int i
end
relation print_star : int => () =
rule Print.print_buf "*"
---------
print_star i
end
relation generate_tuple_type : Types.Type list => string =
rule Debug.fprintln ("cgtr", "generate_tuple_type_1") &
generate_simple_type ty => str
--------------------------------
generate_tuple_type [ty] => str
rule Debug.fprintln ("cgtr", "generate_tuple_type_2") &
generate_simple_type ty => str &
generate_tuple_type tys => str' &
string_append (str, str') => str'' &
string_append ("struct ", str'') => str'''
----------------------------------
generate_tuple_type (ty::tys) => str'''
end
relation generate_simple_type : Types.Type => string =
axiom generate_simple_type Types.T_INTEGER => "modelica_integer"
axiom generate_simple_type Types.T_REAL => "modelica_real"
axiom generate_simple_type Types.T_STRING => "modelica_string"
axiom generate_simple_type Types.T_BOOL => "modelica_boolean"
rule string_append ("const ", n) => n' &
string_append (n', "&") => n''
------------------------------
generate_simple_type Types.T_COMPLEX (ClassInf.RECORD(n),_) => n''
rule Types.array_element_type t => t' &
array_type_string t' => t_str
-----------------------
generate_simple_type (t as Types.T_ARRAY(_,_)) => t_str
rule Print.print_buf "#--generate_simple_type failed " &
Types.print_type ty &
Print.print_buf "\n"
--------------------------------------
generate_simple_type ty => fail
end
relation array_type_string : Types.Type => string =
axiom array_type_string Types.T_INTEGER => "integer_array"
axiom array_type_string Types.T_REAL => "real_array"
axiom array_type_string Types.T_STRING => "string_array"
axiom array_type_string Types.T_BOOL => "boolean_array"
end
relation generate_function_name : Absyn.Path => string =
rule ModUtil.path_string fpath => fstr
----------
generate_function_name fpath => fstr
end
relation generate_function_arg : Types.FuncArg => string =
rule generate_tuple_type [ty] => str &
string_append (str, " ") => str' &
string_append (str', name) => str''
-----------------------------------
generate_function_arg ((name, ty)) => str''
end
relation generate_function_body_tuple : (Absyn.Path,
DAE.Element list,
Types.Type)
=> CFunction =
rule Debug.fprintln ("cgtr", "generate_function_body_tuple") &
let tnr = 1 &
generate_return_type fpath => ret_type_str &
generate_temp_decl(ret_type_str,tnr) => (ret_decl, ret_var, tnr_ret') &
Util.string_append_list(["return ",ret_var,";"]) => ret_stmt &
DAE.get_output_vars dae => outvars &
generate_alloc_outvars(outvars,ret_decl,ret_var,tnr_ret')
=> (out_fn,tnr_ret) &
generate_temp_decl("state",tnr_ret)
=> (mem_decl, mem_var, tnr_mem) &
Util.string_append_list([mem_var," = get_memory_state();"])
=> mem_stmt1 &
Util.string_append_list(["restore_memory_state(",mem_var,");"])
=> mem_stmt2 &
c_add_variables (out_fn, [mem_decl]) => mem_fn' &
c_add_inits (mem_fn',[mem_stmt1]) => mem_fn &
generate_vars (dae, is_var_q, tnr_mem)=> (var_fn,tnr_var) &
generate_algorithms (dae, tnr_var) => (alg_fn,tnr_alg) &
generate_result_vars (dae, ret_var, tnr_alg) => (res_var_fn,tnr_res) &
c_merge_fn(mem_fn, var_fn) => cfn' &
c_merge_fn(cfn' , alg_fn) => cfn'' &
c_merge_fn(cfn'' , res_var_fn) => cfn''' &
c_add_cleanups(cfn''',[mem_stmt2,ret_stmt]) => cfn
--------------
generate_function_body_tuple (fpath, dae, restype) => cfn
end
relation generate_alloc_outvars : (DAE.Element list, string, string,int)
=> (CFunction,int) =
rule c_add_variables(c_empty_function,[rd]) => cfn
---------
generate_alloc_outvars([],rd,rv,tnr) => (cfn,tnr)
rule generate_alloc_outvar(var,rv,tnr) => (cfn1,tnr1) &
generate_alloc_outvars(r,rd,rv,tnr1) => (cfn2,tnr2) &
c_merge_fn(cfn1,cfn2) => cfn
--------------
generate_alloc_outvars ((var as DAE.VAR(cr,vk,vd,t,e,id))::r,
rd,rv,tnr)
=> (cfn,tnr2)
rule generate_alloc_outvars(r,rd,rv,tnr) => (cfn2,tnr2)
--------------
generate_alloc_outvars (_::r,rd,rv,tnr) => (cfn2,tnr2)
end
relation generate_alloc_outvar : (DAE.Element,string,int) => (CFunction,int) =
rule is_array id => is_a &
is_first_in_array id => true &
dae_type_str (typ,is_a) => typ_str &
comp_ref_cstr id => (cref_str,_) &
generate_size_subscripts(inst_dims,tnr) => (cfn1,dim_strs,tnr1) &
c_move_statements_to_inits cfn1 => cfn1' &
list_length dim_strs => ndims &
int_string ndims => ndims_str &
Util.string_delimit_list(dim_strs,", ") => dims_str &
Util.string_append_list(["alloc_",typ_str,
"(&",prefix,".",cref_str,", ",
ndims_str,", ",dims_str,");"])
=> alloc_str &
c_add_inits(cfn1',[alloc_str]) => cfn' &
Util.if (is_a,cfn',cfn1') => cfn
-----------
generate_alloc_outvar(DAE.VAR(id, vk, vd, typ, e,inst_dims),
prefix,
tnr)
=> (cfn,tnr1)
rule not DAE.is_var e
-------------
generate_alloc_outvar (e,_,tnr) => (c_empty_function,tnr)
end
relation generate_size_subscripts : (Exp.Subscript list,int)
=> (CFunction,string list,int) =
axiom generate_size_subscripts ([],tnr) => (c_empty_function,[],tnr)
rule generate_expression (e,tnr) => (cfn1,var1,tnr1) &
generate_size_subscripts (r,tnr1) => (cfn2,vars2,tnr2) &
c_merge_fn(cfn1,cfn2) => cfn
-------
generate_size_subscripts (Exp.INDEX(e)::r,tnr)
=> (cfn,var1::vars2,tnr2)
rule Print.print_buf "# generate_size_subscripts failed\n" & Print.print_buf " - [" &
Dump.print_list(subs,Exp.print_subscript,", ") & Print.print_buf "]\n"
-----------
generate_size_subscripts(subs,_) => fail
end
relation prefix_cr : (string, Exp.ComponentRef) => Exp.ComponentRef =
axiom prefix_cr (prf,cref)
=> Exp.CREF_QUAL(prf,[],cref)
end
relation generate_algorithms: (DAE.Element list, int)
=> (CFunction, int) =
rule DAE.get_matching(els,DAE.is_algorithm) => algs &
generate_algorithms2(algs,tnr) => (cfn,tnr')
------------------------
generate_algorithms (els, tnr) => (cfn,tnr')
end
relation generate_algorithms2: (DAE.Element list, int)
=> (CFunction, int) =
axiom generate_algorithms2 ([],tnr) => (c_empty_function,tnr)
rule generate_algorithm (first,tnr) => (cfn1,tnr1) &
generate_algorithms2 (rest,tnr1) => (cfn2,tnr2) &
c_merge_fn(cfn1,cfn2) => cfn
------------------------
generate_algorithms2 (first::rest, tnr) => (cfn,tnr2)
end
relation generate_algorithm: (DAE.Element, int)
=> (CFunction, int) =
rule generate_algorithm_statements (stmts,tnr) => (cfn,tnr')
----------------------------------------
generate_algorithm (DAE.ALGORITHM(Algorithm.ALGORITHM(stmts)),tnr)
=> (cfn,tnr')
rule Print.print_buf "# generate_algorithm failed\n"
------------------------------------
generate_algorithm (_,_) => fail
end
relation generate_algorithm_statements : (Algorithm.Statement list, int)
=> (CFunction, int) =
axiom generate_algorithm_statements ([],tnr) => (c_empty_function,tnr)
rule generate_algorithm_statement (f,tnr) => (cfn1,tnr1) &
generate_algorithm_statements(r,tnr1) =>(cfn2,tnr2) &
c_merge_fn(cfn1,cfn2) => cfn
-----------
generate_algorithm_statements (f::r, tnr) => (cfn,tnr2)
end
(*
relation : generate_algorithm_statement
returns:
CFunction | Code
string | expression result: variable name, or 'c' expression
int | next temporary number
*)
relation generate_algorithm_statement : (Algorithm.Statement, int)
=> (CFunction, int) =
rule Debug.fprintln("cgas","generate_algorithm_statement") &
generate_expression(exp,tnr) => (cfn1,var1,tnr1) &
generate_scalar_lhs_cref(typ,cref,tnr1)
=> (cfn2,var2,tnr2) &
Util.string_append_list([var2," = ",var1,";"]) => stmt &
c_merge_fn(cfn1,cfn2) => cfn' &
c_add_statements(cfn',[stmt]) => cfn
----------------
generate_algorithm_statement (Algorithm.ASSIGN(typ,cref,exp),tnr)
=> (cfn, tnr2)
rule comp_ref_cstr cref => (cref_str,[]) &
generate_expression(exp,tnr) => (cfn1,var1,tnr1) &
exp_type_str(typ,true) => type_str &
Util.string_append_list(["copy_",type_str,"_data(&",
var1,", &",cref_str,");"]) => stmt &
c_add_statements(cfn1,[stmt]) => cfn2
-------------------------
generate_algorithm_statement (Algorithm.ASSIGN_ARR(typ,cref,exp),tnr)
=> (cfn2,tnr1)
rule comp_ref_cstr cref => (cref_str,subs as _::_) &