GCC Code Coverage Report

Directory: ../
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 99.2% 256 / 0 / 258
Functions: 100.0% 11 / 0 / 11
Branches: 53.5% 306 / 0 / 572
src/irgenerator/GenControlStructures.cpp
Line Branch Exec Source
1 // Copyright (c) 2021-2026 ChilliBits. All rights reserved.
2
3 #include "IRGenerator.h"
4
5 #include <ast/ASTNodes.h>
6 #include <symboltablebuilder/ScopeHandle.h>
7
8 namespace spice::compiler {
9
10 2208 std::any IRGenerator::visitUnsafeBlockDef(const UnsafeBlockNode *node) {
11
1/2
✓ Branch 2 → 3 taken 2208 times.
✗ Branch 2 → 20 not taken.
 2208 diGenerator.setSourceLocation(node);
12
13 // Change scope
14
2/4
✓ Branch 3 → 4 taken 2208 times.
✗ Branch 3 → 14 not taken.
✓ Branch 4 → 5 taken 2208 times.
✗ Branch 4 → 12 not taken.
 2208 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::UNSAFE_BODY, node);
15
16 // Visit instructions in the block
17
1/2
✓ Branch 6 → 7 taken 2208 times.
✗ Branch 6 → 16 not taken.
 2208 visit(node->body);
18
19
1/2
✓ Branch 8 → 9 taken 2208 times.
✗ Branch 8 → 17 not taken.
 4416 return nullptr;
20 2208 }
21
22 1311 std::any IRGenerator::visitForLoop(const ForLoopNode *node) {
23
1/2
✓ Branch 2 → 3 taken 1311 times.
✗ Branch 2 → 73 not taken.
 1311 diGenerator.setSourceLocation(node);
24
25 // Create blocks
26
1/2
✓ Branch 3 → 4 taken 1311 times.
✗ Branch 3 → 73 not taken.
 1311 const std::string codeLine = node->codeLoc.toPrettyLine();
27
2/4
✓ Branch 4 → 5 taken 1311 times.
✗ Branch 4 → 51 not taken.
✓ Branch 5 → 6 taken 1311 times.
✗ Branch 5 → 49 not taken.
 1311 llvm::BasicBlock *bHead = createBlock("for.head." + codeLine);
28
2/4
✓ Branch 7 → 8 taken 1311 times.
✗ Branch 7 → 54 not taken.
✓ Branch 8 → 9 taken 1311 times.
✗ Branch 8 → 52 not taken.
 1311 llvm::BasicBlock *bBody = createBlock("for.body." + codeLine);
29
2/4
✓ Branch 10 → 11 taken 1311 times.
✗ Branch 10 → 57 not taken.
✓ Branch 11 → 12 taken 1311 times.
✗ Branch 11 → 55 not taken.
 1311 llvm::BasicBlock *bTail = createBlock("for.tail." + codeLine);
30
2/4
✓ Branch 13 → 14 taken 1311 times.
✗ Branch 13 → 60 not taken.
✓ Branch 14 → 15 taken 1311 times.
✗ Branch 14 → 58 not taken.
 1311 llvm::BasicBlock *bExit = createBlock("for.exit." + codeLine);
31
32 // Change scope
33
2/4
✓ Branch 16 → 17 taken 1311 times.
✗ Branch 16 → 63 not taken.
✓ Branch 17 → 18 taken 1311 times.
✗ Branch 17 → 61 not taken.
 1311 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::FOR_BODY, node);
34
35 // Save the blocks for break and continue
36
1/2
✓ Branch 19 → 20 taken 1311 times.
✗ Branch 19 → 69 not taken.
 1311 breakBlocks.push_back(bExit);
37
1/2
✓ Branch 20 → 21 taken 1311 times.
✗ Branch 20 → 69 not taken.
 1311 continueBlocks.push_back(bTail);
38
39 // Init statement
40
1/2
✓ Branch 21 → 22 taken 1311 times.
✗ Branch 21 → 65 not taken.
 1311 visit(node->initDecl);
41 // Create jump from original to head block
42
1/2
✓ Branch 23 → 24 taken 1311 times.
✗ Branch 23 → 69 not taken.
 1311 insertJump(bHead);
43
44 // Switch to head block
45
1/2
✓ Branch 24 → 25 taken 1311 times.
✗ Branch 24 → 69 not taken.
 1311 switchToBlock(bHead);
46 // Condition evaluation
47
1/2
✓ Branch 25 → 26 taken 1311 times.
✗ Branch 25 → 69 not taken.
 1311 llvm::Value *condValue = resolveValue(node->condAssign);
48 // Create conditional jump from head to body or exit block
49
1/2
✓ Branch 26 → 27 taken 1311 times.
✗ Branch 26 → 69 not taken.
 1311 insertCondJump(condValue, bBody, bExit);
50
51 // Switch to body block
52
1/2
✓ Branch 27 → 28 taken 1311 times.
✗ Branch 27 → 69 not taken.
 1311 switchToBlock(bBody);
53 // Visit body
54
1/2
✓ Branch 28 → 29 taken 1311 times.
✗ Branch 28 → 66 not taken.
 1311 visit(node->body);
55 // Create jump from body to tail block
56
1/2
✓ Branch 30 → 31 taken 1311 times.
✗ Branch 30 → 69 not taken.
 1311 insertJump(bTail);
57
58 // Switch to tail block
59
1/2
✓ Branch 31 → 32 taken 1311 times.
✗ Branch 31 → 69 not taken.
 1311 switchToBlock(bTail);
60 // Inc statement
61
1/2
✓ Branch 32 → 33 taken 1311 times.
✗ Branch 32 → 67 not taken.
 1311 visit(node->incAssign);
62 // Create jump from tail to head
63
1/2
✓ Branch 34 → 35 taken 1311 times.
✗ Branch 34 → 69 not taken.
 1311 insertJump(bHead);
64
65 // Switch to exit block
66
1/2
✓ Branch 35 → 36 taken 1311 times.
✗ Branch 35 → 69 not taken.
 1311 switchToBlock(bExit);
67
68 // Pop basic blocks from break and continue stacks
69
1/2
✗ Branch 37 → 38 not taken.
✓ Branch 37 → 39 taken 1311 times.
 1311 assert(breakBlocks.back() == bExit);
70 1311 breakBlocks.pop_back();
71
1/2
✗ Branch 41 → 42 not taken.
✓ Branch 41 → 43 taken 1311 times.
 1311 assert(continueBlocks.back() == bTail);
