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 99778 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 99778 times.
✗ Branch 2 → 49 not taken.
✓ Branch 3 → 4 taken 99778 times.
✗ Branch 3 → 46 not taken.
✓ Branch 4 → 5 taken 99778 times.
✗ Branch 4 → 44 not taken.
 99778 const std::string fctId = baseFunction.name + ":" + baseFunction.declNode->codeLoc.toPrettyLineAndColumn();
29
1/2
✓ Branch 8 → 9 taken 99778 times.
✗ Branch 8 → 50 not taken.
 99778 insertScope->functions.emplace(fctId, FunctionManifestationList());
30
31 // Collect substantiations
32 99778 std::vector<Function> manifestations;
33
1/2
✓ Branch 10 → 11 taken 99778 times.
✗ Branch 10 → 54 not taken.
 99778 substantiateOptionalParams(baseFunction, manifestations);
34
1/2
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 14 taken 99778 times.
 99778 assert(!manifestations.empty());
35
36 // Save substantiations in declaration node
37 99778 Function *manifestationPtr = nullptr;
38
2/2
✓ Branch 32 → 16 taken 104832 times.
✓ Branch 32 → 33 taken 99774 times.
 304384 for (const Function &manifestation : manifestations) {
39
2/2
✓ Branch 18 → 19 taken 104828 times.
✓ Branch 18 → 53 taken 4 times.
 104832 manifestationPtr = insertSubstantiation(insertScope, manifestation, baseFunction.declNode);
40
1/2
✗ Branch 19 → 20 not taken.
✓ Branch 19 → 21 taken 104828 times.
 104828 assert(manifestationPtr != nullptr);
41
1/2
✓ Branch 21 → 22 taken 104828 times.
✗ Branch 21 → 23 not taken.
 104828 if (nodeFunctionList)
42
1/2
✓ Branch 22 → 23 taken 104828 times.
✗ Branch 22 → 53 not taken.
 104828 nodeFunctionList->push_back(manifestationPtr);
43 }
44
45
1/2
✗ Branch 33 → 34 not taken.
✓ Branch 33 → 35 taken 99774 times.
 99774 if (!nodeFunctionList)
46 ✗ return manifestationPtr;
47
48
1/2
✗ Branch 36 → 37 not taken.
✓ Branch 36 → 38 taken 99774 times.
 99774 assert(!nodeFunctionList->empty());
49 99774 return nodeFunctionList->front();
50 99782 }
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 99778 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 27211 times.
✓ Branch 3 → 6 taken 72567 times.
 99778 if (baseFunction.paramList.empty()) {
71
1/2
✓ Branch 4 → 5 taken 27211 times.
✗ Branch 4 → 47 not taken.
 27211 manifestations.push_back(baseFunction);
72 27211 return;
73 }
74
75 72567 ParamList currentFunctionParamTypes;
76
1/2
✓ Branch 7 → 8 taken 72567 times.
✗ Branch 7 → 45 not taken.
 72567 currentFunctionParamTypes.reserve(baseFunction.paramList.size());
77 72567 bool metFirstOptionalParam = false;
78
1/2
✓ Branch 8 → 9 taken 72567 times.
✗ Branch 8 → 45 not taken.
 72567 Function manifestation = baseFunction;
79
80 // Loop over all parameters
81
2/2
✓ Branch 32 → 11 taken 113486 times.
✓ Branch 32 → 33 taken 72567 times.
 258620 for (const auto &[qualType, isOptional] : baseFunction.paramList) {
82 // Check if we have a mandatory parameter
83
2/2
✓ Branch 13 → 14 taken 108432 times.
✓ Branch 13 → 16 taken 5054 times.
 113486 if (!isOptional) {
84
1/2
✓ Branch 14 → 15 taken 108432 times.
✗ Branch 14 → 40 not taken.
 108432 currentFunctionParamTypes.push_back({qualType, /*optional=*/false});
85 108432 continue;
86 }
87
88 // Add substantiation without the optional parameter
89
2/2
✓ Branch 16 → 17 taken 4811 times.
✓ Branch 16 → 20 taken 243 times.
 5054 if (!metFirstOptionalParam) {
90
1/2
✓ Branch 17 → 18 taken 4811 times.
✗ Branch 17 → 42 not taken.
 4811 manifestation.paramList = currentFunctionParamTypes;
91
1/2
✓ Branch 18 → 19 taken 4811 times.
✗ Branch 18 → 42 not taken.
 4811 manifestations.push_back(manifestation);
92 // Now we cannot accept mandatory parameters anymore
93 4811 metFirstOptionalParam = true;
94 }
95
96 // Add substantiation with the optional parameter
97
1/2
✓ Branch 20 → 21 taken 5054 times.
✗ Branch 20 → 41 not taken.
 5054 currentFunctionParamTypes.push_back({qualType, /*optional=*/false});
98
1/2
✓ Branch 21 → 22 taken 5054 times.
✗ Branch 21 → 42 not taken.
 5054 manifestation.paramList = currentFunctionParamTypes;
99
1/2
✓ Branch 22 → 23 taken 5054 times.
✗ Branch 22 → 42 not taken.
 5054 manifestations.push_back(manifestation);
100 }
101
102 // Ensure at least once manifestation
103
2/2
✓ Branch 34 → 35 taken 67756 times.
✓ Branch 34 → 36 taken 4811 times.
 72567 if (manifestations.empty())
104
1/2
✓ Branch 35 → 36 taken 67756 times.
✗ Branch 35 → 43 not taken.
 67756 manifestations.push_back(baseFunction);
