/
SimCodeUtil.mo
12158 lines (11133 loc) · 528 KB
/
SimCodeUtil.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-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 package SimCodeUtil
" file: SimCodeUtil.mo
package: SimCodeUtil
description: Code generation using Susan templates
The entry points to this module are the functions createSimCode and
createFunctions."
// public imports
import Absyn;
import BackendDAE;
import Ceval;
import DAE;
import FCore;
import FGraph;
import HashTable;
import HashTableCrILst;
import HashTableCrIListArray;
import HashTableExpToIndex;
import SCode;
import Tpl;
import Types;
import Values;
import SimCode;
import SimCodeVar;
import Vectorization;
// protected imports
protected
import Array;
import BackendDAEOptimize;
import BackendDAETransform;
import BackendDAEUtil;
import BackendDump;
import BackendEquation;
import BackendDAEEXT;
import BackendVariable;
import BackendVarTransform;
import BaseHashTable;
import BaseHashSet;
import Builtin;
import CheckModel;
import ClassInf;
import ComponentReference;
import Config;
import DAEDump;
import DAEUtil;
import Debug;
import Differentiate;
import DoubleEndedList;
import Error;
import EvaluateFunctions;
import Expression;
import ExpressionDump;
import ExpressionSimplify;
import ExpressionSolve;
import Flags;
import FMI;
import Graph;
import HashSet;
import HpcOmSimCode;
import Inline;
import List;
import Matching;
import MetaModelica.Dangerous;
import PriorityQueue;
import SimCodeDump;
import SimCodeFunctionUtil;
import SimCodeFunctionUtil.{execStat,varName};
import Sorting;
import SymbolicJacobian;
import System;
import Util;
import ValuesUtil;
import VisualXML;
public function appendLists
input list<SimCode.SimEqSystem> inEqn1;
input list<SimCode.SimEqSystem> inEqn2;
output list<SimCode.SimEqSystem> outEqn;
algorithm
outEqn := listAppend(inEqn1, inEqn2);
end appendLists;
protected function compareEqSystems
input SimCode.SimEqSystem eq1;
input SimCode.SimEqSystem eq2;
output Boolean b;
algorithm
b := simEqSystemIndex(eq1) > simEqSystemIndex(eq2);
end compareEqSystems;
public function sortEqSystems
input list<SimCode.SimEqSystem> eqs;
output list<SimCode.SimEqSystem> outEqs;
algorithm
outEqs := List.sort(eqs,compareEqSystems);
end sortEqSystems;
protected function simulationFindLiterals
"Finds all literal expressions in the DAE"
input BackendDAE.BackendDAE dae;
input list<DAE.Function> fns;
output list<DAE.Function> ofns;
output tuple<Integer, HashTableExpToIndex.HashTable, list<DAE.Exp>> literals;
algorithm
(ofns, literals) := DAEUtil.traverseDAEFunctions(
fns, SimCodeFunctionUtil.findLiteralsHelper,
(0, HashTableExpToIndex.emptyHashTableSized(BaseHashTable.bigBucketSize), {}), {});
// Broke things :(
// ((i, ht, literals)) := BackendDAEUtil.traverseBackendDAEExpsNoCopyWithUpdate(dae, findLiteralsHelper, (i, ht, literals));
end simulationFindLiterals;
// =============================================================================
// section to create SimCode from BackendDAE
//
// =============================================================================
public function createSimCode "entry point to create SimCode from BackendDAE."
input BackendDAE.BackendDAE inBackendDAE;
input BackendDAE.BackendDAE inInitDAE;
input Boolean inUseHomotopy "true if homotopy(...) is used during initialization";
input Option<BackendDAE.BackendDAE> inInitDAE_lambda0;
input list<BackendDAE.Equation> inRemovedInitialEquationLst;
input list<BackendDAE.Var> inPrimaryParameters "already sorted";
input list<BackendDAE.Var> inAllPrimaryParameters "already sorted";
input Absyn.Path inClassName;
input String filenamePrefix;
input String inFileDir;
input list<SimCode.Function> functions;
input list<String> externalFunctionIncludes;
input list<String> includeDirs;
input list<String> libs;
input list<String> libPaths;
input Option<SimCode.SimulationSettings> simSettingsOpt;
input list<SimCode.RecordDeclaration> recordDecls;
input tuple<Integer, HashTableExpToIndex.HashTable, list<DAE.Exp>> literals;
input Absyn.FunctionArgs args;
input Boolean isFMU=false;
input String FMUVersion="";
output SimCode.SimCode simCode;
output tuple<Integer, list<tuple<Integer, Integer>>> outMapping "the highest simEqIndex in the mapping and the mapping simEq-Index -> scc-Index itself";
protected
BackendDAE.BackendDAE dlow, initDAE_lambda0;
BackendDAE.EquationArray removedEqs;
BackendDAE.EventInfo eventInfo;
BackendDAE.Shared shared;
BackendDAE.SymbolicJacobians symJacs;
BackendDAE.Variables knownVars;
Boolean ifcpp;
HashTableCrIListArray.HashTable varToArrayIndexMapping "maps each array-variable to a array of positions";
HashTableCrILst.HashTable varToIndexMapping "maps each variable to an array position";
Integer maxDelayedExpIndex, uniqueEqIndex, numberofEqns, numStateSets, numberOfJacobians, sccOffset;
Integer numberofLinearSys, numberofNonLinearSys, numberofMixedSys;
Option<SimCode.FmiModelStructure> modelStruct;
SimCode.BackendMapping backendMapping;
SimCode.ExtObjInfo extObjInfo;
SimCode.HashTableCrefToSimVar crefToSimVarHT;
SimCode.MakefileParams makefileParams;
SimCode.ModelInfo modelInfo;
HashTable.HashTable crefToClockIndexHT;
array<Integer> systemIndexMap;
list<BackendDAE.EqSystem> clockedSysts, contSysts;
//list<BackendDAE.Equation> paramAsserts, remEqLst;
list<BackendDAE.Equation> removedInitialEquationLst;
list<BackendDAE.TimeEvent> timeEvents;
list<BackendDAE.Var> allPrimaryParameters "already sorted";
list<BackendDAE.Var> primaryParameters "already sorted";
list<BackendDAE.ZeroCrossing> zeroCrossings, sampleZC, relations;
list<DAE.ClassAttributes> classAttributes;
list<DAE.ComponentRef> discreteModelVars;
list<DAE.Constraint> constraints;
list<DAE.Exp> lits;
list<SimCode.ClockedPartition> clockedPartitions;
list<SimCode.JacobianMatrix> LinearMatrices, SymbolicJacs, SymbolicJacsTemp, SymbolicJacsStateSelect, SymbolicJacsStateSelectInternal, SymbolicJacsNLS;
list<SimCode.SimEqSystem> algorithmAndEquationAsserts;
list<SimCode.SimEqSystem> allEquations;
list<SimCode.SimEqSystem> equationsForZeroCrossings;
list<SimCode.SimEqSystem> initialEquations; // --> initial_equations
list<SimCode.SimEqSystem> initialEquations_lambda0; // --> initial_equations_lambda0
list<SimCode.SimEqSystem> jacobianEquations;
list<SimCode.SimEqSystem> maxValueEquations; // --> updateBoundMaxValues
list<SimCode.SimEqSystem> minValueEquations; // --> updateBoundMinValues
list<SimCode.SimEqSystem> nominalValueEquations; // --> updateBoundNominalValues
//list<SimCode.SimEqSystem> paramAssertSimEqs;
list<SimCode.SimEqSystem> parameterEquations; // --> updateBoundParameters
list<SimCode.SimEqSystem> removedEquations;
list<SimCode.SimEqSystem> removedInitialEquations; // -->
list<SimCode.SimEqSystem> startValueEquations; // --> updateBoundStartValues
list<SimCode.StateSet> stateSets;
list<SimCodeVar.SimVar> mixedArrayVars;
list<SimCodeVar.SimVar> tempvars, jacobianSimvars;
list<list<SimCode.SimEqSystem>> algebraicEquations; // --> functionAlgebraics
list<list<SimCode.SimEqSystem>> odeEquations; // --> functionODE
list<tuple<Integer, Integer>> equationSccMapping, eqBackendSimCodeMapping;
list<tuple<Integer, tuple<DAE.Exp, DAE.Exp, DAE.Exp>>> delayedExps;
constant Boolean debug = false;
algorithm
try
execStat("Backend phase and start with SimCode phase");
dlow := inBackendDAE;
System.tmpTickReset(0);
uniqueEqIndex := 1;
ifcpp := stringEqual(Config.simCodeTarget(), "Cpp");
backendMapping := setUpBackendMapping(inBackendDAE);
if Flags.isSet(Flags.VISUAL_XML) then
VisualXML.visualizationInfoXML(dlow, filenamePrefix);
end if;
if Flags.isSet(Flags.ITERATION_VARS) then
BackendDAEOptimize.listAllIterationVariables(dlow);
end if;
// initialization stuff
(initialEquations, removedInitialEquations, uniqueEqIndex, tempvars) := createInitialEquations(inInitDAE, inRemovedInitialEquationLst, uniqueEqIndex, {});
if isSome(inInitDAE_lambda0) then
SOME(initDAE_lambda0) := inInitDAE_lambda0;
(initialEquations_lambda0, uniqueEqIndex, tempvars) := createInitialEquations_lambda0(initDAE_lambda0, uniqueEqIndex, tempvars);
else
initialEquations_lambda0 := {};
end if;
execStat("simCode: created initialization part");
shared as BackendDAE.SHARED(knownVars=knownVars,
constraints=constraints,
classAttrs=classAttributes,
symjacs=symJacs,
eventInfo=eventInfo) := dlow.shared;
removedEqs := BackendDAEUtil.collapseRemovedEqs(dlow);
// created event suff e.g. zeroCrossings, samples, ...
timeEvents := eventInfo.timeEvents;
zeroCrossings := if ifcpp then eventInfo.relationsLst else eventInfo.zeroCrossingLst;
relations := eventInfo.relationsLst;
sampleZC := eventInfo.sampleLst;
zeroCrossings := if ifcpp then listAppend(zeroCrossings, sampleZC) else zeroCrossings;
(clockedSysts, contSysts) := List.splitOnTrue(dlow.eqs, BackendDAEUtil.isClockedSyst);
execStat("simCode: created event and clocks part");
(uniqueEqIndex, odeEquations, algebraicEquations, allEquations, equationsForZeroCrossings, tempvars,
equationSccMapping, eqBackendSimCodeMapping, backendMapping, sccOffset) :=
createEquationsForSystems(contSysts, shared, uniqueEqIndex, zeroCrossings, tempvars, 1, backendMapping);
if debug then execStat("simCode: createEquationsForSystems"); end if;
(clockedPartitions, uniqueEqIndex, backendMapping, equationSccMapping, eqBackendSimCodeMapping, tempvars) :=
translateClockedEquations(clockedSysts, dlow.shared, sccOffset, uniqueEqIndex,
backendMapping, equationSccMapping, eqBackendSimCodeMapping, tempvars);
if debug then execStat("simCode: translateClockedEquations"); end if;
outMapping := (uniqueEqIndex /* highestSimEqIndex */, equationSccMapping);
execStat("simCode: created simulation system equations");
//(remEqLst, paramAsserts) := List.fold1(BackendEquation.equationList(removedEqs), getParamAsserts, knownVars,({},{}));
//((uniqueEqIndex, removedEquations)) := BackendEquation.traverseEquationArray(BackendEquation.listEquation(remEqLst), traversedlowEqToSimEqSystem, (uniqueEqIndex, {}));
((uniqueEqIndex, removedEquations)) := BackendEquation.traverseEquationArray(removedEqs, traversedlowEqToSimEqSystem, (uniqueEqIndex, {}));
if debug then execStat("simCode: traversedlowEqToSimEqSystem"); end if;
// Assertions and crap
// create parameter equations
((uniqueEqIndex, startValueEquations)) := BackendDAEUtil.foldEqSystem(dlow, createStartValueEquations, (uniqueEqIndex, {}));
if debug then execStat("simCode: createStartValueEquations"); end if;
((uniqueEqIndex, nominalValueEquations)) := BackendDAEUtil.foldEqSystem(dlow, createNominalValueEquations, (uniqueEqIndex, {}));
if debug then execStat("simCode: createNominalValueEquations"); end if;
((uniqueEqIndex, minValueEquations)) := BackendDAEUtil.foldEqSystem(dlow, createMinValueEquations, (uniqueEqIndex, {}));
if debug then execStat("simCode: createMinValueEquations"); end if;
((uniqueEqIndex, maxValueEquations)) := BackendDAEUtil.foldEqSystem(dlow, createMaxValueEquations, (uniqueEqIndex, {}));
if debug then execStat("simCode: createMaxValueEquations"); end if;
((uniqueEqIndex, parameterEquations)) := BackendDAEUtil.foldEqSystem(dlow, createVarNominalAssertFromVars, (uniqueEqIndex, {}));
if debug then execStat("simCode: createVarNominalAssertFromVars"); end if;
(uniqueEqIndex, parameterEquations) := createParameterEquations(uniqueEqIndex, parameterEquations, inPrimaryParameters, inAllPrimaryParameters);
if debug then execStat("simCode: createParameterEquations"); end if;
//((uniqueEqIndex, paramAssertSimEqs)) := BackendEquation.traverseEquationArray(BackendEquation.listEquation(paramAsserts), traversedlowEqToSimEqSystem, (uniqueEqIndex, {}));
//parameterEquations := listAppend(parameterEquations, paramAssertSimEqs);
((uniqueEqIndex, algorithmAndEquationAsserts)) := BackendDAEUtil.foldEqSystem(dlow, createAlgorithmAndEquationAsserts, (uniqueEqIndex, {}));
if debug then execStat("simCode: createAlgorithmAndEquationAsserts"); end if;
discreteModelVars := BackendDAEUtil.foldEqSystem(dlow, extractDiscreteModelVars, {});
if debug then execStat("simCode: extractDiscreteModelVars"); end if;
makefileParams := SimCodeFunctionUtil.createMakefileParams(includeDirs, libs, libPaths, false, isFMU);
(delayedExps, maxDelayedExpIndex) := extractDelayedExpressions(dlow);
execStat("simCode: created of all other equations (e.g. parameter, nominal, assert, etc)");
// append removed equation to all equations, since these are actually
// just the algorithms without outputs
algebraicEquations := listAppend(algebraicEquations, removedEquations::{});
allEquations := List.append_reverse(allEquations, removedEquations);
// state set stuff
(dlow, stateSets, uniqueEqIndex, tempvars, numStateSets) := createStateSets(dlow, {}, uniqueEqIndex, tempvars);
if debug then execStat("simCode: createStateSets"); end if;
// create model info
modelInfo := createModelInfo(inClassName, dlow, inInitDAE, functions, {}, numStateSets, inFileDir, listLength(clockedSysts));
if debug then execStat("simCode: createModelInfo"); end if;
modelInfo := addTempVars(tempvars, modelInfo);
execStat("simCode: created modelInfo and variables");
// external objects
extObjInfo := createExtObjInfo(shared);
// update index of zero-Crossings after equations are created
zeroCrossings := updateZeroCrossEqnIndex(zeroCrossings, eqBackendSimCodeMapping, BackendDAEUtil.equationArraySizeBDAE(dlow));
// replace div operator with div operator with check of Division by zero
allEquations := List.map(allEquations, addDivExpErrorMsgtoSimEqSystem);
odeEquations := List.mapList(odeEquations, addDivExpErrorMsgtoSimEqSystem);
algebraicEquations := List.mapList(algebraicEquations, addDivExpErrorMsgtoSimEqSystem);
startValueEquations := List.map(startValueEquations, addDivExpErrorMsgtoSimEqSystem);
nominalValueEquations := List.map(nominalValueEquations, addDivExpErrorMsgtoSimEqSystem);
minValueEquations := List.map(minValueEquations, addDivExpErrorMsgtoSimEqSystem);
maxValueEquations := List.map(maxValueEquations, addDivExpErrorMsgtoSimEqSystem);
parameterEquations := List.map(parameterEquations, addDivExpErrorMsgtoSimEqSystem);
removedEquations := List.map(removedEquations, addDivExpErrorMsgtoSimEqSystem);
initialEquations := List.map(initialEquations, addDivExpErrorMsgtoSimEqSystem);
initialEquations_lambda0 := List.map(initialEquations_lambda0, addDivExpErrorMsgtoSimEqSystem);
removedInitialEquations := List.map(removedInitialEquations, addDivExpErrorMsgtoSimEqSystem);
// update indexNonLinear in SES_NONLINEAR and count
SymbolicJacsNLS := {};
(initialEquations, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, SymbolicJacsTemp) := countandIndexAlgebraicLoops(initialEquations, 0, 0, 0, 0, {});
SymbolicJacsNLS := listAppend(SymbolicJacsTemp, SymbolicJacsNLS);
(initialEquations_lambda0, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, SymbolicJacsTemp) := countandIndexAlgebraicLoops(initialEquations_lambda0, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, {});
SymbolicJacsNLS := listAppend(SymbolicJacsTemp, SymbolicJacsNLS);
(parameterEquations, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, SymbolicJacsTemp) := countandIndexAlgebraicLoops(parameterEquations, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, {});
SymbolicJacsNLS := listAppend(SymbolicJacsTemp, SymbolicJacsNLS);
(allEquations, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, SymbolicJacsTemp) := countandIndexAlgebraicLoops(allEquations, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, {});
SymbolicJacsNLS := listAppend(SymbolicJacsTemp, SymbolicJacsNLS);
if Flags.isSet(Flags.DYNAMIC_TEARING_INFO) then
print("\n\n*********************\n* SimCode Equations *\n*********************\n\ninitialEquations:\n=================\n");
dumpSimEqSystemLst(initialEquations,"\n");
print("\n\ninitialEquations (lambda=0):\n===================\n");
dumpSimEqSystemLst(initialEquations_lambda0,"\n");
print("\n\nparameterEquations:\n===================\n");
dumpSimEqSystemLst(parameterEquations,"\n");
print("\n\nallEquations:\n=============\n");
dumpSimEqSystemLst(allEquations,"\n");
end if;
// collect symbolic jacobians from state selection
(stateSets, SymbolicJacsStateSelect, SymbolicJacsStateSelectInternal, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians) := indexStateSets(stateSets, {}, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, {}, {});
// generate jacobian or linear model matrices
(LinearMatrices, uniqueEqIndex) := createJacobianLinearCode(symJacs, modelInfo, uniqueEqIndex);
// collect jacobian equation only for equantion info file
jacobianEquations := collectAllJacobianEquations(LinearMatrices);
// collect symbolic jacobians in linear loops of the overall jacobians
(_, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, SymbolicJacs) := countandIndexAlgebraicLoops({}, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians, LinearMatrices);
jacobianEquations := listAppend(collectAllJacobianEquations(SymbolicJacsStateSelect), jacobianEquations);
SymbolicJacsNLS := listAppend(SymbolicJacsStateSelectInternal, SymbolicJacsNLS);
SymbolicJacsNLS := listAppend(SymbolicJacsStateSelect, SymbolicJacsNLS);
SymbolicJacs := listAppend(SymbolicJacsNLS, SymbolicJacs);
jacobianSimvars := collectAllJacobianVars(SymbolicJacs);
modelInfo := setJacobianVars(jacobianSimvars, modelInfo);
execStat("simCode: created linear, non-linear and system jacobian parts");
// map index also odeEquations and algebraicEquations
systemIndexMap := List.fold(allEquations, getSystemIndexMap, arrayCreate(uniqueEqIndex, -1));
odeEquations := List.mapList1_1(odeEquations, setSystemIndexMap, systemIndexMap);
algebraicEquations := List.mapList1_1(algebraicEquations, setSystemIndexMap, systemIndexMap);
numberofEqns := uniqueEqIndex; /* This is a *much* better estimate than the guessed number of equations */
// create model info
modelInfo := addNumEqnsandNumofSystems(modelInfo, numberofEqns, numberofLinearSys, numberofNonLinearSys, numberofMixedSys, numberOfJacobians);
odeEquations := makeEqualLengthLists(odeEquations, Config.noProc());
algebraicEquations := makeEqualLengthLists(algebraicEquations, Config.noProc());
// Filter out empty systems to improve code generation
odeEquations := List.filterOnFalse(odeEquations, listEmpty);
algebraicEquations := List.filterOnFalse(algebraicEquations, listEmpty);
if Flags.isSet(Flags.EXEC_HASH) then
print("*** SimCode -> generate cref2simVar hashtable: " + realString(clock()) + "\n");
end if;
(crefToSimVarHT, mixedArrayVars) := createCrefToSimVarHT(modelInfo);
modelInfo := setMixedArrayVars(mixedArrayVars, modelInfo);
if Flags.isSet(Flags.EXEC_HASH) then
print("*** SimCode -> generate cref2simVar hashtable done!: " + realString(clock()) + "\n");
end if;
backendMapping := setBackendVarMapping(inBackendDAE, crefToSimVarHT, modelInfo, backendMapping);
//dumpBackendMapping(backendMapping);
if if isFMU then FMI.isFMIVersion20(FMUVersion) else false then
modelStruct := createFMIModelStructure(symJacs, modelInfo);
else
modelStruct := NONE();
end if;
(varToArrayIndexMapping, varToIndexMapping) := createVarToArrayIndexMapping(modelInfo);
//print("HASHTABLE MAPPING\n\n");
//BaseHashTable.dumpHashTable(varToArrayIndexMapping);
//print("END MAPPING\n\n");
(crefToClockIndexHT, _) := List.fold(inBackendDAE.eqs, collectClockedVars, (HashTable.emptyHashTable(), 1));
simCode := SimCode.SIMCODE(modelInfo,
{}, // Set by the traversal below...
recordDecls,
externalFunctionIncludes,
allEquations,
odeEquations,
algebraicEquations,
clockedPartitions,
inUseHomotopy,
initialEquations,
initialEquations_lambda0,
removedInitialEquations,
startValueEquations,
nominalValueEquations,
minValueEquations,
maxValueEquations,
parameterEquations,
removedEquations,
algorithmAndEquationAsserts,
equationsForZeroCrossings,
jacobianEquations,
stateSets,
constraints,
classAttributes,
zeroCrossings,
relations,
timeEvents,
discreteModelVars,
extObjInfo,
makefileParams,
SimCode.DELAYED_EXPRESSIONS(delayedExps, maxDelayedExpIndex),
SymbolicJacs,
simSettingsOpt,
filenamePrefix,
HpcOmSimCode.emptyHpcomData,
varToArrayIndexMapping,
varToIndexMapping,
crefToSimVarHT,
crefToClockIndexHT,
SOME(backendMapping),
modelStruct,
SimCode.emptyPartitionData);
(simCode, (_, _, lits)) := traverseExpsSimCode(simCode, SimCodeFunctionUtil.findLiteralsHelper, literals);
simCode := setSimCodeLiterals(simCode, listReverse(lits));
// dumpCrefToSimVarHashTable(crefToSimVarHT);
// print("*** SimCode -> collect all files started: " + realString(clock()) + "\n");
// adrpo: collect all the files from SourceInfo and DAE.ElementSource
// simCode := collectAllFiles(simCode);
// print("*** SimCode -> collect all files done!: " + realString(clock()) + "\n");
execStat("simCode: all other stuff during SimCode phase");
if Flags.isSet(Flags.DUMP_SIMCODE) then
dumpSimCodeDebug(simCode);
end if;
else
Error.addInternalError("function createSimCode failed [Transformation from optimised DAE to simulation code structure failed]", sourceInfo());
fail();
end try;
end createSimCode;
public function createFunctions
input Absyn.Program inProgram;
input BackendDAE.BackendDAE inBackendDAE;
output list<String> outLibs;
output list<String> outLibPaths;
output list<String> outIncludes;
output list<String> outIncludeDirs;
output list<SimCode.RecordDeclaration> outRecordDecls;
output list<SimCode.Function> outFunctions;
output tuple<Integer, HashTableExpToIndex.HashTable, list<DAE.Exp>> outLiterals;
protected
list<DAE.Function> funcelems;
DAE.FunctionTree functionTree;
list<DAE.Exp> lits;
algorithm
try
BackendDAE.DAE(shared=BackendDAE.SHARED(functionTree=functionTree)) := inBackendDAE;
// get all the used functions from the function tree
funcelems := DAEUtil.getFunctionList(functionTree);
funcelems := setRecordVariability(funcelems, inBackendDAE);
funcelems := Inline.inlineCallsInFunctions(funcelems, (NONE(), {DAE.NORM_INLINE(), DAE.AFTER_INDEX_RED_INLINE()}), {});
(funcelems, outLiterals as (_, _, lits)) := simulationFindLiterals(inBackendDAE, funcelems);
(outFunctions, outRecordDecls, outIncludes, outIncludeDirs, outLibs, outLibPaths) := SimCodeFunctionUtil.elaborateFunctions(inProgram, funcelems, {}, lits, {}); // Do we need metarecords here as well?
else
Error.addInternalError("Creation of Modelica functions failed.", sourceInfo());
fail();
end try;
end createFunctions;
protected function getParamAsserts"splits the equationArray in variable-dependent and parameter-dependent equations.
author: Waurich TUD-2015-04"
input BackendDAE.Equation eqIn;
input BackendDAE.Variables vars;
input tuple<list<BackendDAE.Equation>, list<BackendDAE.Equation>> tplIn; //<var-dependent, param-dependent>
output tuple<list<BackendDAE.Equation>, list<BackendDAE.Equation>> tplOut;
algorithm
tplOut := matchcontinue(eqIn,vars,tplIn)
local
list<DAE.Statement> stmts;
list<DAE.ComponentRef> crefs;
list<BackendDAE.Var> varLst;
list<list<BackendDAE.Var>> varLstLst;
list<BackendDAE.Equation> varDep,paramDep;
case(BackendDAE.ALGORITHM(alg=DAE.ALGORITHM_STMTS(statementLst=stmts)),_,(varDep,paramDep))
algorithm
crefs := List.fold(stmts,DAEUtil.getAssertConditionCrefs,{});
(varLstLst,_) := List.map1_2(crefs,BackendVariable.getVar,vars);
varLst := List.flatten(varLstLst);
true := List.exist(varLst,BackendVariable.isParam);
then ((varDep,eqIn::paramDep));
else
algorithm
(varDep,paramDep) := tplIn;
then ((eqIn::varDep,paramDep));
end matchcontinue;
end getParamAsserts;
protected function translateClockedEquations
input BackendDAE.EqSystems inSysts;
input BackendDAE.Shared inShared;
input Integer iSccOffset;
input Integer iuniqueEqIndex;
input SimCode.BackendMapping iBackendMapping;
input list<tuple<Integer,Integer>> ieqSccMapping;
input list<tuple<Integer,Integer>> ieqBackendSimCodeMapping;
input list<SimCodeVar.SimVar> itempvars;
output list<SimCode.ClockedPartition> outPartitions = {};
output Integer ouniqueEqIndex = iuniqueEqIndex;
output SimCode.BackendMapping oBackendMapping = iBackendMapping;
output list<tuple<Integer,Integer>> oeqSccMapping = ieqSccMapping;
output list<tuple<Integer,Integer>> oeqBackendSimCodeMapping = ieqBackendSimCodeMapping;
output list<SimCodeVar.SimVar> otempvars = itempvars;
protected
Integer baseIdx, subPartIdx, cnt;
BackendDAE.SubClock subClk;
list<SimCode.SimEqSystem> removedEquations, equations, preEquations;
SimCode.SubPartition simSubPartition;
Boolean holdEvents;
array<Integer> ass1, stateeqnsmark, zceqnsmarks;
DAE.FunctionTree funcs;
BackendDAE.StrongComponents comps;
Integer sccOffset = iSccOffset;
list<Integer> varIxs;
DAE.Type ty;
BackendDAE.Var var;
BackendDAE.Equation eq;
SimCodeVar.SimVar simVar;
DAE.ComponentRef cr;
list<SimCodeVar.SimVar> clockedVars;
list<tuple<SimCodeVar.SimVar, Boolean>> prevClockedVars;
array<Option<SimCode.SubPartition>> simSubPartitions;
BackendDAE.SubPartition subPartition;
BackendDAE.Var var;
array<Boolean> isPrevVar;
SimCode.SimEqSystem simEq;
algorithm
simSubPartitions := arrayCreate(arrayLength(inShared.partitionsInfo.subPartitions), NONE());
funcs := BackendDAEUtil.getFunctions(inShared);
for syst in inSysts loop
//syst := preCalculateStartValues(syst, inShared.knownVars, funcs);
BackendDAE.CLOCKED_PARTITION(subPartIdx) := syst.partitionKind;
BackendDAE.MATCHING(ass1=ass1, comps=comps) := syst.matching;
subPartition := inShared.partitionsInfo.subPartitions[subPartIdx];
(syst, _, _) := BackendDAEUtil.getIncidenceMatrixfromOption(syst, BackendDAE.ABSOLUTE(), SOME(funcs));
stateeqnsmark := arrayCreate(BackendDAEUtil.equationArraySizeDAE(syst), 0);
stateeqnsmark := BackendDAEUtil.markStateEquations(syst, stateeqnsmark, ass1);
zceqnsmarks := arrayCreate(BackendDAEUtil.equationArraySizeDAE(syst), 0);
//FIXME: Add continuous clocked systems support
(_, _, equations, _, ouniqueEqIndex, clockedVars, oeqSccMapping, oeqBackendSimCodeMapping, oBackendMapping) :=
createEquationsForSystem(stateeqnsmark, zceqnsmarks, syst, inShared, comps, ouniqueEqIndex, {},
sccOffset, oeqSccMapping, oeqBackendSimCodeMapping, oBackendMapping);
sccOffset := listLength(comps) + sccOffset;
//otempvars := listAppend(clockedVars, otempvars);
(ouniqueEqIndex, removedEquations) := BackendEquation.traverseEquationArray(syst.removedEqs, traversedlowEqToSimEqSystem, (ouniqueEqIndex, {}));
equations := List.map(equations, addDivExpErrorMsgtoSimEqSystem);
removedEquations := List.map(removedEquations, addDivExpErrorMsgtoSimEqSystem);
prevClockedVars := {};
isPrevVar := arrayCreate(BackendVariable.varsSize(syst.orderedVars), false);
for cr in subPartition.prevVars loop
(_, varIxs) := BackendVariable.getVar(cr, syst.orderedVars);
for i in varIxs loop
arrayUpdate(isPrevVar, i, true);
end for;
end for;
for i in 1:BackendVariable.varsSize(syst.orderedVars) loop
var := BackendVariable.getVarAt(syst.orderedVars, i);
simVar := dlowvarToSimvar(var, SOME(inShared.aliasVars), inShared.knownVars);
prevClockedVars := (simVar, isPrevVar[i])::prevClockedVars;
clockedVars := simVar::clockedVars;
if isPrevVar[i] then
cr := simVar.name;
simVar.name := ComponentReference.crefPrefixPrevious(cr);
clockedVars := simVar::clockedVars;
simEq := SimCode.SES_SIMPLE_ASSIGN(ouniqueEqIndex, simVar.name, DAE.CREF(cr, simVar.type_), DAE.emptyElementSource);
equations := simEq::equations;
ouniqueEqIndex := ouniqueEqIndex + 1;
end if;
end for;
//otempvars := listAppend(clockedVars, otempvars);
simSubPartition := SimCode.SUBPARTITION(prevClockedVars, equations, removedEquations, subPartition.clock, subPartition.holdEvents);
assert(isNone(simSubPartitions[subPartIdx]), "SimCodeUtil.translateClockedEquations failed");
arrayUpdate(simSubPartitions, subPartIdx, SOME(simSubPartition));
end for;
outPartitions := createClockedSimPartitions(inShared.partitionsInfo.basePartitions, simSubPartitions);
end translateClockedEquations;
protected function createClockedSimPartitions
input array<BackendDAE.BasePartition> basePartitions;
input array<Option<SimCode.SubPartition>> subPartitions;
output list<SimCode.ClockedPartition> clockedPartitions = {};
protected
Integer off = 1;
BackendDAE.BasePartition basePartition;
list<SimCode.SubPartition> simSubPartitions;
algorithm
for i in 1:arrayLength(basePartitions) loop
basePartition := basePartitions[i];
if basePartition.nSubClocks > 0 then
simSubPartitions := List.map(Array.getRange(off, off + basePartition.nSubClocks - 1, subPartitions), Util.getOption);
simSubPartitions := listReverse(simSubPartitions);
else
simSubPartitions := {};
end if;
off := off + basePartition.nSubClocks;
clockedPartitions := SimCode.CLOCKED_PARTITION(basePartition.clock, simSubPartitions)::clockedPartitions;
end for;
end createClockedSimPartitions;
protected function collectClockedVars "author: rfranke
This function collects clocked variables along with their clockIndex"
input BackendDAE.EqSystem inEqSystem;
input tuple<HashTable.HashTable, Integer> inTpl;
output tuple<HashTable.HashTable, Integer> outTpl;
protected
HashTable.HashTable inHT, outHT;
Integer clockIndex;
algorithm
(inHT, clockIndex) := inTpl;
outTpl := match inEqSystem
case BackendDAE.EQSYSTEM(partitionKind = BackendDAE.CLOCKED_PARTITION(_)) equation
(outHT, _) = BackendVariable.traverseBackendDAEVars(inEqSystem.orderedVars, collectClockedVars1, (inHT, clockIndex));
then (outHT, clockIndex + 1);
else (inHT, clockIndex);
end match;
end collectClockedVars;
protected function collectClockedVars1 "author: rfranke
Helper to collectClockedVars"
input BackendDAE.Var inVar;
input tuple<HashTable.HashTable, Integer> inTpl;
output BackendDAE.Var outVar;
output tuple<HashTable.HashTable, Integer> outTpl;
protected
HashTable.HashTable clkHT;
Integer clockIndex;
DAE.ComponentRef cref;
algorithm
(clkHT, clockIndex) := inTpl;
(outVar, outTpl) := match inVar
case BackendDAE.VAR(varName=cref) equation
clkHT = BaseHashTable.add((cref, clockIndex), clkHT);
clkHT = BaseHashTable.add((ComponentReference.crefPrefixPrevious(cref), clockIndex), clkHT);
then (inVar, (clkHT, clockIndex));
else (inVar, inTpl);
end match;
end collectClockedVars1;
public function getClockIndex "author: rfranke
Returns the index of the clock of a variable or zero non-clocked variables"
input SimCodeVar.SimVar simVar;
input SimCode.SimCode simCode;
output Option<Integer> clockIndex;
protected
DAE.ComponentRef cref;
HashTable.HashTable clkHT;
algorithm
cref := getSimVarCompRef(simVar);
clockIndex := match simCode
case SimCode.SIMCODE(crefToClockIndexHT=clkHT) then
if BaseHashTable.hasKey(cref, clkHT)
then SOME(BaseHashTable.get(cref, clkHT))
else NONE();
end match;
end getClockIndex;
protected function getSimVarCompRef
input SimCodeVar.SimVar inVar;
output DAE.ComponentRef outComp;
algorithm
outComp := inVar.name;
end getSimVarCompRef;
public function getSubPartitions
input list<SimCode.ClockedPartition> inPartitions;
output list<SimCode.SubPartition> outSubPartitions;
algorithm
outSubPartitions := List.flatten(List.map(inPartitions, getSubPartition));
end getSubPartitions;
public function getSubPartition
input SimCode.ClockedPartition inPartition;
output list<SimCode.SubPartition> outSubPartitions;
algorithm
outSubPartitions := inPartition.subPartitions;
end getSubPartition;
protected type AddTempVarsArg =
tuple<Integer /*numAlgVars*/, list<SimCodeVar.SimVar> /*algVars*/,
Integer /*numIntAlgVars*/, list<SimCodeVar.SimVar> /*intAlgVars*/,
Integer /*numBoolAlgVars*/, list<SimCodeVar.SimVar> /*boolAlgVars*/,
Integer /*numStringAlgVars*/, list<SimCodeVar.SimVar> /*stringAlgVars*/>;
protected function addTempVars
input list<SimCodeVar.SimVar> tempVars;
input SimCode.ModelInfo modelInfo;
output SimCode.ModelInfo omodelInfo = modelInfo;
protected
AddTempVarsArg arg;
SimCode.VarInfo varInfo;
SimCodeVar.SimVars vars;
Integer numAlgVars, numIntAlgVars, numBoolAlgVars, numStringAlgVars;
list<SimCodeVar.SimVar> algVars, intAlgVars, boolAlgVars, stringAlgVars;
algorithm
varInfo := omodelInfo.varInfo;
vars := omodelInfo.vars;
arg := (varInfo.numAlgVars, listReverse(vars.algVars), varInfo.numIntAlgVars, listReverse(vars.intAlgVars),
varInfo.numBoolAlgVars, listReverse(vars.boolAlgVars), varInfo.numStringAlgVars, listReverse(vars.stringAlgVars));
arg := List.fold(tempVars, addTempVars1, arg);
(numAlgVars, algVars, numIntAlgVars, intAlgVars, numBoolAlgVars, boolAlgVars, numStringAlgVars, stringAlgVars) := arg;
vars.algVars := listReverse(algVars);
vars.intAlgVars := listReverse(intAlgVars);
vars.boolAlgVars := listReverse(boolAlgVars);
vars.stringAlgVars := listReverse(stringAlgVars);
varInfo.numAlgVars := numAlgVars;
varInfo.numIntAlgVars := numIntAlgVars;
varInfo.numBoolAlgVars := numBoolAlgVars;
varInfo.numStringAlgVars := numStringAlgVars;
omodelInfo.vars := vars;
omodelInfo.varInfo := varInfo;
end addTempVars;
protected function addTempVars1
input SimCodeVar.SimVar inVar;
input AddTempVarsArg inArg;
output AddTempVarsArg outArg;
protected
Integer numAlgVars, numIntAlgVars, numBoolAlgVars, numStringAlgVars;
list<SimCodeVar.SimVar> algVars, intAlgVars, boolAlgVars, stringAlgVars;
SimCodeVar.SimVar var = inVar;
algorithm
(numAlgVars, algVars, numIntAlgVars, intAlgVars, numBoolAlgVars, boolAlgVars, numStringAlgVars, stringAlgVars) := inArg;
outArg := match inVar.type_
case DAE.T_INTEGER()
equation var.index = numIntAlgVars;
then
(numAlgVars, algVars, numIntAlgVars+1, var::intAlgVars, numBoolAlgVars, boolAlgVars, numStringAlgVars, stringAlgVars);
case DAE.T_ENUMERATION()
equation var.index = numIntAlgVars;
then
(numAlgVars, algVars, numIntAlgVars+1, var::intAlgVars, numBoolAlgVars, boolAlgVars, numStringAlgVars, stringAlgVars);
case DAE.T_BOOL()
equation var.index = numBoolAlgVars;
then
(numAlgVars, algVars, numIntAlgVars, intAlgVars, numBoolAlgVars+1, var::boolAlgVars, numStringAlgVars, stringAlgVars);
case DAE.T_STRING()
equation var.index = numStringAlgVars;
then
(numAlgVars, algVars, numIntAlgVars, intAlgVars, numBoolAlgVars, boolAlgVars, numStringAlgVars+1, var::stringAlgVars);
else
equation var.index = numAlgVars;
then
(numAlgVars+1, var::algVars, numIntAlgVars, intAlgVars, numBoolAlgVars, boolAlgVars, numStringAlgVars, stringAlgVars);
end match;
end addTempVars1;
protected function setJacobianVars "author: unknown
Set the given jacobian vars in the given model info. The old jacobian variables will be replaced."
input list<SimCodeVar.SimVar> iJacobianVars;
input SimCode.ModelInfo iModelInfo;
output SimCode.ModelInfo oModelInfo = iModelInfo;
protected
SimCodeVar.SimVars vars;
algorithm
if listLength(iJacobianVars) > 0 then
vars := oModelInfo.vars;
vars.jacobianVars := iJacobianVars;
oModelInfo.vars := vars;
end if;
end setJacobianVars;
protected function setMixedArrayVars "author: marcusw
Set the given mixed array vars in the given model info. The old mixed variables will be replaced."
input list<SimCodeVar.SimVar> iMixedArrayVars;
input SimCode.ModelInfo iModelInfo;
output SimCode.ModelInfo oModelInfo = iModelInfo;
protected
SimCodeVar.SimVars vars;
algorithm
vars := oModelInfo.vars;
vars.mixedArrayVars := iMixedArrayVars;
oModelInfo.vars := vars;
end setMixedArrayVars;
protected function addNumEqnsandNumofSystems
input SimCode.ModelInfo modelInfo;
input Integer numEqns;
input Integer numLinearSys;
input Integer numNonLinearSys;
input Integer numMixedLinearSys;
input Integer numOfJacobians;
output SimCode.ModelInfo omodelInfo = modelInfo;
protected
SimCode.VarInfo varInfo;
algorithm
varInfo := omodelInfo.varInfo;
varInfo.numEquations := numEqns;
varInfo.numLinearSystems := numLinearSys;
varInfo.numNonLinearSystems := numNonLinearSys;
varInfo.numMixedSystems := numMixedLinearSys;
varInfo.numJacobians := numOfJacobians;
omodelInfo.varInfo := varInfo;
end addNumEqnsandNumofSystems;
protected function getSystemIndexMap
input SimCode.SimEqSystem inEqn;
input array<Integer> inSysIndexMap;
output array<Integer> outSysIndexMap;
algorithm
outSysIndexMap := match(inEqn, inSysIndexMap)
local
Integer index, systemIndex, index2, systemIndex2;
array<Integer> sysIndexMap;
SimCode.SimEqSystem cont;
list<SimCode.SimEqSystem> eqs, eqs2;
// no dynamic tearing
case(SimCode.SES_LINEAR(SimCode.LINEARSYSTEM(index=index, indexLinearSystem=systemIndex), NONE()), _) equation
sysIndexMap = arrayUpdate(inSysIndexMap, index, systemIndex);
then sysIndexMap;
case(SimCode.SES_NONLINEAR(SimCode.NONLINEARSYSTEM(index=index, eqs=eqs, indexNonLinearSystem=systemIndex), NONE()), _) equation
sysIndexMap = List.fold(eqs, getSystemIndexMap, inSysIndexMap);
sysIndexMap = arrayUpdate(sysIndexMap, index, systemIndex);
then sysIndexMap;
// dynamic tearing
case(SimCode.SES_LINEAR(SimCode.LINEARSYSTEM(index=index, indexLinearSystem=systemIndex), SOME(SimCode.LINEARSYSTEM(index=index2, indexLinearSystem=systemIndex2))), _) equation
sysIndexMap = arrayUpdate(inSysIndexMap, index, systemIndex);
sysIndexMap = arrayUpdate(inSysIndexMap, index2, systemIndex2);
then sysIndexMap;
case(SimCode.SES_NONLINEAR(SimCode.NONLINEARSYSTEM(index=index, eqs=eqs, indexNonLinearSystem=systemIndex) , SOME(SimCode.NONLINEARSYSTEM(index=index2, eqs=eqs2, indexNonLinearSystem=systemIndex2))), _) equation
sysIndexMap = List.fold(eqs, getSystemIndexMap, inSysIndexMap);
sysIndexMap = arrayUpdate(sysIndexMap, index, systemIndex);
sysIndexMap = List.fold(eqs2, getSystemIndexMap, inSysIndexMap);
sysIndexMap = arrayUpdate(sysIndexMap, index2, systemIndex2);
then sysIndexMap;
case(SimCode.SES_MIXED(cont=cont, index=index, indexMixedSystem=systemIndex), _) equation
getSystemIndexMap(cont, inSysIndexMap);
sysIndexMap = arrayUpdate(inSysIndexMap, index, systemIndex);
then sysIndexMap;
else inSysIndexMap;
end match;
end getSystemIndexMap;
protected function setSystemIndexMap "
updates index of strong components systems"
input SimCode.SimEqSystem inEqn;
input array<Integer> inSysIndexMap;
output SimCode.SimEqSystem outEqn;
algorithm
outEqn := match(inEqn, inSysIndexMap)
local
Integer index, index2, sysIndex, sysIndex2;
list<SimCode.SimEqSystem> eqs, eqs2;
list<DAE.ComponentRef> crefs, crefs2;
SimCode.SimEqSystem cont;
list<SimCodeVar.SimVar> discVars;
list<SimCode.SimEqSystem> discEqs;
Option<SimCode.JacobianMatrix> optSymJac, optSymJac2;
Boolean partOfMixed,partOfMixed2;
list<SimCodeVar.SimVar> vars,vars2;
list<DAE.Exp> beqs,beqs2;
Boolean linearTearing, linearTearing2;
list<tuple<Integer, Integer, SimCode.SimEqSystem>> simJac,simJac2;
list<DAE.ElementSource> sources,sources2;
Boolean homotopySupport, homotopySupport2;
Boolean mixedSystem, mixedSystem2;
// no dynamic tearing
case(SimCode.SES_LINEAR(SimCode.LINEARSYSTEM(index, partOfMixed, vars, beqs, simJac, eqs, optSymJac, sources, _), NONE()), _) equation
sysIndex = inSysIndexMap[index];
then SimCode.SES_LINEAR(SimCode.LINEARSYSTEM(index, partOfMixed, vars, beqs, simJac, eqs, optSymJac, sources, sysIndex), NONE());
case(SimCode.SES_NONLINEAR(SimCode.NONLINEARSYSTEM(index, eqs, crefs, _, optSymJac, linearTearing, homotopySupport, mixedSystem), NONE()), _) equation
eqs = List.map1(eqs, setSystemIndexMap, inSysIndexMap);
sysIndex = inSysIndexMap[index];
then SimCode.SES_NONLINEAR(SimCode.NONLINEARSYSTEM(index, eqs, crefs, sysIndex, optSymJac, linearTearing, homotopySupport, mixedSystem), NONE());
// dynamic tearing
case(SimCode.SES_LINEAR(SimCode.LINEARSYSTEM(index, partOfMixed, vars, beqs, simJac, eqs, optSymJac, sources, _), SOME(SimCode.LINEARSYSTEM(index2, partOfMixed2, vars2, beqs2, simJac2, eqs2, optSymJac2, sources2, _))), _) equation
sysIndex = inSysIndexMap[index];
sysIndex2 = inSysIndexMap[index2];
then SimCode.SES_LINEAR(SimCode.LINEARSYSTEM(index, partOfMixed, vars, beqs, simJac, eqs, optSymJac, sources, sysIndex), SOME(SimCode.LINEARSYSTEM(index2, partOfMixed2, vars2, beqs2, simJac2, eqs2, optSymJac2, sources2, sysIndex2)));
case(SimCode.SES_NONLINEAR(SimCode.NONLINEARSYSTEM(index=index, eqs=eqs, crefs=crefs, jacobianMatrix=optSymJac, linearTearing=linearTearing, homotopySupport=homotopySupport, mixedSystem=mixedSystem), SOME(SimCode.NONLINEARSYSTEM(index=index2, eqs=eqs2, crefs=crefs2, jacobianMatrix=optSymJac2, linearTearing=linearTearing2, homotopySupport=homotopySupport2, mixedSystem=mixedSystem2))), _) equation
eqs = List.map1(eqs, setSystemIndexMap, inSysIndexMap);
sysIndex = inSysIndexMap[index];
eqs2 = List.map1(eqs2, setSystemIndexMap, inSysIndexMap);
sysIndex2 = inSysIndexMap[index2];
then SimCode.SES_NONLINEAR(SimCode.NONLINEARSYSTEM(index, eqs, crefs, sysIndex, optSymJac, linearTearing, homotopySupport, mixedSystem), SOME(SimCode.NONLINEARSYSTEM(index2, eqs2, crefs2, sysIndex2, optSymJac2, linearTearing2, homotopySupport2, mixedSystem2)));
case(SimCode.SES_MIXED(index, cont, discVars, discEqs, _), _) equation
sysIndex = inSysIndexMap[index];
cont = setSystemIndexMap(cont, inSysIndexMap);
then SimCode.SES_MIXED(index, cont, discVars, discEqs, sysIndex);
else
then inEqn;
end match;
end setSystemIndexMap;
protected function countandIndexAlgebraicLoops "
counts algebraic loops and updates index of the systems, further all
symbolic jacobians are collected and therefore we also need to seek
for algebraic loops."
input list<SimCode.SimEqSystem> inEqns;
input Integer inLinearSysIndex;
input Integer inNonLinSysIndex;
input Integer inMixedSysIndex;
input Integer inJacobianIndex;
input list<SimCode.JacobianMatrix> inSymJacs;
output list<SimCode.SimEqSystem> outEqns;
output Integer outLinearSysIndex;
output Integer outNonLinSysIndex;
output Integer outMixedSysIndex;
output Integer outJacobianIndex;
output list<SimCode.JacobianMatrix> outSymJacs;
algorithm
(outEqns, outSymJacs, outLinearSysIndex, outNonLinSysIndex, outMixedSysIndex, outJacobianIndex) := countandIndexAlgebraicLoopsWork(inEqns, inSymJacs, inLinearSysIndex, inNonLinSysIndex, inMixedSysIndex, inJacobianIndex, {}, {});
end countandIndexAlgebraicLoops;
protected function countandIndexAlgebraicLoopsWork "
counts algebraic loops and updates index of the systems, further all