72 1311 continueBlocks.pop_back();
73
74
1/2
✓ Branch 44 → 45 taken 1311 times.
✗ Branch 44 → 68 not taken.
 2622 return nullptr;
75 1311 }
76
77 114 std::any IRGenerator::visitForeachLoop(const ForeachLoopNode *node) {
78
1/2
✓ Branch 2 → 3 taken 114 times.
✗ Branch 2 → 254 not taken.
 114 diGenerator.setSourceLocation(node);
79
80 // Create blocks
81
1/2
✓ Branch 3 → 4 taken 114 times.
✗ Branch 3 → 254 not taken.
 114 const std::string codeLine = node->codeLoc.toPrettyLine();
82
2/4
✓ Branch 4 → 5 taken 114 times.
✗ Branch 4 → 178 not taken.
✓ Branch 5 → 6 taken 114 times.
✗ Branch 5 → 176 not taken.
 114 llvm::BasicBlock *bHead = createBlock("foreach.head." + codeLine);
83
2/4
✓ Branch 7 → 8 taken 114 times.
✗ Branch 7 → 181 not taken.
✓ Branch 8 → 9 taken 114 times.
✗ Branch 8 → 179 not taken.
 114 llvm::BasicBlock *bBody = createBlock("foreach.body." + codeLine);
84
2/4
✓ Branch 10 → 11 taken 114 times.
✗ Branch 10 → 184 not taken.
✓ Branch 11 → 12 taken 114 times.
✗ Branch 11 → 182 not taken.
 114 llvm::BasicBlock *bTail = createBlock("foreach.tail." + codeLine);
85
2/4
✓ Branch 13 → 14 taken 114 times.
✗ Branch 13 → 187 not taken.
✓ Branch 14 → 15 taken 114 times.
✗ Branch 14 → 185 not taken.
 114 llvm::BasicBlock *bExit = createBlock("foreach.exit." + codeLine);
86
87 // Change scope
88
2/4
✓ Branch 16 → 17 taken 114 times.
✗ Branch 16 → 190 not taken.
✓ Branch 17 → 18 taken 114 times.
✗ Branch 17 → 188 not taken.
 114 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::FOREACH_BODY, node);
89
90 // Save the blocks for break and continue
91
1/2
✓ Branch 19 → 20 taken 114 times.
✗ Branch 19 → 250 not taken.
 114 breakBlocks.push_back(bExit);
92
1/2
✓ Branch 20 → 21 taken 114 times.
✗ Branch 20 → 250 not taken.
 114 continueBlocks.push_back(bTail);
93
94 // Resolve iterator
95 114 ExprNode *iteratorAssignNode = node->iteratorAssign;
96 llvm::Value *iteratorPtr;
97
2/2
✓ Branch 21 → 22 taken 99 times.
✓ Branch 21 → 58 taken 15 times.
 114 if (node->getIteratorFct != nullptr) { // The iteratorAssignExpr is of type Iterable
98
1/2
✓ Branch 22 → 23 taken 99 times.
✗ Branch 22 → 203 not taken.
 99 llvm::Value *iterablePtr = resolveAddress(iteratorAssignNode);
99
100 llvm::Value *iterator;
101
10/16
✓ Branch 23 → 24 taken 99 times.
✗ Branch 23 → 192 not taken.
✓ Branch 26 → 27 taken 7 times.
✓ Branch 26 → 32 taken 92 times.
✓ Branch 27 → 28 taken 7 times.
✗ Branch 27 → 192 not taken.
✓ Branch 29 → 30 taken 7 times.
✗ Branch 29 → 192 not taken.
✓ Branch 30 → 31 taken 7 times.
✗ Branch 30 → 32 not taken.
✓ Branch 33 → 34 taken 7 times.
✓ Branch 33 → 35 taken 92 times.
✓ Branch 35 → 36 taken 7 times.
✓ Branch 35 → 47 taken 92 times.
✗ Branch 192 → 193 not taken.
✗ Branch 192 → 194 not taken.
 198 if (!node->getIteratorFct->isMethod() && node->getIteratorFct->getParamTypes().front().isArray()) { // Array as iterable
102 // Call iterate() function from std/iterator/array-iterator
103
1/2
✓ Branch 36 → 37 taken 7 times.
✗ Branch 36 → 203 not taken.
 7 llvm::Function *iterateFct = stdFunctionManager.getIterateFct(node->getIteratorFct);
104
2/4
✓ Branch 37 → 38 taken 7 times.
✗ Branch 37 → 203 not taken.
✓ Branch 38 → 39 taken 7 times.
✗ Branch 38 → 203 not taken.
 7 const size_t arraySize = iteratorAssignNode->getEvaluatedSymbolType(manIdx).getArraySize();
105
1/2
✗ Branch 39 → 40 not taken.
✓ Branch 39 → 41 taken 7 times.
 7 assert(arraySize > 0);
106
4/8
✓ Branch 41 → 42 taken 7 times.
✗ Branch 41 → 199 not taken.
✓ Branch 42 → 43 taken 7 times.
✗ Branch 42 → 197 not taken.
✓ Branch 44 → 45 taken 7 times.
✗ Branch 44 → 196 not taken.
✓ Branch 45 → 46 taken 7 times.
✗ Branch 45 → 196 not taken.
 7 iterator = builder.CreateCall(iterateFct, {iterablePtr, builder.getInt64(arraySize)});
107 } else { // Struct as iterable
108 // Call .getIterator() on iterable
109
1/2
✓ Branch 47 → 48 taken 92 times.
✗ Branch 47 → 203 not taken.
 92 llvm::Function *getIteratorFct = stdFunctionManager.getIteratorFct(node->getIteratorFct);
110
3/6
✓ Branch 48 → 49 taken 92 times.
✗ Branch 48 → 202 not taken.
✓ Branch 50 → 51 taken 92 times.
✗ Branch 50 → 200 not taken.
✓ Branch 51 → 52 taken 92 times.
✗ Branch 51 → 200 not taken.
 92 iterator = builder.CreateCall(getIteratorFct, iterablePtr);
111 }
112
113 // Resolve address of iterator
114 99 LLVMExprResult callResult = {.value = iterator, .node = iteratorAssignNode};
115
1/2
✓ Branch 53 → 54 taken 99 times.
✗ Branch 53 → 203 not taken.
 99 iteratorPtr = resolveAddress(callResult);
116
117 // If an anonymous symbol exists, set its address
118
2/4
✓ Branch 54 → 55 taken 99 times.
✗ Branch 54 → 203 not taken.
✗ Branch 55 → 56 not taken.
✓ Branch 55 → 57 taken 99 times.
 99 if (SymbolTableEntry *returnSymbol = currentScope->symbolTable.lookupAnonymous(iteratorAssignNode))
119 ✗ returnSymbol->updateAddress(iteratorPtr);
120 } else { // The iteratorAssignExpr is of type Iterator
121
1/2
✓ Branch 58 → 59 taken 15 times.
✗ Branch 58 → 250 not taken.
 15 iteratorPtr = resolveAddress(iteratorAssignNode);
122 }
123
124 // Check we have an idx
125 114 const DeclStmtNode *idxDeclNode = node->idxVarDecl;
126 114 const bool hasIdx = idxDeclNode != nullptr;
127 // Retrieve item ref type
128
3/4
✓ Branch 60 → 61 taken 5 times.
✓ Branch 60 → 62 taken 109 times.
✗ Branch 63 → 64 not taken.
✓ Branch 63 → 65 taken 114 times.
 114 assert(hasIdx ? node->getIdxFct != nullptr : node->getFct != nullptr);
