/
ExpressionSimplify.mo
5271 lines (4669 loc) · 166 KB
/
ExpressionSimplify.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
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
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-CurrentYear, Linköping University,
* 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
* AND THIS OSMC PUBLIC LICENSE (OSMC-PL).
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES RECIPIENT'S
* ACCEPTANCE OF THE OSMC PUBLIC LICENSE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from Linköping University, 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 package ExpressionSimplify
" file: ExpressionSimplify.mo
package: ExpressionSimplify
description: ExpressionSimplify
RCS: $Id$
This file contains the module ExpressionSimplify, which contains
functions to simplify a DAE.Expression."
// public imports
public import Absyn;
public import ClassInf;
public import DAE;
public import Error;
public import ExpressionSimplifyTypes;
protected type ComponentRef = DAE.ComponentRef;
protected type Ident = String;
protected type Operator = DAE.Operator;
protected type Type = DAE.Type;
protected type Subscript = DAE.Subscript;
// protected imports
protected import ComponentReference;
protected import Config;
protected import DAEUtil;
protected import Debug;
protected import Env;
protected import ErrorExt;
protected import Expression;
protected import ExpressionDump;
protected import Flags;
protected import List;
protected import Prefix;
protected import Static;
protected import Types;
protected import Util;
protected import Values;
protected import ValuesUtil;
protected constant ExpressionSimplifyTypes.Options optionSimplifyOnly = ExpressionSimplifyTypes.optionSimplifyOnly;
public function simplify "Simplifies expressions"
input DAE.Exp inExp;
output DAE.Exp outExp;
output Boolean hasChanged;
algorithm
(outExp,hasChanged) := simplifyWithOptions(inExp,optionSimplifyOnly);
end simplify;
public function condsimplify "Simplifies expressions on condition"
input Boolean cond;
input DAE.Exp inExp;
output DAE.Exp outExp;
output Boolean hasChanged;
algorithm
(outExp,hasChanged) := match(cond,inExp)
local DAE.Exp e;
case(true,_)
equation
(outExp,hasChanged) = simplifyWithOptions(inExp,optionSimplifyOnly);
then
(outExp,hasChanged);
case(false,e)
then (e,false);
end match;
end condsimplify;
protected function simplifyWithOptions "Simplifies expressions"
input DAE.Exp inExp;
input ExpressionSimplifyTypes.Options options;
output DAE.Exp outExp;
output Boolean hasChanged;
algorithm
(outExp,hasChanged) := matchcontinue (inExp,options)
local
DAE.Exp e, eNew;
Boolean b;
case (e,(_,ExpressionSimplifyTypes.DO_EVAL()))
equation
(eNew,_) = simplify1WithOptions(e,options); // Basic local simplifications
Error.assertionOrAddSourceMessage(Expression.isConstValue(eNew), Error.INTERNAL_ERROR, {"eval exp failed"}, Absyn.dummyInfo);
b = not Expression.expEqual(e,eNew);
then (eNew,b);
case (e,_)
equation
false = Config.getNoSimplify();
//print("SIMPLIFY BEFORE->" +& ExpressionDump.printExpStr(e) +& "\n");
(eNew,_) = simplify1WithOptions(e,options); // Basic local simplifications
//print("SIMPLIFY INTERMEDIATE->" +& ExpressionDump.printExpStr(eNew) +& "\n");
eNew = simplify2(eNew); // Advanced (global) simplifications
(eNew,_) = simplify1WithOptions(eNew,options); // Basic local simplifications
b = not Expression.expEqual(e,eNew);
//print("SIMPLIFY FINAL->" +& ExpressionDump.printExpStr(eNew) +& "\n");
then (eNew,b);
case (e,_)
equation
(eNew,b) = simplify1WithOptions(e,options);
then (eNew,b);
end matchcontinue;
end simplifyWithOptions;
public function simplifyTraverseHelper
input tuple<DAE.Exp,A> tpl;
output tuple<DAE.Exp,A> otpl;
replaceable type A subtypeof Any;
protected
A a;
DAE.Exp exp;
algorithm
(exp,a) := tpl;
(exp,_) := simplify(exp);
otpl := (exp,a);
end simplifyTraverseHelper;
public function simplify1time "simplify1 with timing"
input DAE.Exp e;
output DAE.Exp outE;
protected
Real t1,t2;
algorithm
t1 := clock();
(outE,_) := simplify1(e);
t2 := clock();
print(Util.if_(t2 -. t1 >. 0.01,"simplify1 took "+&realString(t2 -. t1)+&" seconds for exp: "+&ExpressionDump.printExpStr(e)+& " \nsimplified to :"+&ExpressionDump.printExpStr(outE)+&"\n",""));
end simplify1time;
public function simplifyWork
"This function does some very basic simplification
on expressions, like 0*a = 0, [1][1] => 1, etc.
NOTE: simplifyWork does not modify expressions unless they change.
If the expression traversal also does not modify expressions that do not change, referenceEq can be used to determine if any subexpression changed.
"
input tuple<DAE.Exp,ExpressionSimplifyTypes.Options> inTpl;
output tuple<DAE.Exp,ExpressionSimplifyTypes.Options> tpl;
protected
DAE.Exp inExp,outExp;
ExpressionSimplifyTypes.Options inOptions,outOptions;
algorithm
(inExp,inOptions) := inTpl;
(outExp,outOptions) := simplifyWork2(inExp,inOptions);
tpl := (outExp,outOptions);
end simplifyWork;
protected function simplifyWork2
"This function does some very basic simplification
on expressions, like 0*a = 0, [1][1] => 1, etc.
This function can be optimised to a switch-statement due to all uniontypes being different.
"
input DAE.Exp inExp;
input ExpressionSimplifyTypes.Options options;
output DAE.Exp outExp;
output ExpressionSimplifyTypes.Options outOptions;
algorithm
(outExp,outOptions) := match /* switch: keep it as such */ (inExp,options)
local
Integer n,i;
DAE.Exp e,exp,e1,e_1,e2,e3,exp1;
Type t,tp;
Boolean b,b2;
String idn,str;
list<DAE.Exp> expl,matrix,subs;
list<Subscript> s;
ComponentRef c_1;
Operator op;
Integer index_;
Option<tuple<DAE.Exp,Integer,Integer>> isExpisASUB;
DAE.ReductionInfo reductionInfo;
DAE.ReductionIterators riters;
Option<DAE.Exp> oe;
case (DAE.SIZE(exp=e1,sz=oe),_)
then (simplifySize(inExp,e1,oe),options);
/* simplify different casts. Optimized to only run simplify1 once on subexpression e*/
case (DAE.CAST(ty = tp,exp=e),_)
equation
e = simplifyCast(inExp,e,tp);
then (e,options);
case (DAE.ASUB(exp = e, sub = subs),_)
equation
e = simplifyAsubExp(inExp,e,subs);
then (e,options);
case (DAE.TSUB(exp = _), _) then (simplifyTSub(inExp),options);
// unary operations
case (DAE.UNARY(operator = op,exp = e1), _)
equation
e = simplifyUnary(inExp, op, e1);
then (e,options);
case (DAE.BINARY(exp1 = e1,operator = op, exp2 = e2), _)
equation
e = simplifyBinary(inExp, op, e1, e2);
then (e,options);
// relations
case (DAE.RELATION(exp1 = e1,operator = op,exp2 = e2, index=index_, optionExpisASUB= isExpisASUB),_)
equation
e = simplifyRelation(inExp, op, e1, e2);
then (e,options);
// logical unary expressions
case (DAE.LUNARY(operator = op,exp = e1),_)
equation
e = simplifyUnary(inExp, op, e1);
then (e,options);
// logical binary expressions
case (DAE.LBINARY(exp1 = e1,operator = op,exp2 = e2),_)
equation
e = simplifyLBinary(inExp, op, e1, e2);
then (e,options);
// if true and false branches are equal
case (DAE.IFEXP(expCond = e1,expThen = e2,expElse = e3),_)
equation
e = simplifyIfExp(inExp,e1,e2,e3);
then (e,options);
// component references
case (DAE.CREF(componentRef = c_1,ty=t),_)
equation
e = simplifyCref(inExp,c_1,t);
then (e,options);
case (DAE.REDUCTION(reductionInfo,e1,riters),_)
equation
(riters,b2) = simplifyReductionIterators(riters, {}, false);
exp1 = Util.if_(b2,DAE.REDUCTION(reductionInfo,e1,riters),inExp);
then (simplifyReduction(exp1),options);
case (DAE.CALL(path=_),_) then (simplifyCall(inExp),options);
case (DAE.MATCHEXPRESSION(cases=_),_) then (simplifyMatch(inExp),options);
case (DAE.UNBOX(exp=_),_) then (simplifyUnbox(inExp),options);
case (DAE.BOX(exp=_),_) then (simplifyUnbox(inExp),options);
case (DAE.CONS(car=_),_) then (simplifyCons(inExp),options);
// Look for things we really *should* have simplified, but only if we did not modify anything!
/* case ((e,(false,_)))
equation
true = Flags.isSet(Flags.CHECK_SIMPLIFY);
true = Expression.isConst(e);
false = Expression.isConstValue(e);
str = ExpressionDump.printExpStr(e);
Error.addSourceMessage(Error.SIMPLIFY_CONSTANT_ERROR, {str}, Absyn.dummyInfo);
then fail(); */
// anything else
else (inExp,options);
end match;
end simplifyWork2;
protected function simplifyAsubExp
input DAE.Exp origExp;
input DAE.Exp inExp;
input list<DAE.Exp> inSubs;
output DAE.Exp outExp;
algorithm
outExp := matchcontinue (origExp,inExp,inSubs)
local
DAE.Type tp;
DAE.Exp e;
// ASUB(CAST(e)) -> CAST(liftArray(t), ASUB(e))
case (_, DAE.CAST(tp,e), _)
equation
tp = Expression.unliftArray(tp);
e = DAE.CAST(tp, DAE.ASUB(e, inSubs));
then e;
// Simplify asubs where some of the subscripts are slices.
case (_, _, _)
then simplifyAsubSlicing(inExp, inSubs);
// other subscripting/asub simplifications where e is not simplified first.
case (_,_,_)
equation
_ = List.map(inSubs,Expression.expInt);
then List.foldr(inSubs,simplifyAsub,inExp);
else origExp;
end matchcontinue;
end simplifyAsubExp;
protected function simplifyCall
input DAE.Exp inExp;
output DAE.Exp outExp;
algorithm
outExp := matchcontinue inExp
local
DAE.Exp e,e1,e2,exp;
list<DAE.Exp> matrix,expl;
DAE.CallAttributes attr;
DAE.Type tp;
Boolean b2;
String idn;
Integer n;
// homotopy(e, e) => e
case DAE.CALL(path=Absyn.IDENT("homotopy"),expLst={e1,e2})
equation
true = Expression.expEqual(e1,e2);
then
e1;
// noEvent propagated to relations and event triggering functions
case DAE.CALL(path=Absyn.IDENT("noEvent"),expLst={e})
equation
b2 = Expression.isRelation(e) or Expression.isEventTriggeringFunctionExp(e);
then Debug.bcallret1(not b2,simplifyNoEvent,e,inExp);
// der(-v) -> -der(v)
case DAE.CALL(path=Absyn.IDENT("der"), expLst={DAE.UNARY(DAE.UMINUS(tp),e1 as DAE.CREF(componentRef=_))},attr=attr)
then
DAE.UNARY(DAE.UMINUS(tp),DAE.CALL(Absyn.IDENT("der"),{e1},attr));
case DAE.CALL(path=Absyn.IDENT("der"), expLst={DAE.UNARY(DAE.UMINUS_ARR(tp),e1 as DAE.CREF(componentRef=_))},attr=attr)
then DAE.UNARY(DAE.UMINUS_ARR(tp),DAE.CALL(Absyn.IDENT("der"),{e1},attr));
case DAE.CALL(path=Absyn.IDENT("pre"), expLst={DAE.CREF(componentRef=_)})
then inExp;
case DAE.CALL(path=Absyn.IDENT("change"), expLst={DAE.CREF(componentRef=_)})
then inExp;
case DAE.CALL(path=Absyn.IDENT("edge"), expLst={DAE.CREF(componentRef=_)})
then inExp;
case DAE.CALL(path=Absyn.IDENT("pre"), expLst={e as DAE.ASUB(exp = exp)})
equation
b2 = Expression.isConst(exp);
then Util.if_(b2,e,inExp);
case DAE.CALL(path=Absyn.IDENT("change"), expLst={e as DAE.ASUB(exp = exp)})
equation
b2 = Expression.isConst(exp);
then Util.if_(b2,DAE.BCONST(false),inExp);
case DAE.CALL(path=Absyn.IDENT("edge"), expLst={e as DAE.ASUB(exp = exp)})
equation
b2 = Expression.isConst(exp);
then Util.if_(b2,DAE.BCONST(false),inExp);
// move pre inside
case DAE.CALL(path=Absyn.IDENT("pre"), expLst={e})
equation
((e,_)) = Expression.traverseExpTopDown(e,preCref,false);
then e;
case DAE.CALL(path=Absyn.IDENT("change"), expLst={e})
equation
((e,_)) = Expression.traverseExpTopDown(e,changeCref,false);
then e;
case DAE.CALL(path=Absyn.IDENT("edge"), expLst={e})
equation
((e,_)) = Expression.traverseExpTopDown(e,edgeCref,false);
then e;
// normal (pure) call
case DAE.CALL(path=Absyn.IDENT(idn),expLst=expl, attr=DAE.CALL_ATTR(isImpure=false))
equation
true = Expression.isConstWorkList(expl, true);
then simplifyBuiltinConstantCalls(idn,inExp);
// simplify some builtin calls, like cross, etc
case DAE.CALL(attr=DAE.CALL_ATTR(builtin = true))
then simplifyBuiltinCalls(inExp);
// simplify identity
case DAE.CALL(path = Absyn.IDENT(name = "identity"), expLst = {DAE.ICONST(n)})
equation
matrix = simplifyIdentity(1,n);
then DAE.ARRAY(DAE.T_ARRAY(DAE.T_INTEGER_DEFAULT,{DAE.DIM_INTEGER(n),DAE.DIM_INTEGER(n)},DAE.emptyTypeSource),false,matrix);
// arcxxx(xxx(e)) => e; xxx(arcxxx(e)) => e
case (DAE.CALL(path=Absyn.IDENT("sin"),expLst={DAE.CALL(path=Absyn.IDENT("asin"),expLst={e})}))
then e;
case (DAE.CALL(path=Absyn.IDENT("cos"),expLst={DAE.CALL(path=Absyn.IDENT("acos"),expLst={e})}))
then e;
case (DAE.CALL(path=Absyn.IDENT("tan"),expLst={DAE.CALL(path=Absyn.IDENT("atan"),expLst={e})}))
then e;
case (DAE.CALL(path=Absyn.IDENT("asin"),expLst={DAE.CALL(path=Absyn.IDENT("sin"),expLst={e})}))
then e;
case (DAE.CALL(path=Absyn.IDENT("atan"),expLst={DAE.CALL(path=Absyn.IDENT("tan"),expLst={e})}))
then e;
// MetaModelica builtin operators are calls
case _
equation
true = Config.acceptMetaModelicaGrammar();
then simplifyMetaModelicaCalls(inExp);
else inExp;
end matchcontinue;
end simplifyCall;
protected function preCref
input tuple<DAE.Exp,Boolean> iExp;
output tuple<DAE.Exp,Boolean,Boolean> oExp;
algorithm
oExp := match(iExp)
local
DAE.Exp e;
Boolean b;
DAE.Type ty;
case ((e as DAE.CREF(ty=ty),_)) then ((DAE.CALL(Absyn.IDENT("pre"),{e},DAE.CALL_ATTR(ty,false,true,false,DAE.NO_INLINE(),DAE.NO_TAIL())),false,true));
case ((e as DAE.CALL(path=Absyn.IDENT("pre")),b)) then ((e,false,b));
case ((e,b)) then ((e,not b,b));
end match;
end preCref;
protected function changeCref
input tuple<DAE.Exp,Boolean> iExp;
output tuple<DAE.Exp,Boolean,Boolean> oExp;
algorithm
oExp := match(iExp)
local
DAE.Exp e;
Boolean b;
DAE.Type ty;
case ((e as DAE.CREF(ty=ty),_)) then ((DAE.CALL(Absyn.IDENT("change"),{e},DAE.CALL_ATTR(ty,false,true,false,DAE.NO_INLINE(),DAE.NO_TAIL())),false,true));
case ((e as DAE.CALL(path=Absyn.IDENT("change")),b)) then ((e,false,b));
case ((e,b)) then ((e,not b,b));
end match;
end changeCref;
protected function edgeCref
input tuple<DAE.Exp,Boolean> iExp;
output tuple<DAE.Exp,Boolean,Boolean> oExp;
algorithm
oExp := match(iExp)
local
DAE.Exp e;
Boolean b;
DAE.Type ty;
case ((e as DAE.CREF(ty=ty),_)) then ((DAE.CALL(Absyn.IDENT("edge"),{e},DAE.CALL_ATTR(ty,false,true,false,DAE.NO_INLINE(),DAE.NO_TAIL())),false,true));
case ((e as DAE.CALL(path=Absyn.IDENT("edge")),b)) then ((e,false,b));
case ((e,b)) then ((e,not b,b));
end match;
end edgeCref;
public function simplify1
"This function does some very basic simplification
on expressions, like 0*a = 0, [1][1] => 1, etc."
input DAE.Exp inExp;
output DAE.Exp outExp;
output Boolean hasChanged;
algorithm
(outExp,hasChanged) := simplify1WithOptions(inExp,optionSimplifyOnly);
end simplify1;
public function simplify1WithOptions
"This function does some very basic simplification
on expressions, like 0*a = 0, [1][1] => 1, etc."
input DAE.Exp inExp;
input ExpressionSimplifyTypes.Options options;
output DAE.Exp outExp;
output Boolean hasChanged;
algorithm
(outExp,hasChanged) := simplify1FixP(inExp,options,100,true,false);
checkSimplify(Flags.isSet(Flags.CHECK_SIMPLIFY),inExp,outExp);
end simplify1WithOptions;
protected function checkSimplify
"Verifies that the complexity of the expression is lower or equal than before the simplification was performed"
input Boolean check;
input DAE.Exp before;
input DAE.Exp after;
algorithm
_ := match (check,before,after)
local
Integer c1,c2;
Boolean b;
String s1,s2,s3,s4;
case (false,_,_) then ();
case (true,_,_)
equation
c1 = Expression.complexity(before);
c2 = Expression.complexity(after);
b = c1 < c2;
s1 = intString(c2);
s2 = intString(c1);
s3 = Debug.bcallret1(b,ExpressionDump.printExpStr,before,"");
s4 = Debug.bcallret1(b,ExpressionDump.printExpStr,after,"");
Error.assertionOrAddSourceMessage(not b, Error.SIMPLIFICATION_COMPLEXITY, {s1,s2,s3,s4}, Absyn.dummyInfo);
then ();
end match;
end checkSimplify;
protected function simplify1FixP
"Does fixpoint simplify1 max n times"
input DAE.Exp inExp;
input ExpressionSimplifyTypes.Options inOptions;
input Integer n;
input Boolean cont;
input Boolean hasChanged;
output DAE.Exp outExp;
output Boolean outHasChanged;
algorithm
(outExp,outHasChanged) := match (inExp,inOptions,n,cont,hasChanged)
local
DAE.Exp exp,expAfterSimplify;
Boolean b;
String str1,str2;
ExpressionSimplifyTypes.Options options;
case (exp,_,_,false,_)
equation
// print("End fixp: " +& ExpressionDump.printExpStr(exp) +& "\n");
then (exp,hasChanged);
case (exp,options,0,_,_)
equation
str1 = ExpressionDump.printExpStr(exp);
((exp,_)) = Expression.traverseExp(exp,simplifyWork,options);
str2 = ExpressionDump.printExpStr(exp);
Error.addMessage(Error.SIMPLIFY_FIXPOINT_MAXIMUM, {str1,str2});
then (exp,hasChanged);
case (exp,options,_,true,_)
equation
// print("simplify1 start: " +& ExpressionDump.printExpStr(exp) +& "\n");
ErrorExt.setCheckpoint("ExpressionSimplify");
((expAfterSimplify,options)) = Expression.traverseExp(exp,simplifyWork,options);
b = not referenceEq(expAfterSimplify, exp);
Debug.bcall1(b,ErrorExt.rollBack,"ExpressionSimplify");
Debug.bcall1(not b,ErrorExt.delCheckpoint,"ExpressionSimplify");
// print("simplify1 iter: " +& ExpressionDump.printExpStr(expAfterSimplify) +& "\n");
(expAfterSimplify,b) = simplify1FixP(expAfterSimplify,options,n-1,b,b or hasChanged);
then (expAfterSimplify,b);
end match;
end simplify1FixP;
protected function simplifyReductionIterators
input list<DAE.ReductionIterator> inIters;
input list<DAE.ReductionIterator> inAcc;
input Boolean inChange;
output list<DAE.ReductionIterator> outIters;
output Boolean outChange;
algorithm
(outIters,outChange) := match (inIters,inAcc,inChange)
local
String id;
DAE.Exp exp;
DAE.Type ty;
DAE.ReductionIterator iter;
list<DAE.ReductionIterator> iters,acc;
Boolean change;
case ({},acc,change) then (listReverse(acc),change);
case (DAE.REDUCTIONITER(id,exp,SOME(DAE.BCONST(true)),ty)::iters,acc,_)
equation
(iters,change) = simplifyReductionIterators(iters,DAE.REDUCTIONITER(id,exp,NONE(),ty)::acc,true);
then (iters,change);
case (DAE.REDUCTIONITER(id,_,SOME(DAE.BCONST(false)),ty)::_,_,_)
then ({DAE.REDUCTIONITER(id,DAE.LIST({}),NONE(),ty)},true);
case (iter::iters,acc,change)
equation
(iters,change) = simplifyReductionIterators(iters,iter::acc,change);
then (iters,change);
end match;
end simplifyReductionIterators;
protected function simplifyIfExp
"Handles simplification of if-expressions"
input DAE.Exp origExp;
input DAE.Exp cond;
input DAE.Exp tb;
input DAE.Exp fb;
output DAE.Exp exp;
algorithm
exp := match (origExp,cond,tb,fb)
local
DAE.Exp e,e1,e2;
// Condition is constant
case (_,DAE.BCONST(true),_,_) then tb;
case (_,DAE.BCONST(false),_,_) then fb;
// The expression is the condition
case (_,exp,DAE.BCONST(true),DAE.BCONST(false)) then exp;
case (_,exp,DAE.BCONST(false),DAE.BCONST(true))
equation
exp = DAE.LUNARY(DAE.NOT(DAE.T_BOOL_DEFAULT), exp);
then exp;
case (_,e,DAE.BOX(e1),DAE.BOX(e2))
equation
e = DAE.IFEXP(e,e1,e2);
then DAE.BOX(e);
else // Are the branches equal? Then why bother with the condition
Util.if_(Expression.expEqual(tb,fb),tb,origExp);
end match;
end simplifyIfExp;
protected function simplifyMetaModelicaCalls "simplifies MetaModelica operators"
input DAE.Exp exp;
output DAE.Exp outExp;
algorithm
outExp := match exp
local
DAE.Exp e,e1,e2,e1_1,e2_1;
Boolean b,b1,b2;
Absyn.Path path;
list<DAE.Exp> el;
Integer i;
Real r;
String s;
Option<DAE.Exp> foldExp;
Option<Values.Value> v;
DAE.Type ty;
DAE.ReductionIterators riters;
case DAE.CALL(path=Absyn.IDENT("listAppend"),expLst={DAE.LIST(el),e2})
equation
e = List.fold(listReverse(el), Expression.makeCons, e2);
then e;
case DAE.CALL(path=Absyn.IDENT("listAppend"),expLst={e1,DAE.LIST(valList={})})
then e1;
case DAE.CALL(path=path as Absyn.IDENT("intString"),expLst={DAE.ICONST(i)})
equation
s = intString(i);
then DAE.SCONST(s);
case DAE.CALL(path=path as Absyn.IDENT("realString"),expLst={DAE.RCONST(r)})
equation
s = realString(r);
then DAE.SCONST(s);
case DAE.CALL(path=path as Absyn.IDENT("boolString"),expLst={DAE.BCONST(b)})
equation
s = boolString(b);
then DAE.SCONST(s);
case DAE.CALL(path=path as Absyn.IDENT("listReverse"),expLst={DAE.LIST(el)})
equation
el = listReverse(el);
e1_1 = DAE.LIST(el);
then e1_1;
case DAE.CALL(path=path as Absyn.IDENT("listReverse"),expLst={DAE.REDUCTION(DAE.REDUCTIONINFO(Absyn.IDENT("list"),ty,v,foldExp),e1,riters)})
equation
e1 = DAE.REDUCTION(DAE.REDUCTIONINFO(Absyn.IDENT("listReverse"),ty,v,foldExp),e1,riters);
then e1;
case DAE.CALL(path=path as Absyn.IDENT("listReverse"),expLst={DAE.REDUCTION(DAE.REDUCTIONINFO(Absyn.IDENT("listReverse"),ty,v,foldExp),e1,riters)})
equation
e1 = DAE.REDUCTION(DAE.REDUCTIONINFO(Absyn.IDENT("list"),ty,v,foldExp),e1,riters);
then e1;
case DAE.CALL(path=path as Absyn.IDENT("listLength"),expLst={DAE.LIST(el)})
equation
i = listLength(el);
then DAE.ICONST(i);
end match;
end simplifyMetaModelicaCalls;
protected function simplifyCons
input DAE.Exp inExp;
output DAE.Exp outExp;
algorithm
outExp := match inExp
local
DAE.Exp e;
list<DAE.Exp> es;
case DAE.CONS(e,DAE.LIST(es)) then DAE.LIST(e::es);
else inExp;
end match;
end simplifyCons;
protected function simplifyUnbox "simplifies both box and unbox expressions"
input DAE.Exp exp;
output DAE.Exp outExp;
algorithm
outExp := match exp
case DAE.UNBOX(exp=DAE.BOX(outExp)) then outExp;
case DAE.BOX(DAE.UNBOX(exp=outExp)) then outExp;
else exp;
end match;
end simplifyUnbox;
protected function simplifyMatch "simplifies MetaModelica match expressions"
input DAE.Exp exp;
output DAE.Exp outExp;
algorithm
outExp := matchcontinue exp
local
DAE.Exp e,e1,e2,e1_1,e2_1;
Boolean b,b1,b2;
Absyn.Path path;
list<DAE.Exp> el;
Integer i;
Real r;
String s;
Option<DAE.Exp> foldExp;
Option<Values.Value> v;
DAE.Type ty;
DAE.ReductionIterators riters;
case DAE.MATCHEXPRESSION(inputs={e}, et=ty, localDecls={}, cases={
DAE.CASE(patterns={DAE.PAT_CONSTANT(exp=DAE.BCONST(b1))},localDecls={},body={},result=SOME(e1)),
DAE.CASE(patterns={DAE.PAT_CONSTANT(exp=DAE.BCONST(b2))},localDecls={},body={},result=SOME(e2))
})
equation
false = boolEq(b1,b2);
false = Types.isTuple(ty);
e1_1 = Util.if_(b1,e1,e2);
e2_1 = Util.if_(b1,e2,e1);
e = DAE.IFEXP(e, e1_1, e2_1);
then e;
case DAE.MATCHEXPRESSION(matchType=DAE.MATCH(switch=_), et=ty, inputs={e}, localDecls={}, cases={
DAE.CASE(patterns={DAE.PAT_CONSTANT(exp=DAE.BCONST(b1))},localDecls={},body={},result=SOME(e1)),
DAE.CASE(patterns={DAE.PAT_WILD()},localDecls={},body={},result=SOME(e2))
})
equation
false = Types.isTuple(ty);
e1_1 = Util.if_(b1,e1,e2);
e2_1 = Util.if_(b1,e2,e1);
e = DAE.IFEXP(e, e1_1, e2_1);
then e;
else exp;
end matchcontinue;
end simplifyMatch;
protected function simplifyCast "help function to simplify1"
input DAE.Exp origExp;
input DAE.Exp exp;
input Type tp;
output DAE.Exp outExp;
algorithm
outExp := matchcontinue(origExp,exp,tp)
local
Real r;
Integer i,n;
Boolean b;
list<DAE.Exp> exps,exps_1;
Type t,tp_1,tp1,tp2,t1,t2;
DAE.Exp e1,e2,cond,e1_1,e2_1,e;
list<list<DAE.Exp>> mexps,mexps_1;
Option<DAE.Exp> eo;
DAE.Dimensions dims;
Absyn.Path p1,p2,p3;
list<String> fieldNames;
// Real -> Real
case(_,DAE.RCONST(r),DAE.T_REAL(varLst = _)) then DAE.RCONST(r);
// Int -> Real
case(_,DAE.ICONST(i),DAE.T_REAL(varLst = _))
equation
r = intReal(i);
then
DAE.RCONST(r);
// cast of unary
case(_,DAE.UNARY(DAE.UMINUS_ARR(_),e),_)
equation
e = addCast(e,tp);
then
DAE.UNARY(DAE.UMINUS_ARR(tp),e);
// cast of unary
case(_,DAE.UNARY(DAE.UMINUS(_),e),_)
equation
e = addCast(e,tp);
then
DAE.UNARY(DAE.UMINUS(tp),e);
// cast of array
case(_,DAE.ARRAY(t,b,exps),_)
equation
tp_1 = Expression.unliftArray(tp);
exps_1 = List.map1(exps, addCast, tp_1);
then
DAE.ARRAY(tp,b,exps_1);
// cast of array
case (_,DAE.RANGE(ty=DAE.T_INTEGER(source=_),start=e1,step=eo,stop=e2),tp1 as DAE.T_ARRAY(ty=tp2 as DAE.T_REAL(source=_)))
equation
e1 = addCast(e1,tp2);
e2 = addCast(e2,tp2);
eo = Util.applyOption1(eo, addCast, tp2);
then
DAE.RANGE(tp2,e1,eo,e2);
// simplify cast in an if expression
case (_,DAE.IFEXP(cond,e1,e2),_)
equation
e1_1 = DAE.CAST(tp,e1);
e2_1 = DAE.CAST(tp,e2);
then DAE.IFEXP(cond,e1_1,e2_1);
// simplify cast of matrix expressions
case (_,DAE.MATRIX(t,n,mexps),_)
equation
tp1 = Expression.unliftArray(tp);
tp2 = Expression.unliftArray(tp1);
mexps_1 = List.map1List(mexps, addCast, tp2);
then DAE.MATRIX(tp,n,mexps_1);
// simplify record constructor from one to another
case (_,DAE.CALL(p1,exps,attr=DAE.CALL_ATTR(ty=DAE.T_COMPLEX(complexClassType=ClassInf.RECORD(p2)))),DAE.T_COMPLEX(complexClassType=ClassInf.RECORD(p3)))
equation
true = Absyn.pathEqual(p1,p2) "It is a record constructor since it has the same path called as its output type";
then DAE.CALL(p3,exps,DAE.CALL_ATTR(tp,false,false,false,DAE.NO_INLINE(),DAE.NO_TAIL()));
case (_,DAE.RECORD(p1,exps,fieldNames,_),DAE.T_COMPLEX(complexClassType=ClassInf.RECORD(p3)))
then DAE.RECORD(p3,exps,fieldNames,tp);
// fill(e, ...) can be simplified
case(_,DAE.CALL(path=Absyn.IDENT("fill"),expLst=e::exps),_)
equation
tp_1 = List.fold(exps,Expression.unliftArrayIgnoreFirst,tp);
e = DAE.CAST(tp_1,e);
e = Expression.makeBuiltinCall("fill",e::exps,tp);
then e;
// cat(e, ...) can be simplified
case(_,DAE.CALL(path=Absyn.IDENT("cat"),expLst=(e as DAE.ICONST(n))::exps),DAE.T_ARRAY(dims=dims))
equation
DAE.DIM_UNKNOWN() = listGet(dims,n);
exps = List.map1(exps,addCast,tp);
then Expression.makeBuiltinCall("cat",e::exps,tp);
// expression already has a specified cast type.
case(_,e,_)
equation
t1 = Expression.arrayEltType(tp);
t2 = Expression.arrayEltType(Expression.typeof(e));
true = valueEq(t1, t2);
then e;
else origExp;
end matchcontinue;
end simplifyCast;
protected function addCast
"Adds a cast of a Type to an expression."
input DAE.Exp inExp;
input Type inType;
output DAE.Exp outExp;
annotation(__OpenModelica_EarlyInline = true);
algorithm
outExp:=DAE.CAST(inType,inExp);
end addCast;
protected function simplifyBuiltinCalls "simplifies some builtin calls (with no constant expressions)"
input DAE.Exp exp;
output DAE.Exp outExp;
algorithm
outExp := matchcontinue (exp)
local
list<list<DAE.Exp>> mexpl;
list<DAE.Exp> es,expl;
DAE.Exp e,len_exp,just_exp,e1,e2,e3,e4;
DAE.Type tp,tp1,tp2;
DAE.Operator op;
list<DAE.Exp> v1, v2;
Boolean scalar,sc;
list<Values.Value> valueLst;
Integer i,i1,i2,dim;
Real r1;
array<array<DAE.Exp>> marr;
String name;
// If the argument to min/max is an array, try to flatten it.
case (DAE.CALL(path=Absyn.IDENT(name),expLst={e as DAE.ARRAY(array=_)},
attr=DAE.CALL_ATTR(ty=tp)))
equation
true = stringEq(name, "max") or stringEq(name, "min");
expl = Expression.flattenArrayExpToList(e);
e1 = Expression.makeScalarArray(expl, tp);
false = Expression.expEqual(e, e1);
then
Expression.makeBuiltinCall(name, {e1}, tp);
// min/max function on arrays of only 1 element
case (DAE.CALL(path=Absyn.IDENT("min"),expLst={DAE.ARRAY(array={e})})) then e;
case (DAE.CALL(path=Absyn.IDENT("max"),expLst={DAE.ARRAY(array={e})})) then e;
// Try to unify the expressions :)
case (DAE.CALL(path=Absyn.IDENT("min"),expLst={DAE.ARRAY(array=es)},attr=DAE.CALL_ATTR(ty=tp)))
equation
i1 = listLength(es);
es = List.union(es,es);
i2 = listLength(es);
false = i1 == i2;
e = Expression.makeScalarArray(es,tp);
then Expression.makeBuiltinCall("min",{e},tp);
case (DAE.CALL(path=Absyn.IDENT("max"),expLst={DAE.ARRAY(array=es)},attr=DAE.CALL_ATTR(ty=tp)))
equation
i1 = listLength(es);
es = List.union(es,es);
i2 = listLength(es);
false = i1 == i2;
e = Expression.makeScalarArray(es,tp);
then Expression.makeBuiltinCall("max",{e},tp);
case (DAE.CALL(path=Absyn.IDENT("min"),attr=DAE.CALL_ATTR(ty=tp),expLst={DAE.ARRAY(array={e1,e2})}))
equation
e = Expression.makeBuiltinCall("min",{e1,e2},tp);
then e;
case (DAE.CALL(path=Absyn.IDENT("max"),attr=DAE.CALL_ATTR(ty=tp),expLst={DAE.ARRAY(array={e1,e2})}))
equation
e = Expression.makeBuiltinCall("max",{e1,e2},tp);
then e;
case (DAE.CALL(path=Absyn.IDENT("min"),attr=DAE.CALL_ATTR(ty=DAE.T_BOOL(varLst = _)),expLst={e1,e2}))
equation
e = DAE.LBINARY(e1,DAE.AND(DAE.T_BOOL_DEFAULT),e2);
then e;
case (DAE.CALL(path=Absyn.IDENT("max"),attr=DAE.CALL_ATTR(ty=DAE.T_BOOL(varLst = _)),expLst={e1,e2}))
equation
e = DAE.LBINARY(e1,DAE.OR(DAE.T_BOOL_DEFAULT),e2);
then e;
case (DAE.CALL(path=Absyn.IDENT("min"),attr=DAE.CALL_ATTR(ty=DAE.T_BOOL(varLst = _)),expLst={DAE.ARRAY(array=expl)}))
equation
e = Expression.makeLBinary(expl,DAE.AND(DAE.T_BOOL_DEFAULT));
then e;
case (DAE.CALL(path=Absyn.IDENT("max"),attr=DAE.CALL_ATTR(ty=DAE.T_BOOL(varLst = _)),expLst={DAE.ARRAY(array=expl)}))
equation
e = Expression.makeLBinary(expl,DAE.OR(DAE.T_BOOL_DEFAULT));
then e;
case DAE.CALL(path=Absyn.IDENT(name), expLst = {DAE.ARRAY(array = expl as _ :: _ :: _)},
attr = DAE.CALL_ATTR(ty = tp))
equation
true = Config.scalarizeMinMax();
true = stringEq(name, "max") or stringEq(name, "min");
e1 :: e2 :: expl = listReverse(expl);
e1 = Expression.makeBuiltinCall(name, {e2, e1}, tp);
e1 = List.fold2(expl, makeNestedReduction, name, tp, e1);
then
e1;
// cross
case (e as DAE.CALL(path = Absyn.IDENT("cross"), expLst = expl))
equation
{DAE.ARRAY(array = v1),DAE.ARRAY(array = v2)} = expl;
expl = Static.elabBuiltinCross2(v1, v2);
tp = Expression.typeof(e);
// Since there is a bug somewhere in simplify that gives wrong types for arrays we take the type from cross.
scalar = not Expression.isArrayType(Expression.unliftArray(tp));
then
DAE.ARRAY(tp, scalar,expl);
case (e as DAE.CALL(path = Absyn.IDENT("skew"), expLst = {DAE.ARRAY(array = v1)}))
equation
mexpl = Static.elabBuiltinSkew2(v1);
tp = Expression.typeof(e);
then DAE.MATRIX(tp, 3, mexpl);
// Simplify built-in function fill. MathCore depends on this being done here, do not remove!
case (DAE.CALL(path = Absyn.IDENT("fill"), expLst = e::expl))
equation
valueLst = List.map(expl, ValuesUtil.expValue);
(_,outExp,_) = Static.elabBuiltinFill2(Env.noCache(), Env.emptyEnv, e, DAE.T_UNKNOWN_DEFAULT, valueLst, DAE.C_CONST(), Prefix.NOPRE(), {}, Absyn.dummyInfo);
then
outExp;
case (DAE.CALL(path = Absyn.IDENT("String"), expLst = {e,len_exp,just_exp}))
then simplifyBuiltinStringFormat(e,len_exp,just_exp);
case (DAE.CALL(path = Absyn.IDENT("stringAppendList"), expLst = {DAE.LIST(expl)}))
then simplifyStringAppendList(expl,{},false);
// sqrt(e ^ r) => e ^ (0.5 * r)
case DAE.CALL(path=Absyn.IDENT("sqrt"),expLst={DAE.BINARY(e1,DAE.POW(ty = DAE.T_REAL(source = _)),e2)})
equation
e = DAE.BINARY(e1,DAE.POW(DAE.T_REAL_DEFAULT),DAE.BINARY(DAE.RCONST(0.5),DAE.MUL(DAE.T_REAL_DEFAULT),e2));
then Expression.makeBuiltinCall("abs",{e},DAE.T_REAL_DEFAULT);
// sqrt(sqrt(e)) => e ^ (0.25)