105 72567 }
106
107 447 Function FunctionManager::createMainFunction(SymbolTableEntry *entry, const QualTypeList &paramTypes, ASTNode *declNode) {
108 447 ParamList paramList;
109
2/2
✓ Branch 16 → 4 taken 16 times.
✓ Branch 16 → 17 taken 447 times.
 910 for (const QualType &paramType : paramTypes)
110
1/2
✓ Branch 6 → 7 taken 16 times.
✗ Branch 6 → 33 not taken.
 16 paramList.push_back({paramType, false});
111
5/10
✓ Branch 19 → 20 taken 447 times.
✗ Branch 19 → 45 not taken.
✓ Branch 20 → 21 taken 447 times.
✗ Branch 20 → 42 not taken.
✓ Branch 21 → 22 taken 447 times.
✗ Branch 21 → 41 not taken.
✓ Branch 22 → 23 taken 447 times.
✗ Branch 22 → 40 not taken.
✓ Branch 24 → 25 taken 447 times.
✗ Branch 24 → 35 not taken.
 1341 return {MAIN_FUNCTION_NAME, entry, QualType(TY_DYN), QualType(TY_INT), paramList, {}, declNode};
112 447 }
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 29752 Function *FunctionManager::findManifestationBySignature(Scope *scope, const std::string &signature) {
122
5/8
✓ Branch 2 → 3 taken 29752 times.
✗ Branch 2 → 19 not taken.
✓ Branch 3 → 4 taken 29752 times.
✗ Branch 3 → 19 not taken.
✓ Branch 4 → 5 taken 29752 times.
✗ Branch 4 → 19 not taken.
✓ Branch 15 → 6 taken 595891 times.
✓ Branch 15 → 16 taken 27062 times.
 622953 for (auto &manifestations : scope->functions | std::views::values)
123
3/4
✓ Branch 7 → 8 taken 595891 times.
✗ Branch 7 → 18 not taken.
✓ Branch 10 → 11 taken 2690 times.
✓ Branch 10 → 13 taken 593201 times.
 595891 if (const auto it = manifestations.find(signature); it != manifestations.end())
124 2690 return &it->second;
125 27062 return nullptr;
126 }
127
128 131894 Function *FunctionManager::insertSubstantiation(Scope *insertScope, const Function &newManifestation, const ASTNode *declNode) {
129
2/4
✓ Branch 2 → 3 taken 131894 times.
✗ Branch 2 → 70 not taken.
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 131894 times.
 131894 assert(newManifestation.hasSubstantiatedParams());
130
131
1/2
✓ Branch 5 → 6 taken 131894 times.
✗ Branch 5 → 70 not taken.
 131894 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 131894 times.
✗ Branch 6 → 59 not taken.
✓ Branch 7 → 8 taken 131894 times.
✗ Branch 7 → 59 not taken.
✓ Branch 8 → 9 taken 131894 times.
✗ Branch 8 → 59 not taken.
✓ Branch 30 → 10 taken 2089922 times.
✓ Branch 30 → 31 taken 131890 times.
 2221812 for (const auto &manifestations : insertScope->functions | std::views::values) {
135
3/4
✓ Branch 11 → 12 taken 2089922 times.
✗ Branch 11 → 59 not taken.
✓ Branch 12 → 13 taken 4 times.
✓ Branch 12 → 28 taken 2089918 times.
 2089922 if (manifestations.contains(signature)) {
136
2/2
✓ Branch 16 → 17 taken 2 times.
✓ Branch 16 → 18 taken 2 times.
 4 const SemanticErrorType errorType = newManifestation.isFunction() ? FUNCTION_DECLARED_TWICE : PROCEDURE_DECLARED_TWICE;
137
4/8
✓ Branch 20 → 21 taken 4 times.
✗ Branch 20 → 53 not taken.
✓ Branch 21 → 22 taken 4 times.
✗ Branch 21 → 51 not taken.
✓ Branch 22 → 23 taken 4 times.
✗ Branch 22 → 49 not taken.
✓ Branch 23 → 24 taken 4 times.
✗ Branch 23 → 47 not taken.
 4 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 131890 times.
✗ Branch 31 → 65 not taken.
✓ Branch 32 → 33 taken 131890 times.
✗ Branch 32 → 62 not taken.
✓ Branch 33 → 34 taken 131890 times.
✗ Branch 33 → 60 not taken.
 131890 const std::string fctId = newManifestation.name + ":" + declNode->codeLoc.toPrettyLineAndColumn();
143
2/4
✓ Branch 36 → 37 taken 131890 times.
✗ Branch 36 → 66 not taken.
✗ Branch 37 → 38 not taken.
✓ Branch 37 → 39 taken 131890 times.
 131890 assert(insertScope->functions.contains(fctId));
144
1/2
✓ Branch 39 → 40 taken 131890 times.
✗ Branch 39 → 66 not taken.
 131890 FunctionManifestationList &manifestationList = insertScope->functions.at(fctId);
145
146 // Add substantiated function
147
1/2
✓ Branch 40 → 41 taken 131890 times.
✗ Branch 40 → 66 not taken.
 131890 manifestationList.emplace(signature, newManifestation);
148
1/2
✓ Branch 41 → 42 taken 131890 times.
✗ Branch 41 → 66 not taken.
 263780 return &manifestationList.at(signature);
149 131894 }
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 101187 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 101187 times.
✗ Branch 2 → 66 not taken.
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 101187 times.
 101187 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 101187 times.
✗ Branch 5 → 78 not taken.
 101187 const ConditionalLock lock(symbolRegistryMutex);
168
169 // Do cache lookup
170 101187 const uint64_t cacheKey = getCacheKey(matchScope, reqName, reqThisType, reqArgs, {});
171
3/4
✓ Branch 9 → 10 taken 101187 times.
✗ Branch 9 → 67 not taken.
✓ Branch 12 → 13 taken 20361 times.
✓ Branch 12 → 15 taken 80826 times.
 101187 if (const auto it = lookupCache.find(cacheKey); it != lookupCache.end()) {
172 20361 lookupCacheHits++;
173 20361 return it->second;
174 }
175 80826 lookupCacheMisses++;
176
177 27500 const auto pred = [&](const Arg &arg) { return arg.first.hasAnyGenericParts(); };
178
4/8
✓ Branch 15 → 16 taken 80826 times.
✗ Branch 15 → 76 not taken.
✓ Branch 16 → 17 taken 80826 times.
✗ Branch 16 → 20 not taken.
✓ Branch 17 → 18 taken 80826 times.
✗ Branch 17 → 76 not taken.
✓ Branch 18 → 19 taken 80826 times.
✗ Branch 18 → 20 not taken.
 80826 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 80826 std::vector<const Function *> matches;
182
2/2
✓ Branch 55 → 23 taken 569755 times.
✓ Branch 55 → 56 taken 80826 times.
 650581 for (const auto &[defCodeLocStr, manifestations] : matchScope->functions) {
183
2/2
✓ Branch 52 → 28 taken 653603 times.
✓ Branch 52 → 53 taken 246686 times.
 900289 for (const auto &[signature, presetFunction] : manifestations) {
184
2/4
✓ Branch 31 → 32 taken 653603 times.
✗ Branch 31 → 71 not taken.
✗ Branch 32 → 33 not taken.
✓ Branch 32 → 34 taken 653603 times.
 653603 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 653603 times.
✗ Branch 34 → 71 not taken.
✓ Branch 35 → 36 taken 264324 times.
✓ Branch 35 → 37 taken 389279 times.
 653603 if (presetFunction.isFullySubstantiated() != requestedFullySubstantiated)
189 330534 continue;
190
191 // Copy the function to be able to substantiate types
192
1/2
✓ Branch 37 → 38 taken 389279 times.
✗ Branch 37 → 71 not taken.
 389279 Function candidate = presetFunction;
193
194 // Create empty type mapping
195 389279 TypeMapping &typeMapping = candidate.typeMapping;
196
197 389279 bool forceSubstantiation = false;
198
1/2
✓ Branch 38 → 39 taken 389279 times.
✗ Branch 38 → 69 not taken.
 389279 const MatchResult matchResult = matchManifestation(candidate, matchScope, reqName, reqThisType, reqArgs, typeMapping,
199 strictQualifierMatching, forceSubstantiation, nullptr);
200
2/2
✓ Branch 39 → 40 taken 299787 times.
✓ Branch 39 → 41 taken 89492 times.
 389279 if (matchResult == MatchResult::SKIP_FUNCTION)
201 299787 break; // Leave the whole function
202
2/2
✓ Branch 41 → 42 taken 66210 times.
✓ Branch 41 → 43 taken 23282 times.
 89492 if (matchResult == MatchResult::SKIP_MANIFESTATION)
203 66210 continue; // Leave this manifestation and try the next one
204
205 // Add to matches
206
3/6
✓ Branch 43 → 44 taken 23282 times.
✗ Branch 43 → 68 not taken.
✓ Branch 44 → 45 taken 23282 times.
✗ Branch 44 → 68 not taken.
✓ Branch 45 → 46 taken 23282 times.
✗ Branch 45 → 68 not taken.
 23282 matches.push_back(&matchScope->functions.at(defCodeLocStr).at(signature));
207
208 23282 break; // Leave the whole manifestation list to not double-match the manifestation
209
2/2
✓ Branch 48 → 49 taken 66210 times.
✓ Branch 48 → 50 taken 323069 times.
 389279 }
210 }
211
212 // Return the very match or a nullptr
213
2/2
✓ Branch 57 → 58 taken 23282 times.
✓ Branch 57 → 60 taken 57544 times.
 80826 return !matches.empty() ? matches.front() : nullptr;
214 101187 }
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 1111079 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 1111079 times.
✗ Branch 2 → 182 not taken.
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 1111079 times.
 1111079 assert(reqThisType.isOneOf({TY_DYN, TY_STRUCT, TY_INTERFACE}));
233
234 // Do cache lookup
235 1111079 const uint64_t cacheKey = getCacheKey(matchScope, reqName, reqThisType, reqArgs, templateTypeHints);
236
3/4
✓ Branch 6 → 7 taken 1111079 times.
✗ Branch 6 → 183 not taken.
✓ Branch 9 → 10 taken 133489 times.
✓ Branch 9 → 12 taken 977590 times.
 1111079 if (const auto it = lookupCache.find(cacheKey); it != lookupCache.end()) {
237 133489 lookupCacheHits++;
238 133489 return it->second;
239 }
240 977590 lookupCacheMisses++;
241
242 // Loop over function registry to find functions, that match the requirements of the call
243 977590 std::vector<Function *> matches;
244
2/2
✓ Branch 141 → 14 taken 11016737 times.
✓ Branch 141 → 142 taken 977588 times.
 11994325 for (auto &[fctId, manifestations] : matchScope->functions) {
245
2/2
✓ Branch 138 → 19 taken 11312330 times.
✓ Branch 138 → 139 taken 430878 times.
 11743208 for (const auto &[signature, presetFunction] : manifestations) {
246
2/4
✓ Branch 22 → 23 taken 11312330 times.
✗ Branch 22 → 205 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 25 taken 11312330 times.
 11312330 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 11312330 times.
✗ Branch 25 → 205 not taken.
✓ Branch 26 → 27 taken 11024984 times.
✓ Branch 26 → 28 taken 287346 times.
✗ Branch 27 → 28 not taken.
✓ Branch 27 → 29 taken 11024984 times.
✓ Branch 30 → 31 taken 287346 times.
✓ Branch 30 → 32 taken 11024984 times.
 11312330 if (presetFunction.isGenericSubstantiation() || presetFunction.isNewlyInserted)
250 726471 continue;
251
252 // Copy the function to be able to substantiate types
253
1/2
✓ Branch 32 → 33 taken 11024984 times.
✗ Branch 32 → 205 not taken.
 11024984 Function candidate = presetFunction;
254
255 // Prepare type mapping, based on the given initial type mapping
256 11024984 TypeMapping &typeMapping = candidate.typeMapping;
257 11024984 typeMapping.clear();
258
2/2
✓ Branch 46 → 35 taken 123106 times.
✓ Branch 46 → 47 taken 11024984 times.
 11148090 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 123106 times.
✗ Branch 35 → 203 not taken.
 123106 const GenericType &candidateTemplateType = candidate.templateTypes.at(i);
263
3/4
✓ Branch 36 → 37 taken 123106 times.
✗ Branch 36 → 203 not taken.
✓ Branch 37 → 38 taken 1254 times.
✓ Branch 37 → 39 taken 121852 times.
 123106 if (!candidateTemplateType.is(TY_GENERIC))
264 1254 continue;
265
1/2
✓ Branch 39 → 40 taken 121852 times.
✗ Branch 39 → 203 not taken.
 121852 const std::string &typeName = candidateTemplateType.getSubType();
266
1/2
✓ Branch 40 → 41 taken 121852 times.
✗ Branch 40 → 203 not taken.
 121852 const QualType &templateType = templateTypeHints.at(i);
267
1/2
✓ Branch 41 → 42 taken 121852 times.
✗ Branch 41 → 203 not taken.
 121852 typeMapping.emplace(typeName, templateType);
268 }
269
270 11024984 bool forceSubstantiation = false;
271
2/2
✓ Branch 47 → 48 taken 11024982 times.
✓ Branch 47 → 203 taken 2 times.
 11024984 const MatchResult matchResult = matchManifestation(candidate, matchScope, reqName, reqThisType, reqArgs, typeMapping,
272 strictQualifierMatching, forceSubstantiation, callNode);
273
2/2
✓ Branch 48 → 49 taken 10556105 times.
✓ Branch 48 → 50 taken 468877 times.
 11024982 if (matchResult == MatchResult::SKIP_FUNCTION)
274 10556105 break; // Leave the whole function
275
2/2
✓ Branch 50 → 51 taken 395046 times.
✓ Branch 50 → 52 taken 73831 times.
 468877 if (matchResult == MatchResult::SKIP_MANIFESTATION)
276 395046 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 73831 candidate.used = true;
280 73831 candidate.entry->used = true;
281
282 // Check if the function is generic needs to be substantiated
283
6/6
✓ Branch 53 → 54 taken 45557 times.
✓ Branch 53 → 56 taken 28274 times.
✓ Branch 54 → 55 taken 44079 times.
✓ Branch 54 → 56 taken 1478 times.
✓ Branch 57 → 58 taken 44079 times.
✓ Branch 57 → 70 taken 29752 times.
 73831 if (presetFunction.templateTypes.empty() && !forceSubstantiation) {
284
5/10
✓ Branch 58 → 59 taken 44079 times.
✗ Branch 58 → 184 not taken.
✓ Branch 59 → 60 taken 44079 times.
✗ Branch 59 → 64 not taken.
✓ Branch 60 → 61 taken 44079 times.
✗ Branch 60 → 184 not taken.
✓ Branch 61 → 62 taken 44079 times.
✗ Branch 61 → 184 not taken.
✓ Branch 62 → 63 taken 44079 times.
✗ Branch 62 → 64 not taken.
 44079 assert(matchScope->functions.contains(fctId) && matchScope->functions.at(fctId).contains(signature));
285
2/4
✓ Branch 65 → 66 taken 44079 times.
✗ Branch 65 → 184 not taken.
✓ Branch 66 → 67 taken 44079 times.
✗ Branch 66 → 184 not taken.
 44079 Function *match = &matchScope->functions.at(fctId).at(signature);
286 44079 match->used = true;
287
1/2
✓ Branch 67 → 68 taken 44079 times.
✗ Branch 67 → 184 not taken.
 44079 matches.push_back(match);
288 44079 continue; // Match was successful -> match the next function
289 44079 }
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 29752 times.
✗ Branch 70 → 203 not taken.
 29752 const std::string newSignature = candidate.getSignature(true, true, false, true);
297
3/4
✓ Branch 71 → 72 taken 29752 times.
✗ Branch 71 → 185 not taken.
✓ Branch 72 → 73 taken 2690 times.
✓ Branch 72 → 75 taken 27062 times.
 29752 if (Function *existingManifestation = findManifestationBySignature(matchScope, newSignature)) {
298 2690 existingManifestation->used = true;
299
1/2
✓ Branch 73 → 74 taken 2690 times.
✗ Branch 73 → 185 not taken.
 2690 matches.push_back(existingManifestation);
300 2690 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 27062 times.
✗ Branch 75 → 201 not taken.
 27062 Function *substantiatedFunction = insertSubstantiation(matchScope, candidate, presetFunction.declNode);
305
2/4
✓ Branch 77 → 78 taken 27062 times.
✗ Branch 77 → 201 not taken.
✓ Branch 78 → 79 taken 27062 times.
✗ Branch 78 → 201 not taken.
 27062 substantiatedFunction->genericPreset = &matchScope->functions.at(fctId).at(signature);
306 27062 substantiatedFunction->alreadyTypeChecked = false;
307
2/4
✓ Branch 79 → 80 taken 27062 times.
✗ Branch 79 → 201 not taken.
✓ Branch 80 → 81 taken 27062 times.
✗ Branch 80 → 201 not taken.
 27062 substantiatedFunction->declNode->getFctManifestations(reqName)->push_back(substantiatedFunction);
308 27062 substantiatedFunction->isNewlyInserted = true; // To not iterate over it in the same matching
309
310 // Copy function entry
311
1/2
✓ Branch 81 → 82 taken 27062 times.
✗ Branch 81 → 201 not taken.
 27062 const std::string newScopeName = substantiatedFunction->getScopeName();
312
1/2
✓ Branch 82 → 83 taken 27062 times.
✗ Branch 82 → 199 not taken.
 27062 matchScope->lookupStrict(presetFunction.entry->name)->used = true;
313
1/2
✓ Branch 85 → 86 taken 27062 times.
✗ Branch 85 → 199 not taken.
 27062 substantiatedFunction->entry = matchScope->symbolTable.copySymbol(presetFunction.entry->name, newScopeName);
314
1/2
✗ Branch 86 → 87 not taken.
✓ Branch 86 → 88 taken 27062 times.
 27062 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 27062 times.
✗ Branch 88 → 199 not taken.
 27062 const std::string oldScopeName = presetFunction.getScopeName();
319
3/4
✓ Branch 89 → 90 taken 27062 times.
✗ Branch 89 → 197 not taken.
✓ Branch 90 → 91 taken 27050 times.
✓ Branch 90 → 127 taken 12 times.
 27062 if (matchScope->children.contains(oldScopeName)) {
320
1/2
✓ Branch 91 → 92 taken 27050 times.
✗ Branch 91 → 197 not taken.
 27050 Scope *childScope = matchScope->copyChildScope(oldScopeName, newScopeName);
321
1/2
✗ Branch 92 → 93 not taken.
✓ Branch 92 → 94 taken 27050 times.
 27050 assert(childScope != nullptr);
322 27050 childScope->isGenericScope = false;
323 27050 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 32770 times.
✓ Branch 104 → 105 taken 27050 times.
 59820 for (const auto &[typeName, concreteType] : substantiatedFunction->typeMapping)
327
2/4
✓ Branch 99 → 100 taken 32770 times.
✗ Branch 99 → 188 not taken.
✓ Branch 100 → 101 taken 32770 times.
✗ Branch 100 → 186 not taken.
 32770 childScope->insertGenericType(typeName, GenericType(concreteType));
328
329 // Substantiate the 'this' entry in the new function scope
330
6/6
✓ Branch 108 → 109 taken 20588 times.
✓ Branch 108 → 112 taken 6462 times.
✓ Branch 110 → 111 taken 20582 times.
✓ Branch 110 → 112 taken 6 times.
✓ Branch 113 → 114 taken 20582 times.
✓ Branch 113 → 127 taken 6468 times.
 27050 if (presetFunction.isMethod() && !presetFunction.templateTypes.empty()) {
331
1/2
✓ Branch 116 → 117 taken 20582 times.
✗ Branch 116 → 192 not taken.
 61746 SymbolTableEntry *thisEntry = childScope->lookupStrict(THIS_VARIABLE_NAME);
332
1/2
✗ Branch 122 → 123 not taken.
✓ Branch 122 → 124 taken 20582 times.
 20582 assert(thisEntry != nullptr);
333
2/4
✓ Branch 124 → 125 taken 20582 times.
✗ Branch 124 → 196 not taken.
✓ Branch 125 → 126 taken 20582 times.
✗ Branch 125 → 196 not taken.
 20582 thisEntry->updateType(candidate.thisType.toPtr(callNode), /*overwriteExistingType=*/true);
334 }
335 }
336
337 // Add to matched functions
338
1/2
✓ Branch 127 → 128 taken 27062 times.
✗ Branch 127 → 197 not taken.
 27062 matches.push_back(substantiatedFunction);
339
340 27062 break; // Leave the whole manifestation list to not double-match the manifestation
341
2/2
✓ Branch 134 → 135 taken 439125 times.
✓ Branch 134 → 136 taken 10585857 times.
 11054736 }
342 }
343
344 // If no matches were found, return a nullptr
345
2/2
✓ Branch 143 → 144 taken 903783 times.
✓ Branch 143 → 145 taken 73805 times.
 977588 if (matches.empty())
346 903783 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 73805 times.
✗ Branch 145 → 221 not taken.
 73805 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 73805 times.
 73805 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 73805 Function *matchedFunction = matches.front();
361 73805 matchedFunction->isNewlyInserted = false;
362
363 // Insert into cache
364
1/2
✓ Branch 176 → 177 taken 73805 times.
✗ Branch 176 → 221 not taken.
 73805 lookupCache[cacheKey] = matchedFunction;
365
366 // Trigger revisit in type checker if required
367
1/2
✓ Branch 177 → 178 taken 73805 times.
✗ Branch 177 → 221 not taken.
 73805 TypeChecker::requestRevisitIfRequired(matchedFunction);
368
369 // Return the very match
370 73805 return matchedFunction;
371 977590 }
372
373 11414263 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 10855892 times.
✓ Branch 3 → 5 taken 558371 times.
 11414263 if (!matchName(candidate, reqName))
379 10855892 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 558371 times.
✗ Branch 5 → 29 not taken.
✗ Branch 6 → 7 not taken.
✓ Branch 6 → 8 taken 558371 times.
 558371 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 558369 times.
✓ Branch 8 → 29 taken 2 times.
✓ Branch 9 → 10 taken 461252 times.
✓ Branch 9 → 11 taken 97117 times.
 558371 if (!matchArgTypes(candidate, reqArgs, typeMapping, strictQualifierMatching, forceSubstantiation, callNode))
387 461252 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 40804 const auto isGeneric = [](const GenericType &templateType) { return templateType.is(TY_GENERIC); };
393
3/4
✓ Branch 12 → 13 taken 97117 times.
✗ Branch 12 → 29 not taken.
✓ Branch 13 → 14 taken 4 times.
✓ Branch 13 → 15 taken 97113 times.
 97117 if (typeMapping.size() < static_cast<size_t>(std::ranges::count_if(candidate.templateTypes, isGeneric)))
394 4 return MatchResult::SKIP_MANIFESTATION; // Leave this manifestation and try the next one
395
396 // Substantiate return type
397
1/2
✓ Branch 15 → 16 taken 97113 times.
✗ Branch 15 → 29 not taken.
 97113 substantiateReturnType(candidate, typeMapping, callNode);
398
399 // Set the match scope to the scope of the concrete substantiation
400 97113 const QualType &thisType = candidate.thisType;
401
3/4
✓ Branch 16 → 17 taken 97113 times.
✗ Branch 16 → 29 not taken.
✓ Branch 17 → 18 taken 67686 times.
✓ Branch 17 → 25 taken 29427 times.
 97113 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 30 times.
✓ Branch 18 → 23 taken 67656 times.
 67686 if (matchScope->isGenericScope) {
404
1/2
✓ Branch 19 → 20 taken 30 times.
✗ Branch 19 → 29 not taken.
 30 const Struct *spiceStruct = thisType.getStruct(candidate.declNode);
405
1/2
✗ Branch 20 → 21 not taken.
✓ Branch 20 → 22 taken 30 times.
 30 assert(spiceStruct != nullptr);
406 30 matchScope = spiceStruct->scope;
407 }
408
1/2
✓ Branch 23 → 24 taken 67686 times.
✗ Branch 23 → 28 not taken.
 67686 candidate.thisType = candidate.thisType.getWithBodyScope(matchScope);
409 }
410
411 97113 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 11414263 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 558371 bool FunctionManager::matchThisType(Function &candidate, const QualType &reqThisType, TypeMapping &typeMapping,
434 bool strictQualifierMatching, const ASTNode *callNode) {
435 558371 QualType &candidateThisType = candidate.thisType;
436
437 // Shortcut for procedures
438
7/10
✓ Branch 2 → 3 taken 558371 times.
✗ Branch 2 → 23 not taken.
✓ Branch 3 → 4 taken 378092 times.
✓ Branch 3 → 7 taken 180279 times.
✓ Branch 4 → 5 taken 378092 times.
✗ Branch 4 → 23 not taken.
✓ Branch 5 → 6 taken 378092 times.
✗ Branch 5 → 7 not taken.
✓ Branch 8 → 9 taken 378092 times.
✓ Branch 8 → 10 taken 180279 times.
 558371 if (candidateThisType.is(TY_DYN) && reqThisType.is(TY_DYN))
439 378092 return true;
440
441 // Give the type matcher a way to retrieve instances of GenericType by their name
442 388935 TypeMatcher::ResolverFct genericTypeResolver = [&](const std::string &genericTypeName) {
443 28377 return getGenericTypeOfCandidateByName(candidate, genericTypeName);
444 180279 };
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 180279 times.
✗ Branch 11 → 21 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 14 taken 180279 times.
 180279 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 180279 times.
✗ Branch 14 → 21 not taken.
✓ Branch 15 → 16 taken 30648 times.
✓ Branch 15 → 17 taken 149631 times.
 180279 if (candidateThisType.hasAnyGenericParts())
453
1/2
✓ Branch 16 → 17 taken 30648 times.
✗ Branch 16 → 21 not taken.
 30648 TypeMatcher::substantiateTypeWithTypeMapping(candidateThisType, typeMapping, callNode);
454
455 180279 return true;
456 180279 }
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 558371 bool FunctionManager::matchArgTypes(Function &candidate, const ArgList &reqArgs, TypeMapping &typeMapping,
470 bool strictQualifierMatching, bool &needsSubstantiation, const ASTNode *callNode) {
471 558371 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 556444 times.
✓ Branch 2 → 7 taken 1927 times.
✓ Branch 5 → 6 taken 78222 times.
✓ Branch 5 → 7 taken 478222 times.
✓ Branch 8 → 9 taken 78222 times.
✓ Branch 8 → 10 taken 480149 times.
 558371 if (!candidate.isVararg && reqArgs.size() != candidateParamList.size())
475 78222 return false;
476 // In the case of a vararg function, we only disallow fewer arguments than parameters
477
4/6
✓ Branch 10 → 11 taken 1927 times.
✓ Branch 10 → 15 taken 478222 times.
✗ Branch 13 → 14 not taken.
✓ Branch 13 → 15 taken 1927 times.
✗ Branch 16 → 17 not taken.
✓ Branch 16 → 18 taken 480149 times.
 480149 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 988707 TypeMatcher::ResolverFct genericTypeResolver = [&](const std::string &genericTypeName) {
482 28409 return getGenericTypeOfCandidateByName(candidate, genericTypeName);
483 480149 };
484
485 // Loop over all parameters
486
2/2
✓ Branch 66 → 20 taken 497998 times.
✓ Branch 66 → 67 taken 97117 times.
 595115 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 8205 times.
✓ Branch 20 → 24 taken 489793 times.
✓ Branch 22 → 23 taken 3807 times.
✓ Branch 22 → 24 taken 4398 times.
✓ Branch 25 → 26 taken 3807 times.
✓ Branch 25 → 29 taken 494191 times.
 497998 if (candidate.isVararg && i >= candidateParamList.size()) {
490
2/4
✓ Branch 26 → 27 taken 3807 times.
✗ Branch 26 → 71 not taken.
✓ Branch 27 → 28 taken 3807 times.
✗ Branch 27 → 71 not taken.
 3807 candidateParamList.push_back(Param(reqArgs.at(i).first, false));
491 3807 needsSubstantiation = true; // We need to modify the candidate param types
492 3807 continue;
493 }
494
495 // Retrieve actual and requested types
496
2/4
✓ Branch 29 → 30 taken 494191 times.
✗ Branch 29 → 84 not taken.
✗ Branch 30 → 31 not taken.
✓ Branch 30 → 32 taken 494191 times.
 494191 assert(!candidateParamList.at(i).isOptional);
497
1/2
✓ Branch 32 → 33 taken 494191 times.
✗ Branch 32 → 84 not taken.
 494191 QualType &candidateType = candidateParamList.at(i).qualType;
498
1/2
✓ Branch 33 → 34 taken 494191 times.
✗ Branch 33 → 84 not taken.
 494191 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 494191 times.
✗ Branch 36 → 84 not taken.
✓ Branch 37 → 38 taken 383030 times.
✓ Branch 37 → 39 taken 111161 times.
 494191 if (!TypeMatcher::matchRequestedToCandidateType(candidateType, requestedType, typeMapping, genericTypeResolver,
502 strictQualifierMatching))
503 383030 return false;
504
505 // Substantiate the candidate param type, based on the type mapping
506
3/4
✓ Branch 39 → 40 taken 111161 times.
✗ Branch 39 → 84 not taken.
✓ Branch 40 → 41 taken 22440 times.
✓ Branch 40 → 42 taken 88721 times.
 111161 if (candidateType.hasAnyGenericParts())
507
1/2
✓ Branch 41 → 42 taken 22440 times.
✗ Branch 41 → 84 not taken.
 22440 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 111161 times.
✗ Branch 42 → 84 not taken.
✓ Branch 43 → 44 taken 2 times.
✓ Branch 43 → 54 taken 111159 times.
 111161 if (!candidateType.canBind(requestedType, isArgTemporary)) {
511
1/2
✓ Branch 44 → 45 taken 2 times.
✗ Branch 44 → 53 not taken.
 2 if (callNode)
512
2/4
✓ Branch 48 → 49 taken 2 times.
✗ Branch 48 → 75 not taken.
✓ Branch 49 → 50 taken 2 times.
✗ Branch 49 → 72 not taken.
 6 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 111159 times.
✗ Branch 54 → 81 not taken.
✓ Branch 55 → 56 taken 111159 times.
✗ Branch 55 → 81 not taken.
✓ Branch 56 → 57 taken 164 times.
✓ Branch 56 → 60 taken 110995 times.
✓ Branch 57 → 58 taken 164 times.
✗ Branch 57 → 81 not taken.
✓ Branch 58 → 59 taken 40 times.
✓ Branch 58 → 60 taken 124 times.
✓ Branch 61 → 62 taken 40 times.
✓ Branch 61 → 64 taken 111119 times.
 111159 if (requestedType.getBase().isOneOf({TY_FUNCTION, TY_PROCEDURE}) && requestedType.hasLambdaCaptures()) {
518
1/2
✓ Branch 62 → 63 taken 40 times.
✗ Branch 62 → 83 not taken.
 40 candidateType = candidateType.getWithLambdaCaptures();
519 40 needsSubstantiation = true;
520 }
521 }
522
523 97117 return true;
524 480149 }
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 97113 void FunctionManager::substantiateReturnType(Function &candidate, const TypeMapping &typeMapping, const ASTNode *callNode) {
534
2/2
✓ Branch 3 → 4 taken 8370 times.
✓ Branch 3 → 5 taken 88743 times.
 97113 if (candidate.returnType.hasAnyGenericParts())
535 8370 TypeMatcher::substantiateTypeWithTypeMapping(candidate.returnType, typeMapping, callNode);
536 97113 }
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 56786 const GenericType *FunctionManager::getGenericTypeOfCandidateByName(const Function &candidate,
546 const std::string &templateTypeName) {
547
1/2
✓ Branch 19 → 4 taken 64326 times.
✗ Branch 19 → 20 not taken.
 121112 for (const GenericType &templateType : candidate.templateTypes) {
548
3/4
✓ Branch 6 → 7 taken 64326 times.
✗ Branch 6 → 22 not taken.
✓ Branch 8 → 9 taken 56786 times.
✓ Branch 8 → 10 taken 7540 times.
 64326 if (templateType.getSubType() == templateTypeName)
549 56786 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 73805 void FunctionManager::breakOverloadTie(std::vector<Function *> &matches, const ArgList &reqArgs) {
569
2/2
✓ Branch 3 → 4 taken 73779 times.
✓ Branch 3 → 5 taken 26 times.
 73805 if (matches.size() < 2)
570 73779 return;
571
572 26 constexpr int CONSTIFY_PENALTY = 1;
573 26 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 26 constexpr int UPCAST_PENALTY = 1000;
578 130 const auto scoreSpecificity = [&](const Function *f) {
579 104 int penalty = 0;
580
2/2
✓ Branch 23 → 3 taken 104 times.
✓ Branch 23 → 24 taken 104 times.
 208 for (size_t i = 0; i < std::min(reqArgs.size(), f->paramList.size()); i++) {
581
1/2
✓ Branch 3 → 4 taken 104 times.
✗ Branch 3 → 28 not taken.
 104 const QualType &paramType = f->paramList.at(i).qualType;
582
1/2
✓ Branch 4 → 5 taken 104 times.
✗ Branch 4 → 28 not taken.
 104 const QualType &argType = reqArgs.at(i).first;
583
2/4
✓ Branch 5 → 6 taken 104 times.
✗ Branch 5 → 26 not taken.
✓ Branch 6 → 7 taken 104 times.
✗ Branch 6 → 26 not taken.
 104 const bool paramIsConst = paramType.removeReferenceWrapper().isConst();
584
2/4
✓ Branch 7 → 8 taken 104 times.
✗ Branch 7 → 27 not taken.
✓ Branch 8 → 9 taken 104 times.
✗ Branch 8 → 27 not taken.
 104 const bool argIsConst = argType.removeReferenceWrapper().isConst();
585
4/4
✓ Branch 9 → 10 taken 56 times.
✓ Branch 9 → 12 taken 48 times.
✓ Branch 10 → 11 taken 16 times.
✓ Branch 10 → 12 taken 40 times.
 104 if (paramIsConst && !argIsConst)
586 16 penalty += CONSTIFY_PENALTY;
587
4/4
✓ Branch 12 → 13 taken 48 times.
✓ Branch 12 → 15 taken 40 times.
✓ Branch 13 → 14 taken 24 times.
✓ Branch 13 → 15 taken 24 times.
 88 else if (!paramIsConst && argIsConst)
588 24 penalty += CONST_LOSS_PENALTY;
589 // Penalize matches that were only possible through an implicit upcast
590 104 QualType paramBase = paramType;
591 104 QualType argBase = argType;
592
1/2
✓ Branch 15 → 16 taken 104 times.
✗ Branch 15 → 28 not taken.
 104 QualType::unwrapBothWithRefWrappers(paramBase, argBase);
593
2/4
✓ Branch 16 → 17 taken 104 times.
✗ Branch 16 → 28 not taken.
✗ Branch 17 → 18 not taken.
✓ Branch 17 → 19 taken 104 times.
 104 if (!paramBase.matches(argBase, true, true, true))
594 ✗ penalty += UPCAST_PENALTY;
595 }
596 104 return penalty;
597 26 };
598
599 26 int bestScore = std::numeric_limits<int>::max();
600
2/2
✓ Branch 20 → 7 taken 52 times.
✓ Branch 20 → 21 taken 26 times.
 104 for (const Function *m : matches)
601
1/2
✓ Branch 9 → 10 taken 52 times.
✗ Branch 9 → 76 not taken.
 52 bestScore = std::min(bestScore, scoreSpecificity(m));
602 26 std::vector<Function *> filtered;
603
1/2
✓ Branch 22 → 23 taken 26 times.
✗ Branch 22 → 80 not taken.
 26 filtered.reserve(matches.size());
604
2/2
✓ Branch 39 → 25 taken 52 times.
✓ Branch 39 → 40 taken 26 times.
 104 for (Function *m : matches)
605
3/4
✓ Branch 27 → 28 taken 52 times.
✗ Branch 27 → 78 not taken.
✓ Branch 28 → 29 taken 32 times.
✓ Branch 28 → 30 taken 20 times.
 52 if (scoreSpecificity(m) == bestScore)
606
1/2
✓ Branch 29 → 30 taken 32 times.
✗ Branch 29 → 78 not taken.
 32 filtered.push_back(m);
607 26 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 6 times.
✓ Branch 44 → 48 taken 20 times.
✓ Branch 45 → 46 taken 6 times.
✗ Branch 45 → 80 not taken.
✓ Branch 46 → 47 taken 6 times.
✗ Branch 46 → 48 not taken.
✓ Branch 49 → 50 taken 6 times.
✓ Branch 49 → 73 taken 20 times.
 36 if (matches.size() > 1 && std::ranges::any_of(matches, [](const Function *m) { return !m->isGenericSubstantiation(); })) {
618
2/2
✓ Branch 71 → 52 taken 12 times.
✓ Branch 71 → 72 taken 6 times.
 24 for (Function *m : matches)
619
6/8
✓ Branch 54 → 55 taken 12 times.
✗ Branch 54 → 79 not taken.
✓ Branch 55 → 56 taken 6 times.
✓ Branch 55 → 58 taken 6 times.
✓ Branch 56 → 57 taken 6 times.
✗ Branch 56 → 58 not taken.
✓ Branch 59 → 60 taken 6 times.
✓ Branch 59 → 62 taken 6 times.
 12 if (m->isGenericSubstantiation() && m->isNewlyInserted)
620
2/4
✓ Branch 60 → 61 taken 6 times.
✗ Branch 60 → 79 not taken.
✓ Branch 61 → 62 taken 6 times.
✗ Branch 61 → 79 not taken.
 6 std::erase(*m->declNode->getFctManifestations(m->name), m);
621
1/2
✓ Branch 72 → 73 taken 6 times.
✗ Branch 72 → 80 not taken.
 18 std::erase_if(matches, [](const Function *m) { return m->isGenericSubstantiation(); });
622 }
623 26 }
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 1212266 uint64_t FunctionManager::getCacheKey(const Scope *scope, const std::string &name, const QualType &thisType, const ArgList &args,
636 const QualTypeList &templateTypes) {
637 1212266 uint64_t hash = 0;
638 1212266 hashCombine64(hash, hashPointer(scope));
639 1212266 hashCombine64(hash, std::hash<std::string>{}(name));
640 1212266 hashCombine64(hash, std::hash<QualType>{}(thisType));
641
2/2
✓ Branch 27 → 10 taken 1972916 times.
✓ Branch 27 → 28 taken 1212266 times.
 6370364 for (const auto &[first, second] : args) {
642 1972916 hashCombine64(hash, std::hash<QualType>{}(first));
643 1972916 hashCombine64(hash, std::hash<bool>{}(second));
644 }
645 1212266 hashCombine64(hash, hashVector(templateTypes));
646 1212266 return hash;
647 }
648
649 40487 bool FunctionManager::hasCtor(const Scope *matchScope, CtorKind kind) {
650
5/8
✓ Branch 2 → 3 taken 40487 times.
✗ Branch 2 → 60 not taken.
✓ Branch 3 → 4 taken 40487 times.
✗ Branch 3 → 60 not taken.
✓ Branch 4 → 5 taken 40487 times.
✗ Branch 4 → 60 not taken.
✓ Branch 55 → 6 taken 191050 times.
✓ Branch 55 → 56 taken 27185 times.
 218235 for (const auto &manifestations : matchScope->functions | std::views::values) {
651
5/8
✓ Branch 7 → 8 taken 191050 times.
✗ Branch 7 → 59 not taken.
✓ Branch 8 → 9 taken 191050 times.
✗ Branch 8 → 59 not taken.
✓ Branch 9 → 10 taken 191050 times.
✗ Branch 9 → 59 not taken.
✓ Branch 51 → 11 taken 207421 times.
✓ Branch 51 → 52 taken 177748 times.
 385169 for (const auto &function : manifestations | std::views::values) {
652 // If it is no ctor, skip it
653
3/4
✓ Branch 12 → 13 taken 207421 times.
✗ Branch 12 → 59 not taken.
✓ Branch 13 → 14 taken 134002 times.
✓ Branch 13 → 15 taken 73419 times.
 207421 if (function.name != CTOR_FUNCTION_NAME)
654 134002 continue;
655 // Classify the ctor based on its parameter list
656
6/8
✓ Branch 16 → 17 taken 40575 times.
✓ Branch 16 → 25 taken 32844 times.
✓ Branch 17 → 18 taken 40575 times.
✗ Branch 17 → 58 not taken.
✓ Branch 18 → 19 taken 40575 times.
✗ Branch 18 → 58 not taken.
✓ Branch 19 → 20 taken 18811 times.
✓ Branch 19 → 25 taken 21764 times.
 92230 const bool singleSelfRefParam = function.paramList.size() == 1 && function.paramList.at(0).qualType.isRef() &&
657
5/8
✓ Branch 20 → 21 taken 18811 times.
✗ Branch 20 → 58 not taken.
✓ Branch 21 → 22 taken 18811 times.
✗ Branch 21 → 58 not taken.
✓ Branch 22 → 23 taken 18811 times.
✗ Branch 22 → 58 not taken.
✓ Branch 23 → 24 taken 14804 times.
✓ Branch 23 → 25 taken 4007 times.
 18811 function.paramList.at(0).qualType.getBase() == function.thisType;
658
6/8
✓ Branch 26 → 27 taken 14804 times.
✓ Branch 26 → 31 taken 58615 times.
✓ Branch 27 → 28 taken 14804 times.
✗ Branch 27 → 59 not taken.
✓ Branch 28 → 29 taken 14804 times.
✗ Branch 28 → 59 not taken.
✓ Branch 29 → 30 taken 14778 times.
✓ Branch 29 → 31 taken 26 times.
 73419 const bool isCopyCtor = singleSelfRefParam && function.paramList.at(0).qualType.isConstRef();
659
6/8
✓ Branch 32 → 33 taken 14804 times.
✓ Branch 32 → 37 taken 58615 times.
✓ Branch 33 → 34 taken 14804 times.
✗ Branch 33 → 59 not taken.
✓ Branch 34 → 35 taken 14804 times.
✗ Branch 34 → 59 not taken.
✓ Branch 35 → 36 taken 26 times.
✓ Branch 35 → 37 taken 14778 times.
 73419 const bool isMoveCtor = singleSelfRefParam && !function.paramList.at(0).qualType.isConstRef();
660
3/4
✓ Branch 38 → 39 taken 54370 times.
✓ Branch 38 → 42 taken 11265 times.
✓ Branch 38 → 45 taken 7784 times.
✗ Branch 38 → 49 not taken.
 73419 switch (kind) {
661 54370 case CtorKind::COPY:
662
2/2
✓ Branch 39 → 40 taken 8266 times.
✓ Branch 39 → 41 taken 46104 times.
 54370 if (isCopyCtor)
663 13302 return true;
664 46104 break;
665 11265 case CtorKind::MOVE:
666
2/2
✓ Branch 42 → 43 taken 8 times.
✓ Branch 42 → 44 taken 11257 times.
 11265 if (isMoveCtor)
667 8 return true;
668 11257 break;
669 7784 case CtorKind::ANY_NON_COPY_NON_MOVE:
670
4/4
✓ Branch 45 → 46 taken 5032 times.
✓ Branch 45 → 48 taken 2752 times.
✓ Branch 46 → 47 taken 5028 times.
✓ Branch 46 → 48 taken 4 times.
 7784 if (!isCopyCtor && !isMoveCtor)
671 5028 return true;
672 2756 break;
673 }
674 }
675 }
676 27185 return false;
677 }
678
679 1971 bool FunctionManager::hasAnyCtor(const Scope *matchScope) {
680
5/8
✓ Branch 2 → 3 taken 1971 times.
✗ Branch 2 → 24 not taken.
✓ Branch 3 → 4 taken 1971 times.
✗ Branch 3 → 24 not taken.
✓ Branch 4 → 5 taken 1971 times.
✗ Branch 4 → 24 not taken.
✓ Branch 20 → 6 taken 2742 times.
✓ Branch 20 → 21 taken 1971 times.
 4713 for (const auto &manifestations : matchScope->functions | std::views::values)
681
5/8
✓ Branch 7 → 8 taken 2742 times.
✗ Branch 7 → 23 not taken.
✓ Branch 8 → 9 taken 2742 times.
✗ Branch 8 → 23 not taken.
✓ Branch 9 → 10 taken 2742 times.
✗ Branch 9 → 23 not taken.
✓ Branch 17 → 11 taken 2776 times.
✓ Branch 17 → 18 taken 2742 times.
 5518 for (const auto &function : manifestations | std::views::values)
682
2/4
✓ Branch 12 → 13 taken 2776 times.
✗ Branch 12 → 23 not taken.
✗ Branch 13 → 14 not taken.
✓ Branch 13 → 15 taken 2776 times.
 2776 if (function.name == CTOR_FUNCTION_NAME)
683 ✗ return true;
684 1971 return false;
685 }
686
687 5290 bool FunctionManager::hasAnyNonCopyCtor(const Scope *matchScope) { return hasCtor(matchScope, CtorKind::ANY_NON_COPY_NON_MOVE); }
688
689 29186 bool FunctionManager::hasCopyCtor(const Scope *matchScope) { return hasCtor(matchScope, CtorKind::COPY); }
690
691 6003 bool FunctionManager::hasUserCopyCtor(const Scope *matchScope) {
692
5/8
✓ Branch 2 → 3 taken 6003 times.
✗ Branch 2 → 42 not taken.
✓ Branch 3 → 4 taken 6003 times.
✗ Branch 3 → 42 not taken.
✓ Branch 4 → 5 taken 6003 times.
✗ Branch 4 → 42 not taken.
✓ Branch 37 → 6 taken 27298 times.
✓ Branch 37 → 38 taken 5499 times.
 32797 for (const auto &manifestations : matchScope->functions | std::views::values) {
693
5/8
✓ Branch 7 → 8 taken 27298 times.
✗ Branch 7 → 41 not taken.
✓ Branch 8 → 9 taken 27298 times.
✗ Branch 8 → 41 not taken.
✓ Branch 9 → 10 taken 27298 times.
✗ Branch 9 → 41 not taken.
✓ Branch 34 → 11 taken 29104 times.
✓ Branch 34 → 35 taken 26794 times.
 55898 for (const auto &function : manifestations | std::views::values) {
694
7/8
✓ Branch 12 → 13 taken 29104 times.
✗ Branch 12 → 41 not taken.
✓ Branch 13 → 14 taken 11235 times.
✓ Branch 13 → 15 taken 17869 times.
✓ Branch 14 → 15 taken 3506 times.
✓ Branch 14 → 16 taken 7729 times.
✓ Branch 17 → 18 taken 21375 times.
✓ Branch 17 → 19 taken 7729 times.
 29104 if (function.name != CTOR_FUNCTION_NAME || function.implicitDefault)
695 21375 continue;
696
6/8
✓ Branch 20 → 21 taken 5479 times.
✓ Branch 20 → 29 taken 2250 times.
✓ Branch 21 → 22 taken 5479 times.
✗ Branch 21 → 40 not taken.
✓ Branch 22 → 23 taken 5479 times.
✗ Branch 22 → 40 not taken.
✓ Branch 23 → 24 taken 828 times.
✓ Branch 23 → 29 taken 4651 times.
 8557 const bool isCopyCtor = function.paramList.size() == 1 && function.paramList.at(0).qualType.isConstRef() &&
697
5/8
✓ Branch 24 → 25 taken 828 times.
✗ Branch 24 → 40 not taken.
✓ Branch 25 → 26 taken 828 times.
✗ Branch 25 → 40 not taken.
✓ Branch 26 → 27 taken 828 times.
✗ Branch 26 → 40 not taken.
✓ Branch 27 → 28 taken 504 times.
✓ Branch 27 → 29 taken 324 times.
 828 function.paramList.at(0).qualType.getBase() == function.thisType;
698
2/2
✓ Branch 30 → 31 taken 504 times.
✓ Branch 30 → 32 taken 7225 times.
 7729 if (isCopyCtor)
699 504 return true;
700 }
701 }
702 5499 return false;
703 }
704
705 6011 bool FunctionManager::hasMoveCtor(const Scope *matchScope) { return hasCtor(matchScope, CtorKind::MOVE); }
706
707 34052 Function *FunctionManager::findMoveCtor(Scope *matchScope) {
708
5/8
✓ Branch 2 → 3 taken 34052 times.
✗ Branch 2 → 41 not taken.
✓ Branch 3 → 4 taken 34052 times.
✗ Branch 3 → 41 not taken.
✓ Branch 4 → 5 taken 34052 times.
✗ Branch 4 → 41 not taken.
✓ Branch 36 → 6 taken 305634 times.
✓ Branch 36 → 37 taken 33715 times.
 339349 for (auto &manifestations : matchScope->functions | std::views::values) {
709
5/8
✓ Branch 7 → 8 taken 305634 times.
✗ Branch 7 → 40 not taken.
✓ Branch 8 → 9 taken 305634 times.
✗ Branch 8 → 40 not taken.
✓ Branch 9 → 10 taken 305634 times.
✗ Branch 9 → 40 not taken.
✓ Branch 33 → 11 taken 384921 times.
✓ Branch 33 → 34 taken 305297 times.
 690218 for (auto &function : manifestations | std::views::values) {
710
3/4
✓ Branch 12 → 13 taken 384921 times.
✗ Branch 12 → 40 not taken.
✓ Branch 13 → 14 taken 293687 times.
✓ Branch 13 → 15 taken 91234 times.
 384921 if (function.name != CTOR_FUNCTION_NAME)
711 293687 continue;
712
4/6
✓ Branch 17 → 18 taken 67018 times.
✗ Branch 17 → 39 not taken.
✓ Branch 18 → 19 taken 67018 times.
✗ Branch 18 → 39 not taken.
✓ Branch 19 → 20 taken 41800 times.
✓ Branch 19 → 28 taken 25218 times.
 158252 const bool isMoveCtor = function.paramList.size() == 1 && function.paramList.at(0).qualType.isRef() &&
713
6/8
✓ Branch 16 → 17 taken 67018 times.
✓ Branch 16 → 28 taken 24216 times.
✓ Branch 20 → 21 taken 41800 times.
✗ Branch 20 → 39 not taken.
✓ Branch 21 → 22 taken 41800 times.
✗ Branch 21 → 39 not taken.
✓ Branch 22 → 23 taken 5953 times.
✓ Branch 22 → 28 taken 35847 times.
 164205 !function.paramList.at(0).qualType.isConstRef() &&
714
5/8
✓ Branch 23 → 24 taken 5953 times.
✗ Branch 23 → 39 not taken.
✓ Branch 24 → 25 taken 5953 times.
✗ Branch 24 → 39 not taken.
✓ Branch 25 → 26 taken 5953 times.
✗ Branch 25 → 39 not taken.
✓ Branch 26 → 27 taken 337 times.
✓ Branch 26 → 28 taken 5616 times.
 5953 function.paramList.at(0).qualType.getBase() == function.thisType;
715
2/2
✓ Branch 29 → 30 taken 337 times.
✓ Branch 29 → 31 taken 90897 times.
 91234 if (isMoveCtor)
716 337 return &function;
717 }
718 }
719 33715 return nullptr;
720 }
721
722 22 bool FunctionManager::hasDefaultCtor(const Scope *matchScope) {
723
4/8
✓ Branch 2 → 3 taken 22 times.
✗ Branch 2 → 29 not taken.
✓ Branch 3 → 4 taken 22 times.
✗ Branch 3 → 29 not taken.
✓ Branch 4 → 5 taken 22 times.
✗ Branch 4 → 29 not taken.
✓ Branch 25 → 6 taken 84 times.
✗ Branch 25 → 26 not taken.
 84 for (const auto &manifestations : matchScope->functions | std::views::values)
724
5/8
✓ Branch 7 → 8 taken 84 times.
✗ Branch 7 → 28 not taken.
✓ Branch 8 → 9 taken 84 times.
✗ Branch 8 → 28 not taken.
✓ Branch 9 → 10 taken 84 times.
✗ Branch 9 → 28 not taken.
✓ Branch 22 → 11 taken 84 times.
✓ Branch 22 → 23 taken 62 times.
 146 for (const auto &function : manifestations | std::views::values)
725
6/8
✓ Branch 12 → 13 taken 84 times.
✗ Branch 12 → 28 not taken.
✓ Branch 13 → 14 taken 22 times.
✓ Branch 13 → 17 taken 62 times.
✓ Branch 15 → 16 taken 22 times.
✗ Branch 15 → 17 not taken.
✓ Branch 18 → 19 taken 22 times.
✓ Branch 18 → 20 taken 62 times.
 84 if (function.name == CTOR_FUNCTION_NAME && function.paramList.empty())
726 22 return true;
727 ✗ return false;
728 }
729
730 52287 bool FunctionManager::hasDtor(const Scope *matchScope) {
731
5/8
✓ Branch 2 → 3 taken 52287 times.
✗ Branch 2 → 24 not taken.
✓ Branch 3 → 4 taken 52287 times.
✗ Branch 3 → 24 not taken.
✓ Branch 4 → 5 taken 52287 times.
✗ Branch 4 → 24 not taken.
✓ Branch 20 → 6 taken 406043 times.
✓ Branch 20 → 21 taken 30490 times.
 436533 for (const auto &manifestations : matchScope->functions | std::views::values)
732
5/8
✓ Branch 7 → 8 taken 406043 times.
✗ Branch 7 → 23 not taken.
✓ Branch 8 → 9 taken 406043 times.
✗ Branch 8 → 23 not taken.
✓ Branch 9 → 10 taken 406043 times.
✗ Branch 9 → 23 not taken.
✓ Branch 17 → 11 taken 447481 times.
✓ Branch 17 → 18 taken 384246 times.
 831727 for (const auto &function : manifestations | std::views::values)
733
3/4
✓ Branch 12 → 13 taken 447481 times.
✗ Branch 12 → 23 not taken.
✓ Branch 13 → 14 taken 21797 times.
✓ Branch 13 → 15 taken 425684 times.
 447481 if (function.name == DTOR_FUNCTION_NAME)
734 21797 return true;
735 30490 return false;
736 }
737
738 /**
739 * Clear the lookup cache
740 */
741 1252 void FunctionManager::cleanup() {
742 1252 lookupCache.clear();
743 1252 lookupCacheHits = 0;
744 1252 lookupCacheMisses = 0;
745 1252 }
746
747 /**
748 * Dump usage statistics for the lookup cache
749 */
750 738 std::string FunctionManager::dumpLookupCacheStatistics() {
751
1/2
✓ Branch 2 → 3 taken 738 times.
✗ Branch 2 → 22 not taken.
 738 std::stringstream stats;
752
2/4
✓ Branch 3 → 4 taken 738 times.
✗ Branch 3 → 20 not taken.
✓ Branch 4 → 5 taken 738 times.
✗ Branch 4 → 20 not taken.
 738 stats << "FunctionManager lookup cache statistics:" << std::endl;
753
3/6
✓ Branch 5 → 6 taken 738 times.
✗ Branch 5 → 20 not taken.
✓ Branch 7 → 8 taken 738 times.
✗ Branch 7 → 20 not taken.
✓ Branch 8 → 9 taken 738 times.
✗ Branch 8 → 20 not taken.
 738 stats << " lookup cache entries: " << lookupCache.size() << std::endl;
754
3/6
✓ Branch 9 → 10 taken 738 times.
✗ Branch 9 → 20 not taken.
✓ Branch 10 → 11 taken 738 times.
✗ Branch 10 → 20 not taken.
✓ Branch 11 → 12 taken 738 times.
✗ Branch 11 → 20 not taken.
 738 stats << " lookup cache hits: " << lookupCacheHits << std::endl;
755
3/6
✓ Branch 12 → 13 taken 738 times.
✗ Branch 12 → 20 not taken.
✓ Branch 13 → 14 taken 738 times.
✗ Branch 13 → 20 not taken.
✓ Branch 14 → 15 taken 738 times.
✗ Branch 14 → 20 not taken.
 738 stats << " lookup cache misses: " << lookupCacheMisses << std::endl;
756
1/2
✓ Branch 15 → 16 taken 738 times.
✗ Branch 15 → 20 not taken.
 1476 return stats.str();
757 738 }
758
759 } // namespace spice::compiler
760