129
2/2
✓ Branch 65 → 66 taken 5 times.
✓ Branch 65 → 67 taken 109 times.
 114 const QualType itemRefSTy = hasIdx ? node->getIdxFct->returnType : node->getFct->returnType;
130
131 // Visit idx variable declaration if required
132 114 SymbolTableEntry *idxEntry = nullptr;
133 114 llvm::Value *idxAddress = nullptr;
134
2/2
✓ Branch 68 → 69 taken 5 times.
✓ Branch 68 → 75 taken 109 times.
 114 if (hasIdx) {
135
1/2
✓ Branch 69 → 70 taken 5 times.
✗ Branch 69 → 204 not taken.
 5 visit(idxDeclNode);
136 // Get address of idx variable
137
1/2
✓ Branch 71 → 72 taken 5 times.
✗ Branch 71 → 250 not taken.
 5 idxEntry = idxDeclNode->entries.at(manIdx);
138
1/2
✓ Branch 72 → 73 taken 5 times.
✗ Branch 72 → 250 not taken.
 5 idxAddress = idxEntry->getAddress();
139
1/2
✗ Branch 73 → 74 not taken.
✓ Branch 73 → 75 taken 5 times.
 5 assert(idxAddress != nullptr);
140 }
141
142 // Visit item variable declaration
143 114 const DeclStmtNode *itemDeclNode = node->itemVarDecl;
144
1/2
✓ Branch 75 → 76 taken 114 times.
✗ Branch 75 → 205 not taken.
 114 visit(itemDeclNode);
145 // Get address of item variable
146
1/2
✓ Branch 77 → 78 taken 114 times.
✗ Branch 77 → 250 not taken.
 114 SymbolTableEntry *itemEntry = itemDeclNode->entries.at(manIdx);
147
1/2
✓ Branch 78 → 79 taken 114 times.
✗ Branch 78 → 250 not taken.
 114 llvm::Value *itemAddress = itemEntry->getAddress();
148
1/2
✗ Branch 79 → 80 not taken.
✓ Branch 79 → 81 taken 114 times.
 114 assert(itemAddress != nullptr);
149
150 // Create jump from original to head block
151
1/2
✓ Branch 81 → 82 taken 114 times.
✗ Branch 81 → 250 not taken.
 114 insertJump(bHead);
152
153 // Switch to head block
154
1/2
✓ Branch 82 → 83 taken 114 times.
✗ Branch 82 → 250 not taken.
 114 switchToBlock(bHead);
155 // Call .isValid() on iterator
156
1/2
✗ Branch 83 → 84 not taken.
✓ Branch 83 → 85 taken 114 times.
 114 assert(node->isValidFct);
157
1/2
✓ Branch 85 → 86 taken 114 times.
✗ Branch 85 → 250 not taken.
 114 llvm::Function *isValidFct = stdFunctionManager.getIteratorIsValidFct(node->isValidFct);
158
3/6
✓ Branch 86 → 87 taken 114 times.
✗ Branch 86 → 208 not taken.
✓ Branch 88 → 89 taken 114 times.
✗ Branch 88 → 206 not taken.
✓ Branch 89 → 90 taken 114 times.
✗ Branch 89 → 206 not taken.
 114 llvm::Value *isValid = builder.CreateCall(isValidFct, iteratorPtr);
159 // Create conditional jump from head to body or exit block
160
1/2
✓ Branch 90 → 91 taken 114 times.
✗ Branch 90 → 250 not taken.
 114 insertCondJump(isValid, bBody, bExit);
161
162 // Switch to body block
163
1/2
✓ Branch 91 → 92 taken 114 times.
✗ Branch 91 → 250 not taken.
 114 switchToBlock(bBody);
