/
InstExtends.mo
1990 lines (1823 loc) · 75.8 KB
/
InstExtends.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 InstExtends
" file: InstExtends.mo
package: InstExtends
description: Model instantiation
RCS: $Id$
This module is responsible for instantiation of the extends and
class extends constructs in Modelica models.
"
// public imports
public import Absyn;
public import ClassInf;
public import DAE;
public import Env;
public import HashTableStringToPath;
public import InnerOuter;
public import SCode;
public import Prefix;
// protected imports
protected import BaseHashTable;
protected import Builtin;
protected import ComponentReference;
protected import Debug;
protected import Dump;
protected import Error;
protected import Flags;
protected import Inst;
protected import List;
protected import Lookup;
protected import Mod;
protected import Types;
protected import Util;
protected import SCodeDump;
protected import ErrorExt;
protected import SCodeUtil;
protected import System;
public type InstanceHierarchy = InnerOuter.InstHierarchy "an instance hierarchy";
protected function instExtendsList "
author: PA
This function flattens out the inheritance structure of a class.
It takes an SCode.Element list and flattens out the extends nodes
of that list. The result is a list of components and lists of equations
and algorithms."
input Env.Cache inCache;
input Env.Env inEnv;
input InstanceHierarchy inIH;
input DAE.Mod inMod;
input Prefix.Prefix inPrefix;
input list<SCode.Element> inSCodeElementLst;
input ClassInf.State inState;
input String inClassName; // the class name whose elements are getting instantiated.
input Boolean inImplicit;
input Boolean isPartialInst;
output Env.Cache outCache;
output Env.Env outEnv1;
output InstanceHierarchy outIH;
output DAE.Mod outMod2;
output list<tuple<SCode.Element, DAE.Mod, Boolean>> outTplSCodeElementModLst3;
output list<SCode.Equation> outSCodeEquationLst4;
output list<SCode.Equation> outSCodeEquationLst5;
output list<SCode.AlgorithmSection> outSCodeAlgorithmLst6;
output list<SCode.AlgorithmSection> outSCodeAlgorithmLst7;
algorithm
(outCache,outEnv1,outIH,outMod2,outTplSCodeElementModLst3,outSCodeEquationLst4,outSCodeEquationLst5,outSCodeAlgorithmLst6,outSCodeAlgorithmLst7):=
matchcontinue (inCache,inEnv,inIH,inMod,inPrefix,inSCodeElementLst,inState,inClassName,inImplicit,isPartialInst)
local
SCode.Element c;
String cn,s,scope_str,className;
SCode.Encapsulated encf;
Boolean impl,notConst;
SCode.Restriction r;
list<Env.Frame> cenv,cenv1,cenv3,env2,env,env_1;
DAE.Mod outermod,mods,mods_1,emod_1,mod;
list<SCode.Element> importelts,els,els_1,rest,cdefelts,classextendselts;
list<SCode.Equation> eq1,ieq1,eq1_1,ieq1_1,eq2,ieq2,eq3,ieq3,eq,ieq,initeq2;
list<SCode.AlgorithmSection> alg1,ialg1,alg1_1,ialg1_1,alg2,ialg2,alg3,ialg3,alg,ialg;
Absyn.Path tp_1,tp;
ClassInf.State new_ci_state,ci_state;
list<tuple<SCode.Element, DAE.Mod, Boolean>> compelts1,compelts2,compelts,compelts3;
SCode.Mod emod;
SCode.Element elt;
Env.Cache cache;
InstanceHierarchy ih;
HashTableStringToPath.HashTable ht;
SCode.Variability var;
Prefix.Prefix pre;
SCode.Mod scodeMod;
SCode.Final finalPrefix;
Absyn.Info info;
Option<SCode.Comment> cmt;
/* no further elements to instantiate */
case (cache,env,ih,mod,pre,{},ci_state,className,impl,_) then (cache,env,ih,mod,{},{},{},{},{});
/* instantiate a base class */
case (cache,env,ih,mod,pre,(elt as SCode.EXTENDS(info = info, baseClassPath = tp, modifications = emod)) :: rest,ci_state,className,impl,isPartialInst)
equation
// Debug.fprintln(Flags.INST_TRACE, "EXTENDS: " +& Env.printEnvPathStr(env) +& " el: " +& SCodeDump.unparseElementStr(elt) +& " mods: " +& Mod.printModStr(mod));
//print("EXTENDS: " +& Env.printEnvPathStr(env) +& "/" +& Absyn.pathString(tp) +& "(" +& SCodeDump.printModStr(emod) +& ") outemod: " +& Mod.printModStr(mod) +& "\n");
// adrpo - here we need to check if we don't have recursive extends of the form:
// package Icons
// extends Icons.BaseLibrary;
// model BaseLibrary "Icon for base library"
// end BaseLibrary;
// end Icons;
// if we don't check that, then the compiler enters an infinite loop!
// what we do is removing Icons from extends Icons.BaseLibrary;
tp = Inst.removeSelfReference(className, tp);
//print(className +& "\n");
//print("Type: " +& Absyn.pathString(tp) +& "(" +& SCodeDump.printModStr(emod) +& ")\n");
emod = Inst.chainRedeclares(mod, emod);
// fully qualify modifiers in extends in this environment!
(cache, emod) = fixModifications(cache, env, emod, HashTableStringToPath.emptyHashTable());
// Debug.fprintln(Flags.INST_TRACE, "EXTENDS (FULLY QUAL): " +& Env.printEnvPathStr(env) +& " el: " +& SCodeDump.printModStr(emod));
(cache,(c as SCode.CLASS(name=cn,encapsulatedPrefix=encf,restriction=r)),cenv) = Lookup.lookupClass(cache, env, tp, false);
//print("Found " +& cn +& "\n");
outermod = Mod.lookupModificationP(mod, Absyn.IDENT(cn));
(cache,cenv1,ih,els,eq1,ieq1,alg1,ialg1) = instDerivedClasses(cache,cenv,ih,outermod,pre,c,impl,info);
(cache,tp_1) = Inst.makeFullyQualified(cache,/* adrpo: cenv1?? FIXME */env, tp);
eq1_1 = Util.if_(isPartialInst, {}, eq1);
ieq1_1 = Util.if_(isPartialInst, {}, ieq1);
alg1_1 = Util.if_(isPartialInst, {}, alg1);
ialg1_1 = Util.if_(isPartialInst, {}, ialg1);
cenv3 = Env.openScope(cenv1, encf, SOME(cn), Env.classInfToScopeType(ci_state));
new_ci_state = ClassInf.start(r, Env.getEnvName(cenv3));
/* Add classdefs and imports to env, so e.g. imports from baseclasses found, see Extends5.mo */
(importelts,cdefelts,classextendselts,els_1) = Inst.splitEltsNoComponents(els);
(cenv3,ih) = Inst.addClassdefsToEnv(cenv3,ih,pre,importelts,impl,NONE());
(cenv3,ih) = Inst.addClassdefsToEnv(cenv3,ih,pre,cdefelts,impl,SOME(mod));
els_1 = SCodeUtil.addRedeclareAsElementsToExtends(els_1, SCodeUtil.getRedeclareAsElements(els_1));
(cache,_,ih,mods,compelts1,eq2,ieq2,alg2,ialg2) = instExtendsAndClassExtendsList2(cache,cenv3,ih,outermod,pre,els_1,classextendselts,ci_state,className,impl,isPartialInst)
"recurse to fully flatten extends elements env";
ht = getLocalIdentList(compelts1,HashTableStringToPath.emptyHashTable(),getLocalIdentElementTpl);
ht = getLocalIdentList(cdefelts,ht,getLocalIdentElement);
ht = getLocalIdentList(importelts,ht,getLocalIdentElement);
//tmp = tick(); Debug.traceln("try fix local idents " +& intString(tmp));
(cache,compelts1) = fixLocalIdents(cache, cenv3, compelts1, ht);
(cache,eq1_1) = fixList(cache, cenv3, eq1_1, ht,fixEquation);
(cache,ieq1_1) = fixList(cache, cenv3, ieq1_1, ht,fixEquation);
(cache,alg1_1) = fixList(cache, cenv3, alg1_1, ht,fixAlgorithm);
(cache,ialg1_1) = fixList(cache, cenv3, ialg1_1, ht,fixAlgorithm);
//Debug.traceln("fixed local idents " +& intString(tmp));
(cache,env2,ih,mods_1,compelts2,eq3,ieq3,alg3,ialg3) = instExtendsList(cache,env,ih,mod,pre,rest,ci_state,className,impl,isPartialInst)
"continue with next element in list" ;
/*
corresponding elements. But emod is Absyn.Mod and can not Must merge(mod,emod)
here and then apply the bindings to the be elaborated, because for instance extends
A(x=y) can reference a variable y defined in A and will thus not be found.
On the other hand: A(n=4), n might be a structural parameter that must be set
to instantiate A. How could this be solved? Solution: made new function elab_untyped_mod
which transforms to a Mod, but set the type information to unknown. We can then perform the
merge, and update untyped modifications later (using update_mod), when we are instantiating
the components."
*/
emod_1 = Mod.elabUntypedMod(emod, env2, Prefix.NOPRE());
mods_1 = Mod.merge(mod, mods_1, env2, Prefix.NOPRE());
mods_1 = Mod.merge(mods_1, emod_1, env2, Prefix.NOPRE());
compelts = listAppend(compelts1, compelts2);
(compelts3,mods_1) = updateComponentsAndClassdefs(compelts, mods_1, env2) "update components with new merged modifiers";
eq = List.unionOnTrueList({eq1_1,eq2,eq3},Util.equal);
ieq = List.unionOnTrueList({ieq1_1,ieq2,ieq3},Util.equal);
alg = List.unionOnTrueList({alg1_1,alg2,alg3},Util.equal);
ialg = List.unionOnTrueList({ialg1_1,ialg2,ialg3},Util.equal);
then
(cache,env2,ih,mods_1,compelts3,eq,ieq,alg,ialg);
// base class was not found
case (cache,env,ih,mod,pre,(SCode.EXTENDS(info = info, baseClassPath = tp,modifications = emod) :: rest),ci_state,className,impl,_)
equation
failure((_,c,cenv) = Lookup.lookupClass(cache, env, tp, false));
s = Absyn.pathString(tp);
scope_str = Env.printEnvPathStr(env);
Error.addSourceMessage(Error.LOOKUP_BASECLASS_ERROR, {s,scope_str}, info);
then
fail();
// Extending a component means copying it. It might fail above, try again
case (cache,env,ih,mod,pre,
(elt as SCode.COMPONENT(name = s, attributes =
SCode.ATTR(variability = var),
modifications = scodeMod,
prefixes = SCode.PREFIXES(finalPrefix=finalPrefix),
comment = cmt)) :: rest,
ci_state,className,impl,isPartialInst)
equation
(cache,env_1,ih,mods,compelts2,eq2,initeq2,alg2,ialg2) =
instExtendsList(cache, env, ih, mod, pre, rest, ci_state, className, impl, isPartialInst);
// Filter out non-constants or parameters if partial inst
notConst = not SCode.isConstant(var); // not (SCode.isConstant(var) or SCode.getEvaluateAnnotation(cmt));
// we should always add it as the class that variable represents might contain constants!
compelts2 = Util.if_(notConst and isPartialInst,compelts2,(elt,DAE.NOMOD(),false)::compelts2);
then
(cache,env_1,ih,mods,compelts2,eq2,initeq2,alg2,ialg2);
// Classdefs
case (cache,env,ih,mod,pre,(elt as SCode.CLASS(name = cn)) :: rest,
ci_state,className,impl,isPartialInst)
equation
(cache,env_1,ih,mods,compelts2,eq2,initeq2,alg2,ialg2) =
instExtendsList(cache, env, ih, mod, pre, rest, ci_state, className, impl, isPartialInst);
then
(cache,env_1,ih,mods,((elt,DAE.NOMOD(),false) :: compelts2),eq2,initeq2,alg2,ialg2);
/* instantiate elements that are not extends */
case (cache,env,ih,mod,pre,(elt as SCode.IMPORT(imp = _)) :: rest,ci_state,className,impl,isPartialInst)
equation
(cache,env_1,ih,mods,compelts2,eq2,initeq2,alg2,ialg2) =
instExtendsList(cache,env,ih, mod, pre, rest, ci_state, className, impl, isPartialInst);
then
(cache,env_1,ih,mods,((elt,DAE.NOMOD(),false) :: compelts2),eq2,initeq2,alg2,ialg2);
/* instantiation failed */
case (cache,env,ih,mod,pre,rest,ci_state,className,_,_)
equation
true = Flags.isSet(Flags.FAILTRACE);
Debug.traceln("- Inst.instExtendsList failed on:\n\t" +&
"className: " +& className +& "\n\t" +&
"env: " +& Env.printEnvPathStr(env) +& "\n\t" +&
"mods: " +& Mod.printModStr(mod) +& "\n\t" +&
"elems: " +& stringDelimitList(List.map(rest, SCodeDump.printElementStr), ", ")
);
then
fail();
end matchcontinue;
end instExtendsList;
public function instExtendsAndClassExtendsList "
This function flattens out the inheritance structure of a class.
It takes an SCode.Element list and flattens out the extends nodes and
class extends nodes of that list. The result is a list of components and
lists of equations and algorithms."
input Env.Cache inCache;
input Env.Env inEnv;
input InstanceHierarchy inIH;
input DAE.Mod inMod;
input Prefix.Prefix inPrefix;
input list<SCode.Element> inExtendsElementLst;
input list<SCode.Element> inClassExtendsElementLst;
input ClassInf.State inState;
input String inClassName; // the class name whose elements are getting instantiated.
input Boolean inImpl;
input Boolean isPartialInst;
output Env.Cache outCache;
output Env.Env outEnv;
output InstanceHierarchy outIH;
output DAE.Mod outMod;
output list<tuple<SCode.Element, DAE.Mod>> outTplSCodeElementModLst;
output list<SCode.Equation> outSCodeNormalEquationLst;
output list<SCode.Equation> outSCodeInitialEquationLst;
output list<SCode.AlgorithmSection> outSCodeNormalAlgorithmLst;
output list<SCode.AlgorithmSection> outSCodeInitialAlgorithmLst;
protected
list<tuple<SCode.Element, DAE.Mod, Boolean>> outTplSCodeElementModLstTpl3;
list<SCode.Element> cdefelts,tmpelts;
algorithm
//Debug.fprintln(Flags.DEBUG,"instExtendsAndClassExtendsList: " +& inClassName);
(outCache,outEnv,outIH,outMod,outTplSCodeElementModLstTpl3,outSCodeNormalEquationLst,outSCodeInitialEquationLst,outSCodeNormalAlgorithmLst,outSCodeInitialAlgorithmLst):=
instExtendsAndClassExtendsList2(inCache,inEnv,inIH,inMod,inPrefix,inExtendsElementLst,inClassExtendsElementLst,inState,inClassName,inImpl,isPartialInst);
// Filter out the last boolean in the tuple
outTplSCodeElementModLst := List.map(outTplSCodeElementModLstTpl3, Util.tuple312);
// Create a list of the class definitions, since these can't be properly added in the recursive call
tmpelts := List.map(outTplSCodeElementModLst,Util.tuple21);
(_,cdefelts,_,_) := Inst.splitEltsNoComponents(tmpelts);
// Add the class definitions to the environment
(outEnv,outIH) := Inst.addClassdefsToEnv(outEnv,outIH,inPrefix,cdefelts,inImpl,SOME(outMod));
//Debug.fprintln(Flags.DEBUG,"instExtendsAndClassExtendsList: " +& inClassName +& " done");
end instExtendsAndClassExtendsList;
protected function instExtendsAndClassExtendsList2 "
This function flattens out the inheritance structure of a class.
It takes an SCode.Element list and flattens out the extends nodes and
class extends nodes of that list. The result is a list of components and
lists of equations and algorithms."
input Env.Cache inCache;
input Env.Env inEnv;
input InstanceHierarchy inIH;
input DAE.Mod inMod;
input Prefix.Prefix inPrefix;
input list<SCode.Element> inExtendsElementLst;
input list<SCode.Element> inClassExtendsElementLst;
input ClassInf.State inState;
input String inClassName; // the class name whose elements are getting instantiated.
input Boolean inImpl;
input Boolean isPartialInst;
output Env.Cache outCache;
output Env.Env outEnv;
output InstanceHierarchy outIH;
output DAE.Mod outMod;
output list<tuple<SCode.Element, DAE.Mod, Boolean>> outTplSCodeElementModLst;
output list<SCode.Equation> outSCodeNormalEquationLst;
output list<SCode.Equation> outSCodeInitialEquationLst;
output list<SCode.AlgorithmSection> outSCodeNormalAlgorithmLst;
output list<SCode.AlgorithmSection> outSCodeInitialAlgorithmLst;
algorithm
(outCache,outEnv,outIH,outMod,outTplSCodeElementModLst,outSCodeNormalEquationLst,outSCodeInitialEquationLst,outSCodeNormalAlgorithmLst,outSCodeInitialAlgorithmLst):=
instExtendsList(inCache,inEnv,inIH,inMod,inPrefix,inExtendsElementLst,inState,inClassName,inImpl,isPartialInst);
(outMod,outTplSCodeElementModLst):=instClassExtendsList(inEnv,outMod,inClassExtendsElementLst,outTplSCodeElementModLst);
end instExtendsAndClassExtendsList2;
protected function instClassExtendsList
"Instantiate element nodes of type SCode.CLASS_EXTENDS. This is done by walking
the extended classes and performing the modifications in-place. The old class
will no longer be accessible."
input Env.Env inEnv;
input DAE.Mod inMod;
input list<SCode.Element> inClassExtendsList;
input list<tuple<SCode.Element, DAE.Mod, Boolean>> inTplSCodeElementModLst;
output DAE.Mod outMod;
output list<tuple<SCode.Element, DAE.Mod, Boolean>> outTplSCodeElementModLst;
algorithm
(outMod,outTplSCodeElementModLst) := matchcontinue (inEnv,inMod,inClassExtendsList,inTplSCodeElementModLst)
local
SCode.Element first;
list<SCode.Element> rest;
String name;
list<SCode.Element> els;
list<tuple<SCode.Element, DAE.Mod, Boolean>> compelts;
DAE.Mod emod;
list<String> names;
case (_,emod,{},compelts) then (emod,compelts);
case (_,emod,(first as SCode.CLASS(name=name))::rest,compelts)
equation
(emod,compelts) = instClassExtendsList2(inEnv,emod,name,first,compelts);
(emod,compelts) = instClassExtendsList(inEnv,emod,rest,compelts);
then (emod,compelts);
case (_,_,SCode.CLASS(name=name)::rest,compelts)
equation
true = Flags.isSet(Flags.FAILTRACE);
Debug.traceln("- Inst.instClassExtendsList failed " +& name);
Debug.traceln(" Candidate classes: ");
els = List.map(compelts, Util.tuple31);
names = List.map(els, SCode.elementName);
Debug.traceln(stringDelimitList(names, ","));
then fail();
end matchcontinue;
end instClassExtendsList;
protected function buildClassExtendsName
input String inEnvPath;
input String inClassName;
output String outClassName;
algorithm
outClassName := matchcontinue(inEnvPath, inClassName)
local String ep, cn;
/*
case (ep, cn)
equation
// we already added this environment
0 = System.stringFind(ep, cn);
0 = System.stringFind(cn, "$parent");
// keep the same class name!
then
cn;*/
case (ep, cn)
equation
cn = "$parent" +& "." +& cn +& ".$env." +& ep;
then
cn;
end matchcontinue;
end buildClassExtendsName;
protected function instClassExtendsList2
input Env.Env inEnv;
input DAE.Mod inMod;
input String inName;
input SCode.Element inClassExtendsElt;
input list<tuple<SCode.Element, DAE.Mod, Boolean>> inTplSCodeElementModLst;
output DAE.Mod outMod;
output list<tuple<SCode.Element, DAE.Mod, Boolean>> outTplSCodeElementModLst;
algorithm
(outMod,outTplSCodeElementModLst) := matchcontinue (inEnv,inMod,inName,inClassExtendsElt,inTplSCodeElementModLst)
local
SCode.Element elt,compelt,classExtendsElt;
SCode.Element cl,classExtendsClass;
SCode.ClassDef classDef,classExtendsCdef;
SCode.Partial partialPrefix1,partialPrefix2;
SCode.Encapsulated encapsulatedPrefix1,encapsulatedPrefix2;
SCode.Final finalPrefix1,finalPrefix2;
SCode.Replaceable replaceablePrefix1,replaceablePrefix2;
SCode.Redeclare redecl1,redecl2;
SCode.Restriction restriction1,restriction2;
SCode.Prefixes prefixes1,prefixes2;
SCode.Visibility vis1,vis2;
String name1,name2,env_path;
Option<SCode.ExternalDecl> externalDecl1,externalDecl2;
list<SCode.Annotation> annotationLst1,annotationLst2;
Option<SCode.Comment> comment1,comment2;
list<SCode.Element> els1,els2;
list<SCode.Equation> nEqn1,nEqn2,inEqn1,inEqn2;
list<SCode.AlgorithmSection> nAlg1,nAlg2,inAlg1,inAlg2;
list<SCode.ConstraintSection> inCons1, inCons2;
list<Absyn.NamedArg> clats;
list<tuple<SCode.Element, DAE.Mod, Boolean>> rest;
tuple<SCode.Element, DAE.Mod, Boolean> first;
SCode.Mod mods;
DAE.Mod mod1,emod;
Option<Absyn.ConstrainClass> cc1,cc2;
Absyn.Info info1, info2;
Boolean b;
case (_,emod,name1,classExtendsElt,(cl as SCode.CLASS(name = name2),mod1,b)::rest)
equation
true = name1 ==& name2; // Compare the name before pattern-matching to speed this up
env_path = Absyn.pathString(Env.getEnvName(inEnv));
name2 = buildClassExtendsName(env_path,name2);
SCode.CLASS(_,prefixes2,encapsulatedPrefix2,partialPrefix2,restriction2,SCode.PARTS(els2,nEqn2,inEqn2,nAlg2,inAlg2,inCons2,clats,externalDecl2,annotationLst2,comment2),info2) = cl;
SCode.CLASS(_, prefixes1, encapsulatedPrefix1, partialPrefix1, restriction1, classExtendsCdef, info1) = classExtendsElt;
SCode.CLASS_EXTENDS(_,mods,SCode.PARTS(els1,nEqn1,inEqn1,nAlg1,inAlg1,inCons1,_,externalDecl1,annotationLst1,comment1)) = classExtendsCdef;
classDef = SCode.PARTS(els2,nEqn2,inEqn2,nAlg2,inAlg2,inCons2,clats,externalDecl2,annotationLst2,comment2);
compelt = SCode.CLASS(name2,prefixes2,encapsulatedPrefix2,partialPrefix2,restriction2,classDef,info2);
vis2 = SCode.prefixesVisibility(prefixes2);
elt = SCode.EXTENDS(Absyn.IDENT(name2),vis2,mods,NONE(),info1);
classDef = SCode.PARTS(elt::els1,nEqn1,inEqn1,nAlg1,inAlg1,inCons1,clats,externalDecl1,annotationLst1,comment1);
elt = SCode.CLASS(name1, prefixes1, encapsulatedPrefix1, partialPrefix1, restriction1, classDef, info1);
emod = Mod.renameTopLevelNamedSubMod(emod,name1,name2);
//Debug.traceln("class extends: " +& SCodeDump.unparseElementStr(compelt) +& " " +& SCodeDump.unparseElementStr(elt));
then
(emod,(compelt,mod1,b)::(elt,DAE.NOMOD(),true)::rest);
case (_,emod,name1,classExtendsElt,first::rest)
equation
(emod,rest) = instClassExtendsList2(inEnv,emod,name1,classExtendsElt,rest);
then
(emod,first::rest);
case (_,_,_,_,{})
equation
Debug.traceln("TODO: Make a proper Error message here - Inst.instClassExtendsList2 couldn't find the class to extend");
then
fail();
end matchcontinue;
end instClassExtendsList2;
public function instDerivedClasses
"function: instDerivedClasses
author: PA
This function takes a class definition and returns the
elements and equations and algorithms of the class.
If the class is derived, the class is looked up and the
derived class parts are fetched."
input Env.Cache inCache;
input Env.Env inEnv;
input InstanceHierarchy inIH;
input DAE.Mod inMod;
input Prefix.Prefix inPrefix;
input SCode.Element inClass;
input Boolean inBoolean;
input Absyn.Info info "File information of the extends element";
output Env.Cache outCache;
output Env.Env outEnv1;
output InstanceHierarchy outIH;
output list<SCode.Element> outSCodeElementLst2;
output list<SCode.Equation> outSCodeEquationLst3;
output list<SCode.Equation> outSCodeEquationLst4;
output list<SCode.AlgorithmSection> outSCodeAlgorithmLst5;
output list<SCode.AlgorithmSection> outSCodeAlgorithmLst6;
algorithm
(outCache,outEnv1,outIH,outSCodeElementLst2,outSCodeEquationLst3,outSCodeEquationLst4,outSCodeAlgorithmLst5,outSCodeAlgorithmLst6):=
matchcontinue (inCache,inEnv,inIH,inMod,inPrefix,inClass,inBoolean,info)
local
list<SCode.Element> elt;
list<Env.Frame> env,cenv;
DAE.Mod mod;
list<SCode.Equation> eq,ieq;
list<SCode.AlgorithmSection> alg,ialg;
SCode.Element c;
Absyn.Path tp;
SCode.Mod dmod;
Boolean impl;
Env.Cache cache;
InstanceHierarchy ih;
Option<SCode.Comment> cmt;
list<SCode.Enum> enumLst;
String n,name;
Option<SCode.ExternalDecl> extdecl;
Absyn.Info info;
DAE.Mod daeDMOD;
Prefix.Prefix pre;
case (cache,env,ih,mod,pre,SCode.CLASS(name = name, classDef =
SCode.PARTS(elementLst = elt,
normalEquationLst = eq,initialEquationLst = ieq,
normalAlgorithmLst = alg,initialAlgorithmLst = ialg,
externalDecl = extdecl)),_,info)
equation
/* elt_1 = noImportElements(elt); */
Error.assertionOrAddSourceMessage(Util.isNone(extdecl), Error.EXTENDS_EXTERNAL, {name}, info);
then
(cache,env,ih,elt,eq,ieq,alg,ialg);
case (cache,env,ih,mod,pre,SCode.CLASS(info = info, classDef = SCode.DERIVED(typeSpec = Absyn.TPATH(tp, _),modifications = dmod)),impl, _)
equation
// Debug.fprintln(Flags.INST_TRACE, "DERIVED: " +& Env.printEnvPathStr(env) +& " el: " +& SCodeDump.unparseElementStr(inClass) +& " mods: " +& Mod.printModStr(mod));
(cache, c, cenv) = Lookup.lookupClass(cache, env, tp, true);
// modifiers should be evaluated in the current scope for derived!
//(cache,daeDMOD) = Mod.elabMod(cache, env, ih, pre, dmod, impl, info);
// merge in the class env
//mod = Mod.merge(mod, daeDMOD, cenv, pre);
(cache,env,ih,elt,eq,ieq,alg,ialg) = instDerivedClasses(cache, cenv, ih, mod, pre, c, impl, info)
"Mod.lookup_modification_p(mod, c) => innermod & We have to merge and apply modifications as well!" ;
then
(cache,env,ih,elt,eq,ieq,alg,ialg);
case (cache,env,ih,mod,pre,SCode.CLASS(name=n, classDef = SCode.ENUMERATION(enumLst,cmt), info = info),impl,_)
equation
c = Inst.instEnumeration(n, enumLst, cmt, info);
(cache,env,ih,elt,eq,ieq,alg,ialg) = instDerivedClasses(cache, env, ih, mod, pre, c, impl,info);
then
(cache,env,ih,elt,eq,ieq,alg,ialg);
else
equation
Debug.fprint(Flags.FAILTRACE, "- Inst.instDerivedClasses failed\n");
then
fail();
end matchcontinue;
end instDerivedClasses;
protected function noImportElements
"function: noImportElements
Returns all elements except imports, i.e. filter out import elements."
input list<SCode.Element> inSCodeElementLst;
output list<SCode.Element> outSCodeElementLst;
algorithm
outSCodeElementLst := matchcontinue (inSCodeElementLst)
local
list<SCode.Element> elt,rest;
SCode.Element e;
case {} then {};
case (SCode.IMPORT(imp = _) :: rest)
equation
elt = noImportElements(rest);
then
elt;
case (e :: rest)
equation
elt = noImportElements(rest);
then
(e :: elt);
end matchcontinue;
end noImportElements;
protected function updateComponentsAndClassdefs
"This function takes a list of components and a Mod and returns a list of
components with the modifiers updated. The function is used when flattening
the inheritance structure, resulting in a list of components to insert into
the class definition. For instance
model A
extends B(modifiers)
end A;
will result in a list of components
from B for which modifiers should be applied to."
input list<tuple<SCode.Element, DAE.Mod, Boolean>> inComponents;
input DAE.Mod inMod;
input Env.Env inEnv;
output list<tuple<SCode.Element, DAE.Mod, Boolean>> outComponents;
output DAE.Mod outRestMod;
algorithm
(outComponents, outRestMod) := List.map1Fold(inComponents,
updateComponentsAndClassdefs2, inEnv, inMod);
end updateComponentsAndClassdefs;
protected function updateComponentsAndClassdefs2
input tuple<SCode.Element, DAE.Mod, Boolean> inComponent;
input Env.Env inEnv;
input DAE.Mod inMod;
output tuple<SCode.Element, DAE.Mod, Boolean> outComponent;
output DAE.Mod outRestMod;
algorithm
(outComponent, outRestMod) := matchcontinue(inComponent, inEnv, inMod)
local
SCode.Element comp;
DAE.Mod cmod, cmod2, mod_rest;
String id, el_str, mod_str1, mod_str2;
Boolean b;
case ((comp as SCode.COMPONENT(name = id), cmod, b), _, _)
equation
// Debug.traceln(" comp: " +& id +& " " +& Mod.printModStr(mod));
// take ONLY the modification from the equation if is typed
cmod2 = Mod.lookupCompModificationFromEqu(inMod, id);
// Debug.traceln("\tSpecific mods on comp: " +& Mod.printModStr(cmod2));
cmod = Mod.merge(cmod2, cmod, inEnv, Prefix.NOPRE());
mod_rest = Mod.removeMod(inMod, id);
then
((comp, cmod, b), mod_rest);
case ((SCode.EXTENDS(baseClassPath = _), _, _), _, _)
then (inComponent, inMod);
case ((comp as SCode.IMPORT(imp = _), _, b), _ , _)
then ((comp, DAE.NOMOD(), b), inMod);
case ((comp as SCode.CLASS(name = id, prefixes = SCode.PREFIXES(replaceablePrefix = SCode.REPLACEABLE(_))), _, b), _, _)
equation
DAE.REDECL(_, _, (comp, cmod)::_) = Mod.lookupCompModification(inMod, id);
mod_rest = Mod.removeMod(inMod, id);
comp = SCode.renameElement(comp, id);
then
((comp, cmod, b), mod_rest);
case ((comp as SCode.CLASS(name = id), cmod, b), _, _)
equation
DAE.NOMOD() = Mod.lookupCompModification(inMod, id);
then
((comp, cmod, b), inMod);
// adrpo:
// 2011-01-19 we can have a modifier in the mods here,
// example in Modelica.Media:
// partial package SingleGasNasa
// extends Interfaces.PartialPureSubstance(
// ThermoStates = Choices.IndependentVariables.pT,
// mediumName=data.name,
// substanceNames={data.name},
// singleState=false,
// Temperature(min=200, max=6000, start=500, nominal=500),
// SpecificEnthalpy(start=if referenceChoice==ReferenceEnthalpy.ZeroAt0K then data.H0 else
// if referenceChoice==ReferenceEnthalpy.UserDefined then h_offset else 0, nominal=1.0e5),
// Density(start=10, nominal=10),
// AbsolutePressure(start=10e5, nominal=10e5)); <--- AbsolutePressure is a type and can have modifications!
case ((comp as SCode.CLASS(name = id), _, b), _, _)
equation
cmod = Mod.lookupCompModification(inMod, id);
then
((comp, cmod, b), inMod);
case ((comp,cmod,b),inEnv,inMod)
equation
Debug.fprintln(
Flags.FAILTRACE,
"- InstExtends.updateComponentsAndClassdefs2 failed on:\n" +&
"env = " +& Env.printEnvPathStr(inEnv) +&
"\nmod = " +& Mod.printModStr(inMod) +&
"\ncmod = " +& Mod.printModStr(cmod) +&
"\nbool = " +& Util.if_(b, "true", "false") +& "\n" +&
SCodeDump.printElementStr(comp)
);
then
fail();
end matchcontinue;
end updateComponentsAndClassdefs2;
protected function getLocalIdentList
" Analyzes the elements of a class and fetches a list of components and classdefs,
as well as aliases from imports to paths.
"
input list<Type_A> ielts;
input HashTableStringToPath.HashTable inHt;
input getIdentFn getIdent;
output HashTableStringToPath.HashTable outHt;
replaceable type Type_A subtypeof Any;
partial function getIdentFn
input Type_A inA;
input HashTableStringToPath.HashTable inHt;
output HashTableStringToPath.HashTable outHt;
end getIdentFn;
algorithm
(outHt) := match (ielts,inHt,getIdent)
local
Type_A elt;
HashTableStringToPath.HashTable ht;
list<Type_A> elts;
case ({},ht,getIdent) then ht;
case (elt::elts,ht,getIdent)
equation
ht = getIdent(elt,ht);
ht = getLocalIdentList(elts,ht,getIdent);
then ht;
end match;
end getLocalIdentList;
protected function getLocalIdentElementTpl
" Analyzes the elements of a class and fetches a list of components and classdefs,
as well as aliases from imports to paths.
"
input tuple<SCode.Element,DAE.Mod,Boolean> eltTpl;
input HashTableStringToPath.HashTable ht;
output HashTableStringToPath.HashTable outHt;
algorithm
(outHt) := match (eltTpl,ht)
local
SCode.Element elt;
case ((elt,_,_),ht) then getLocalIdentElement(elt,ht);
end match;
end getLocalIdentElementTpl;
protected function getLocalIdentElement
" Analyzes an element of a class and fetches a list of components and classdefs,
as well as aliases from imports to paths.
"
input SCode.Element elt;
input HashTableStringToPath.HashTable inHt;
output HashTableStringToPath.HashTable outHt;
algorithm
(outHt) := match (elt,inHt)
local
String id;
Absyn.Path p;
HashTableStringToPath.HashTable ht;
case (SCode.COMPONENT(name = id),ht)
equation
ht = BaseHashTable.add((id,Absyn.IDENT(id)), ht);
then ht;
case (SCode.CLASS(name = id),ht)
equation
ht = BaseHashTable.add((id,Absyn.IDENT(id)), ht);
then ht;
case (SCode.IMPORT(imp = Absyn.NAMED_IMPORT(name = id, path = p)),ht)
equation
failure(_ = BaseHashTable.get(id, ht));
ht = BaseHashTable.add((id,p), ht);
then ht;
case (SCode.IMPORT(imp = Absyn.QUAL_IMPORT(path = p)),ht)
equation
id = Absyn.pathLastIdent(p);
failure(_ = BaseHashTable.get(id, ht));
ht = BaseHashTable.add((id,p), ht);
then ht;
// adrpo: 2010-10-07 handle unqualified imports!!! TODO! FIXME! should we just ignore them??
// this fixes bug: #1234 https://openmodelica.org:8443/cb/issue/1234
case (SCode.IMPORT(imp = Absyn.UNQUAL_IMPORT(path = p)),ht)
equation
id = Absyn.pathLastIdent(p);
failure(_ = BaseHashTable.get(id, ht));
ht = BaseHashTable.add((id,p), ht);
then ht;
end match;
end getLocalIdentElement;
protected function fixLocalIdents
" All of the fix functions do the following:
Analyzes the SCode datastructure and replace paths with a new path (from
local lookup or fully qualified in the environment."
input Env.Cache inCache;
input Env.Env inEnv;
input list<tuple<SCode.Element,DAE.Mod,Boolean>> inElts;
input HashTableStringToPath.HashTable inHt;
output Env.Cache outCache;
output list<tuple<SCode.Element,DAE.Mod,Boolean>> outElts;
algorithm
(outCache,outElts) := matchcontinue (inCache,inEnv,inElts,inHt)
local
SCode.Element elt;
DAE.Mod mod;
Boolean b;
Env.Cache cache;
Env.Env env;
HashTableStringToPath.HashTable ht;
list<tuple<SCode.Element,DAE.Mod,Boolean>> elts;
case (cache,env,{},ht) then (cache,{});
case (cache,env,(elt,mod,false)::elts,ht)
equation
(cache,elt) = fixElement(cache,env,elt,ht);
(cache,elts) = fixLocalIdents(cache,env,elts,ht);
then (cache,(elt,mod,true)::elts);
case (cache,env,(elt,mod,true)::elts,ht)
equation
(cache,elt) = fixElement(cache,env,elt,ht);
(cache,elts) = fixLocalIdents(cache,env,elts,ht);
then (cache,(elt,mod,true)::elts);
case (_,env,(elt,mod,b)::elts,_)
equation
Debug.traceln("- InstExtends.fixLocalIdents failed for element:" +&
SCodeDump.unparseElementStr(elt) +& " mods: " +&
Mod.printModStr(mod) +& " class extends:" +&
Util.if_(b, "true", "false") +& " in env: " +& Env.printEnvPathStr(env)
);
then
fail();
end matchcontinue;
end fixLocalIdents;
protected function fixElement
" All of the fix functions do the following:
Analyzes the SCode datastructure and replace paths with a new path (from
local lookup or fully qualified in the environment.
"
input Env.Cache inCache;
input Env.Env inEnv;
input SCode.Element inElt;
input HashTableStringToPath.HashTable inHt;
output Env.Cache outCache;
output SCode.Element outElts;
algorithm
(outCache,outElts) := matchcontinue (inCache,inEnv,inElt,inHt)
local
String id,name,str;
Absyn.InnerOuter innerOuter;
SCode.Prefixes prefixes;
SCode.Partial partialPrefix;
SCode.Encapsulated encapsulatedPrefix;
SCode.Attributes attributes;
Absyn.TypeSpec typeSpec;
SCode.Mod modifications;
Option<SCode.Comment> comment;
Option<Absyn.Exp> condition;
Absyn.Info info;
Option<Absyn.ConstrainClass> cc;
SCode.ClassDef classDef;
SCode.Restriction restriction;
Option<SCode.Annotation> optAnnotation;
Absyn.Path extendsPath;
SCode.Visibility vis;
Absyn.ArrayDim ad;
SCode.Flow fp;
SCode.Stream sp;
SCode.Variability var;
SCode.Parallelism prl;
Absyn.Direction dir;
Env.Cache cache;
Env.Env env;
HashTableStringToPath.HashTable ht;
SCode.Element elt;
case (cache,env,SCode.COMPONENT(name, prefixes, SCode.ATTR(ad, fp, sp, prl, var, dir), typeSpec, modifications, comment, condition, info),ht)
equation
//Debug.fprintln(Flags.DEBUG,"fix comp " +& SCodeDump.printElementStr(elt));
(cache,modifications) = fixModifications(cache,env,modifications,ht);
(cache,typeSpec) = fixTypeSpec(cache,env,typeSpec,ht);
(cache,SOME(ad)) = fixArrayDim(cache, env, SOME(ad), ht);
then
(cache,SCode.COMPONENT(name, prefixes, SCode.ATTR(ad, fp, sp, prl, var, dir), typeSpec, modifications, comment, condition, info));
case (cache,env,SCode.CLASS(name, prefixes, SCode.ENCAPSULATED(), partialPrefix, restriction, classDef, info),ht)
equation
//Debug.fprintln(Flags.DEBUG,"fixClassdef " +& name);
(cache,env) = Builtin.initialEnv(cache);
(cache,classDef) = fixClassdef(cache,env,classDef,ht);
then
(cache,SCode.CLASS(name, prefixes, SCode.ENCAPSULATED(), partialPrefix, restriction, classDef, info));
case (cache,env,SCode.CLASS(name, prefixes, SCode.NOT_ENCAPSULATED(), partialPrefix, restriction, classDef, info),ht)
equation
//Debug.fprintln(Flags.DEBUG,"fixClassdef " +& name +& str);
(cache,classDef) = fixClassdef(cache,env,classDef,ht);
then
(cache,SCode.CLASS(name, prefixes, SCode.NOT_ENCAPSULATED(), partialPrefix, restriction, classDef, info));
case (cache,env,SCode.EXTENDS(extendsPath,vis,modifications,optAnnotation,info),ht)
equation
//Debug.fprintln(Flags.DEBUG,"fix extends " +& SCodeDump.printElementStr(elt));
(cache,extendsPath) = fixPath(cache,env,extendsPath,ht);
(cache,modifications) = fixModifications(cache,env,modifications,ht);
then
(cache,SCode.EXTENDS(extendsPath,vis,modifications,optAnnotation,info));
case (cache,env,SCode.IMPORT(imp = _),ht) then (cache,inElt);
case (cache,env,elt,ht)
equation
Debug.fprintln(Flags.FAILTRACE, "InstExtends.fixElement failed: " +& SCodeDump.printElementStr(elt));
then fail();
end matchcontinue;
end fixElement;
protected function fixClassdef
" All of the fix functions do the following:
Analyzes the SCode datastructure and replace paths with a new path (from
local lookup or fully qualified in the environment."
input Env.Cache inCache;
input Env.Env inEnv;
input SCode.ClassDef inCd;
input HashTableStringToPath.HashTable inHt;
output Env.Cache outCache;
output SCode.ClassDef outCd;
algorithm
(outCache,outCd) := matchcontinue (inCache,inEnv,inCd,inHt)
local
list<SCode.Element> elts;
list<SCode.Equation> ne,ie;
list<SCode.AlgorithmSection> na,ia;
list<SCode.ConstraintSection> nc;
list<Absyn.NamedArg> clats;
Option<SCode.ExternalDecl> ed;
list<SCode.Annotation> ann;
Option<SCode.Comment> c;
Absyn.TypeSpec ts;
SCode.Attributes attr;
String name;
SCode.Mod mod;
Env.Cache cache;
Env.Env env;
HashTableStringToPath.HashTable ht;
SCode.ClassDef cd;
case (cache,env,SCode.PARTS(elts,ne,ie,na,ia,nc,clats,ed,ann,c),ht)
equation
(cache,elts) = fixList(cache,env,elts,ht,fixElement);
(cache,ne) = fixList(cache,env,ne,ht,fixEquation);
(cache,ie) = fixList(cache,env,ie,ht,fixEquation);
(cache,na) = fixList(cache,env,na,ht,fixAlgorithm);
(cache,ia) = fixList(cache,env,ia,ht,fixAlgorithm);
(cache,nc) = fixList(cache,env,nc,ht,fixConstraint);
then (cache,SCode.PARTS(elts,ne,ie,na,ia,nc,clats,ed,ann,c));
case (cache,env,SCode.CLASS_EXTENDS(name,mod,SCode.PARTS(elts,ne,ie,na,ia,nc,clats,ed,ann,c)),ht)
equation
(cache,mod) = fixModifications(cache,env,mod,ht);
(cache,elts) = fixList(cache,env,elts,ht,fixElement);
(cache,ne) = fixList(cache,env,ne,ht,fixEquation);
(cache,ie) = fixList(cache,env,ie,ht,fixEquation);
(cache,na) = fixList(cache,env,na,ht,fixAlgorithm);
(cache,ia) = fixList(cache,env,ia,ht,fixAlgorithm);
(cache,nc) = fixList(cache,env,nc,ht,fixConstraint);
then (cache,SCode.CLASS_EXTENDS(name,mod,SCode.PARTS(elts,ne,ie,na,ia,nc,clats,ed,ann,c)));
case (cache,env,SCode.DERIVED(ts,mod,attr,c),ht)
equation
(cache,ts) = fixTypeSpec(cache,env,ts,ht);
(cache,mod) = fixModifications(cache,env,mod,ht);
then (cache,SCode.DERIVED(ts,mod,attr,c));
case (cache,env,cd as SCode.ENUMERATION(comment = _),ht) then (cache,cd);
case (cache,env,cd as SCode.OVERLOAD(comment = _),ht) then (cache,cd);
case (cache,env,cd as SCode.PDER(comment = _),ht) then (cache,cd);
case (cache,env,cd,ht)
equation
Debug.fprintln(Flags.FAILTRACE, "InstExtends.fixClassDef failed: " +& SCodeDump.printClassdefStr(cd));
then
fail();
end matchcontinue;
end fixClassdef;
protected function fixEquation
" All of the fix functions do the following: