GCC Code Coverage Report

Directory: ../
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 96.0% 359 / 0 / 374
Functions: 100.0% 33 / 0 / 33
Branches: 64.7% 494 / 0 / 764
src/typechecker/FunctionManager.cpp
Line Branch Exec Source
1 // Copyright (c) 2021-2026 ChilliBits. All rights reserved.
2
3 #include "FunctionManager.h"
4
5 #include <algorithm>
6 #include <limits>
7
8 #include <ast/ASTNodes.h>
9 #include <exception/SemanticError.h>
10 #include <model/GenericType.h>
11 #include <symboltablebuilder/Scope.h>
12 #include <symboltablebuilder/SymbolTableBuilder.h>
13 #include <typechecker/TypeChecker.h>
14 #include <typechecker/TypeMatcher.h>
15 #include <util/CodeLoc.h>
16 #include <util/Concurrency.h>
17 #include <util/CustomHashFunctions.h>
18
19 namespace spice::compiler {
20
21 // Static member initialization
22 std::unordered_map<uint64_t, Function *> FunctionManager::lookupCache = {};
23 size_t FunctionManager::lookupCacheHits = 0;
24 size_t FunctionManager::lookupCacheMisses = 0;
25
26 46977 Function *FunctionManager::insert(Scope *insertScope, const Function &baseFunction, std::vector<Function *> *nodeFunctionList) {
27 // Open a new manifestation list for the function definition
28
3/6
✓ Branch 2 → 3 taken 46977 times.
✗ Branch 2 → 49 not taken.
✓ Branch 3 → 4 taken 46977 times.
✗ Branch 3 → 46 not taken.
✓ Branch 4 → 5 taken 46977 times.
✗ Branch 4 → 44 not taken.
 46977 const std::string fctId = baseFunction.name + ":" + baseFunction.declNode->codeLoc.toPrettyLineAndColumn();
29
1/2
✓ Branch 8 → 9 taken 46977 times.
✗ Branch 8 → 50 not taken.
 46977 insertScope->functions.emplace(fctId, FunctionManifestationList());
30
31 // Collect substantiations
32 46977 std::vector<Function> manifestations;
33
1/2
✓ Branch 10 → 11 taken 46977 times.
✗ Branch 10 → 54 not taken.
 46977 substantiateOptionalParams(baseFunction, manifestations);
34
1/2
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 14 taken 46977 times.
 46977 assert(!manifestations.empty());
35
36 // Save substantiations in declaration node
37 46977 Function *manifestationPtr = nullptr;
38
2/2
✓ Branch 32 → 16 taken 49511 times.
✓ Branch 32 → 33 taken 46975 times.
 143463 for (const Function &manifestation : manifestations) {
39
2/2
✓ Branch 18 → 19 taken 49509 times.
✓ Branch 18 → 53 taken 2 times.
 49511 manifestationPtr = insertSubstantiation(insertScope, manifestation, baseFunction.declNode);
40
1/2
✗ Branch 19 → 20 not taken.
✓ Branch 19 → 21 taken 49509 times.
 49509 assert(manifestationPtr != nullptr);
41
1/2
✓ Branch 21 → 22 taken 49509 times.
✗ Branch 21 → 23 not taken.
 49509 if (nodeFunctionList)
42
1/2
✓ Branch 22 → 23 taken 49509 times.
✗ Branch 22 → 53 not taken.
 49509 nodeFunctionList->push_back(manifestationPtr);
43 }
44
45
1/2
✗ Branch 33 → 34 not taken.
✓ Branch 33 → 35 taken 46975 times.
 46975 if (!nodeFunctionList)
46 ✗ return manifestationPtr;
47
48
1/2
✗ Branch 36 → 37 not taken.
✓ Branch 36 → 38 taken 46975 times.
 46975 assert(!nodeFunctionList->empty());
49 46975 return nodeFunctionList->front();
50 46979 }
51
52 /**
53 * Create definite functions from ambiguous ones, in regard to optional arguments.
54 *
55 * Example:
56 * int testFunc(string, int?, double?)
57 * gets
58 * int testFunc(string)
59 * int testFunc(string, int)
60 * int testFunc(string, int, double)
61 *
62 * This method also accepts functions, that are already definite, but does nothing to them.
63 *
64 * @param baseFunction Ambiguous base function
65 * @param manifestations Vector to store the definite manifestations
66 * @return True, if there were optional arguments found
67 */
68 46977 void FunctionManager::substantiateOptionalParams(const Function &baseFunction, std::vector<Function> &manifestations) {
69 // Handle the case of no parameters -> simply return the base function
70
2/2
✓ Branch 3 → 4 taken 11897 times.
✓ Branch 3 → 6 taken 35080 times.
 46977 if (baseFunction.paramList.empty()) {
71
1/2
✓ Branch 4 → 5 taken 11897 times.
✗ Branch 4 → 47 not taken.
 11897 manifestations.push_back(baseFunction);
72 11897 return;
73 }
74
75 35080 ParamList currentFunctionParamTypes;
76
1/2
✓ Branch 7 → 8 taken 35080 times.
✗ Branch 7 → 45 not taken.
 35080 currentFunctionParamTypes.reserve(baseFunction.paramList.size());
77 35080 bool metFirstOptionalParam = false;
78
1/2
✓ Branch 8 → 9 taken 35080 times.
✗ Branch 8 → 45 not taken.
 35080 Function manifestation = baseFunction;
79
80 // Loop over all parameters
81
2/2
✓ Branch 32 → 11 taken 52352 times.
✓ Branch 32 → 33 taken 35080 times.
 122512 for (const auto &[qualType, isOptional] : baseFunction.paramList) {
82 // Check if we have a mandatory parameter
83
2/2
✓ Branch 13 → 14 taken 49818 times.
✓ Branch 13 → 16 taken 2534 times.
 52352 if (!isOptional) {
84
1/2
✓ Branch 14 → 15 taken 49818 times.
✗ Branch 14 → 40 not taken.
 49818 currentFunctionParamTypes.push_back({qualType, /*optional=*/false});
85 49818 continue;
86 }
87
88 // Add substantiation without the optional parameter
89
2/2
✓ Branch 16 → 17 taken 2411 times.
✓ Branch 16 → 20 taken 123 times.
 2534 if (!metFirstOptionalParam) {
90
1/2
✓ Branch 17 → 18 taken 2411 times.
✗ Branch 17 → 42 not taken.
 2411 manifestation.paramList = currentFunctionParamTypes;
91
1/2
✓ Branch 18 → 19 taken 2411 times.
✗ Branch 18 → 42 not taken.
 2411 manifestations.push_back(manifestation);
92 // Now we cannot accept mandatory parameters anymore
93 2411 metFirstOptionalParam = true;
94 }
95
96 // Add substantiation with the optional parameter
97
1/2
✓ Branch 20 → 21 taken 2534 times.
✗ Branch 20 → 41 not taken.
 2534 currentFunctionParamTypes.push_back({qualType, /*optional=*/false});
98
1/2
✓ Branch 21 → 22 taken 2534 times.
✗ Branch 21 → 42 not taken.
 2534 manifestation.paramList = currentFunctionParamTypes;
99
1/2
✓ Branch 22 → 23 taken 2534 times.
✗ Branch 22 → 42 not taken.
 2534 manifestations.push_back(manifestation);
100 }
101
102 // Ensure at least once manifestation
103
2/2
✓ Branch 34 → 35 taken 32669 times.
✓ Branch 34 → 36 taken 2411 times.
 35080 if (manifestations.empty())
104
1/2
✓ Branch 35 → 36 taken 32669 times.
✗ Branch 35 → 43 not taken.
 32669 manifestations.push_back(baseFunction);
105 35080 }
106
107 7 Function FunctionManager::createMainFunction(SymbolTableEntry *entry, const QualTypeList &paramTypes, ASTNode *declNode) {
108 7 ParamList paramList;
109
2/2
✓ Branch 16 → 4 taken 2 times.
✓ Branch 16 → 17 taken 7 times.
 16 for (const QualType &paramType : paramTypes)
110
1/2
✓ Branch 6 → 7 taken 2 times.
✗ Branch 6 → 33 not taken.
 2 paramList.push_back({paramType, false});
111
5/10
✓ Branch 19 → 20 taken 7 times.
✗ Branch 19 → 45 not taken.
✓ Branch 20 → 21 taken 7 times.
✗ Branch 20 → 42 not taken.
✓ Branch 21 → 22 taken 7 times.
✗ Branch 21 → 41 not taken.
✓ Branch 22 → 23 taken 7 times.
✗ Branch 22 → 40 not taken.
✓ Branch 24 → 25 taken 7 times.
✗ Branch 24 → 35 not taken.
 21 return {MAIN_FUNCTION_NAME, entry, QualType(TY_DYN), QualType(TY_INT), paramList, {}, declNode};
112 7 }
113
114 /**
115 * Search all manifestation lists of the given scope for a function with the given signature
116 *
117 * @param scope Scope to search in
118 * @param signature Signature to search for
119 * @return Found function or nullptr
120 */
121 14333 Function *FunctionManager::findManifestationBySignature(Scope *scope, const std::string &signature) {
122
5/8
✓ Branch 2 → 3 taken 14333 times.
✗ Branch 2 → 19 not taken.
✓ Branch 3 → 4 taken 14333 times.
✗ Branch 3 → 19 not taken.
✓ Branch 4 → 5 taken 14333 times.
✗ Branch 4 → 19 not taken.
✓ Branch 15 → 6 taken 294707 times.
✓ Branch 15 → 16 taken 12994 times.
 307701 for (auto &manifestations : scope->functions | std::views::values)
123
3/4
✓ Branch 7 → 8 taken 294707 times.
✗ Branch 7 → 18 not taken.
✓ Branch 10 → 11 taken 1339 times.
✓ Branch 10 → 13 taken 293368 times.
 294707 if (const auto it = manifestations.find(signature); it != manifestations.end())
124 1339 return &it->second;
125 12994 return nullptr;
126 }
127
128 62505 Function *FunctionManager::insertSubstantiation(Scope *insertScope, const Function &newManifestation, const ASTNode *declNode) {
129
2/4
✓ Branch 2 → 3 taken 62505 times.
✗ Branch 2 → 70 not taken.
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 62505 times.
 62505 assert(newManifestation.hasSubstantiatedParams());
130
131
1/2
✓ Branch 5 → 6 taken 62505 times.
✗ Branch 5 → 70 not taken.
 62505 const std::string signature = newManifestation.getSignature(true, true, false, true);
132
133 // Check if the function exists already
134
5/8
✓ Branch 6 → 7 taken 62505 times.
✗ Branch 6 → 59 not taken.
✓ Branch 7 → 8 taken 62505 times.
✗ Branch 7 → 59 not taken.
✓ Branch 8 → 9 taken 62505 times.
✗ Branch 8 → 59 not taken.
✓ Branch 30 → 10 taken 1030917 times.
✓ Branch 30 → 31 taken 62503 times.
 1093420 for (const auto &manifestations : insertScope->functions | std::views::values) {
135
3/4
✓ Branch 11 → 12 taken 1030917 times.
✗ Branch 11 → 59 not taken.
✓ Branch 12 → 13 taken 2 times.
✓ Branch 12 → 28 taken 1030915 times.
 1030917 if (manifestations.contains(signature)) {
136
2/2
✓ Branch 16 → 17 taken 1 time.
✓ Branch 16 → 18 taken 1 time.
 2 const SemanticErrorType errorType = newManifestation.isFunction() ? FUNCTION_DECLARED_TWICE : PROCEDURE_DECLARED_TWICE;
137
4/8
✓ Branch 20 → 21 taken 2 times.
✗ Branch 20 → 53 not taken.
✓ Branch 21 → 22 taken 2 times.
✗ Branch 21 → 51 not taken.
✓ Branch 22 → 23 taken 2 times.
✗ Branch 22 → 49 not taken.
✓ Branch 23 → 24 taken 2 times.
✗ Branch 23 → 47 not taken.
 2 throw SemanticError(declNode, errorType, "'" + newManifestation.getSignature(true, false) + "' is declared twice");
138 }
139 }
140
141 // Retrieve the matching manifestation list of the scope
142
3/6
✓ Branch 31 → 32 taken 62503 times.
✗ Branch 31 → 65 not taken.
✓ Branch 32 → 33 taken 62503 times.
✗ Branch 32 → 62 not taken.
✓ Branch 33 → 34 taken 62503 times.
✗ Branch 33 → 60 not taken.
 62503 const std::string fctId = newManifestation.name + ":" + declNode->codeLoc.toPrettyLineAndColumn();
143
2/4
✓ Branch 36 → 37 taken 62503 times.
✗ Branch 36 → 66 not taken.
✗ Branch 37 → 38 not taken.
✓ Branch 37 → 39 taken 62503 times.
 62503 assert(insertScope->functions.contains(fctId));
144
1/2
✓ Branch 39 → 40 taken 62503 times.
✗ Branch 39 → 66 not taken.
 62503 FunctionManifestationList &manifestationList = insertScope->functions.at(fctId);
145
146 // Add substantiated function
147
1/2
✓ Branch 40 → 41 taken 62503 times.
✗ Branch 40 → 66 not taken.
 62503 manifestationList.emplace(signature, newManifestation);
148
1/2
✓ Branch 41 → 42 taken 62503 times.
✗ Branch 41 → 66 not taken.
 125006 return &manifestationList.at(signature);
149 62505 }
150
151 /**
152 * Checks if a function exists by matching it, but not setting it to used
153 *
154 * @param matchScope Scope to match against
155 * @param reqName Function name requirement
156 * @param reqThisType This type requirement
157 * @param reqArgs Argument requirement
158 * @param strictQualifierMatching Match argument and this type qualifiers strictly
159 * @return Found function or nullptr
160 */
161 45750 const Function *FunctionManager::lookup(Scope *matchScope, const std::string &reqName, const QualType &reqThisType,
162 const ArgList &reqArgs, bool strictQualifierMatching) {
163
2/4
✓ Branch 2 → 3 taken 45750 times.
✗ Branch 2 → 66 not taken.
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 45750 times.
 45750 assert(reqThisType.isOneOf({TY_DYN, TY_STRUCT}));
164
165 // Unlike match(), lookup() is also called from the IR generator (e.g. to find a copy ctor), so it can run on multiple
166 // threads at once and has to guard the process-wide lookup machinery.
167
1/2
✓ Branch 5 → 6 taken 45750 times.
✗ Branch 5 → 78 not taken.
 45750 const ConditionalLock lock(symbolRegistryMutex);
168
169 // Do cache lookup
170 45750 const uint64_t cacheKey = getCacheKey(matchScope, reqName, reqThisType, reqArgs, {});
171
3/4
✓ Branch 9 → 10 taken 45750 times.
✗ Branch 9 → 67 not taken.
✓ Branch 12 → 13 taken 9917 times.
✓ Branch 12 → 15 taken 35833 times.
 45750 if (const auto it = lookupCache.find(cacheKey); it != lookupCache.end()) {
172 9917 lookupCacheHits++;
173 9917 return it->second;
174 }
175 35833 lookupCacheMisses++;
176
177 12144 const auto pred = [&](const Arg &arg) { return arg.first.hasAnyGenericParts(); };
178
4/8
✓ Branch 15 → 16 taken 35833 times.
✗ Branch 15 → 76 not taken.
✓ Branch 16 → 17 taken 35833 times.
✗ Branch 16 → 20 not taken.
✓ Branch 17 → 18 taken 35833 times.
✗ Branch 17 → 76 not taken.
✓ Branch 18 → 19 taken 35833 times.
✗ Branch 18 → 20 not taken.
 35833 const bool requestedFullySubstantiated = !reqThisType.hasAnyGenericParts() && std::ranges::none_of(reqArgs, pred);
179
180 // Loop over function registry to find functions, that match the requirements of the call
181 35833 std::vector<const Function *> matches;
182
2/2
✓ Branch 55 → 23 taken 263303 times.
✓ Branch 55 → 56 taken 35833 times.
 299136 for (const auto &[defCodeLocStr, manifestations] : matchScope->functions) {
183
2/2
✓ Branch 52 → 28 taken 305898 times.
✓ Branch 52 → 53 taken 116933 times.
 422831 for (const auto &[signature, presetFunction] : manifestations) {
184
2/4
✓ Branch 31 → 32 taken 305898 times.
✗ Branch 31 → 71 not taken.
✗ Branch 32 → 33 not taken.
✓ Branch 32 → 34 taken 305898 times.
 305898 assert(presetFunction.hasSubstantiatedParams()); // No optional params are allowed at this point
185
186 // - search for concrete fct: Only match against fully substantiated versions to prevent double matching of a function
187 // - search for generic fct: Only match against generic preset functions
188
3/4
✓ Branch 34 → 35 taken 305898 times.
✗ Branch 34 → 71 not taken.
✓ Branch 35 → 36 taken 127560 times.
✓ Branch 35 → 37 taken 178338 times.
 305898 if (presetFunction.isFullySubstantiated() != requestedFullySubstantiated)
189 159528 continue;
190
191 // Copy the function to be able to substantiate types
192
1/2
✓ Branch 37 → 38 taken 178338 times.
✗ Branch 37 → 71 not taken.
 178338 Function candidate = presetFunction;
193
194 // Create empty type mapping
195 178338 TypeMapping &typeMapping = candidate.typeMapping;
196
197 178338 bool forceSubstantiation = false;
198
1/2
✓ Branch 38 → 39 taken 178338 times.
✗ Branch 38 → 69 not taken.
 178338 const MatchResult matchResult = matchManifestation(candidate, matchScope, reqName, reqThisType, reqArgs, typeMapping,
199 strictQualifierMatching, forceSubstantiation, nullptr);
200
2/2
✓ Branch 39 → 40 taken 134894 times.
✓ Branch 39 → 41 taken 43444 times.
 178338 if (matchResult == MatchResult::SKIP_FUNCTION)
201 134894 break; // Leave the whole function
202
2/2
✓ Branch 41 → 42 taken 31968 times.
✓ Branch 41 → 43 taken 11476 times.
 43444 if (matchResult == MatchResult::SKIP_MANIFESTATION)
203 31968 continue; // Leave this manifestation and try the next one
204
205 // Add to matches
206
3/6
✓ Branch 43 → 44 taken 11476 times.
✗ Branch 43 → 68 not taken.
✓ Branch 44 → 45 taken 11476 times.
✗ Branch 44 → 68 not taken.
✓ Branch 45 → 46 taken 11476 times.
✗ Branch 45 → 68 not taken.
 11476 matches.push_back(&matchScope->functions.at(defCodeLocStr).at(signature));
207
208 11476 break; // Leave the whole manifestation list to not double-match the manifestation
209
2/2
✓ Branch 48 → 49 taken 31968 times.
✓ Branch 48 → 50 taken 146370 times.
 178338 }
210 }
211
212 // Return the very match or a nullptr
213
2/2
✓ Branch 57 → 58 taken 11476 times.
✓ Branch 57 → 60 taken 24357 times.
 35833 return !matches.empty() ? matches.front() : nullptr;
214 45750 }
215
216 /**
217 * Check if there is a function in the scope, fulfilling all given requirements and if found, return it.
218 * If more than one function matches the requirement, an error gets thrown.
219 *
220 * @param matchScope Scope to match against
221 * @param reqName Function name requirement
222 * @param reqThisType This type requirement
223 * @param reqArgs Argument requirement
224 * @param templateTypeHints Template type requirement
225 * @param strictQualifierMatching Match argument and this type qualifiers strictly
226 * @param callNode Call AST node for printing error messages
227 * @return Matched function or nullptr
228 */
229 541741 Function *FunctionManager::match(Scope *matchScope, const std::string &reqName, const QualType &reqThisType,
230 const ArgList &reqArgs, const QualTypeList &templateTypeHints, bool strictQualifierMatching,
231 const ASTNode *callNode) {
232
2/4
✓ Branch 2 → 3 taken 541741 times.
✗ Branch 2 → 182 not taken.
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 541741 times.
 541741 assert(reqThisType.isOneOf({TY_DYN, TY_STRUCT, TY_INTERFACE}));
233
234 // Do cache lookup
235 541741 const uint64_t cacheKey = getCacheKey(matchScope, reqName, reqThisType, reqArgs, templateTypeHints);
236
3/4
✓ Branch 6 → 7 taken 541741 times.
✗ Branch 6 → 183 not taken.
✓ Branch 9 → 10 taken 67270 times.
✓ Branch 9 → 12 taken 474471 times.
 541741 if (const auto it = lookupCache.find(cacheKey); it != lookupCache.end()) {
237 67270 lookupCacheHits++;
238 67270 return it->second;
239 }
240 474471 lookupCacheMisses++;
241
242 // Loop over function registry to find functions, that match the requirements of the call
243 474471 std::vector<Function *> matches;
244
2/2
✓ Branch 141 → 14 taken 5372768 times.
✓ Branch 141 → 142 taken 474470 times.
 5847238 for (auto &[fctId, manifestations] : matchScope->functions) {
245
2/2
✓ Branch 138 → 19 taken 5517579 times.
✓ Branch 138 → 139 taken 210845 times.
 5728424 for (const auto &[signature, presetFunction] : manifestations) {
246
2/4
✓ Branch 22 → 23 taken 5517579 times.
✗ Branch 22 → 205 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 25 taken 5517579 times.
 5517579 assert(presetFunction.hasSubstantiatedParams()); // No optional params are allowed at this point
247
248 // Skip generic and newly inserted substantiations to prevent double matching of a function
249
6/8
✓ Branch 25 → 26 taken 5517579 times.
✗ Branch 25 → 205 not taken.
✓ Branch 26 → 27 taken 5376891 times.
✓ Branch 26 → 28 taken 140688 times.
✗ Branch 27 → 28 not taken.
✓ Branch 27 → 29 taken 5376891 times.
✓ Branch 30 → 31 taken 140688 times.
✓ Branch 30 → 32 taken 5376891 times.
 5517579 if (presetFunction.isGenericSubstantiation() || presetFunction.isNewlyInserted)
250 355656 continue;
251
252 // Copy the function to be able to substantiate types
253
1/2
✓ Branch 32 → 33 taken 5376891 times.
✗ Branch 32 → 205 not taken.
 5376891 Function candidate = presetFunction;
254
255 // Prepare type mapping, based on the given initial type mapping
256 5376891 TypeMapping &typeMapping = candidate.typeMapping;
257 5376891 typeMapping.clear();
258
2/2
✓ Branch 46 → 35 taken 60146 times.
✓ Branch 46 → 47 taken 5376891 times.
 5437037 for (size_t i = 0; i < std::min(templateTypeHints.size(), candidate.templateTypes.size()); i++) {
259 // Skip template slots that are not generic (anymore). The default members of an already-concrete struct
260 // manifestation carry the concrete types in their template type list, and only generic types have a sub type
261 // usable as a mapping key here - getSubType() would assert on e.g. a primitive or a 'heap byte*'.
262
1/2
✓ Branch 35 → 36 taken 60146 times.
✗ Branch 35 → 203 not taken.
 60146 const GenericType &candidateTemplateType = candidate.templateTypes.at(i);
263
3/4
✓ Branch 36 → 37 taken 60146 times.
✗ Branch 36 → 203 not taken.
✓ Branch 37 → 38 taken 597 times.
✓ Branch 37 → 39 taken 59549 times.
 60146 if (!candidateTemplateType.is(TY_GENERIC))
264 597 continue;
265
1/2
✓ Branch 39 → 40 taken 59549 times.
✗ Branch 39 → 203 not taken.
 59549 const std::string &typeName = candidateTemplateType.getSubType();
266
1/2
✓ Branch 40 → 41 taken 59549 times.
✗ Branch 40 → 203 not taken.
 59549 const QualType &templateType = templateTypeHints.at(i);
267
1/2
✓ Branch 41 → 42 taken 59549 times.
✗ Branch 41 → 203 not taken.
 59549 typeMapping.emplace(typeName, templateType);
268 }
269
270 5376891 bool forceSubstantiation = false;
271
2/2
✓ Branch 47 → 48 taken 5376890 times.
✓ Branch 47 → 203 taken 1 time.
 5376891 const MatchResult matchResult = matchManifestation(candidate, matchScope, reqName, reqThisType, reqArgs, typeMapping,
272 strictQualifierMatching, forceSubstantiation, callNode);
273
2/2
✓ Branch 48 → 49 taken 5147589 times.
✓ Branch 48 → 50 taken 229301 times.
 5376890 if (matchResult == MatchResult::SKIP_FUNCTION)
274 5147589 break; // Leave the whole function
275
2/2
✓ Branch 50 → 51 taken 194539 times.
✓ Branch 50 → 52 taken 34762 times.
 229301 if (matchResult == MatchResult::SKIP_MANIFESTATION)
276 194539 continue; // Leave this manifestation and try the next one
277
278 // We found a match! -> Set the actual candidate and its entry to used
279 34762 candidate.used = true;
280 34762 candidate.entry->used = true;
281
282 // Check if the function is generic needs to be substantiated
283
6/6
✓ Branch 53 → 54 taken 20709 times.
✓ Branch 53 → 56 taken 14053 times.
✓ Branch 54 → 55 taken 20429 times.
✓ Branch 54 → 56 taken 280 times.
✓ Branch 57 → 58 taken 20429 times.
✓ Branch 57 → 70 taken 14333 times.
 34762 if (presetFunction.templateTypes.empty() && !forceSubstantiation) {
284
5/10
✓ Branch 58 → 59 taken 20429 times.
✗ Branch 58 → 184 not taken.
✓ Branch 59 → 60 taken 20429 times.
✗ Branch 59 → 64 not taken.
✓ Branch 60 → 61 taken 20429 times.
✗ Branch 60 → 184 not taken.
✓ Branch 61 → 62 taken 20429 times.
✗ Branch 61 → 184 not taken.
✓ Branch 62 → 63 taken 20429 times.
✗ Branch 62 → 64 not taken.
 20429 assert(matchScope->functions.contains(fctId) && matchScope->functions.at(fctId).contains(signature));
285
2/4
✓ Branch 65 → 66 taken 20429 times.
✗ Branch 65 → 184 not taken.
✓ Branch 66 → 67 taken 20429 times.
✗ Branch 66 → 184 not taken.
 20429 Function *match = &matchScope->functions.at(fctId).at(signature);
286 20429 match->used = true;
287
1/2
✓ Branch 67 → 68 taken 20429 times.
✗ Branch 67 → 184 not taken.
 20429 matches.push_back(match);
288 20429 continue; // Match was successful -> match the next function
289 20429 }
290
291 // Check if we already have this manifestation and can simply re-use it. matchManifestation may have redirected
292 // matchScope from the generic struct scope to the concrete manifestation scope; the substantiation is inserted
293 // there, so that is also where an already existing one has to be looked for. Searching the manifestation list we
294 // are currently iterating instead would miss it and insert a duplicate (which insertSubstantiation then reports
295 // as 'declared twice').
296
1/2
✓ Branch 70 → 71 taken 14333 times.
✗ Branch 70 → 203 not taken.
 14333 const std::string newSignature = candidate.getSignature(true, true, false, true);
297
3/4
✓ Branch 71 → 72 taken 14333 times.
✗ Branch 71 → 185 not taken.
✓ Branch 72 → 73 taken 1339 times.
✓ Branch 72 → 75 taken 12994 times.
 14333 if (Function *existingManifestation = findManifestationBySignature(matchScope, newSignature)) {
298 1339 existingManifestation->used = true;
299
1/2
✓ Branch 73 → 74 taken 1339 times.
✗ Branch 73 → 185 not taken.
 1339 matches.push_back(existingManifestation);
300 1339 break; // Leave the whole manifestation list to not double-match the manifestation
301 }
302
303 // Insert the substantiated version if required
304
1/2
✓ Branch 75 → 77 taken 12994 times.
✗ Branch 75 → 201 not taken.
 12994 Function *substantiatedFunction = insertSubstantiation(matchScope, candidate, presetFunction.declNode);
305
2/4
✓ Branch 77 → 78 taken 12994 times.
✗ Branch 77 → 201 not taken.
✓ Branch 78 → 79 taken 12994 times.
✗ Branch 78 → 201 not taken.
 12994 substantiatedFunction->genericPreset = &matchScope->functions.at(fctId).at(signature);
306 12994 substantiatedFunction->alreadyTypeChecked = false;
307
2/4
✓ Branch 79 → 80 taken 12994 times.
✗ Branch 79 → 201 not taken.
✓ Branch 80 → 81 taken 12994 times.
✗ Branch 80 → 201 not taken.
 12994 substantiatedFunction->declNode->getFctManifestations(reqName)->push_back(substantiatedFunction);
308 12994 substantiatedFunction->isNewlyInserted = true; // To not iterate over it in the same matching
309
310 // Copy function entry
311
1/2
✓ Branch 81 → 82 taken 12994 times.
✗ Branch 81 → 201 not taken.
 12994 const std::string newScopeName = substantiatedFunction->getScopeName();
312
1/2
✓ Branch 82 → 83 taken 12994 times.
✗ Branch 82 → 199 not taken.
 12994 matchScope->lookupStrict(presetFunction.entry->name)->used = true;
313
1/2
✓ Branch 85 → 86 taken 12994 times.
✗ Branch 85 → 199 not taken.
 12994 substantiatedFunction->entry = matchScope->symbolTable.copySymbol(presetFunction.entry->name, newScopeName);
314
1/2
✗ Branch 86 → 87 not taken.
✓ Branch 86 → 88 taken 12994 times.
 12994 assert(substantiatedFunction->entry != nullptr);
315
316 // Copy function scope. Interface method declarations have no body and therefore no child scope to copy - only
317 // their signature needs to be substantiated for call-site type checking, so skip this step for them.
318
1/2
✓ Branch 88 → 89 taken 12994 times.
✗ Branch 88 → 199 not taken.
 12994 const std::string oldScopeName = presetFunction.getScopeName();
319
3/4
✓ Branch 89 → 90 taken 12994 times.
✗ Branch 89 → 197 not taken.
✓ Branch 90 → 91 taken 12988 times.
✓ Branch 90 → 127 taken 6 times.
 12994 if (matchScope->children.contains(oldScopeName)) {
320
1/2
✓ Branch 91 → 92 taken 12988 times.
✗ Branch 91 → 197 not taken.
 12988 Scope *childScope = matchScope->copyChildScope(oldScopeName, newScopeName);
321
1/2
✗ Branch 92 → 93 not taken.
✓ Branch 92 → 94 taken 12988 times.
 12988 assert(childScope != nullptr);
322 12988 childScope->isGenericScope = false;
323 12988 substantiatedFunction->bodyScope = childScope;
324
325 // Insert symbols for generic type names with concrete types into the child block
326
2/2
✓ Branch 104 → 96 taken 16328 times.
✓ Branch 104 → 105 taken 12988 times.
 29316 for (const auto &[typeName, concreteType] : substantiatedFunction->typeMapping)
327
2/4
✓ Branch 99 → 100 taken 16328 times.
✗ Branch 99 → 188 not taken.
✓ Branch 100 → 101 taken 16328 times.
✗ Branch 100 → 186 not taken.
 16328 childScope->insertGenericType(typeName, GenericType(concreteType));
328
329 // Substantiate the 'this' entry in the new function scope
330
6/6
✓ Branch 108 → 109 taken 10234 times.
✓ Branch 108 → 112 taken 2754 times.
✓ Branch 110 → 111 taken 10231 times.
✓ Branch 110 → 112 taken 3 times.
✓ Branch 113 → 114 taken 10231 times.
✓ Branch 113 → 127 taken 2757 times.
 12988 if (presetFunction.isMethod() && !presetFunction.templateTypes.empty()) {
331
1/2
✓ Branch 116 → 117 taken 10231 times.
✗ Branch 116 → 192 not taken.
 30693 SymbolTableEntry *thisEntry = childScope->lookupStrict(THIS_VARIABLE_NAME);
332
1/2
✗ Branch 122 → 123 not taken.
✓ Branch 122 → 124 taken 10231 times.
 10231 assert(thisEntry != nullptr);
333
2/4
✓ Branch 124 → 125 taken 10231 times.
✗ Branch 124 → 196 not taken.
✓ Branch 125 → 126 taken 10231 times.
✗ Branch 125 → 196 not taken.
 10231 thisEntry->updateType(candidate.thisType.toPtr(callNode), /*overwriteExistingType=*/true);
334 }
335 }
336
337 // Add to matched functions
338
1/2
✓ Branch 127 → 128 taken 12994 times.
✗ Branch 127 → 197 not taken.
 12994 matches.push_back(substantiatedFunction);
339
340 12994 break; // Leave the whole manifestation list to not double-match the manifestation
341
2/2
✓ Branch 134 → 135 taken 214968 times.
✓ Branch 134 → 136 taken 5161922 times.
 5391224 }
342 }
343
344 // If no matches were found, return a nullptr
345
2/2
✓ Branch 143 → 144 taken 439721 times.
✓ Branch 143 → 145 taken 34749 times.
 474470 if (matches.empty())
346 439721 return nullptr;
347
348 // Tie-breaking: if multiple candidates match, narrow them by qualifier specificity and by preferring
349 // explicitly declared overloads over generic substitutions (see breakOverloadTie).
350
1/2
✓ Branch 145 → 146 taken 34749 times.
✗ Branch 145 → 221 not taken.
 34749 breakOverloadTie(matches, reqArgs);
351
352 // Check if more than one function matches the requirements
353
1/2
✗ Branch 147 → 148 not taken.
✓ Branch 147 → 175 taken 34749 times.
 34749 if (matches.size() > 1) {
354 ✗ std::stringstream errorMessage;
355 ✗ errorMessage << "The function/procedure '" << reqName << "' is ambiguous. All of the following match the requested criteria:";
356 ✗ for (const Function *match : matches)
357 ✗ errorMessage << "\n " << match->getSignature();
358 ✗ throw SemanticError(callNode, FUNCTION_AMBIGUITY, errorMessage.str());
359 ✗ }
360 34749 Function *matchedFunction = matches.front();
361 34749 matchedFunction->isNewlyInserted = false;
362
363 // Insert into cache
364
1/2
✓ Branch 176 → 177 taken 34749 times.
✗ Branch 176 → 221 not taken.
 34749 lookupCache[cacheKey] = matchedFunction;
365
366 // Trigger revisit in type checker if required
367
1/2
✓ Branch 177 → 178 taken 34749 times.
✗ Branch 177 → 221 not taken.
 34749 TypeChecker::requestRevisitIfRequired(matchedFunction);
368
369 // Return the very match
370 34749 return matchedFunction;
371 474471 }
372
373 5555229 MatchResult FunctionManager::matchManifestation(Function &candidate, Scope *&matchScope, const std::string &reqName,
374 const QualType &reqThisType, const ArgList &reqArgs, TypeMapping &typeMapping,
375 bool strictQualifierMatching, bool &forceSubstantiation,
376 const ASTNode *callNode) {
377 // Check name requirement
378
2/2
✓ Branch 3 → 4 taken 5282483 times.
✓ Branch 3 → 5 taken 272746 times.
 5555229 if (!matchName(candidate, reqName))
379 5282483 return MatchResult::SKIP_FUNCTION; // Leave the whole manifestation list, because all have the same name
380
381 // Check 'this' type requirement
382
2/4
✓ Branch 5 → 6 taken 272746 times.
✗ Branch 5 → 29 not taken.
✗ Branch 6 → 7 not taken.
✓ Branch 6 → 8 taken 272746 times.
 272746 if (!matchThisType(candidate, reqThisType, typeMapping, strictQualifierMatching, callNode))
383 ✗ return MatchResult::SKIP_MANIFESTATION; // Leave this manifestation and try the next one
384
385 // Check arg types requirement
386
4/4
✓ Branch 8 → 9 taken 272745 times.
✓ Branch 8 → 29 taken 1 time.
✓ Branch 9 → 10 taken 226505 times.
✓ Branch 9 → 11 taken 46240 times.
 272746 if (!matchArgTypes(candidate, reqArgs, typeMapping, strictQualifierMatching, forceSubstantiation, callNode))
387 226505 return MatchResult::SKIP_MANIFESTATION; // Leave this manifestation and try the next one
388
389 // Check if there are unresolved generic types. Only template slots that actually are generic have to be resolved into
390 // the type mapping - a slot that already holds a concrete type (as for the default members of an already-concrete
391 // struct manifestation, e.g. HashEntry<int, String>::dtor()) never ends up there and must not count as unresolved.
392 20358 const auto isGeneric = [](const GenericType &templateType) { return templateType.is(TY_GENERIC); };
393
3/4
✓ Branch 12 → 13 taken 46240 times.
✗ Branch 12 → 29 not taken.
✓ Branch 13 → 14 taken 2 times.
✓ Branch 13 → 15 taken 46238 times.
 46240 if (typeMapping.size() < static_cast<size_t>(std::ranges::count_if(candidate.templateTypes, isGeneric)))
394 2 return MatchResult::SKIP_MANIFESTATION; // Leave this manifestation and try the next one
395
396 // Substantiate return type
397
1/2
✓ Branch 15 → 16 taken 46238 times.
✗ Branch 15 → 29 not taken.
 46238 substantiateReturnType(candidate, typeMapping, callNode);
398
399 // Set the match scope to the scope of the concrete substantiation
400 46238 const QualType &thisType = candidate.thisType;
401
3/4
✓ Branch 16 → 17 taken 46238 times.
✗ Branch 16 → 29 not taken.
✓ Branch 17 → 18 taken 32496 times.
✓ Branch 17 → 25 taken 13742 times.
 46238 if (!thisType.is(TY_DYN)) {
402 // If we only have the generic struct scope, lookup the concrete manifestation scope
403
2/2
✓ Branch 18 → 19 taken 15 times.
✓ Branch 18 → 23 taken 32481 times.
 32496 if (matchScope->isGenericScope) {
404
1/2
✓ Branch 19 → 20 taken 15 times.
✗ Branch 19 → 29 not taken.
 15 const Struct *spiceStruct = thisType.getStruct(candidate.declNode);
405
1/2
✗ Branch 20 → 21 not taken.
✓ Branch 20 → 22 taken 15 times.
 15 assert(spiceStruct != nullptr);
406 15 matchScope = spiceStruct->scope;
407 }
408
1/2
✓ Branch 23 → 24 taken 32496 times.
✗ Branch 23 → 28 not taken.
 32496 candidate.thisType = candidate.thisType.getWithBodyScope(matchScope);
409 }
410
411 46238 return MatchResult::MATCHED;
412 }
413
414 /**
415 * Checks if the matching candidate fulfills the name requirement
416 *
417 * @param candidate Matching candidate function
418 * @param reqName Requested function name
419 * @return Fulfilled or not
420 */
421 5555229 bool FunctionManager::matchName(const Function &candidate, const std::string &reqName) { return candidate.name == reqName; }
422
423 /**
424 * Checks if the matching candidate fulfills the 'this' type requirement
425 *
426 * @param candidate Matching candidate function
427 * @param reqThisType Requested 'this' type
428 * @param typeMapping Concrete template type mapping
429 * @param strictQualifierMatching Match qualifiers strictly
430 * @param callNode Call AST node for printing error messages
431 * @return Fulfilled or not
432 */
433 272746 bool FunctionManager::matchThisType(Function &candidate, const QualType &reqThisType, TypeMapping &typeMapping,
434 bool strictQualifierMatching, const ASTNode *callNode) {
435 272746 QualType &candidateThisType = candidate.thisType;
436
437 // Shortcut for procedures
438
7/10
✓ Branch 2 → 3 taken 272746 times.
✗ Branch 2 → 23 not taken.
✓ Branch 3 → 4 taken 185310 times.
✓ Branch 3 → 7 taken 87436 times.
✓ Branch 4 → 5 taken 185310 times.
✗ Branch 4 → 23 not taken.
✓ Branch 5 → 6 taken 185310 times.
✗ Branch 5 → 7 not taken.
✓ Branch 8 → 9 taken 185310 times.
✓ Branch 8 → 10 taken 87436 times.
 272746 if (candidateThisType.is(TY_DYN) && reqThisType.is(TY_DYN))
439 185310 return true;
440
441 // Give the type matcher a way to retrieve instances of GenericType by their name
442 188985 TypeMatcher::ResolverFct genericTypeResolver = [&](const std::string &genericTypeName) {
443 14113 return getGenericTypeOfCandidateByName(candidate, genericTypeName);
444 87436 };
445
446 // Check if the requested 'this' type matches the candidate 'this' type. The type mapping may be extended
447
2/4
✓ Branch 11 → 12 taken 87436 times.
✗ Branch 11 → 21 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 14 taken 87436 times.
 87436 if (!TypeMatcher::matchRequestedToCandidateType(candidateThisType, reqThisType, typeMapping, genericTypeResolver,
448 strictQualifierMatching))
449 ✗ return false;
450
451 // Substantiate the candidate param type, based on the type mapping
452
3/4
✓ Branch 14 → 15 taken 87436 times.
✗ Branch 14 → 21 not taken.
✓ Branch 15 → 16 taken 15248 times.
✓ Branch 15 → 17 taken 72188 times.
 87436 if (candidateThisType.hasAnyGenericParts())
453
1/2
✓ Branch 16 → 17 taken 15248 times.
✗ Branch 16 → 21 not taken.
 15248 TypeMatcher::substantiateTypeWithTypeMapping(candidateThisType, typeMapping, callNode);
454
455 87436 return true;
456 87436 }
457
458 /**
459 * Checks if the matching candidate fulfills the argument types requirement
460 *
461 * @param candidate Matching candidate function
462 * @param reqArgs Requested argument types
463 * @param typeMapping Concrete template type mapping
464 * @param strictQualifierMatching Match qualifiers strictly
465 * @param needsSubstantiation We want to create a substantiation after successfully matching
466 * @param callNode Call AST node for printing error messages
467 * @return Fulfilled or not
468 */
469 272746 bool FunctionManager::matchArgTypes(Function &candidate, const ArgList &reqArgs, TypeMapping &typeMapping,
470 bool strictQualifierMatching, bool &needsSubstantiation, const ASTNode *callNode) {
471 272746 std::vector<Param> &candidateParamList = candidate.paramList;
472
473 // If the number of arguments does not match with the number of params, the matching fails
474
6/6
✓ Branch 2 → 3 taken 272471 times.
✓ Branch 2 → 7 taken 275 times.
✓ Branch 5 → 6 taken 38139 times.
✓ Branch 5 → 7 taken 234332 times.
✓ Branch 8 → 9 taken 38139 times.
✓ Branch 8 → 10 taken 234607 times.
 272746 if (!candidate.isVararg && reqArgs.size() != candidateParamList.size())
475 38139 return false;
476 // In the case of a vararg function, we only disallow fewer arguments than parameters
477
4/6
✓ Branch 10 → 11 taken 275 times.
✓ Branch 10 → 15 taken 234332 times.
✗ Branch 13 → 14 not taken.
✓ Branch 13 → 15 taken 275 times.
✗ Branch 16 → 17 not taken.
✓ Branch 16 → 18 taken 234607 times.
 234607 if (candidate.isVararg && reqArgs.size() < candidateParamList.size())
478 ✗ return false;
479
480 // Give the type matcher a way to retrieve instances of GenericType by their name
481 483458 TypeMatcher::ResolverFct genericTypeResolver = [&](const std::string &genericTypeName) {
482 14244 return getGenericTypeOfCandidateByName(candidate, genericTypeName);
483 234607 };
484
485 // Loop over all parameters
486
2/2
✓ Branch 66 → 20 taken 240821 times.
✓ Branch 66 → 67 taken 46240 times.
 287061 for (size_t i = 0; i < reqArgs.size(); i++) {
487 // In the case of a vararg function candidate, we can accept additional arguments, that are not defined in the candidate,
488 // but we need to modify the candidate param list to accept them
489
6/6
✓ Branch 20 → 21 taken 1119 times.
✓ Branch 20 → 24 taken 239702 times.
✓ Branch 22 → 23 taken 297 times.
✓ Branch 22 → 24 taken 822 times.
✓ Branch 25 → 26 taken 297 times.
✓ Branch 25 → 29 taken 240524 times.
 240821 if (candidate.isVararg && i >= candidateParamList.size()) {
490
2/4
✓ Branch 26 → 27 taken 297 times.
✗ Branch 26 → 71 not taken.
✓ Branch 27 → 28 taken 297 times.
✗ Branch 27 → 71 not taken.
 297 candidateParamList.push_back(Param(reqArgs.at(i).first, false));
491 297 needsSubstantiation = true; // We need to modify the candidate param types
492 297 continue;
493 }
494
495 // Retrieve actual and requested types
496
2/4
✓ Branch 29 → 30 taken 240524 times.
✗ Branch 29 → 84 not taken.
✗ Branch 30 → 31 not taken.
✓ Branch 30 → 32 taken 240524 times.
 240524 assert(!candidateParamList.at(i).isOptional);
497
1/2
✓ Branch 32 → 33 taken 240524 times.
✗ Branch 32 → 84 not taken.
 240524 QualType &candidateType = candidateParamList.at(i).qualType;
498
1/2
✓ Branch 33 → 34 taken 240524 times.
✗ Branch 33 → 84 not taken.
 240524 const auto &[requestedType, isArgTemporary] = reqArgs.at(i);
499
500 // Check if the requested param type matches the candidate param type. The type mapping may be extended
501
3/4
✓ Branch 36 → 37 taken 240524 times.
✗ Branch 36 → 84 not taken.
✓ Branch 37 → 38 taken 188366 times.
✓ Branch 37 → 39 taken 52158 times.
 240524 if (!TypeMatcher::matchRequestedToCandidateType(candidateType, requestedType, typeMapping, genericTypeResolver,
502 strictQualifierMatching))
503 188366 return false;
504
505 // Substantiate the candidate param type, based on the type mapping
506
3/4
✓ Branch 39 → 40 taken 52158 times.
✗ Branch 39 → 84 not taken.
✓ Branch 40 → 41 taken 11236 times.
✓ Branch 40 → 42 taken 40922 times.
 52158 if (candidateType.hasAnyGenericParts())
507
1/2
✓ Branch 41 → 42 taken 11236 times.
✗ Branch 41 → 84 not taken.
 11236 TypeMatcher::substantiateTypeWithTypeMapping(candidateType, typeMapping, callNode);
508
509 // Check if we try to bind a non-ref temporary to a non-const ref parameter
510
3/4
✓ Branch 42 → 43 taken 52158 times.
✗ Branch 42 → 84 not taken.
✓ Branch 43 → 44 taken 1 time.
✓ Branch 43 → 54 taken 52157 times.
 52158 if (!candidateType.canBind(requestedType, isArgTemporary)) {
511
1/2
✓ Branch 44 → 45 taken 1 time.
✗ Branch 44 → 53 not taken.
 1 if (callNode)
512
2/4
✓ Branch 48 → 49 taken 1 time.
✗ Branch 48 → 75 not taken.
✓ Branch 49 → 50 taken 1 time.
✗ Branch 49 → 72 not taken.
 3 throw SemanticError(callNode, TEMP_TO_NON_CONST_REF, "Temporary values can only be bound to const reference parameters");
513 ✗ return false;
514 }
515
516 // If we have a function/procedure type we need to take care of the information, if it takes captures
517
9/12
✓ Branch 54 → 55 taken 52157 times.
✗ Branch 54 → 81 not taken.
✓ Branch 55 → 56 taken 52157 times.
✗ Branch 55 → 81 not taken.
✓ Branch 56 → 57 taken 82 times.
✓ Branch 56 → 60 taken 52075 times.
✓ Branch 57 → 58 taken 82 times.
✗ Branch 57 → 81 not taken.
✓ Branch 58 → 59 taken 20 times.
✓ Branch 58 → 60 taken 62 times.
✓ Branch 61 → 62 taken 20 times.
✓ Branch 61 → 64 taken 52137 times.
 52157 if (requestedType.getBase().isOneOf({TY_FUNCTION, TY_PROCEDURE}) && requestedType.hasLambdaCaptures()) {
518
1/2
✓ Branch 62 → 63 taken 20 times.
✗ Branch 62 → 83 not taken.
 20 candidateType = candidateType.getWithLambdaCaptures();
519 20 needsSubstantiation = true;
520 }
521 }
522
523 46240 return true;
524 234607 }
525
526 /**
527 * Substantiates the candidate return type, based on the given type mapping
528 *
529 * @param candidate Matching candidate function
530 * @param typeMapping Concrete template type mapping
531 * @param callNode AST node for error messages
532 */
533 46238 void FunctionManager::substantiateReturnType(Function &candidate, const TypeMapping &typeMapping, const ASTNode *callNode) {
534
2/2
✓ Branch 3 → 4 taken 4104 times.
✓ Branch 3 → 5 taken 42134 times.
 46238 if (candidate.returnType.hasAnyGenericParts())
535 4104 TypeMatcher::substantiateTypeWithTypeMapping(candidate.returnType, typeMapping, callNode);
536 46238 }
537
538 /**
539 * Searches the candidate template types for a generic type object with a certain name and return it
540 *
541 * @param candidate Matching candidate function
542 * @param templateTypeName Template type name
543 * @return Generic type object
544 */
545 28357 const GenericType *FunctionManager::getGenericTypeOfCandidateByName(const Function &candidate,
546 const std::string &templateTypeName) {
547
1/2
✓ Branch 19 → 4 taken 32134 times.
✗ Branch 19 → 20 not taken.
 60491 for (const GenericType &templateType : candidate.templateTypes) {
548
3/4
✓ Branch 6 → 7 taken 32134 times.
✗ Branch 6 → 22 not taken.
✓ Branch 8 → 9 taken 28357 times.
✓ Branch 8 → 10 taken 3777 times.
 32134 if (templateType.getSubType() == templateTypeName)
549 28357 return &templateType;
550 }
551 ✗ return nullptr;
552 }
553
554 /**
555 * Narrow a multi-match overload set by preferring the candidate whose parameter qualifiers most closely match
556 * the argument qualifiers. This resolves the typical copy-vs-move ctor ambiguity where both a `const T&`
557 * (copy) and a `T&` (move) ctor match a non-const lvalue argument - we prefer the non-const-ref candidate
558 * (move) since it requires no constification. When the argument is const, we prefer the const-ref candidate
559 * (copy) since binding to a non-const ref would require const-loss. As a secondary criterion, an explicitly
560 * declared (non-generic) overload is preferred over a generic substitution that matches equally well.
561 *
562 * Modifies `matches` in place, removing any candidate that scores worse than the best one. A no-op if there
563 * are fewer than two candidates.
564 *
565 * @param matches Candidate list to narrow
566 * @param reqArgs Argument list from the call site
567 */
568 34749 void FunctionManager::breakOverloadTie(std::vector<Function *> &matches, const ArgList &reqArgs) {
569
2/2
✓ Branch 3 → 4 taken 34736 times.
✓ Branch 3 → 5 taken 13 times.
 34749 if (matches.size() < 2)
570 34736 return;
571
572 13 constexpr int CONSTIFY_PENALTY = 1;
573 13 constexpr int CONST_LOSS_PENALTY = 100;
574 // An exact type match is always preferred over a match that required an implicit upcast (struct to
575 // implemented interface, or struct to composed base struct). This keeps e.g. 'f(Derived)' preferred
576 // over 'f(Base)' when called with a Derived, instead of reporting an ambiguity.
577 13 constexpr int UPCAST_PENALTY = 1000;
578 65 const auto scoreSpecificity = [&](const Function *f) {
579 52 int penalty = 0;
580
2/2
✓ Branch 23 → 3 taken 52 times.
✓ Branch 23 → 24 taken 52 times.
 104 for (size_t i = 0; i < std::min(reqArgs.size(), f->paramList.size()); i++) {
581
1/2
✓ Branch 3 → 4 taken 52 times.
✗ Branch 3 → 28 not taken.
 52 const QualType &paramType = f->paramList.at(i).qualType;
582
1/2
✓ Branch 4 → 5 taken 52 times.
✗ Branch 4 → 28 not taken.
 52 const QualType &argType = reqArgs.at(i).first;
583
2/4
✓ Branch 5 → 6 taken 52 times.
✗ Branch 5 → 26 not taken.
✓ Branch 6 → 7 taken 52 times.
✗ Branch 6 → 26 not taken.
 52 const bool paramIsConst = paramType.removeReferenceWrapper().isConst();
584
2/4
✓ Branch 7 → 8 taken 52 times.
✗ Branch 7 → 27 not taken.
✓ Branch 8 → 9 taken 52 times.
✗ Branch 8 → 27 not taken.
 52 const bool argIsConst = argType.removeReferenceWrapper().isConst();
585
4/4
✓ Branch 9 → 10 taken 28 times.
✓ Branch 9 → 12 taken 24 times.
✓ Branch 10 → 11 taken 8 times.
✓ Branch 10 → 12 taken 20 times.
 52 if (paramIsConst && !argIsConst)
586 8 penalty += CONSTIFY_PENALTY;
587
4/4
✓ Branch 12 → 13 taken 24 times.
✓ Branch 12 → 15 taken 20 times.
✓ Branch 13 → 14 taken 12 times.
✓ Branch 13 → 15 taken 12 times.
 44 else if (!paramIsConst && argIsConst)
588 12 penalty += CONST_LOSS_PENALTY;
589 // Penalize matches that were only possible through an implicit upcast
590 52 QualType paramBase = paramType;
591 52 QualType argBase = argType;
592
1/2
✓ Branch 15 → 16 taken 52 times.
✗ Branch 15 → 28 not taken.
 52 QualType::unwrapBothWithRefWrappers(paramBase, argBase);
593
2/4
✓ Branch 16 → 17 taken 52 times.
✗ Branch 16 → 28 not taken.
✗ Branch 17 → 18 not taken.
✓ Branch 17 → 19 taken 52 times.
 52 if (!paramBase.matches(argBase, true, true, true))
594 ✗ penalty += UPCAST_PENALTY;
595 }
596 52 return penalty;
597 13 };
598
599 13 int bestScore = std::numeric_limits<int>::max();
600
2/2
✓ Branch 20 → 7 taken 26 times.
✓ Branch 20 → 21 taken 13 times.
 52 for (const Function *m : matches)
601
1/2
✓ Branch 9 → 10 taken 26 times.
✗ Branch 9 → 76 not taken.
 26 bestScore = std::min(bestScore, scoreSpecificity(m));
602 13 std::vector<Function *> filtered;
603
1/2
✓ Branch 22 → 23 taken 13 times.
✗ Branch 22 → 80 not taken.
 13 filtered.reserve(matches.size());
604
2/2
✓ Branch 39 → 25 taken 26 times.
✓ Branch 39 → 40 taken 13 times.
 52 for (Function *m : matches)
605
3/4
✓ Branch 27 → 28 taken 26 times.
✗ Branch 27 → 78 not taken.
✓ Branch 28 → 29 taken 16 times.
✓ Branch 28 → 30 taken 10 times.
 26 if (scoreSpecificity(m) == bestScore)
606
1/2
✓ Branch 29 → 30 taken 16 times.
✗ Branch 29 → 78 not taken.
 16 filtered.push_back(m);
607 13 matches = std::move(filtered);
608
609 // Secondary tie-break: prefer an explicitly declared (non-generic) overload over a generic substitution
610 // when both match equally well, mirroring C++ overload resolution where a non-template wins over a
611 // template specialization. This resolves e.g. the copy ctor 'Any.ctor(const Any&)' vs. the value ctor
612 // 'Any.ctor<Any>(const Any&)' ambiguity when copy-constructing from another value of the same type. It is
613 // applied after the qualifier-specificity narrowing above, so a more specific generic match still wins.
614 // A generic substitution that loses here and was only inserted for this very match is removed from its
615 // declaration's manifestation list again, so the IR generator never emits a manifestation that was never
616 // type-checked (and so we leave no dead code behind).
617
6/8
✓ Branch 44 → 45 taken 3 times.
✓ Branch 44 → 48 taken 10 times.
✓ Branch 45 → 46 taken 3 times.
✗ Branch 45 → 80 not taken.
✓ Branch 46 → 47 taken 3 times.
✗ Branch 46 → 48 not taken.
✓ Branch 49 → 50 taken 3 times.
✓ Branch 49 → 73 taken 10 times.
 18 if (matches.size() > 1 && std::ranges::any_of(matches, [](const Function *m) { return !m->isGenericSubstantiation(); })) {
618
2/2
✓ Branch 71 → 52 taken 6 times.
✓ Branch 71 → 72 taken 3 times.
 12 for (Function *m : matches)
619
6/8
✓ Branch 54 → 55 taken 6 times.
✗ Branch 54 → 79 not taken.
✓ Branch 55 → 56 taken 3 times.
✓ Branch 55 → 58 taken 3 times.
✓ Branch 56 → 57 taken 3 times.
✗ Branch 56 → 58 not taken.
✓ Branch 59 → 60 taken 3 times.
✓ Branch 59 → 62 taken 3 times.
 6 if (m->isGenericSubstantiation() && m->isNewlyInserted)
620
2/4
✓ Branch 60 → 61 taken 3 times.
✗ Branch 60 → 79 not taken.
✓ Branch 61 → 62 taken 3 times.
✗ Branch 61 → 79 not taken.
 3 std::erase(*m->declNode->getFctManifestations(m->name), m);
621
1/2
✓ Branch 72 → 73 taken 3 times.
✗ Branch 72 → 80 not taken.
 9 std::erase_if(matches, [](const Function *m) { return m->isGenericSubstantiation(); });
622 }
623 13 }
624
625 /**
626 * Calculate the cache key for the function lookup cache
627 *
628 * @param scope Scope to match against
629 * @param name Function name requirement
630 * @param thisType This type requirement
631 * @param args Argument requirement
632 * @param templateTypes Template type requirement
633 * @return Cache key
634 */
635 587491 uint64_t FunctionManager::getCacheKey(const Scope *scope, const std::string &name, const QualType &thisType, const ArgList &args,
636 const QualTypeList &templateTypes) {
637 587491 uint64_t hash = 0;
638 587491 hashCombine64(hash, hashPointer(scope));
639 587491 hashCombine64(hash, std::hash<std::string>{}(name));
640 587491 hashCombine64(hash, std::hash<QualType>{}(thisType));
641
2/2
✓ Branch 27 → 10 taken 956713 times.
✓ Branch 27 → 28 taken 587491 times.
 3088408 for (const auto &[first, second] : args) {
642 956713 hashCombine64(hash, std::hash<QualType>{}(first));
643 956713 hashCombine64(hash, std::hash<bool>{}(second));
644 }
645 587491 hashCombine64(hash, hashVector(templateTypes));
646 587491 return hash;
647 }
648
649 19309 bool FunctionManager::hasCtor(const Scope *matchScope, CtorKind kind) {
650
5/8
✓ Branch 2 → 3 taken 19309 times.
✗ Branch 2 → 60 not taken.
✓ Branch 3 → 4 taken 19309 times.
✗ Branch 3 → 60 not taken.
✓ Branch 4 → 5 taken 19309 times.
✗ Branch 4 → 60 not taken.
✓ Branch 55 → 6 taken 86500 times.
✓ Branch 55 → 56 taken 12597 times.
 99097 for (const auto &manifestations : matchScope->functions | std::views::values) {
651
5/8
✓ Branch 7 → 8 taken 86500 times.
✗ Branch 7 → 59 not taken.
✓ Branch 8 → 9 taken 86500 times.
✗ Branch 8 → 59 not taken.
✓ Branch 9 → 10 taken 86500 times.
✗ Branch 9 → 59 not taken.
✓ Branch 51 → 11 taken 94732 times.
✓ Branch 51 → 52 taken 79788 times.
 174520 for (const auto &function : manifestations | std::views::values) {
652 // If it is no ctor, skip it
653
3/4
✓ Branch 12 → 13 taken 94732 times.
✗ Branch 12 → 59 not taken.
✓ Branch 13 → 14 taken 58011 times.
✓ Branch 13 → 15 taken 36721 times.
 94732 if (function.name != CTOR_FUNCTION_NAME)
654 58011 continue;
655 // Classify the ctor based on its parameter list
656
6/8
✓ Branch 16 → 17 taken 20402 times.
✓ Branch 16 → 25 taken 16319 times.
✓ Branch 17 → 18 taken 20402 times.
✗ Branch 17 → 58 not taken.
✓ Branch 18 → 19 taken 20402 times.
✗ Branch 18 → 58 not taken.
✓ Branch 19 → 20 taken 9441 times.
✓ Branch 19 → 25 taken 10961 times.
 46162 const bool singleSelfRefParam = function.paramList.size() == 1 && function.paramList.at(0).qualType.isRef() &&
657
5/8
✓ Branch 20 → 21 taken 9441 times.
✗ Branch 20 → 58 not taken.
✓ Branch 21 → 22 taken 9441 times.
✗ Branch 21 → 58 not taken.
✓ Branch 22 → 23 taken 9441 times.
✗ Branch 22 → 58 not taken.
✓ Branch 23 → 24 taken 7454 times.
✓ Branch 23 → 25 taken 1987 times.
 9441 function.paramList.at(0).qualType.getBase() == function.thisType;
658
6/8
✓ Branch 26 → 27 taken 7454 times.
✓ Branch 26 → 31 taken 29267 times.
✓ Branch 27 → 28 taken 7454 times.
✗ Branch 27 → 59 not taken.
✓ Branch 28 → 29 taken 7454 times.
✗ Branch 28 → 59 not taken.
✓ Branch 29 → 30 taken 7441 times.
✓ Branch 29 → 31 taken 13 times.
 36721 const bool isCopyCtor = singleSelfRefParam && function.paramList.at(0).qualType.isConstRef();
659
6/8
✓ Branch 32 → 33 taken 7454 times.
✓ Branch 32 → 37 taken 29267 times.
✓ Branch 33 → 34 taken 7454 times.
✗ Branch 33 → 59 not taken.
✓ Branch 34 → 35 taken 7454 times.
✗ Branch 34 → 59 not taken.
✓ Branch 35 → 36 taken 13 times.
✓ Branch 35 → 37 taken 7441 times.
 36721 const bool isMoveCtor = singleSelfRefParam && !function.paramList.at(0).qualType.isConstRef();
660
3/4
✓ Branch 38 → 39 taken 27213 times.
✓ Branch 38 → 42 taken 5597 times.
✓ Branch 38 → 45 taken 3911 times.
✗ Branch 38 → 49 not taken.
 36721 switch (kind) {
661 27213 case CtorKind::COPY:
662
2/2
✓ Branch 39 → 40 taken 4182 times.
✓ Branch 39 → 41 taken 23031 times.
 27213 if (isCopyCtor)
663 6712 return true;
664 23031 break;
665 5597 case CtorKind::MOVE:
666
2/2
✓ Branch 42 → 43 taken 4 times.
✓ Branch 42 → 44 taken 5593 times.
 5597 if (isMoveCtor)
667 4 return true;
668 5593 break;
669 3911 case CtorKind::ANY_NON_COPY_NON_MOVE:
670
4/4
✓ Branch 45 → 46 taken 2528 times.
✓ Branch 45 → 48 taken 1383 times.
✓ Branch 46 → 47 taken 2526 times.
✓ Branch 46 → 48 taken 2 times.
 3911 if (!isCopyCtor && !isMoveCtor)
671 2526 return true;
672 1385 break;
673 }
674 }
675 }
676 12597 return false;
677 }
678
679 531 bool FunctionManager::hasAnyCtor(const Scope *matchScope) {
680
5/8
✓ Branch 2 → 3 taken 531 times.
✗ Branch 2 → 24 not taken.
✓ Branch 3 → 4 taken 531 times.
✗ Branch 3 → 24 not taken.
✓ Branch 4 → 5 taken 531 times.
✗ Branch 4 → 24 not taken.
✓ Branch 20 → 6 taken 684 times.
✓ Branch 20 → 21 taken 531 times.
 1215 for (const auto &manifestations : matchScope->functions | std::views::values)
681
5/8
✓ Branch 7 → 8 taken 684 times.
✗ Branch 7 → 23 not taken.
✓ Branch 8 → 9 taken 684 times.
✗ Branch 8 → 23 not taken.
✓ Branch 9 → 10 taken 684 times.
✗ Branch 9 → 23 not taken.
✓ Branch 17 → 11 taken 701 times.
✓ Branch 17 → 18 taken 684 times.
 1385 for (const auto &function : manifestations | std::views::values)
682
2/4
✓ Branch 12 → 13 taken 701 times.
✗ Branch 12 → 23 not taken.
✗ Branch 13 → 14 not taken.
✓ Branch 13 → 15 taken 701 times.
 701 if (function.name == CTOR_FUNCTION_NAME)
683 ✗ return true;
684 531 return false;
685 }
686
687 2640 bool FunctionManager::hasAnyNonCopyCtor(const Scope *matchScope) { return hasCtor(matchScope, CtorKind::ANY_NON_COPY_NON_MOVE); }
688
689 14132 bool FunctionManager::hasCopyCtor(const Scope *matchScope) { return hasCtor(matchScope, CtorKind::COPY); }
690
691 2533 bool FunctionManager::hasUserCopyCtor(const Scope *matchScope) {
692
5/8
✓ Branch 2 → 3 taken 2533 times.
✗ Branch 2 → 42 not taken.
✓ Branch 3 → 4 taken 2533 times.
✗ Branch 3 → 42 not taken.
✓ Branch 4 → 5 taken 2533 times.
✗ Branch 4 → 42 not taken.
✓ Branch 37 → 6 taken 11942 times.
✓ Branch 37 → 38 taken 2277 times.
 14219 for (const auto &manifestations : matchScope->functions | std::views::values) {
693
5/8
✓ Branch 7 → 8 taken 11942 times.
✗ Branch 7 → 41 not taken.
✓ Branch 8 → 9 taken 11942 times.
✗ Branch 8 → 41 not taken.
✓ Branch 9 → 10 taken 11942 times.
✗ Branch 9 → 41 not taken.
✓ Branch 34 → 11 taken 12842 times.
✓ Branch 34 → 35 taken 11686 times.
 24528 for (const auto &function : manifestations | std::views::values) {
694
7/8
✓ Branch 12 → 13 taken 12842 times.
✗ Branch 12 → 41 not taken.
✓ Branch 13 → 14 taken 5582 times.
✓ Branch 13 → 15 taken 7260 times.
✓ Branch 14 → 15 taken 1746 times.
✓ Branch 14 → 16 taken 3836 times.
✓ Branch 17 → 18 taken 9006 times.
✓ Branch 17 → 19 taken 3836 times.
 12842 if (function.name != CTOR_FUNCTION_NAME || function.implicitDefault)
695 9006 continue;
696
6/8
✓ Branch 20 → 21 taken 2729 times.
✓ Branch 20 → 29 taken 1107 times.
✓ Branch 21 → 22 taken 2729 times.
✗ Branch 21 → 40 not taken.
✓ Branch 22 → 23 taken 2729 times.
✗ Branch 22 → 40 not taken.
✓ Branch 23 → 24 taken 411 times.
✓ Branch 23 → 29 taken 2318 times.
 4247 const bool isCopyCtor = function.paramList.size() == 1 && function.paramList.at(0).qualType.isConstRef() &&
697
5/8
✓ Branch 24 → 25 taken 411 times.
✗ Branch 24 → 40 not taken.
✓ Branch 25 → 26 taken 411 times.
✗ Branch 25 → 40 not taken.
✓ Branch 26 → 27 taken 411 times.
✗ Branch 26 → 40 not taken.
✓ Branch 27 → 28 taken 256 times.
✓ Branch 27 → 29 taken 155 times.
 411 function.paramList.at(0).qualType.getBase() == function.thisType;
698
2/2
✓ Branch 30 → 31 taken 256 times.
✓ Branch 30 → 32 taken 3580 times.
 3836 if (isCopyCtor)
699 256 return true;
700 }
701 }
702 2277 return false;
703 }
704
705 2537 bool FunctionManager::hasMoveCtor(const Scope *matchScope) { return hasCtor(matchScope, CtorKind::MOVE); }
706
707 15407 Function *FunctionManager::findMoveCtor(Scope *matchScope) {
708
5/8
✓ Branch 2 → 3 taken 15407 times.
✗ Branch 2 → 41 not taken.
✓ Branch 3 → 4 taken 15407 times.
✗ Branch 3 → 41 not taken.
✓ Branch 4 → 5 taken 15407 times.
✗ Branch 4 → 41 not taken.
✓ Branch 36 → 6 taken 143951 times.
✓ Branch 36 → 37 taken 15229 times.
 159180 for (auto &manifestations : matchScope->functions | std::views::values) {
709
5/8
✓ Branch 7 → 8 taken 143951 times.
✗ Branch 7 → 40 not taken.
✓ Branch 8 → 9 taken 143951 times.
✗ Branch 8 → 40 not taken.
✓ Branch 9 → 10 taken 143951 times.
✗ Branch 9 → 40 not taken.
✓ Branch 33 → 11 taken 183152 times.
✓ Branch 33 → 34 taken 143773 times.
 326925 for (auto &function : manifestations | std::views::values) {
710
3/4
✓ Branch 12 → 13 taken 183152 times.
✗ Branch 12 → 40 not taken.
✓ Branch 13 → 14 taken 138508 times.
✓ Branch 13 → 15 taken 44644 times.
 183152 if (function.name != CTOR_FUNCTION_NAME)
711 138508 continue;
712
4/6
✓ Branch 17 → 18 taken 33004 times.
✗ Branch 17 → 39 not taken.
✓ Branch 18 → 19 taken 33004 times.
✗ Branch 18 → 39 not taken.
✓ Branch 19 → 20 taken 20633 times.
✓ Branch 19 → 28 taken 12371 times.
 77648 const bool isMoveCtor = function.paramList.size() == 1 && function.paramList.at(0).qualType.isRef() &&
713
6/8
✓ Branch 16 → 17 taken 33004 times.
✓ Branch 16 → 28 taken 11640 times.
✓ Branch 20 → 21 taken 20633 times.
✗ Branch 20 → 39 not taken.
✓ Branch 21 → 22 taken 20633 times.
✗ Branch 21 → 39 not taken.
✓ Branch 22 → 23 taken 2994 times.
✓ Branch 22 → 28 taken 17639 times.
 80642 !function.paramList.at(0).qualType.isConstRef() &&
714
5/8
✓ Branch 23 → 24 taken 2994 times.
✗ Branch 23 → 39 not taken.
✓ Branch 24 → 25 taken 2994 times.
✗ Branch 24 → 39 not taken.
✓ Branch 25 → 26 taken 2994 times.
✗ Branch 25 → 39 not taken.
✓ Branch 26 → 27 taken 178 times.
✓ Branch 26 → 28 taken 2816 times.
 2994 function.paramList.at(0).qualType.getBase() == function.thisType;
715
2/2
✓ Branch 29 → 30 taken 178 times.
✓ Branch 29 → 31 taken 44466 times.
 44644 if (isMoveCtor)
716 178 return &function;
717 }
718 }
719 15229 return nullptr;
720 }
721
722 11 bool FunctionManager::hasDefaultCtor(const Scope *matchScope) {
723
4/8
✓ Branch 2 → 3 taken 11 times.
✗ Branch 2 → 29 not taken.
✓ Branch 3 → 4 taken 11 times.
✗ Branch 3 → 29 not taken.
✓ Branch 4 → 5 taken 11 times.
✗ Branch 4 → 29 not taken.
✓ Branch 25 → 6 taken 42 times.
✗ Branch 25 → 26 not taken.
 42 for (const auto &manifestations : matchScope->functions | std::views::values)
724
5/8
✓ Branch 7 → 8 taken 42 times.
✗ Branch 7 → 28 not taken.
✓ Branch 8 → 9 taken 42 times.
✗ Branch 8 → 28 not taken.
✓ Branch 9 → 10 taken 42 times.
✗ Branch 9 → 28 not taken.
✓ Branch 22 → 11 taken 42 times.
✓ Branch 22 → 23 taken 31 times.
 73 for (const auto &function : manifestations | std::views::values)
725
6/8
✓ Branch 12 → 13 taken 42 times.
✗ Branch 12 → 28 not taken.
✓ Branch 13 → 14 taken 11 times.
✓ Branch 13 → 17 taken 31 times.
✓ Branch 15 → 16 taken 11 times.
✗ Branch 15 → 17 not taken.
✓ Branch 18 → 19 taken 11 times.
✓ Branch 18 → 20 taken 31 times.
 42 if (function.name == CTOR_FUNCTION_NAME && function.paramList.empty())
726 11 return true;
727 ✗ return false;
728 }
729
730 25371 bool FunctionManager::hasDtor(const Scope *matchScope) {
731
5/8
✓ Branch 2 → 3 taken 25371 times.
✗ Branch 2 → 24 not taken.
✓ Branch 3 → 4 taken 25371 times.
✗ Branch 3 → 24 not taken.
✓ Branch 4 → 5 taken 25371 times.
✗ Branch 4 → 24 not taken.
✓ Branch 20 → 6 taken 183647 times.
✓ Branch 20 → 21 taken 14443 times.
 198090 for (const auto &manifestations : matchScope->functions | std::views::values)
732
5/8
✓ Branch 7 → 8 taken 183647 times.
✗ Branch 7 → 23 not taken.
✓ Branch 8 → 9 taken 183647 times.
✗ Branch 8 → 23 not taken.
✓ Branch 9 → 10 taken 183647 times.
✗ Branch 9 → 23 not taken.
✓ Branch 17 → 11 taken 204583 times.
✓ Branch 17 → 18 taken 172719 times.
 377302 for (const auto &function : manifestations | std::views::values)
733
3/4
✓ Branch 12 → 13 taken 204583 times.
✗ Branch 12 → 23 not taken.
✓ Branch 13 → 14 taken 10928 times.
✓ Branch 13 → 15 taken 193655 times.
 204583 if (function.name == DTOR_FUNCTION_NAME)
734 10928 return true;
735 14443 return false;
736 }
737
738 /**
739 * Clear the lookup cache
740 */
741 622 void FunctionManager::cleanup() {
742 622 lookupCache.clear();
743 622 lookupCacheHits = 0;
744 622 lookupCacheMisses = 0;
745 622 }
746
747 /**
748 * Dump usage statistics for the lookup cache
749 */
750 366 std::string FunctionManager::dumpLookupCacheStatistics() {
751
1/2
✓ Branch 2 → 3 taken 366 times.
✗ Branch 2 → 22 not taken.
 366 std::stringstream stats;
752
2/4
✓ Branch 3 → 4 taken 366 times.
✗ Branch 3 → 20 not taken.
✓ Branch 4 → 5 taken 366 times.
✗ Branch 4 → 20 not taken.
 366 stats << "FunctionManager lookup cache statistics:" << std::endl;
753
3/6
✓ Branch 5 → 6 taken 366 times.
✗ Branch 5 → 20 not taken.
✓ Branch 7 → 8 taken 366 times.
✗ Branch 7 → 20 not taken.
✓ Branch 8 → 9 taken 366 times.
✗ Branch 8 → 20 not taken.
 366 stats << " lookup cache entries: " << lookupCache.size() << std::endl;
754
3/6
✓ Branch 9 → 10 taken 366 times.
✗ Branch 9 → 20 not taken.
✓ Branch 10 → 11 taken 366 times.
✗ Branch 10 → 20 not taken.
✓ Branch 11 → 12 taken 366 times.
✗ Branch 11 → 20 not taken.
 366 stats << " lookup cache hits: " << lookupCacheHits << std::endl;
755
3/6
✓ Branch 12 → 13 taken 366 times.
✗ Branch 12 → 20 not taken.
✓ Branch 13 → 14 taken 366 times.
✗ Branch 13 → 20 not taken.
✓ Branch 14 → 15 taken 366 times.
✗ Branch 14 → 20 not taken.
 366 stats << " lookup cache misses: " << lookupCacheMisses << std::endl;
756
1/2
✓ Branch 15 → 16 taken 366 times.
✗ Branch 15 → 20 not taken.
 732 return stats.str();
757 366 }
758
759 } // namespace spice::compiler
760