164 // Get the current iterator values
165 114 LLVMExprResult itemResult;
166
2/2
✓ Branch 92 → 93 taken 5 times.
✓ Branch 92 → 129 taken 109 times.
 114 if (hasIdx) {
167 // Allocate space to save pair
168 5 const QualType &pairSTy = node->getIdxFct->returnType;
169
1/2
✓ Branch 93 → 94 taken 5 times.
✗ Branch 93 → 233 not taken.
 5 llvm::Type *pairTy = pairSTy.toLLVMType(sourceFile);
170
2/4
✓ Branch 96 → 97 taken 5 times.
✗ Branch 96 → 211 not taken.
✓ Branch 97 → 98 taken 5 times.
✗ Branch 97 → 209 not taken.
 5 llvm::Value *pairPtr = insertAlloca(pairSTy, "pair.addr");
171 // Call .getIdx() on iterator
172
1/2
✗ Branch 100 → 101 not taken.
✓ Branch 100 → 102 taken 5 times.
 5 assert(node->getIdxFct);
173
1/2
✓ Branch 102 → 103 taken 5 times.
✗ Branch 102 → 233 not taken.
 5 llvm::Function *getIdxFct = stdFunctionManager.getIteratorGetIdxFct(node->getIdxFct);
174
3/6
✓ Branch 103 → 104 taken 5 times.
✗ Branch 103 → 217 not taken.
✓ Branch 105 → 106 taken 5 times.
✗ Branch 105 → 215 not taken.
✓ Branch 106 → 107 taken 5 times.
✗ Branch 106 → 215 not taken.
 5 llvm::Value *pair = builder.CreateCall(getIdxFct, iteratorPtr);
175
2/4
✓ Branch 107 → 108 taken 5 times.
✗ Branch 107 → 218 not taken.
✓ Branch 108 → 109 taken 5 times.
✗ Branch 108 → 218 not taken.
 5 pair->setName("pair");
176
1/2
✓ Branch 109 → 110 taken 5 times.
✗ Branch 109 → 233 not taken.
 5 insertStore(pair, pairPtr);
177 // Store idx to idx var
178
2/4
✓ Branch 112 → 113 taken 5 times.
✗ Branch 112 → 221 not taken.
✓ Branch 113 → 114 taken 5 times.
✗ Branch 113 → 219 not taken.
 5 llvm::Value *idxAddrInPair = insertStructGEP(pairTy, pairPtr, 0, "idx.addr");
179 5 LLVMExprResult idxResult = {.ptr = idxAddrInPair};
180
2/4
✓ Branch 116 → 117 taken 5 times.
✗ Branch 116 → 119 not taken.
✓ Branch 117 → 118 taken 5 times.
✗ Branch 117 → 119 not taken.
 5 assert(idxAddress != nullptr && idxEntry != nullptr);
181
2/4
✓ Branch 120 → 121 taken 5 times.
✗ Branch 120 → 225 not taken.
✓ Branch 121 → 122 taken 5 times.
✗ Branch 121 → 225 not taken.
 5 doAssignment(idxAddress, idxEntry, idxResult, QualType(TY_LONG), node, true);
182 // Store item to item var
183
2/4
✓ Branch 124 → 125 taken 5 times.
✗ Branch 124 → 229 not taken.
✓ Branch 125 → 126 taken 5 times.
✗ Branch 125 → 227 not taken.
 10 itemResult.refPtr = insertStructGEP(pairTy, pairPtr, 1, "item.addr");
184 } else {
185 // Call .get() on iterator
186
1/2
✗ Branch 129 → 130 not taken.
✓ Branch 129 → 131 taken 109 times.
 109 assert(node->getFct);
187
1/2
✓ Branch 131 → 132 taken 109 times.
✗ Branch 131 → 250 not taken.
 109 llvm::Function *getFct = stdFunctionManager.getIteratorGetFct(node->getFct);
188
3/6
✓ Branch 132 → 133 taken 109 times.
✗ Branch 132 → 236 not taken.
✓ Branch 134 → 135 taken 109 times.
✗ Branch 134 → 234 not taken.
✓ Branch 135 → 136 taken 109 times.
✗ Branch 135 → 234 not taken.
 109 itemResult.ptr = builder.CreateCall(getFct, iteratorPtr);
189 }
190
2/2
✓ Branch 137 → 138 taken 2 times.
✓ Branch 137 → 148 taken 112 times.
 114 if (node->calledItemCopyCtor != nullptr) {
191 // Call copy ctor
192
1/2
✓ Branch 138 → 139 taken 2 times.
✗ Branch 138 → 250 not taken.
 2 llvm::Value *rhsAddress = resolveAddress(itemResult);
193
1/2
✗ Branch 139 → 140 not taken.
✓ Branch 139 → 141 taken 2 times.
 2 assert(rhsAddress != nullptr);
194
2/4
✓ Branch 143 → 144 taken 2 times.
✗ Branch 143 → 239 not taken.
✓ Branch 144 → 145 taken 2 times.
✗ Branch 144 → 237 not taken.
 6 generateCtorOrDtorCall(itemEntry, node->calledItemCopyCtor, {rhsAddress});
195 } else {
196 // Perform normal assignment
197
1/2
✓ Branch 148 → 149 taken 112 times.
✗ Branch 148 → 244 not taken.
 112 doAssignment(itemAddress, itemEntry, itemResult, itemRefSTy, node, true);
198 }
199 // Visit body
200
1/2
✓ Branch 150 → 151 taken 114 times.
✗ Branch 150 → 245 not taken.
 114 visit(node->body);
201 // Create jump from body to tail block
202
1/2
✓ Branch 152 → 153 taken 114 times.
✗ Branch 152 → 250 not taken.
 114 insertJump(bTail);
203
204 // Switch to tail block
205
1/2
✓ Branch 153 → 154 taken 114 times.
✗ Branch 153 → 250 not taken.
 114 switchToBlock(bTail);
206 // Call .next() on iterator
207
1/2
✗ Branch 154 → 155 not taken.
✓ Branch 154 → 156 taken 114 times.
 114 assert(node->nextFct);
208
1/2
✓ Branch 156 → 157 taken 114 times.
✗ Branch 156 → 250 not taken.
 114 llvm::Function *nextFct = stdFunctionManager.getIteratorNextFct(node->nextFct);
209
3/6
✓ Branch 157 → 158 taken 114 times.
✗ Branch 157 → 248 not taken.
✓ Branch 159 → 160 taken 114 times.
✗ Branch 159 → 246 not taken.
✓ Branch 160 → 161 taken 114 times.
✗ Branch 160 → 246 not taken.
 114 builder.CreateCall(nextFct, iteratorPtr);
210 // Create jump from tail to head block
211
1/2
✓ Branch 161 → 162 taken 114 times.
✗ Branch 161 → 250 not taken.
 114 insertJump(bHead);
212
213 // Switch to exit block
214
1/2
✓ Branch 162 → 163 taken 114 times.
✗ Branch 162 → 250 not taken.
 114 switchToBlock(bExit);
215
216 // Pop basic blocks from break and continue stacks
217
1/2
✗ Branch 164 → 165 not taken.
✓ Branch 164 → 166 taken 114 times.
 114 assert(breakBlocks.back() == bExit);
218 114 breakBlocks.pop_back();
219
1/2
✗ Branch 168 → 169 not taken.
✓ Branch 168 → 170 taken 114 times.
 114 assert(continueBlocks.back() == bTail);
220 114 continueBlocks.pop_back();
221
222
1/2
✓ Branch 171 → 172 taken 114 times.
✗ Branch 171 → 249 not taken.
 228 return nullptr;
