-
Notifications
You must be signed in to change notification settings - Fork 298
/
NFStatement.mo
846 lines (726 loc) · 21.5 KB
/
NFStatement.mo
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
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-2014, Open Source Modelica Consortium (OSMC),
* c/o Linköpings universitet, Department of Computer and Information Science,
* SE-58183 Linköping, Sweden.
*
* All rights reserved.
*
* THIS PROGRAM IS PROVIDED UNDER THE TERMS OF GPL VERSION 3 LICENSE OR
* THIS OSMC PUBLIC LICENSE (OSMC-PL) VERSION 1.2.
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THE OSMC PUBLIC LICENSE OR THE GPL VERSION 3,
* ACCORDING TO RECIPIENTS CHOICE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from OSMC, either from the above address,
* from the URLs: http://www.ida.liu.se/projects/OpenModelica or
* http://www.openmodelica.org, and in the OpenModelica distribution.
* GNU version 3 is obtained from: http://www.gnu.org/copyleft/gpl.html.
*
* This program is distributed WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH
* IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS OF OSMC-PL.
*
* See the full OSMC Public License conditions for more details.
*
*/
encapsulated uniontype NFStatement
import Type = NFType;
import Expression = NFExpression;
import NFInstNode.InstNode;
import DAE;
protected
import Statement = NFStatement;
import ElementSource;
import Util;
import IOStream;
public
record ASSIGNMENT
Expression lhs "The asignee";
Expression rhs "The expression";
Type ty;
DAE.ElementSource source;
end ASSIGNMENT;
record FUNCTION_ARRAY_INIT "Used to mark in which order local array variables in functions should be initialized"
String name;
Type ty;
DAE.ElementSource source;
end FUNCTION_ARRAY_INIT;
record FOR
InstNode iterator;
Option<Expression> range;
list<Statement> body "The body of the for loop.";
DAE.ElementSource source;
end FOR;
record IF
list<tuple<Expression, list<Statement>>> branches
"List of branches, where each branch is a tuple of a condition and a body.";
DAE.ElementSource source;
end IF;
record WHEN
list<tuple<Expression, list<Statement>>> branches
"List of branches, where each branch is a tuple of a condition and a body.";
DAE.ElementSource source;
end WHEN;
record ASSERT
Expression condition "The assert condition.";
Expression message "The message to display if the assert fails.";
Expression level;
DAE.ElementSource source;
end ASSERT;
record TERMINATE
Expression message "The message to display if the terminate triggers.";
DAE.ElementSource source;
end TERMINATE;
record NORETCALL
Expression exp;
DAE.ElementSource source;
end NORETCALL;
record WHILE
Expression condition;
list<Statement> body;
DAE.ElementSource source;
end WHILE;
record RETURN
DAE.ElementSource source;
end RETURN;
record BREAK
DAE.ElementSource source;
end BREAK;
record FAILURE
list<Statement> body;
DAE.ElementSource source;
end FAILURE;
function makeAssignment
input Expression lhs;
input Expression rhs;
input Type ty;
input DAE.ElementSource src;
output Statement stmt;
algorithm
stmt := ASSIGNMENT(lhs, rhs, ty, src);
annotation(__OpenModelica_EarlyInline=true);
end makeAssignment;
function makeIf
input list<tuple<Expression, list<Statement>>> branches;
input DAE.ElementSource src;
output Statement stmt;
algorithm
stmt := IF(branches, src);
annotation(__OpenModelica_EarlyInline=true);
end makeIf;
function source
input Statement stmt;
output DAE.ElementSource source;
algorithm
source := match stmt
case ASSIGNMENT() then stmt.source;
case FUNCTION_ARRAY_INIT() then stmt.source;
case FOR() then stmt.source;
case IF() then stmt.source;
case WHEN() then stmt.source;
case ASSERT() then stmt.source;
case TERMINATE() then stmt.source;
case NORETCALL() then stmt.source;
case WHILE() then stmt.source;
case RETURN() then stmt.source;
case BREAK() then stmt.source;
case FAILURE() then stmt.source;
end match;
end source;
function info
input Statement stmt;
output SourceInfo info = ElementSource.getInfo(source(stmt));
end info;
partial function ApplyFn
input Statement stmt;
end ApplyFn;
function apply
input Statement stmt;
input ApplyFn func;
algorithm
() := match stmt
case FOR()
algorithm
for e in stmt.body loop
apply(e, func);
end for;
then
();
case IF()
algorithm
for b in stmt.branches loop
for e in Util.tuple22(b) loop
apply(e, func);
end for;
end for;
then
();
case WHEN()
algorithm
for b in stmt.branches loop
for e in Util.tuple22(b) loop
apply(e, func);
end for;
end for;
then
();
case WHILE()
algorithm
for e in stmt.body loop
apply(e, func);
end for;
then
();
case FAILURE()
algorithm
for e in stmt.body loop
apply(e, func);
end for;
then
();
else ();
end match;
func(stmt);
end apply;
function map
input output Statement stmt;
input MapFn func;
partial function MapFn
input output Statement stmt;
end MapFn;
algorithm
() := match stmt
case FOR()
algorithm
stmt.body := list(map(s, func) for s in stmt.body);
then
();
case IF()
algorithm
stmt.branches := list(
(Util.tuple21(b),
list(map(s, func) for s in Util.tuple22(b))) for b in stmt.branches);
then
();
case WHEN()
algorithm
stmt.branches := list(
(Util.tuple21(b),
list(map(s, func) for s in Util.tuple22(b))) for b in stmt.branches);
then
();
case WHILE()
algorithm
stmt.body := list(map(s, func) for s in stmt.body);
then
();
else ();
end match;
stmt := func(stmt);
end map;
function applyExpList
input list<Statement> stmt;
input FoldFunc func;
partial function FoldFunc
input Expression exp;
end FoldFunc;
algorithm
for s in stmt loop
applyExp(s, func);
end for;
end applyExpList;
function applyExp
input Statement stmt;
input ApplyFunc func;
partial function ApplyFunc
input Expression exp;
end ApplyFunc;
algorithm
() := match stmt
case Statement.ASSIGNMENT()
algorithm
func(stmt.lhs);
func(stmt.rhs);
then
();
case Statement.FOR()
algorithm
applyExpList(stmt.body, func);
if isSome(stmt.range) then
func(Util.getOption(stmt.range));
end if;
then
();
case Statement.IF()
algorithm
for b in stmt.branches loop
func(Util.tuple21(b));
applyExpList(Util.tuple22(b), func);
end for;
then
();
case Statement.WHEN()
algorithm
for b in stmt.branches loop
func(Util.tuple21(b));
applyExpList(Util.tuple22(b), func);
end for;
then
();
case Statement.ASSERT()
algorithm
func(stmt.condition);
func(stmt.message);
func(stmt.level);
then
();
case Statement.TERMINATE()
algorithm
func(stmt.message);
then
();
case Statement.NORETCALL()
algorithm
func(stmt.exp);
then
();
case Statement.WHILE()
algorithm
func(stmt.condition);
applyExpList(stmt.body, func);
then
();
else ();
end match;
end applyExp;
function mapExpList
input output list<Statement> stmtl;
input MapFunc func;
partial function MapFunc
input output Expression exp;
end MapFunc;
algorithm
stmtl := list(mapExp(s, func) for s in stmtl);
end mapExpList;
function mapExp
input output Statement stmt;
input MapFunc func;
partial function MapFunc
input output Expression exp;
end MapFunc;
algorithm
stmt := match stmt
local
Expression e1, e2, e3;
case ASSIGNMENT()
algorithm
e1 := func(stmt.lhs);
e2 := func(stmt.rhs);
then
if referenceEq(e1, stmt.lhs) and referenceEq(e2, stmt.rhs) then
stmt else ASSIGNMENT(e1, e2, stmt.ty, stmt.source);
case FOR()
algorithm
stmt.body := mapExpList(stmt.body, func);
stmt.range := Util.applyOption(stmt.range, func);
then
stmt;
case IF()
algorithm
stmt.branches := list(
(func(Util.tuple21(b)), mapExpList(Util.tuple22(b), func)) for b in stmt.branches);
then
stmt;
case WHEN()
algorithm
stmt.branches := list(
(func(Util.tuple21(b)), mapExpList(Util.tuple22(b), func)) for b in stmt.branches);
then
stmt;
case ASSERT()
algorithm
e1 := func(stmt.condition);
e2 := func(stmt.message);
e3 := func(stmt.level);
then
if referenceEq(e1, stmt.condition) and referenceEq(e2, stmt.message) and
referenceEq(e3, stmt.level) then stmt else ASSERT(e1, e2, e3, stmt.source);
case TERMINATE()
algorithm
e1 := func(stmt.message);
then
if referenceEq(e1, stmt.message) then stmt else TERMINATE(e1, stmt.source);
case NORETCALL()
algorithm
e1 := func(stmt.exp);
then
if referenceEq(e1, stmt.exp) then stmt else NORETCALL(e1, stmt.source);
case WHILE()
then WHILE(func(stmt.condition), mapExpList(stmt.body, func), stmt.source);
else stmt;
end match;
end mapExp;
function foldExpList<ArgT>
input list<Statement> stmt;
input FoldFunc func;
input output ArgT arg;
partial function FoldFunc
input Expression exp;
input output ArgT arg;
end FoldFunc;
algorithm
for s in stmt loop
arg := foldExp(s, func, arg);
end for;
end foldExpList;
function foldExp<ArgT>
input Statement stmt;
input FoldFunc func;
input output ArgT arg;
partial function FoldFunc
input Expression exp;
input output ArgT arg;
end FoldFunc;
algorithm
() := match stmt
case Statement.ASSIGNMENT()
algorithm
arg := func(stmt.lhs, arg);
arg := func(stmt.rhs, arg);
then
();
case Statement.FOR()
algorithm
arg := foldExpList(stmt.body, func, arg);
if isSome(stmt.range) then
arg := func(Util.getOption(stmt.range), arg);
end if;
then
();
case Statement.IF()
algorithm
for b in stmt.branches loop
arg := func(Util.tuple21(b), arg);
arg := foldExpList(Util.tuple22(b), func, arg);
end for;
then
();
case Statement.WHEN()
algorithm
for b in stmt.branches loop
arg := func(Util.tuple21(b), arg);
arg := foldExpList(Util.tuple22(b), func, arg);
end for;
then
();
case Statement.ASSERT()
algorithm
arg := func(stmt.condition, arg);
arg := func(stmt.message, arg);
arg := func(stmt.level, arg);
then
();
case Statement.TERMINATE()
algorithm
arg := func(stmt.message, arg);
then
();
case Statement.NORETCALL()
algorithm
arg := func(stmt.exp, arg);
then
();
case Statement.WHILE()
algorithm
arg := func(stmt.condition, arg);
arg := foldExpList(stmt.body, func, arg);
then
();
else ();
end match;
end foldExp;
function toString
input Statement stmt;
input String indent = "";
output String str;
protected
IOStream.IOStream s;
algorithm
s := IOStream.create(getInstanceName(), IOStream.IOStreamType.LIST());
s := toStream(stmt, indent, s);
str := IOStream.string(s);
IOStream.delete(s);
end toString;
function toStringList
input list<Statement> stmtl;
input String indent = "";
output String str;
protected
IOStream.IOStream s;
algorithm
s := IOStream.create(getInstanceName(), IOStream.IOStreamType.LIST());
s := toStreamList(stmtl, indent, s);
str := IOStream.string(s);
IOStream.delete(s);
end toStringList;
function toStream
input Statement stmt;
input String indent;
input output IOStream.IOStream s;
protected
String str;
algorithm
s := IOStream.append(s, indent);
s := match stmt
case ASSIGNMENT()
algorithm
s := IOStream.append(s, Expression.toString(stmt.lhs));
s := IOStream.append(s, " := ");
s := IOStream.append(s, Expression.toString(stmt.rhs));
then
s;
case FUNCTION_ARRAY_INIT()
algorithm
s := IOStream.append(s, "array init");
s := IOStream.append(s, stmt.name);
then
s;
case FOR()
algorithm
s := IOStream.append(s, "for ");
s := IOStream.append(s, InstNode.name(stmt.iterator));
if isSome(stmt.range) then
s := IOStream.append(s, " in ");
s := IOStream.append(s, Expression.toString(Util.getOption(stmt.range)));
end if;
s := IOStream.append(s, " loop\n");
s := toStreamList(stmt.body, indent + " ", s);
s := IOStream.append(s, indent);
s := IOStream.append(s, "end for");
then
s;
case IF()
algorithm
str := "if ";
for b in stmt.branches loop
s := IOStream.append(s, str);
s := IOStream.append(s, Expression.toString(Util.tuple21(b)));
s := IOStream.append(s, " then\n");
s := toStreamList(Util.tuple22(b), indent + " ", s);
s := IOStream.append(s, indent);
str := "elseif ";
end for;
s := IOStream.append(s, "end if");
then
s;
case WHEN()
algorithm
str := "when ";
for b in stmt.branches loop
s := IOStream.append(s, str);
s := IOStream.append(s, Expression.toString(Util.tuple21(b)));
s := IOStream.append(s, " then\n");
s := toStreamList(Util.tuple22(b), indent + " ", s);
s := IOStream.append(s, indent);
str := "elsewhen ";
end for;
s := IOStream.append(s, "end when");
then
s;
case ASSERT()
algorithm
s := IOStream.append(s, "assert(");
s := IOStream.append(s, Expression.toString(stmt.condition));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toString(stmt.message));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toString(stmt.level));
s := IOStream.append(s, ")");
then
s;
case TERMINATE()
algorithm
s := IOStream.append(s, "terminate(");
s := IOStream.append(s, Expression.toString(stmt.message));
s := IOStream.append(s, ")");
then
s;
case NORETCALL()
then IOStream.append(s, Expression.toString(stmt.exp));
case WHILE()
algorithm
s := IOStream.append(s, "while ");
s := IOStream.append(s, Expression.toString(stmt.condition));
s := IOStream.append(s, " then\n");
s := toStreamList(stmt.body, indent + " ", s);
s := IOStream.append(s, indent);
s := IOStream.append(s, "end while");
then
s;
case RETURN() then IOStream.append(s, "return");
case RETURN() then IOStream.append(s, "break");
else IOStream.append(s, "#UNKNOWN STATEMENT#");
end match;
end toStream;
function toStreamList
input list<Statement> stmtl;
input String indent;
input output IOStream.IOStream s;
protected
Boolean prev_multi_line = false, multi_line;
Boolean first = true;
algorithm
for stmt in stmtl loop
multi_line := isMultiLine(stmt);
// Improve human parsability by separating statements that spans multiple
// lines (like if-statements) with newlines.
if first then
first := false;
elseif prev_multi_line or multi_line then
s := IOStream.append(s, "\n");
end if;
prev_multi_line := multi_line;
s := toStream(stmt, indent, s);
s := IOStream.append(s, ";\n");
end for;
end toStreamList;
function toFlatStream
input Statement stmt;
input String indent;
input output IOStream.IOStream s;
protected
String str;
algorithm
s := IOStream.append(s, indent);
s := match stmt
case ASSIGNMENT()
algorithm
s := IOStream.append(s, Expression.toFlatString(stmt.lhs));
s := IOStream.append(s, " := ");
s := IOStream.append(s, Expression.toFlatString(stmt.rhs));
then
s;
case FUNCTION_ARRAY_INIT()
algorithm
s := IOStream.append(s, "array init");
s := IOStream.append(s, stmt.name);
then
s;
case FOR()
algorithm
s := IOStream.append(s, "for ");
s := IOStream.append(s, InstNode.name(stmt.iterator));
if isSome(stmt.range) then
s := IOStream.append(s, " in ");
s := IOStream.append(s, Expression.toFlatString(Util.getOption(stmt.range)));
end if;
s := IOStream.append(s, " loop\n");
s := toFlatStreamList(stmt.body, indent + " ", s);
s := IOStream.append(s, indent);
s := IOStream.append(s, "end for");
then
s;
case IF()
algorithm
str := "if ";
for b in stmt.branches loop
s := IOStream.append(s, str);
s := IOStream.append(s, Expression.toFlatString(Util.tuple21(b)));
s := IOStream.append(s, " then\n");
s := toFlatStreamList(Util.tuple22(b), indent + " ", s);
s := IOStream.append(s, indent);
str := "elseif ";
end for;
s := IOStream.append(s, "end if");
then
s;
case WHEN()
algorithm
str := "when ";
for b in stmt.branches loop
s := IOStream.append(s, str);
s := IOStream.append(s, Expression.toFlatString(Util.tuple21(b)));
s := IOStream.append(s, " then\n");
s := toFlatStreamList(Util.tuple22(b), indent + " ", s);
s := IOStream.append(s, indent);
str := "elsewhen ";
end for;
s := IOStream.append(s, "end when");
then
s;
case ASSERT()
algorithm
s := IOStream.append(s, "assert(");
s := IOStream.append(s, Expression.toFlatString(stmt.condition));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toFlatString(stmt.message));
s := IOStream.append(s, ", ");
s := IOStream.append(s, Expression.toFlatString(stmt.level));
s := IOStream.append(s, ")");
then
s;
case TERMINATE()
algorithm
s := IOStream.append(s, "terminate(");
s := IOStream.append(s, Expression.toFlatString(stmt.message));
s := IOStream.append(s, ")");
then
s;
case NORETCALL()
then IOStream.append(s, Expression.toFlatString(stmt.exp));
case WHILE()
algorithm
s := IOStream.append(s, "while ");
s := IOStream.append(s, Expression.toFlatString(stmt.condition));
s := IOStream.append(s, " loop\n");
s := toFlatStreamList(stmt.body, indent + " ", s);
s := IOStream.append(s, indent);
s := IOStream.append(s, "end while");
then
s;
case RETURN() then IOStream.append(s, "return");
case RETURN() then IOStream.append(s, "break");
else IOStream.append(s, "#UNKNOWN STATEMENT#");
end match;
end toFlatStream;
function toFlatStreamList
input list<Statement> stmtl;
input String indent;
input output IOStream.IOStream s;
protected
Boolean prev_multi_line = false, multi_line;
Boolean first = true;
algorithm
for stmt in stmtl loop
multi_line := isMultiLine(stmt);
// Improve human parsability by separating statements that spans multiple
// lines (like if-statements) with newlines.
if first then
first := false;
elseif prev_multi_line or multi_line then
s := IOStream.append(s, "\n");
end if;
prev_multi_line := multi_line;
s := toFlatStream(stmt, indent, s);
s := IOStream.append(s, ";\n");
end for;
end toFlatStreamList;
function isMultiLine
input Statement stmt;
output Boolean multiLine;
algorithm
multiLine := match stmt
case FOR() then true;
case IF() then true;
case WHEN() then true;
case WHILE() then true;
else false;
end match;
end isMultiLine;
annotation(__OpenModelica_Interface="frontend");
end NFStatement;