-
Notifications
You must be signed in to change notification settings - Fork 299
/
Lookup.mo
3385 lines (3079 loc) · 127 KB
/
Lookup.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 Lookup
" file: Lookup.mo
package: Lookup
description: Scoping rules
This module is responsible for the lookup mechanism in Modelica.
It is responsible for looking up classes, variables, etc. in the
environment Env by following the lookup rules.
The most important functions are:
lookupClass - to find a class
lookupType - to find types (e.g. functions, types, etc.)
lookupVar - to find a variable in the instance hierarchy."
public import Absyn;
public import ClassInf;
public import DAE;
public import FCore;
public import HashTableStringToPath;
public import InstTypes;
public import SCode;
public import Util;
public import Types;
protected import BaseHashTable;
protected import Builtin;
protected import ComponentReference;
protected import Config;
protected import Connect;
protected import ConnectionGraph;
protected import Debug;
protected import Error;
protected import Expression;
protected import ExpressionDump;
protected import Flags;
protected import FGraph;
protected import FNode;
protected import Inst;
protected import InstExtends;
protected import InstFunction;
protected import InstUtil;
protected import InnerOuter;
protected import List;
protected import Mod;
protected import Prefix;
protected import PrefixUtil;
protected import Static;
protected import UnitAbsyn;
protected import SCodeDump;
protected import ErrorExt;
protected import ValuesUtil;
protected import Values;
/* - Lookup functions
These functions look up class and variable names in the environment.
The names are supplied as a path, and if the path is qualified, a
variable named as the first part of the path is searched for, and the
name is looked for in it.
*/
public function lookupType
" This function finds a specified type in the environment.
If it finds a function instead, this will be implicitly instantiated
and lookup will start over.
"
input FCore.Cache inCache;
input FCore.Graph inEnv "environment to search in";
input Absyn.Path inPath "type to look for";
input Option<SourceInfo> msg "Messaage flag, SOME() outputs lookup error messages";
output FCore.Cache outCache;
output DAE.Type outType "the found type";
output FCore.Graph outEnv "The environment the type was found in";
algorithm
(outCache,outType,outEnv):=
matchcontinue (inCache,inEnv,inPath,msg)
local
DAE.Type t;
FCore.Graph env_1,env,env_2;
Absyn.Path path;
SCode.Element c;
String classname,scope;
FCore.Cache cache;
SourceInfo info;
// Special handling for Connections.isRoot
case (cache,env,Absyn.QUALIFIED("Connections", Absyn.IDENT("isRoot")),_)
equation
t = DAE.T_FUNCTION({DAE.FUNCARG("x", DAE.T_ANYTYPE_DEFAULT, DAE.C_VAR(), DAE.NON_PARALLEL(), NONE())}, DAE.T_BOOL_DEFAULT, DAE.FUNCTION_ATTRIBUTES_DEFAULT, DAE.emptyTypeSource);
then
(cache, t, env);
// Special handling for MultiBody 3.x rooted() operator
case (cache,env,Absyn.IDENT("rooted"),_)
equation
t = DAE.T_FUNCTION({DAE.FUNCARG("x", DAE.T_ANYTYPE_DEFAULT, DAE.C_VAR(), DAE.NON_PARALLEL(), NONE())}, DAE.T_BOOL_DEFAULT, DAE.FUNCTION_ATTRIBUTES_DEFAULT, DAE.emptyTypeSource);
then
(cache, t, env);
// Special handling for Connections.uniqueRootIndices
case (cache,env,Absyn.QUALIFIED("Connections", Absyn.IDENT("uniqueRootIndices")),_)
equation
t = DAE.T_FUNCTION({
DAE.FUNCARG("roots", DAE.T_ARRAY(DAE.T_ANYTYPE_DEFAULT, {DAE.DIM_UNKNOWN()}, DAE.emptyTypeSource), DAE.C_VAR(), DAE.NON_PARALLEL(), NONE()),
DAE.FUNCARG("nodes", DAE.T_ARRAY(DAE.T_ANYTYPE_DEFAULT, {DAE.DIM_UNKNOWN()}, DAE.emptyTypeSource), DAE.C_VAR(), DAE.NON_PARALLEL(), NONE()),
DAE.FUNCARG("message", DAE.T_STRING_DEFAULT, DAE.C_VAR(), DAE.NON_PARALLEL(), NONE())},
DAE.T_ARRAY(DAE.T_INTEGER_DEFAULT, {DAE.DIM_UNKNOWN()}, DAE.emptyTypeSource),
DAE.FUNCTION_ATTRIBUTES_DEFAULT, DAE.emptyTypeSource);
then
(cache, t, env);
// For simple names
case (cache,env,(path as Absyn.IDENT()),_)
equation
(cache,t,env_1) = lookupTypeInEnv(cache,env,path);
then
(cache,t,env_1);
// Special classes (function, record, metarecord, external object)
case (cache,env,path,_)
equation
(cache,c,env_1) = lookupClass(cache,env,path);
(cache,t,env_2) = lookupType2(cache,env_1,path,c);
then
(cache,t,env_2);
// Error for type not found
case (_,env,path,SOME(info))
equation
classname = Absyn.pathString(path);
classname = stringAppend(classname," (its type) ");
scope = FGraph.printGraphPathStr(env);
Error.addSourceMessage(Error.LOOKUP_ERROR, {classname,scope}, info);
then
fail();
end matchcontinue;
end lookupType;
protected function lookupType2
" This function handles the case when we looked up a class, but need to
check if it is function, record, metarecord, etc.
"
input FCore.Cache inCache;
input FCore.Graph inEnv "environment to search in";
input Absyn.Path inPath "type to look for";
input SCode.Element inClass "the class lookupType found";
output FCore.Cache outCache;
output DAE.Type outType "the found type";
output FCore.Graph outEnv "The environment the type was found in";
algorithm
(outCache,outType,outEnv) := matchcontinue (inCache,inEnv,inPath,inClass)
local
DAE.Type t;
FCore.Graph env_1,env_2,env_3;
Absyn.Path path;
SCode.Element c;
String id;
FCore.Cache cache;
SCode.Restriction r;
list<DAE.Var> types;
list<String> names;
ClassInf.State ci_state;
SCode.Encapsulated encflag;
DAE.TypeSource ts;
DAE.Mod mod;
// Record constructors
case (cache,env_1,_,c as SCode.CLASS(restriction=SCode.R_RECORD(_)))
equation
(cache,env_1,t) = buildRecordType(cache,env_1,c);
then
(cache,t,env_1);
// lookup of an enumeration type
case (cache,env_1,path,c as SCode.CLASS(name=id,encapsulatedPrefix=encflag,restriction=r as SCode.R_ENUMERATION()))
equation
env_2 = FGraph.openScope(env_1, encflag, id, SOME(FCore.CLASS_SCOPE()));
ci_state = ClassInf.start(r, FGraph.getGraphName(env_2));
// fprintln(Flags.INST_TRACE, "LOOKUP TYPE ICD: " + FGraph.printGraphPathStr(env_1) + " path:" + Absyn.pathString(path));
mod = Mod.getClassModifier(env_1, id);
(cache,env_3,_,_,_,_,_,types,_,_,_,_) =
Inst.instClassIn(
cache,env_2,InnerOuter.emptyInstHierarchy,UnitAbsyn.noStore,
mod, Prefix.NOPRE(),
ci_state, c, SCode.PUBLIC(), {}, false, InstTypes.INNER_CALL(),
ConnectionGraph.EMPTY, Connect.emptySet, NONE());
// build names
(_,names) = SCode.getClassComponents(c);
Types.checkEnumDuplicateLiterals(names, c.info);
// generate the enumeration type
path = FGraph.getGraphName(env_3);
ts = Types.mkTypeSource(SOME(path));
t = DAE.T_ENUMERATION(NONE(), path, names, types, {}, ts);
env_3 = FGraph.mkTypeNode(env_3, id, t);
then
(cache,t,env_3);
// Real Type
case (cache,env_1,_,SCode.CLASS(restriction=SCode.R_TYPE(),classDef=SCode.DERIVED(typeSpec=Absyn.TPATH(path=Absyn.IDENT(name="Real")))))
equation
t = DAE.T_REAL({}, DAE.emptyTypeSource);
then
(cache,t,env_1);
// Integer Type
case (cache,env_1,_,SCode.CLASS(restriction=SCode.R_TYPE(),classDef=SCode.DERIVED(typeSpec=Absyn.TPATH(path=Absyn.IDENT(name="Integer")))))
equation
t = DAE.T_INTEGER({}, DAE.emptyTypeSource);
then
(cache,t,env_1);
// Boolean Type
case (cache,env_1,_,SCode.CLASS(restriction=SCode.R_TYPE(),classDef=SCode.DERIVED(typeSpec=Absyn.TPATH(path=Absyn.IDENT(name="Boolean")))))
equation
t = DAE.T_BOOL({}, DAE.emptyTypeSource);
then
(cache,t,env_1);
// String Type
case (cache,env_1,_,SCode.CLASS(restriction=SCode.R_TYPE(),classDef=SCode.DERIVED(typeSpec=Absyn.TPATH(path=Absyn.IDENT(name="String")))))
equation
t = DAE.T_STRING({}, DAE.emptyTypeSource);
then
(cache,t,env_1);
// Metamodelica extension, Uniontypes
case (cache,env_1,_,c as SCode.CLASS(restriction=SCode.R_METARECORD()))
equation
(cache,env_2,t) = buildMetaRecordType(cache,env_1,c);
then
(cache,t,env_2);
// Classes that are external objects. Implicitly instantiate to get type
case (cache,env_1,_,c)
equation
// fprintln(Flags.INST_TRACE, "LOOKUP TYPE ICD: " + FGraph.printGraphPathStr(env_1) + " path:" + Absyn.pathString(path));
true = SCode.classIsExternalObject(c);
(cache,env_1,_,_,_,_,_,_,_,_) = Inst.instClass(
cache,env_1,InnerOuter.emptyInstHierarchy, UnitAbsyn.noStore,
DAE.NOMOD(), Prefix.NOPRE(), c,
{}, false, InstTypes.TOP_CALL(), ConnectionGraph.EMPTY, Connect.emptySet);
SCode.CLASS(name=id) = c;
(env_1, _) = FGraph.stripLastScopeRef(env_1);
(cache,t,env_2) = lookupTypeInEnv(cache,env_1,Absyn.IDENT(id));
then
(cache,t,env_2);
// If we find a class definition that is a function or external function
// with the same name then we implicitly instantiate that function, look
// up the type.
case (cache,env_1,_,c as SCode.CLASS(name = id,restriction=SCode.R_FUNCTION(_)))
equation
// fprintln(Flags.INST_TRACE, "LOOKUP TYPE ICD: " + FGraph.printGraphPathStr(env_1) + " path:" + Absyn.pathString(path));
(cache,env_2,_) =
InstFunction.implicitFunctionTypeInstantiation(cache,env_1,InnerOuter.emptyInstHierarchy,c);
(cache,t,env_3) = lookupTypeInEnv(cache,env_2,Absyn.IDENT(id));
then
(cache,t,env_3);
end matchcontinue;
end lookupType2;
public function lookupMetarecordsRecursive
"Takes a list of paths to Uniontypes. Use this list to create a list of T_METARECORD.
The function is guarded against recursive definitions by accumulating all paths it
starts to traverse."
input FCore.Cache inCache;
input FCore.Graph inEnv;
input list<Absyn.Path> inUniontypePaths;
output FCore.Cache outCache;
output list<DAE.Type> outMetarecordTypes;
algorithm
(outCache,_,outMetarecordTypes) := lookupMetarecordsRecursive2(inCache, inEnv, inUniontypePaths, HashTableStringToPath.emptyHashTable(), {});
end lookupMetarecordsRecursive;
protected function lookupMetarecordsRecursive2
"Takes a list of paths to Uniontypes. Use this list to create a list of T_METARECORD.
The function is guarded against recursive definitions by accumulating all paths it
starts to traverse."
input FCore.Cache inCache;
input FCore.Graph inEnv;
input list<Absyn.Path> inUniontypePaths;
input HashTableStringToPath.HashTable inHt;
input list<DAE.Type> inAcc;
output FCore.Cache outCache;
output HashTableStringToPath.HashTable outHt;
output list<DAE.Type> outMetarecordTypes;
algorithm
(outCache,outHt,outMetarecordTypes) := match (inCache, inEnv, inUniontypePaths, inHt, inAcc)
local
FCore.Cache cache;
FCore.Graph env;
Absyn.Path first;
list<Absyn.Path> rest;
HashTableStringToPath.HashTable ht;
list<DAE.Type> acc;
case (cache, _, {}, ht, acc) then (cache, ht, acc);
case (cache, env, first::rest, ht, acc)
equation
(cache,ht,acc) = lookupMetarecordsRecursive3(cache, env, first, Absyn.pathString(first), ht, acc);
(cache,ht,acc) = lookupMetarecordsRecursive2(cache, env, rest, ht, acc);
then (cache, ht, acc);
end match;
end lookupMetarecordsRecursive2;
protected function lookupMetarecordsRecursive3
"Takes a list of paths to Uniontypes. Use this list to create a list of T_METARECORD.
The function is guarded against recursive definitions by accumulating all paths it
starts to traverse."
input FCore.Cache inCache;
input FCore.Graph inEnv;
input Absyn.Path path;
input String str;
input HashTableStringToPath.HashTable inHt;
input list<DAE.Type> inAcc;
output FCore.Cache outCache;
output HashTableStringToPath.HashTable outHt;
output list<DAE.Type> outMetarecordTypes;
algorithm
(outCache,outHt,outMetarecordTypes) := matchcontinue (inCache, inEnv, path, str, inHt, inAcc)
local
FCore.Cache cache;
FCore.Graph env;
list<Absyn.Path> uniontypePaths;
list<DAE.Type> uniontypeTypes;
DAE.Type ty;
list<DAE.Type> acc;
HashTableStringToPath.HashTable ht;
case (cache, _, _, _, ht, acc)
equation
_ = BaseHashTable.get(str, ht);
then (cache, ht, acc);
case (cache, env, _, _, ht, acc)
equation
ht = BaseHashTable.add((str,path),ht);
(cache, ty, _) = lookupType(cache, env, path, SOME(Absyn.dummyInfo));
acc = ty::acc;
uniontypeTypes = Types.getAllInnerTypesOfType(ty, Types.uniontypeFilter);
uniontypePaths = List.flatten(List.map(uniontypeTypes, Types.getUniontypePaths));
(cache, ht, acc) = lookupMetarecordsRecursive2(cache, env, uniontypePaths, ht, acc);
then (cache,ht,acc);
end matchcontinue;
end lookupMetarecordsRecursive3;
public function lookupClass "Tries to find a specified class in an environment"
input FCore.Cache inCache;
input FCore.Graph inEnv "Where to look";
input Absyn.Path inPath "Path of the class to look for";
input Option<SourceInfo> inInfo = NONE();
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv;
algorithm
(outCache,outClass,outEnv) := matchcontinue(inCache, inEnv, inPath)
local
Absyn.Path p, id;
String name, className;
FGraph.Graph cenv;
/*
case (_,_,_,_)
equation
print("CL: " + Absyn.pathString(inPath) + " env: " + FGraph.printGraphPathStr(inEnv) + " msg: " + boolString(msg) + "\n");
then
fail();*/
// see if the first path ident is a component
// we might have a component reference, i.e. world.gravityAcceleration
case (_,_,Absyn.QUALIFIED(name, id))
equation
ErrorExt.setCheckpoint("functionViaComponentRef2");
(outCache,_,_,_,_,_,_,cenv,_) = lookupVar(inCache, inEnv, ComponentReference.makeCrefIdent(name, DAE.T_UNKNOWN_DEFAULT, {}));
(outCache, outClass, outEnv) = lookupClass(outCache, cenv, id);
ErrorExt.rollBack("functionViaComponentRef2");
then
(outCache,outClass,outEnv);
case (_,_,Absyn.QUALIFIED(_, _))
equation
ErrorExt.rollBack("functionViaComponentRef2");
then
fail();
// normal case
case (_, _, _)
equation
(outCache,outClass,outEnv,_) = lookupClass1(inCache, inEnv, inPath, {}, Util.makeStatefulBoolean(false), inInfo);
// print("CLRET: " + SCode.elementName(outClass) + " outenv: " + FGraph.printGraphPathStr(outEnv) + "\n");
then
(outCache,outClass,outEnv);
end matchcontinue;
// print("Lookup C2: " + " outenv: " + FGraph.printGraphPathStr(outEnv) + "\n");
end lookupClass;
public function lookupClassIdent "Like lookupClass, but takes a String as ident for input (avoids Absyn.IDENT() creation)"
input FCore.Cache inCache;
input FCore.Graph inEnv "Where to look";
input String ident;
input Option<SourceInfo> inInfo = NONE();
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv;
algorithm
(outCache,outClass,outEnv) := lookupClassInEnv(inCache, inEnv, ident, {}, Util.makeStatefulBoolean(false), inInfo);
end lookupClassIdent;
protected function lookupClass1 "help function to lookupClass, does all the work."
input FCore.Cache inCache;
input FCore.Graph inEnv;
input Absyn.Path inPath "The path of the class to lookup";
input FCore.Scope inPrevFrames "Environment in reverse order. Contains frames we previously had in the scope. Will be looked up instead of the environment in order to avoid infinite recursion.";
input Util.StatefulBoolean inState "If true, we have found a class. If the path was qualified, we should no longer look in previous frames of the environment";
input Option<SourceInfo> inInfo;
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv "The environment in which the class was found (not the environment inside the class)";
output FCore.Scope outPrevFrames;
protected
Integer errors = Error.getNumErrorMessages();
SourceInfo info;
algorithm
try
(outCache, outClass, outEnv, outPrevFrames) := lookupClass2(inCache, inEnv,
inPath, inPrevFrames, inState, inInfo);
else
if isSome(inInfo) and errors == Error.getNumErrorMessages() then
Error.addSourceMessage(Error.LOOKUP_ERROR,
{Absyn.pathString(inPath), FGraph.printGraphPathStr(inEnv)},
Util.getOption(inInfo));
end if;
fail();
end try;
end lookupClass1;
protected function lookupClass2 "help function to lookupClass, does all the work."
input FCore.Cache inCache;
input FCore.Graph inEnv;
input Absyn.Path inPath "The path of the class to lookup";
input FCore.Scope inPrevFrames "Environment in reverse order. Contains frames we previously had in the scope. Will be looked up instead of the environment in order to avoid infinite recursion.";
input Util.StatefulBoolean inState "If true, we have found a class. If the path was qualified, we should no longer look in previous frames of the environment";
input Option<SourceInfo> inInfo;
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv "The environment in which the class was found (not the environment inside the class)";
output FCore.Scope outPrevFrames;
algorithm
(outCache,outClass,outEnv,outPrevFrames) := match (inCache,inEnv,inPath,inPrevFrames)
local
FCore.Node f;
FCore.Ref r;
FCore.Cache cache;
SCode.Element c;
FCore.Graph env,env_1,env_2,fs;
FCore.Scope prevFrames;
Absyn.Path path,p,scope;
String id,pack;
Option<FCore.Ref> optFrame;
// Fully qualified names are looked up in top scope. With previous frames remembered.
case (cache,env,Absyn.FULLYQUALIFIED(path),{})
equation
r::prevFrames = listReverse(FGraph.currentScope(env));
Util.setStatefulBoolean(inState,true);
env = FGraph.setScope(env, {r});
(cache,c,env_1,prevFrames) = lookupClass2(cache,env,path,prevFrames,inState,inInfo);
then
(cache,c,env_1,prevFrames);
// Qualified names are handled in a special function in order to avoid infinite recursion.
case (cache,env,(Absyn.QUALIFIED(name = pack,path = path)),prevFrames)
equation
(optFrame,prevFrames) = lookupPrevFrames(pack,prevFrames);
(cache,c,env_2,prevFrames) = lookupClassQualified(cache,env,pack,path,optFrame,prevFrames,inState,inInfo);
then
(cache,c,env_2,prevFrames);
// Simple names
case (cache,env,Absyn.IDENT(name = id),prevFrames)
equation
(cache,c,env_1,prevFrames) = lookupClassInEnv(cache, env, id, prevFrames, inState, inInfo);
then
(cache,c,env_1,prevFrames);
/*
case (cache,env,p,_,_,_)
equation
Debug.traceln("lookupClass failed " + Absyn.pathString(p) + " " + FGraph.printGraphPathStr(env));
then fail();
*/
end match;
end lookupClass2;
protected function lookupClassQualified
input FCore.Cache inCache;
input FCore.Graph inEnv;
input String id;
input Absyn.Path path;
input Option<FCore.Ref> inOptFrame;
input FCore.Scope inPrevFrames "Environment in reverse order. Contains frames we previously had in the scope. Will be looked up instead of the environment in order to avoid infinite recursion.";
input Util.StatefulBoolean inState "If true, we have found a class. If the path was qualified, we should no longer look in previous frames of the environment";
input Option<SourceInfo> inInfo;
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv "The environment in which the class was found (not the environment inside the class)";
output FCore.Scope outPrevFrames;
algorithm
(outCache,outClass,outEnv,outPrevFrames) := match (inCache,inEnv,id,path,inOptFrame,inPrevFrames)
local
SCode.Element c;
Absyn.Path scope;
FCore.Cache cache;
FCore.Graph env;
FCore.Scope prevFrames;
FCore.Ref frame;
Option<FCore.Ref> optFrame;
// Qualified names first identifier cached in previous frames
case (cache,env,_,_,SOME(frame),prevFrames)
equation
Util.setStatefulBoolean(inState,true);
env = FGraph.pushScopeRef(env, frame);
(cache,c,env,prevFrames) = lookupClass2(cache,env,path,prevFrames,inState,inInfo);
then
(cache,c,env,prevFrames);
// Qualified names in package and non-package
case (cache,env,_,_,NONE(),_)
equation
(cache,c,env,prevFrames) = lookupClassInEnv(cache,env,id,{},inState,inInfo);
(optFrame,prevFrames) = lookupPrevFrames(id,prevFrames);
(cache,c,env,prevFrames) = lookupClassQualified2(cache,env,path,c,optFrame,prevFrames,inState,inInfo);
then
(cache,c,env,prevFrames);
end match;
end lookupClassQualified;
protected function lookupClassQualified2
input FCore.Cache inCache;
input FCore.Graph inEnv;
input Absyn.Path path;
input SCode.Element inC;
input Option<FCore.Ref> optFrame;
input FCore.Scope inPrevFrames "Environment in reverse order. Contains frames we previously had in the scope. Will be looked up instead of the environment in order to avoid infinite recursion.";
input Util.StatefulBoolean inState "If true, we have found a class. If the path was qualified, we should no longer look in previous frames of the environment";
input Option<SourceInfo> inInfo;
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv "The environment in which the class was found (not the environment inside the class)";
output FCore.Scope outPrevFrames;
algorithm
(outCache,outClass,outEnv,outPrevFrames) := matchcontinue (inCache,inEnv,path,inC,optFrame,inPrevFrames)
local
FCore.Cache cache;
FCore.Graph env;
FCore.Scope prevFrames;
FCore.Ref frame;
SCode.Restriction restr;
ClassInf.State ci_state;
SCode.Encapsulated encflag;
String id;
SCode.Element c;
FCore.Ref r;
DAE.Mod mod;
case (cache,env,_,_,SOME(frame),prevFrames)
equation
env = FGraph.pushScopeRef(env, frame);
(cache,c,env,prevFrames) = lookupClass2(cache,env,path,prevFrames,inState,inInfo);
// fprintln(Flags.INST_TRACE, "LOOKUP CLASS QUALIFIED FRAME: " + FGraph.printGraphPathStr(env) + " path: " + Absyn.pathString(path) + " class: " + SCodeDump.shortElementStr(c));
then (cache,c,env,prevFrames);
// class is an instance of a component
case (cache,env,_,SCode.CLASS(name=id),NONE(),_)
equation
r = FNode.child(FGraph.lastScopeRef(env), id);
FCore.CL(status = FCore.CLS_INSTANCE(_)) = FNode.refData(r);
// fetch the env
(cache, env) = Inst.getCachedInstance(cache, env, id, r);
(cache,c,env,prevFrames) = lookupClass2(cache,env,path,{},inState,inInfo);
then (cache,c,env,prevFrames);
case (cache,env,_,SCode.CLASS(name=id,encapsulatedPrefix=encflag,restriction=restr),NONE(),_)
equation
env = FGraph.openScope(env, encflag, id, FGraph.restrictionToScopeType(restr));
ci_state = ClassInf.start(restr, FGraph.getGraphName(env));
// fprintln(Flags.INST_TRACE, "LOOKUP CLASS QUALIFIED PARTIALICD: " + FGraph.printGraphPathStr(env) + " path: " + Absyn.pathString(path) + " class: " + SCodeDump.shortElementStr(c));
mod = Mod.getClassModifier(inEnv, id);
(cache,env,_,_,_) =
Inst.partialInstClassIn(
cache,env,InnerOuter.emptyInstHierarchy,
mod, Prefix.NOPRE(),
ci_state, inC, SCode.PUBLIC(), {}, 0);
checkPartialScope(env, inEnv, cache, inInfo);
(cache,c,env,prevFrames) = lookupClass2(cache,env,path,{},inState,inInfo);
then (cache,c,env,prevFrames);
end matchcontinue;
end lookupClassQualified2;
protected function checkPartialScope
input FCore.Graph inEnv;
input FCore.Graph inParentEnv;
input FCore.Cache inCache;
input Option<SourceInfo> inInfo;
protected
SCode.Element el;
Prefix.Prefix pre;
String name, pre_str, cc_str;
SourceInfo cls_info, pre_info, info;
algorithm
if isSome(inInfo) and FGraph.isPartialScope(inEnv) and
Config.languageStandardAtLeast(Config.LanguageStandard.'3.2') then
FCore.N(data = FCore.CL(e = el, pre = pre)) :=
FNode.fromRef(FGraph.lastScopeRef(inEnv));
name := SCode.elementName(el);
if FGraph.graphPrefixOf(inParentEnv, inEnv) and not
PrefixUtil.isNoPrefix(pre) then
pre_str := PrefixUtil.printPrefixStr(pre);
cls_info := SCode.elementInfo(el);
pre_info := PrefixUtil.getPrefixInfo(pre);
cc_str := getConstrainingClass(el, FGraph.stripLastScopeRef(inEnv), inCache);
Error.addMultiSourceMessage(Error.USE_OF_PARTIAL_CLASS,
{pre_str, name, cc_str}, {cls_info, pre_info});
fail();
else
SOME(info) := inInfo;
Error.addSourceMessage(Error.LOOKUP_IN_PARTIAL_CLASS, {name}, info);
// We should fail here, but the MSL 3.2.1 contains such errors. So just
// print an error and continue anyway for now.
end if;
end if;
end checkPartialScope;
protected function getConstrainingClass
input SCode.Element inClass;
input FCore.Graph inEnv;
input FCore.Cache inCache;
output String outPath;
algorithm
outPath := matchcontinue inClass
local
Absyn.Path cc_path;
Absyn.TypeSpec ts;
SCode.Element el;
FCore.Graph env;
case SCode.CLASS(prefixes = SCode.PREFIXES(replaceablePrefix =
SCode.REPLACEABLE(cc = SOME(SCode.CONSTRAINCLASS(constrainingClass = cc_path)))))
then Absyn.pathString(cc_path);
case SCode.CLASS(classDef = SCode.DERIVED(typeSpec = ts))
algorithm
(_, el, env) := lookupClass(inCache, inEnv, Absyn.typeSpecPath(ts));
then
getConstrainingClass(el, env, inCache);
else FGraph.printGraphPathStr(inEnv) + "." + SCode.elementName(inClass);
end matchcontinue;
end getConstrainingClass;
protected function lookupPrevFrames
input String id;
input FCore.Scope inPrevFrames;
output Option<FCore.Ref> outFrame;
output FCore.Scope outPrevFrames;
algorithm
(outFrame,outPrevFrames) := matchcontinue (id,inPrevFrames)
local
String sid;
FCore.Scope prevFrames;
FCore.Ref ref;
case (_, ref::prevFrames)
equation
false = FNode.isRefTop(ref);
sid = FNode.refName(ref);
true = id == sid;
then
(SOME(ref),prevFrames);
else (NONE(), {});
end matchcontinue;
end lookupPrevFrames;
protected function lookupQualifiedImportedVarInFrame
"author: PA
Looking up variables (constants) imported using qualified imports,
i.e. import Modelica.Constants.PI;"
input list<Absyn.Import> inImports;
input SCode.Ident ident;
output DAE.ComponentRef outCref;
algorithm
(outCref) := matchcontinue (inImports,ident)
local
String id;
list<Absyn.Import> rest;
Absyn.Path path;
// For imported simple name, e.g. A, not possible to assert sub-path package
case (Absyn.QUAL_IMPORT(path = path) :: _, _)
equation
id = Absyn.pathLastIdent(path);
true = id == ident;
then ComponentReference.pathToCref(path);
// Named imports, e.g. import A = B.C;
case (Absyn.NAMED_IMPORT(name = id,path = path) :: _, _)
equation
true = id == ident;
then ComponentReference.pathToCref(path);
// Check next frame.
case (_ :: rest, _) then lookupQualifiedImportedVarInFrame(rest, ident);
end matchcontinue;
end lookupQualifiedImportedVarInFrame;
protected function moreLookupUnqualifiedImportedVarInFrame
"Helper function for lookup_unqualified_imported_var_in_frame. Returns
true if there are unqualified imports that matches a sought constant."
input FCore.Cache inCache;
input list<Absyn.Import> inImports;
input FCore.Graph inEnv;
input SCode.Ident inIdent;
output FCore.Cache outCache;
output Boolean outBoolean;
algorithm
(outCache,outBoolean) := matchcontinue (inCache,inImports,inEnv,inIdent)
local
FCore.Ref f;
String ident;
Boolean res;
FCore.Graph env;
FCore.Scope prevFrames;
list<Absyn.Import> rest;
FCore.Cache cache;
DAE.ComponentRef cref;
Absyn.Path path;
case (cache,Absyn.UNQUAL_IMPORT(path = path) :: _,env,ident)
equation
f::prevFrames = listReverse(FGraph.currentScope(env));
cref = ComponentReference.pathToCref(path);
cref = ComponentReference.crefPrependIdent(cref,ident,{},DAE.T_UNKNOWN_DEFAULT);
env = FGraph.setScope(env, {f});
(cache,_,_,_,_,_,_,_,_) = lookupVarInPackages(cache,env,cref,prevFrames,Util.makeStatefulBoolean(false));
then
(cache,true);
// look into the parent scope
case (cache,(_ :: rest),env,ident)
equation
(cache, res) = moreLookupUnqualifiedImportedVarInFrame(cache, rest, env, ident);
then
(cache, res);
// we reached the end, no more lookup
case (cache,{},_,_) then (cache, false);
end matchcontinue;
end moreLookupUnqualifiedImportedVarInFrame;
protected function lookupUnqualifiedImportedVarInFrame "Find a variable from an unqualified import locally in a frame"
input FCore.Cache inCache;
input list<Absyn.Import> inImports;
input FCore.Graph inEnv;
input SCode.Ident inIdent;
output FCore.Cache outCache;
output FCore.Graph outClassEnv;
output DAE.Attributes outAttributes;
output DAE.Type outType;
output DAE.Binding outBinding;
output Option<DAE.Const> constOfForIteratorRange "SOME(constant-ness) of the range if this is a for iterator, NONE() if this is not a for iterator";
output Boolean outBoolean;
output InstTypes.SplicedExpData splicedExpData;
output FCore.Graph outComponentEnv;
output String name;
algorithm
(outCache,outClassEnv,outAttributes,outType,outBinding,constOfForIteratorRange,outBoolean,splicedExpData,outComponentEnv,name):=
matchcontinue (inCache,inImports,inEnv,inIdent)
local
FCore.Ref f;
DAE.ComponentRef cref;
String ident;
Boolean more,unique;
FCore.Graph env,classEnv,componentEnv,env2;
FCore.Scope prevFrames;
DAE.Attributes attr;
DAE.Type ty;
DAE.Binding bind;
list<Absyn.Import> rest;
FCore.Cache cache;
Absyn.Path path;
Option<DAE.Const> cnstForRange;
// unique
case (cache,Absyn.UNQUAL_IMPORT(path = path) :: rest,env,ident)
equation
f::prevFrames = listReverse(FGraph.currentScope(env));
cref = ComponentReference.pathToCref(path);
cref = ComponentReference.crefPrependIdent(cref,ident,{},DAE.T_UNKNOWN_DEFAULT);
env2 = FGraph.setScope(env, {f});
(cache,classEnv,attr,ty,bind,cnstForRange,splicedExpData,componentEnv,name) = lookupVarInPackages(cache,env2,cref,prevFrames,Util.makeStatefulBoolean(false));
(cache,more) = moreLookupUnqualifiedImportedVarInFrame(cache, rest, env, ident);
unique = boolNot(more);
then
(cache,classEnv,attr,ty,bind,cnstForRange,unique,splicedExpData,componentEnv,name);
// search in the parent scopes
case (cache,_ :: rest,env,ident)
equation
(cache,classEnv,attr,ty,bind,cnstForRange,unique,splicedExpData,componentEnv,name) = lookupUnqualifiedImportedVarInFrame(cache, rest, env, ident);
then
(cache,classEnv,attr,ty,bind,cnstForRange,unique,splicedExpData,componentEnv,name);
end matchcontinue;
end lookupUnqualifiedImportedVarInFrame;
protected function lookupQualifiedImportedClassInFrame
"Helper function to lookupQualifiedImportedClassInEnv."
input FCore.Cache inCache;
input list<Absyn.Import> inImport;
input FCore.Graph inEnv;
input SCode.Ident inIdent;
input Util.StatefulBoolean inState;
input Option<SourceInfo> inInfo;
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv;
output FCore.Scope outPrevFrames;
algorithm
(outCache,outClass,outEnv,outPrevFrames) := matchcontinue (inCache,inImport,inEnv,inIdent,inState)
local
FCore.Node fr;
FCore.Ref r;
SCode.Element c;
FCore.Graph env_1,env;
FCore.Scope prevFrames;
String id,ident;
list<Absyn.Import> rest;
Absyn.Path path;
FCore.Cache cache;
case (cache,Absyn.QUAL_IMPORT(path = Absyn.IDENT(name = id)) :: _,env,ident,_)
equation
true = id == ident "For imported paths A, not possible to assert sub-path package";
Util.setStatefulBoolean(inState,true);
r::prevFrames = listReverse(FGraph.currentScope(env));
env = FGraph.setScope(env, {r});
(cache,c,env_1,prevFrames) = lookupClassInEnv(cache,env,id,prevFrames,Util.makeStatefulBoolean(false),inInfo);
then
(cache,c,env_1,prevFrames);
case (cache,Absyn.QUAL_IMPORT(path = path) :: _,env,ident,_)
equation
id = Absyn.pathLastIdent(path) "For imported path A.B.C, assert A.B is package" ;
true = id == ident;
Util.setStatefulBoolean(inState,true);
r::prevFrames = listReverse(FGraph.currentScope(env));
env = FGraph.setScope(env, {r});
// strippath = Absyn.stripLast(path);
// (cache,c2,env_1,_) = lookupClass2(cache,{fr},strippath,prevFrames,Util.makeStatefulBoolean(false),true);
(cache,c,env_1,prevFrames) = lookupClass2(cache,env,path,prevFrames,Util.makeStatefulBoolean(false),inInfo);
then
(cache,c,env_1,prevFrames);
case (cache,Absyn.NAMED_IMPORT(name = id,path = path) :: _,env,ident,_)
equation
true = id == ident "Named imports";
Util.setStatefulBoolean(inState,true);
r::prevFrames = listReverse(FGraph.currentScope(env));
env = FGraph.setScope(env, {r});
// strippath = Absyn.stripLast(path);
// Debug.traceln("named import " + id + " is " + Absyn.pathString(path));
// (cache,c2,env_1,prevFrames) = lookupClass2(cache,{fr},strippath,prevFrames,Util.makeStatefulBoolean(false),true);
(cache,c,env_1,prevFrames) = lookupClass2(cache,env,path,prevFrames,Util.makeStatefulBoolean(false),inInfo);
then
(cache,c,env_1,prevFrames);
case (cache,_ :: rest,env,ident,_)
equation
(cache,c,env_1,prevFrames) = lookupQualifiedImportedClassInFrame(cache,rest,env,ident,inState,inInfo);
then
(cache,c,env_1,prevFrames);
end matchcontinue;
end lookupQualifiedImportedClassInFrame;
protected function moreLookupUnqualifiedImportedClassInFrame
"Helper function for lookupUnqualifiedImportedClassInFrame"
input FCore.Cache inCache;
input list<Absyn.Import> inImports;
input FCore.Graph inEnv;
input SCode.Ident inIdent;
output FCore.Cache outCache;
output Boolean outBoolean;
algorithm
(outCache,outBoolean) := matchcontinue (inCache,inImports,inEnv,inIdent)
local
FCore.Node fr,f;
SCode.Element c;
String id,ident;
SCode.Encapsulated encflag;
Boolean res;
SCode.Restriction restr;
FCore.Graph env_1,env2,env;
ClassInf.State ci_state;
Absyn.Path path;
Absyn.Ident firstIdent;
list<Absyn.Import> rest;
FCore.Cache cache;
FCore.Ref r;
DAE.Mod mod;
// Not found, instantiate
case (cache,Absyn.UNQUAL_IMPORT(path = path) :: _,env,ident)
equation
env = FGraph.topScope(env);
(cache,(c as SCode.CLASS(name=id,encapsulatedPrefix=encflag,restriction=restr)),env_1) = lookupClass(cache, env, path);
env2 = FGraph.openScope(env_1, encflag, id, FGraph.restrictionToScopeType(restr));
ci_state = ClassInf.start(restr, FGraph.getGraphName(env2));
// fprintln(Flags.INST_TRACE, "LOOKUP MORE UNQUALIFIED IMPORTED ICD: " + FGraph.printGraphPathStr(env) + "." + ident);
mod = Mod.getClassModifier(env_1, id);
(cache, env, _,_,_) = Inst.partialInstClassIn(cache, env2, InnerOuter.emptyInstHierarchy, mod, Prefix.NOPRE(), ci_state, c, SCode.PUBLIC(), {}, 0);
r = FGraph.lastScopeRef(env);
env = FGraph.setScope(env, {r});
(cache,_,_) = lookupClass(cache, env, Absyn.IDENT(ident));
then
(cache, true);
// Look in the parent scope
case (cache,_ :: rest,env,ident)
equation
(cache, res) = moreLookupUnqualifiedImportedClassInFrame(cache, rest, env, ident);
then
(cache, res);
case (cache,{},_,_) then (cache,false);
end matchcontinue;
end moreLookupUnqualifiedImportedClassInFrame;
protected function lookupUnqualifiedImportedClassInFrame
"Finds a class from an unqualified import locally in a frame"
input FCore.Cache inCache;
input list<Absyn.Import> inImports;
input FCore.Graph inEnv;
input SCode.Ident inIdent;
input Option<SourceInfo> inInfo;
output FCore.Cache outCache;
output SCode.Element outClass;
output FCore.Graph outEnv;
output FCore.Scope outPrevFrames;
output Boolean outBoolean;
algorithm
(outCache,outClass,outEnv,outPrevFrames,outBoolean) := matchcontinue (inCache,inImports,inEnv,inIdent)
local
FCore.Node fr;
FCore.Ref r;
SCode.Element c,c_1;
String id,ident;
SCode.Encapsulated encflag;
Boolean more,unique;