223 114 }
224
225 746 std::any IRGenerator::visitWhileLoop(const WhileLoopNode *node) {
226
1/2
✓ Branch 2 → 3 taken 746 times.
✗ Branch 2 → 59 not taken.
 746 diGenerator.setSourceLocation(node);
227
228 // Create blocks
229
1/2
✓ Branch 3 → 4 taken 746 times.
✗ Branch 3 → 59 not taken.
 746 const std::string codeLine = node->codeLoc.toPrettyLine();
230
2/4
✓ Branch 4 → 5 taken 746 times.
✗ Branch 4 → 42 not taken.
✓ Branch 5 → 6 taken 746 times.
✗ Branch 5 → 40 not taken.
 746 llvm::BasicBlock *bHead = createBlock("while.head." + codeLine);
231
2/4
✓ Branch 7 → 8 taken 746 times.
✗ Branch 7 → 45 not taken.
✓ Branch 8 → 9 taken 746 times.
✗ Branch 8 → 43 not taken.
 746 llvm::BasicBlock *bBody = createBlock("while.body." + codeLine);
232
2/4
✓ Branch 10 → 11 taken 746 times.
✗ Branch 10 → 48 not taken.
✓ Branch 11 → 12 taken 746 times.
✗ Branch 11 → 46 not taken.
 746 llvm::BasicBlock *bExit = createBlock("while.exit." + codeLine);
233
234 // Change scope
235
2/4
✓ Branch 13 → 14 taken 746 times.
✗ Branch 13 → 51 not taken.
✓ Branch 14 → 15 taken 746 times.
✗ Branch 14 → 49 not taken.
 746 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::WHILE_BODY, node);
236
237 // Save the blocks for break and continue
238
1/2
✓ Branch 16 → 17 taken 746 times.
✗ Branch 16 → 55 not taken.
 746 breakBlocks.push_back(bExit);
239
1/2
✓ Branch 17 → 18 taken 746 times.
✗ Branch 17 → 55 not taken.
 746 continueBlocks.push_back(bHead);
240
241 // Jump to head block
242
1/2
✓ Branch 18 → 19 taken 746 times.
✗ Branch 18 → 55 not taken.
 746 insertJump(bHead);
243
244 // Switch to head block
245
1/2
✓ Branch 19 → 20 taken 746 times.
✗ Branch 19 → 55 not taken.
 746 switchToBlock(bHead);
246 // Evaluate condition
247
1/2
✓ Branch 20 → 21 taken 746 times.
✗ Branch 20 → 55 not taken.
 746 llvm::Value *condValue = resolveValue(node->condition);
248 // Jump to body or exit block, depending on the condition
249
1/2
✓ Branch 21 → 22 taken 746 times.
✗ Branch 21 → 55 not taken.
 746 insertCondJump(condValue, bBody, bExit);
250
251 // Switch to body block
252
1/2
✓ Branch 22 → 23 taken 746 times.
✗ Branch 22 → 55 not taken.
 746 switchToBlock(bBody);
253 // Visit body
254
1/2
✓ Branch 23 → 24 taken 746 times.
✗ Branch 23 → 53 not taken.
 746 visit(node->body);
255 // Create jump to head block
256
1/2
✓ Branch 25 → 26 taken 746 times.
✗ Branch 25 → 55 not taken.
 746 insertJump(bHead);
257
258 // Switch to exit block
259
1/2
✓ Branch 26 → 27 taken 746 times.
✗ Branch 26 → 55 not taken.
 746 switchToBlock(bExit);
260
261 // Pop basic blocks from break and continue stacks
262
1/2
✗ Branch 28 → 29 not taken.
✓ Branch 28 → 30 taken 746 times.
 746 assert(breakBlocks.back() == bExit);
263 746 breakBlocks.pop_back();
264
1/2
✗ Branch 32 → 33 not taken.
✓ Branch 32 → 34 taken 746 times.
 746 assert(continueBlocks.back() == bHead);
265 746 continueBlocks.pop_back();
266
267
1/2
✓ Branch 35 → 36 taken 746 times.
✗ Branch 35 → 54 not taken.
 1492 return nullptr;
268 746 }
269
270 7 std::any IRGenerator::visitDoWhileLoop(const DoWhileLoopNode *node) {
271
1/2
✓ Branch 2 → 3 taken 7 times.
✗ Branch 2 → 59 not taken.
 7 diGenerator.setSourceLocation(node);
272
273 // Create blocks
274
1/2
✓ Branch 3 → 4 taken 7 times.
✗ Branch 3 → 59 not taken.
 7 const std::string codeLine = node->codeLoc.toPrettyLine();
275
2/4
✓ Branch 4 → 5 taken 7 times.
✗ Branch 4 → 42 not taken.
✓ Branch 5 → 6 taken 7 times.
✗ Branch 5 → 40 not taken.
 7 llvm::BasicBlock *bBody = createBlock("dowhile.body." + codeLine);
276
2/4
✓ Branch 7 → 8 taken 7 times.
✗ Branch 7 → 45 not taken.
✓ Branch 8 → 9 taken 7 times.
✗ Branch 8 → 43 not taken.
 7 llvm::BasicBlock *bFoot = createBlock("dowhile.foot." + codeLine);
277
2/4
✓ Branch 10 → 11 taken 7 times.
✗ Branch 10 → 48 not taken.
✓ Branch 11 → 12 taken 7 times.
✗ Branch 11 → 46 not taken.
 7 llvm::BasicBlock *bExit = createBlock("dowhile.exit." + codeLine);
278
279 // Change scope
280
2/4
✓ Branch 13 → 14 taken 7 times.
✗ Branch 13 → 51 not taken.
✓ Branch 14 → 15 taken 7 times.
✗ Branch 14 → 49 not taken.
 7 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::WHILE_BODY, node);
281
282 // Save the blocks for break and continue
283
1/2
✓ Branch 16 → 17 taken 7 times.
✗ Branch 16 → 55 not taken.
 7 breakBlocks.push_back(bExit);
284
1/2
✓ Branch 17 → 18 taken 7 times.
✗ Branch 17 → 55 not taken.
 7 continueBlocks.push_back(bFoot);
285
286 // Jump to body block
287
1/2
✓ Branch 18 → 19 taken 7 times.
✗ Branch 18 → 55 not taken.
 7 insertJump(bBody);
288
289 // Switch to body block
290
1/2
✓ Branch 19 → 20 taken 7 times.
✗ Branch 19 → 55 not taken.
 7 switchToBlock(bBody);
291 // Visit body
292
1/2
✓ Branch 20 → 21 taken 7 times.
✗ Branch 20 → 53 not taken.
 7 visit(node->body);
293 // Create jump to foot block
294
1/2
✓ Branch 22 → 23 taken 7 times.
✗ Branch 22 → 55 not taken.
 7 insertJump(bFoot);
295
296 // Switch to head block
297
1/2
✓ Branch 23 → 24 taken 7 times.
✗ Branch 23 → 55 not taken.
 7 switchToBlock(bFoot);
298 // Evaluate condition
299
1/2
✓ Branch 24 → 25 taken 7 times.
✗ Branch 24 → 55 not taken.
 7 llvm::Value *condValue = resolveValue(node->condition);
300 // Jump to body or exit block, depending on the condition
301
1/2
✓ Branch 25 → 26 taken 7 times.
✗ Branch 25 → 55 not taken.
 7 insertCondJump(condValue, bBody, bExit);
302
303 // Switch to exit block
304
1/2
✓ Branch 26 → 27 taken 7 times.
✗ Branch 26 → 55 not taken.
 7 switchToBlock(bExit);
305
306 // Pop basic blocks from break and continue stacks
307
1/2
✗ Branch 28 → 29 not taken.
✓ Branch 28 → 30 taken 7 times.
 7 assert(breakBlocks.back() == bExit);
308 7 breakBlocks.pop_back();
309
1/2
✗ Branch 32 → 33 not taken.
✓ Branch 32 → 34 taken 7 times.
 7 assert(continueBlocks.back() == bFoot);
310 7 continueBlocks.pop_back();
311
312
1/2
✓ Branch 35 → 36 taken 7 times.
✗ Branch 35 → 54 not taken.
 14 return nullptr;
313 7 }
314
315 4379 std::any IRGenerator::visitIfStmt(const IfStmtNode *node) {
316
1/2
✓ Branch 2 → 3 taken 4379 times.
✗ Branch 2 → 95 not taken.
 4379 diGenerator.setSourceLocation(node);
317
318 // If we have a compile time decision, only evaluate the respective branch
319
4/4
✓ Branch 3 → 4 taken 4373 times.
✓ Branch 3 → 15 taken 6 times.
✓ Branch 4 → 5 taken 1 time.
✓ Branch 4 → 15 taken 4372 times.
 4379 if (node->compileThenBranch && !node->compileElseBranch) {
320
2/4
✓ Branch 5 → 6 taken 1 time.
✗ Branch 5 → 66 not taken.
✓ Branch 6 → 7 taken 1 time.
✗ Branch 6 → 64 not taken.
 1 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::IF_ELSE_BODY, node);
321
1/2
✓ Branch 8 → 9 taken 1 time.
✗ Branch 8 → 68 not taken.
 1 visit(node->thenBody);
322
2/4
✓ Branch 10 → 11 taken 1 time.
✗ Branch 10 → 69 not taken.
✓ Branch 11 → 12 taken 1 time.
✗ Branch 11 → 69 not taken.
 1 return builder.getTrue();
323 1 }
324
3/4
✓ Branch 15 → 16 taken 6 times.
✓ Branch 15 → 25 taken 4372 times.
✓ Branch 16 → 17 taken 6 times.
✗ Branch 16 → 25 not taken.
 4378 if (!node->compileThenBranch && node->compileElseBranch) {
325
1/2
✗ Branch 17 → 18 not taken.
✓ Branch 17 → 21 taken 6 times.
 6 if (node->elseStmt)
326 ✗ visit(node->elseStmt);
327
2/4
✓ Branch 21 → 22 taken 6 times.
✗ Branch 21 → 74 not taken.
✓ Branch 22 → 23 taken 6 times.
✗ Branch 22 → 74 not taken.
 6 return builder.getFalse();
328 }
329
330 // Create blocks
331
1/2
✓ Branch 25 → 26 taken 4372 times.
✗ Branch 25 → 95 not taken.
 4372 const std::string codeLine = node->codeLoc.toPrettyLine();
332
2/4
✓ Branch 26 → 27 taken 4372 times.
✗ Branch 26 → 77 not taken.
✓ Branch 27 → 28 taken 4372 times.
✗ Branch 27 → 75 not taken.
 4372 llvm::BasicBlock *bThen = createBlock("if.then." + codeLine);
333
6/10
✓ Branch 29 → 30 taken 203 times.
✓ Branch 29 → 33 taken 4169 times.
✓ Branch 30 → 31 taken 203 times.
✗ Branch 30 → 78 not taken.
✓ Branch 31 → 32 taken 203 times.
✗ Branch 31 → 78 not taken.
✓ Branch 34 → 35 taken 203 times.
✓ Branch 34 → 36 taken 4169 times.
✗ Branch 78 → 79 not taken.
✗ Branch 78 → 80 not taken.
 4372 llvm::BasicBlock *bElse = node->elseStmt ? createBlock("if.else." + codeLine) : nullptr;
334
2/4
✓ Branch 36 → 37 taken 4372 times.
✗ Branch 36 → 84 not taken.
✓ Branch 37 → 38 taken 4372 times.
✗ Branch 37 → 82 not taken.
 4372 llvm::BasicBlock *bExit = createBlock("if.exit." + codeLine);
335
336 // Change scope
337
2/4
✓ Branch 39 → 40 taken 4372 times.
✗ Branch 39 → 87 not taken.
✓ Branch 40 → 41 taken 4372 times.
✗ Branch 40 → 85 not taken.
 4372 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::IF_ELSE_BODY, node);
338
339 // Retrieve condition value
340
1/2
✓ Branch 42 → 43 taken 4372 times.
✗ Branch 42 → 91 not taken.
 4372 llvm::Value *condValue = resolveValue(node->condition);
341 // Check if condition is fulfilled
342
3/4
✓ Branch 43 → 44 taken 203 times.
✓ Branch 43 → 45 taken 4169 times.
✓ Branch 46 → 47 taken 4372 times.
✗ Branch 46 → 91 not taken.
 4372 insertCondJump(condValue, bThen, node->elseStmt ? bElse : bExit);
343
344 // Switch to then block
345
1/2
✓ Branch 47 → 48 taken 4372 times.
✗ Branch 47 → 91 not taken.
 4372 switchToBlock(bThen);
346 // Visit then body
347
1/2
✓ Branch 48 → 49 taken 4372 times.
✗ Branch 48 → 89 not taken.
 4372 visit(node->thenBody);
348 // Create jump from then to end block
349
1/2
✓ Branch 50 → 51 taken 4372 times.
✗ Branch 50 → 91 not taken.
 4372 insertJump(bExit);
350
351 // Change scope back
352
1/2
✓ Branch 51 → 52 taken 4372 times.
✗ Branch 51 → 91 not taken.
 4372 scopeHandle.leaveScopeEarly();
353
354
2/2
✓ Branch 52 → 53 taken 203 times.
✓ Branch 52 → 57 taken 4169 times.
 4372 if (node->elseStmt) {
355 // Switch to else block
356
1/2
✓ Branch 53 → 54 taken 203 times.
✗ Branch 53 → 91 not taken.
 203 switchToBlock(bElse);
357 // Visit else block
358
1/2
✓ Branch 54 → 55 taken 203 times.
✗ Branch 54 → 90 not taken.
 203 visit(node->elseStmt);
359 // Create jump from else to end block
360
1/2
✓ Branch 56 → 57 taken 203 times.
✗ Branch 56 → 91 not taken.
 203 insertJump(bExit);
361 }
362
363 // Switch to exit block
364
1/2
✓ Branch 57 → 58 taken 4372 times.
✗ Branch 57 → 91 not taken.
 4372 switchToBlock(bExit);
365
366 // Return conditional value as result for the 'if' stmt
367
1/2
✓ Branch 58 → 59 taken 4372 times.
✗ Branch 58 → 91 not taken.
 4372 return condValue;
368 4372 }
369
370 203 std::any IRGenerator::visitElseStmt(const ElseStmtNode *node) {
371 203 diGenerator.setSourceLocation(node);
372
373
2/2
✓ Branch 3 → 4 taken 60 times.
✓ Branch 3 → 7 taken 143 times.
 203 if (node->ifStmt) { // It is an else if branch
374
1/2
✓ Branch 4 → 5 taken 60 times.
✗ Branch 4 → 17 not taken.
 60 visit(node->ifStmt);
375 } else { // It is an else branch
376 // Change scope
377
2/4
✓ Branch 7 → 8 taken 143 times.
✗ Branch 7 → 20 not taken.
✓ Branch 8 → 9 taken 143 times.
✗ Branch 8 → 18 not taken.
 143 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::IF_ELSE_BODY, node);
378
379 // Generate IR for nested statements
380
1/2
✓ Branch 10 → 11 taken 143 times.
✗ Branch 10 → 22 not taken.
 143 visit(node->body);
381 143 }
382
383
1/2
✓ Branch 14 → 15 taken 203 times.
✗ Branch 14 → 26 not taken.
 203 return nullptr;
384 }
385
386 8 std::any IRGenerator::visitSwitchStmt(const SwitchStmtNode *node) {
387
1/2
✓ Branch 2 → 3 taken 8 times.
✗ Branch 2 → 107 not taken.
 8 diGenerator.setSourceLocation(node);
388
389 // Create blocks
390 8 std::vector<llvm::BasicBlock *> bCases;
391
1/2
✓ Branch 4 → 5 taken 8 times.
✗ Branch 4 → 105 not taken.
 8 bCases.reserve(node->caseBranches.size());
392
2/2
✓ Branch 16 → 7 taken 49 times.
✓ Branch 16 → 17 taken 8 times.
 57 for (const auto caseBranch : node->caseBranches)
393
4/8
✓ Branch 8 → 9 taken 49 times.
✗ Branch 8 → 82 not taken.
✓ Branch 9 → 10 taken 49 times.
✗ Branch 9 → 80 not taken.
✓ Branch 10 → 11 taken 49 times.
✗ Branch 10 → 78 not taken.
✓ Branch 11 → 12 taken 49 times.
✗ Branch 11 → 78 not taken.
 49 bCases.push_back(createBlock("switch.case." + caseBranch->codeLoc.toPrettyLine()));
394 8 llvm::BasicBlock *bDefault = nullptr;
395
2/2
✓ Branch 17 → 18 taken 4 times.
✓ Branch 17 → 24 taken 4 times.
 8 if (node->hasDefaultBranch)
396
3/6
✓ Branch 18 → 19 taken 4 times.
✗ Branch 18 → 90 not taken.
✓ Branch 19 → 20 taken 4 times.
✗ Branch 19 → 88 not taken.
✓ Branch 20 → 21 taken 4 times.
✗ Branch 20 → 86 not taken.
 4 bDefault = createBlock("switch.default." + node->defaultBranch->codeLoc.toPrettyLine());
397
1/2
✓ Branch 24 → 25 taken 8 times.
✗ Branch 24 → 105 not taken.
 8 const std::string codeLine = node->codeLoc.toPrettyLine();
398
2/4
✓ Branch 25 → 26 taken 8 times.
✗ Branch 25 → 94 not taken.
✓ Branch 26 → 27 taken 8 times.
✗ Branch 26 → 92 not taken.
 8 llvm::BasicBlock *bExit = createBlock("switch.exit." + codeLine);
399
400 // Save the blocks for break and continue
401
1/2
✓ Branch 28 → 29 taken 8 times.
✗ Branch 28 → 103 not taken.
 8 breakBlocks.push_back(bExit);
402
403 // Visit switch expression
404
1/2
✓ Branch 29 → 30 taken 8 times.
✗ Branch 29 → 103 not taken.
 8 llvm::Value *exprValue = resolveValue(node->assignExpr);
405
406 // Generate switch instruction
407
3/4
✓ Branch 31 → 32 taken 4 times.
✓ Branch 31 → 33 taken 4 times.
✓ Branch 34 → 35 taken 8 times.
✗ Branch 34 → 103 not taken.
 8 llvm::SwitchInst *switchInst = builder.CreateSwitch(exprValue, bDefault ? bDefault : bExit, node->caseBranches.size());
408
409 // Generate case branches
410
2/2
✓ Branch 62 → 36 taken 49 times.
✓ Branch 62 → 63 taken 8 times.
 57 for (size_t i = 0; i < node->caseBranches.size(); i++) {
411
1/2
✓ Branch 36 → 37 taken 49 times.
✗ Branch 36 → 100 not taken.
 49 const CaseBranchNode *caseBranch = node->caseBranches.at(i);
412
413 // Push fallthrough block
414 49 llvm::BasicBlock *bFallthrough = bDefault;
415
2/2
✓ Branch 38 → 39 taken 41 times.
✓ Branch 38 → 41 taken 8 times.
 49 if (i + 1 < node->caseBranches.size())
416
1/2
✓ Branch 39 → 40 taken 41 times.
✗ Branch 39 → 100 not taken.
 41 bFallthrough = bCases.at(i + 1);
417
1/2
✓ Branch 41 → 42 taken 49 times.
✗ Branch 41 → 100 not taken.
 49 fallthroughBlocks.push(bFallthrough);
418
419 // Switch to case block
420
2/4
✓ Branch 42 → 43 taken 49 times.
✗ Branch 42 → 100 not taken.
✓ Branch 43 → 44 taken 49 times.
✗ Branch 43 → 100 not taken.
 49 switchToBlock(bCases.at(i));
421
422 // Visit case body
423
1/2
✓ Branch 44 → 45 taken 49 times.
✗ Branch 44 → 95 not taken.
 49 visit(caseBranch);
424
425 // Create jump from case to exit block
426
1/2
✓ Branch 46 → 47 taken 49 times.
✗ Branch 46 → 100 not taken.
 49 insertJump(bExit);
427
428 // Pop fallthrough block
429 49 fallthroughBlocks.pop();
430
431 // Add case to switch instruction
432
2/2
✓ Branch 59 → 50 taken 66 times.
✓ Branch 59 → 60 taken 49 times.
 115 for (const CaseConstantNode *caseConstantNode : caseBranch->caseConstants) {
433
2/4
✓ Branch 51 → 52 taken 66 times.
✗ Branch 51 → 98 not taken.
✓ Branch 52 → 53 taken 66 times.
✗ Branch 52 → 96 not taken.
 66 const auto caseValue = std::any_cast<llvm::Constant *>(visit(caseConstantNode));
434
3/6
✓ Branch 54 → 55 taken 66 times.
✗ Branch 54 → 99 not taken.
✓ Branch 55 → 56 taken 66 times.
✗ Branch 55 → 99 not taken.
✓ Branch 56 → 57 taken 66 times.
✗ Branch 56 → 99 not taken.
 66 switchInst->addCase(llvm::cast<llvm::ConstantInt>(caseValue), bCases.at(i));
435 }
436 }
437
438 // Generate default branch
439
2/2
✓ Branch 63 → 64 taken 4 times.
✓ Branch 63 → 68 taken 4 times.
 8 if (node->hasDefaultBranch) {
440 // Switch to default block
441
1/2
✓ Branch 64 → 65 taken 4 times.
✗ Branch 64 → 103 not taken.
 4 switchToBlock(bDefault);
442
443 // Visit default body
444
1/2
✓ Branch 65 → 66 taken 4 times.
✗ Branch 65 → 101 not taken.
 4 visit(node->defaultBranch);
445
446 // Create jump from default to exit block
447
1/2
✓ Branch 67 → 68 taken 4 times.
✗ Branch 67 → 103 not taken.
 4 insertJump(bExit);
448 }
449
450 // Switch to exit block
451
1/2
✓ Branch 68 → 69 taken 8 times.
✗ Branch 68 → 103 not taken.
 8 switchToBlock(bExit);
452
453 // Pop basic blocks from break stack
454
1/2
✗ Branch 70 → 71 not taken.
✓ Branch 70 → 72 taken 8 times.
 8 assert(breakBlocks.back() == bExit);
455 8 breakBlocks.pop_back();
456
457
1/2
✓ Branch 73 → 74 taken 8 times.
✗ Branch 73 → 102 not taken.
 16 return nullptr;
458 8 }
459
460 49 std::any IRGenerator::visitCaseBranch(const CaseBranchNode *node) {
461
1/2
✓ Branch 2 → 3 taken 49 times.
✗ Branch 2 → 20 not taken.
 49 diGenerator.setSourceLocation(node);
462
463 // Change to case body scope
464
2/4
✓ Branch 3 → 4 taken 49 times.
✗ Branch 3 → 14 not taken.
✓ Branch 4 → 5 taken 49 times.
✗ Branch 4 → 12 not taken.
 49 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::CASE_BODY);
465
466 // Visit case body
467
1/2
✓ Branch 6 → 7 taken 49 times.
✗ Branch 6 → 16 not taken.
 49 visit(node->body);
468
469
1/2
✓ Branch 8 → 9 taken 49 times.
✗ Branch 8 → 17 not taken.
 98 return nullptr;
470 49 }
471
472 4 std::any IRGenerator::visitDefaultBranch(const DefaultBranchNode *node) {
473
1/2
✓ Branch 2 → 3 taken 4 times.
✗ Branch 2 → 20 not taken.
 4 diGenerator.setSourceLocation(node);
474
475 // Change to default body scope
476
2/4
✓ Branch 3 → 4 taken 4 times.
✗ Branch 3 → 14 not taken.
✓ Branch 4 → 5 taken 4 times.
✗ Branch 4 → 12 not taken.
 4 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::DEFAULT_BODY);
477
478 // Visit case body
479
1/2
✓ Branch 6 → 7 taken 4 times.
✗ Branch 6 → 16 not taken.
 4 visit(node->body);
480
481
1/2
✓ Branch 8 → 9 taken 4 times.
✗ Branch 8 → 17 not taken.
 8 return nullptr;
482 4 }
483
484 32 std::any IRGenerator::visitAnonymousBlockStmt(const AnonymousBlockStmtNode *node) {
485
1/2
✓ Branch 2 → 3 taken 32 times.
✗ Branch 2 → 20 not taken.
 32 diGenerator.setSourceLocation(node);
486
487 // Change scope
488 32 node->bodyScope->parent = currentScope; // Needed for nested scopes in generic functions
489 32 node->bodyScope->symbolTable.parent = &currentScope->symbolTable; // Needed for nested scopes in generic functions
490
2/4
✓ Branch 3 → 4 taken 32 times.
✗ Branch 3 → 14 not taken.
✓ Branch 4 → 5 taken 32 times.
✗ Branch 4 → 12 not taken.
 32 ScopeHandle scopeHandle(this, node->getScopeId(), ScopeType::ANONYMOUS_BLOCK_BODY, node);
491
492 // Visit instructions in the block
493
1/2
✓ Branch 6 → 7 taken 32 times.
✗ Branch 6 → 16 not taken.
 32 visit(node->body);
494
495
1/2
✓ Branch 8 → 9 taken 32 times.
✗ Branch 8 → 17 not taken.
 64 return nullptr;
496 32 }
497
498 } // namespace spice::compiler
499