src/irgenerator/GenStatements.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 <driver/Driver.h> | ||
| 7 | #include <symboltablebuilder/SymbolTableBuilder.h> | ||
| 8 | |||
| 9 | #include <llvm/IR/Module.h> | ||
| 10 | |||
| 11 | namespace spice::compiler { | ||
| 12 | |||
| 13 | 162863 | std::any IRGenerator::visitStmtLst(const StmtLstNode *node) { | |
| 14 | // Generate instructions in the scope | ||
| 15 |
2/2✓ Branch 20 → 4 taken 321289 times.
✓ Branch 20 → 21 taken 162823 times.
|
646975 | for (const StmtNode *stmt : node->statements) { |
| 16 | // Check if we can cancel generating instructions for this code branch | ||
| 17 |
4/4✓ Branch 6 → 7 taken 321253 times.
✓ Branch 6 → 21 taken 36 times.
✓ Branch 7 → 8 taken 321249 times.
✓ Branch 7 → 21 taken 4 times.
|
321289 | if (blockAlreadyTerminated || stmt->unreachable) |
| 18 | break; | ||
| 19 | |||
| 20 | // Set source location for debug info | ||
| 21 |
1/2✓ Branch 8 → 9 taken 321249 times.
✗ Branch 8 → 27 not taken.
|
321249 | diGenerator.setSourceLocation(stmt); |
| 22 | |||
| 23 | // Visit child | ||
| 24 |
1/2✓ Branch 9 → 10 taken 321249 times.
✗ Branch 9 → 26 not taken.
|
321249 | visit(stmt); |
| 25 | } | ||
| 26 | |||
| 27 | // Generate cleanup code of this scope, e.g. dtor calls for struct instances | ||
| 28 | 162863 | generateScopeCleanup(node); | |
| 29 | |||
| 30 |
1/2✓ Branch 22 → 23 taken 162863 times.
✗ Branch 22 → 28 not taken.
|
325726 | return nullptr; |
| 31 | } | ||
| 32 | |||
| 33 | ✗ | std::any IRGenerator::visitTypeAltsLst(const TypeAltsLstNode *node) { | |
| 34 | ✗ | return nullptr; // Noop | |
| 35 | } | ||
| 36 | |||
| 37 | 64048 | std::any IRGenerator::visitDeclStmt(const DeclStmtNode *node) { | |
| 38 | // Get variable entry | ||
| 39 |
1/2✓ Branch 2 → 3 taken 64048 times.
✗ Branch 2 → 90 not taken.
|
64048 | const SymbolTableEntry *varEntry = node->entries.at(manIdx); |
| 40 |
1/2✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 64048 times.
|
64048 | assert(varEntry != nullptr); |
| 41 |
1/2✓ Branch 5 → 6 taken 64048 times.
✗ Branch 5 → 90 not taken.
|
64048 | const QualType varSymbolType = varEntry->getQualType(); |
| 42 | |||
| 43 | // Get LLVM type of variable | ||
| 44 |
1/2✓ Branch 6 → 7 taken 64048 times.
✗ Branch 6 → 90 not taken.
|
64048 | llvm::Type *varTy = varSymbolType.toLLVMType(sourceFile); |
| 45 | |||
| 46 | // Check if the declaration is with an assignment or the default value | ||
| 47 | 64048 | llvm::Value *varAddress = nullptr; | |
| 48 |
2/2✓ Branch 7 → 8 taken 60014 times.
✓ Branch 7 → 33 taken 4034 times.
|
64048 | if (node->hasAssignment) { // Assignment |
| 49 |
2/2✓ Branch 8 → 9 taken 480 times.
✓ Branch 8 → 27 taken 59534 times.
|
60014 | if (node->calledCopyCtor) { |
| 50 | // Allocate memory | ||
| 51 |
1/2✓ Branch 12 → 13 taken 480 times.
✗ Branch 12 → 65 not taken.
|
480 | varAddress = insertAlloca(varTy); |
| 52 |
1/2✓ Branch 15 → 16 taken 480 times.
✗ Branch 15 → 90 not taken.
|
480 | updateAddress(varEntry, varAddress); |
| 53 | // Generate debug info for variable declaration | ||
| 54 |
1/2✓ Branch 16 → 17 taken 480 times.
✗ Branch 16 → 90 not taken.
|
480 | diGenerator.generateLocalVarDebugInfo(node->varName, varAddress); |
| 55 | // Call copy ctor | ||
| 56 |
1/2✓ Branch 17 → 18 taken 480 times.
✗ Branch 17 → 90 not taken.
|
480 | llvm::Value *rhsAddress = resolveAddress(node->assignExpr); |
| 57 |
1/2✗ Branch 18 → 19 not taken.
✓ Branch 18 → 20 taken 480 times.
|
480 | assert(rhsAddress != nullptr); |
| 58 |
2/4✓ Branch 22 → 23 taken 480 times.
✗ Branch 22 → 73 not taken.
✓ Branch 23 → 24 taken 480 times.
✗ Branch 23 → 71 not taken.
|
1440 | generateCtorOrDtorCall(varEntry, node->calledCopyCtor, {rhsAddress}); |
| 59 | } else { | ||
| 60 | // Assign rhs to lhs | ||
| 61 |
1/2✓ Branch 27 → 28 taken 59534 times.
✗ Branch 27 → 78 not taken.
|
59534 | [[maybe_unused]] const LLVMExprResult assignResult = doAssignment(varAddress, varEntry, node->assignExpr, node, true); |
| 62 |
1/2✗ Branch 28 → 29 not taken.
✓ Branch 28 → 30 taken 59534 times.
|
59534 | assert(assignResult.entry == varEntry); |
| 63 |
1/2✓ Branch 30 → 31 taken 59534 times.
✗ Branch 30 → 78 not taken.
|
59534 | varAddress = getAddress(varEntry); |
| 64 |
1/2✓ Branch 31 → 32 taken 59534 times.
✗ Branch 31 → 78 not taken.
|
59534 | updateAddress(varEntry, varAddress); |
| 65 | } | ||
| 66 | } else { // Default value | ||
| 67 | // Allocate memory | ||
| 68 |
1/2✓ Branch 36 → 37 taken 4034 times.
✗ Branch 36 → 79 not taken.
|
4034 | varAddress = insertAlloca(varTy); |
| 69 |
1/2✓ Branch 39 → 40 taken 4034 times.
✗ Branch 39 → 90 not taken.
|
4034 | updateAddress(varEntry, varAddress); |
| 70 | |||
| 71 | // Generate debug info for variable declaration | ||
| 72 |
1/2✓ Branch 40 → 41 taken 4034 times.
✗ Branch 40 → 90 not taken.
|
4034 | diGenerator.generateLocalVarDebugInfo(node->varName, varAddress); |
| 73 | |||
| 74 |
2/2✓ Branch 41 → 42 taken 1842 times.
✓ Branch 41 → 46 taken 2192 times.
|
4034 | if (node->calledInitCtor) { |
| 75 | // Call no-args constructor | ||
| 76 |
1/2✓ Branch 43 → 44 taken 1842 times.
✗ Branch 43 → 85 not taken.
|
1842 | generateCtorOrDtorCall(varEntry, node->calledInitCtor, {}); |
| 77 | // A union with no default field must start in the "unset" tag state, and a union with a default field must | ||
| 78 | // start with that field active. Either way, the tag bits carry real runtime safety meaning (unlike a struct's | ||
| 79 | // all-zero debug-only default), so they must be initialized unconditionally, in every build mode. | ||
| 80 |
8/10✓ Branch 46 → 47 taken 1228 times.
✓ Branch 46 → 51 taken 964 times.
✓ Branch 47 → 48 taken 2 times.
✓ Branch 47 → 50 taken 1226 times.
✓ Branch 48 → 49 taken 2 times.
✗ Branch 48 → 90 not taken.
✗ Branch 49 → 50 not taken.
✓ Branch 49 → 51 taken 2 times.
✓ Branch 52 → 53 taken 1226 times.
✓ Branch 52 → 57 taken 966 times.
|
2192 | } else if (!node->isForEachItem && (cliOptions.buildMode != BuildMode::RELEASE || varSymbolType.is(TY_UNION))) { |
| 81 |
1/2✗ Branch 53 → 54 not taken.
✓ Branch 53 → 55 taken 1226 times.
|
1226 | assert(!node->isCtorCallRequired); |
| 82 | // Retrieve default value for lhs symbol type and store it | ||
| 83 |
1/2✓ Branch 55 → 56 taken 1226 times.
✗ Branch 55 → 90 not taken.
|
1226 | llvm::Constant *defaultValue = getDefaultValueForSymbolType(varSymbolType); |
| 84 |
1/2✓ Branch 56 → 57 taken 1226 times.
✗ Branch 56 → 90 not taken.
|
1226 | insertStore(defaultValue, varAddress); |
| 85 | } | ||
| 86 | } | ||
| 87 |
1/2✗ Branch 57 → 58 not taken.
✓ Branch 57 → 59 taken 64048 times.
|
64048 | assert(varAddress != nullptr); |
| 88 | |||
| 89 | // Attach the variable name to the LLVM value. | ||
| 90 |
2/4✓ Branch 59 → 60 taken 64048 times.
✗ Branch 59 → 88 not taken.
✓ Branch 60 → 61 taken 64048 times.
✗ Branch 60 → 88 not taken.
|
64048 | varAddress->setName(varEntry->name); |
| 91 | |||
| 92 |
1/2✓ Branch 61 → 62 taken 64048 times.
✗ Branch 61 → 89 not taken.
|
128096 | return nullptr; |
| 93 | } | ||
| 94 | |||
| 95 | ✗ | std::any IRGenerator::visitQualifierLst(const QualifierLstNode *node) { | |
| 96 | ✗ | return nullptr; // Noop | |
| 97 | } | ||
| 98 | |||
| 99 | 2034 | std::any IRGenerator::visitModAttr(const ModAttrNode *node) { | |
| 100 |
1/2✓ Branch 2 → 3 taken 2034 times.
✗ Branch 2 → 6 not taken.
|
4068 | return nullptr; // Noop |
| 101 | } | ||
| 102 | |||
| 103 | ✗ | std::any IRGenerator::visitTopLevelDefinitionAttr(const TopLevelDefAttrNode *node) { | |
| 104 | ✗ | return nullptr; // Noop | |
| 105 | } | ||
| 106 | |||
| 107 | 1907 | std::any IRGenerator::visitCaseConstant(const CaseConstantNode *node) { | |
| 108 |
2/2✓ Branch 2 → 3 taken 131 times.
✓ Branch 2 → 4 taken 1776 times.
|
1907 | if (node->constant) |
| 109 | 131 | return visit(node->constant); | |
| 110 | |||
| 111 | 1776 | const SymbolTableEntry *constantEntry = node->entry; | |
| 112 |
4/8✓ Branch 4 → 5 taken 1776 times.
✗ Branch 4 → 12 not taken.
✓ Branch 5 → 6 taken 1776 times.
✗ Branch 5 → 11 not taken.
✓ Branch 6 → 7 taken 1776 times.
✗ Branch 6 → 11 not taken.
✓ Branch 7 → 8 taken 1776 times.
✗ Branch 7 → 11 not taken.
|
3552 | return getConst(constantEntry->declNode->getCompileTimeValue(manIdx), node->getEvaluatedSymbolType(manIdx), node); |
| 113 | } | ||
| 114 | |||
| 115 | 74309 | std::any IRGenerator::visitReturnStmt(const ReturnStmtNode *node) { | |
| 116 | 74309 | llvm::Value *returnValue = nullptr; | |
| 117 |
2/2✓ Branch 2 → 3 taken 67614 times.
✓ Branch 2 → 31 taken 6695 times.
|
74309 | if (node->hasReturnValue) { // Return value is attached to the return statement |
| 118 | 67614 | const ExprNode *returnExpr = node->assignExpr; | |
| 119 |
2/2✓ Branch 3 → 4 taken 306 times.
✓ Branch 3 → 25 taken 67308 times.
|
67614 | if (node->calledCopyCtor) { |
| 120 | // Perform a copy | ||
| 121 | 306 | llvm::Value *originalAddress = resolveAddress(returnExpr); | |
| 122 | 306 | llvm::Type *returnTy = node->returnType.toLLVMType(sourceFile); | |
| 123 |
1/2✓ Branch 9 → 10 taken 306 times.
✗ Branch 9 → 59 not taken.
|
306 | llvm::Value *newAddress = insertAlloca(returnTy); |
| 124 |
2/4✓ Branch 14 → 15 taken 306 times.
✗ Branch 14 → 67 not taken.
✓ Branch 15 → 16 taken 306 times.
✗ Branch 15 → 65 not taken.
|
918 | generateCtorOrDtorCall(newAddress, node->calledCopyCtor, {originalAddress}); |
| 125 |
1/2✓ Branch 21 → 22 taken 306 times.
✗ Branch 21 → 72 not taken.
|
306 | returnValue = insertLoad(returnTy, newAddress); |
| 126 | } else { | ||
| 127 |
2/2✓ Branch 26 → 27 taken 4144 times.
✓ Branch 26 → 29 taken 63164 times.
|
67308 | returnValue = node->returnType.isRef() ? resolveAddress(returnExpr) : resolveValue(returnExpr); |
| 128 | } | ||
| 129 | } else { // Try to load result variable value | ||
| 130 |
1/2✓ Branch 33 → 34 taken 6695 times.
✗ Branch 33 → 80 not taken.
|
20085 | const SymbolTableEntry *resultEntry = currentScope->lookup(RETURN_VARIABLE_NAME); |
| 131 |
2/2✓ Branch 39 → 40 taken 14 times.
✓ Branch 39 → 50 taken 6681 times.
|
6695 | if (resultEntry != nullptr) { |
| 132 | 14 | llvm::Type *resultSTy = resultEntry->getQualType().toLLVMType(sourceFile); | |
| 133 | 14 | llvm::Value *returnValueAddr = getAddress(resultEntry); | |
| 134 |
1/2✓ Branch 46 → 47 taken 14 times.
✗ Branch 46 → 84 not taken.
|
14 | returnValue = insertLoad(resultSTy, returnValueAddr); |
| 135 | } | ||
| 136 | } | ||
| 137 | |||
| 138 | // Clean up all scopes between here and the enclosing function/procedure/lambda body, then terminate the block | ||
| 139 | 74309 | generateScopeCleanupUpTo(node, currentScope->getFunctionScope()); | |
| 140 | 74309 | blockAlreadyTerminated = true; | |
| 141 | |||
| 142 | // Create return instruction | ||
| 143 |
2/2✓ Branch 52 → 53 taken 67628 times.
✓ Branch 52 → 54 taken 6681 times.
|
74309 | if (returnValue != nullptr) { |
| 144 | // Return with value | ||
| 145 | 67628 | builder.CreateRet(returnValue); | |
| 146 | } else { | ||
| 147 | // Return without value | ||
| 148 | 6681 | builder.CreateRetVoid(); | |
| 149 | } | ||
| 150 | |||
| 151 |
1/2✓ Branch 55 → 56 taken 74309 times.
✗ Branch 55 → 90 not taken.
|
148618 | return nullptr; |
| 152 | } | ||
| 153 | |||
| 154 | 1044 | std::any IRGenerator::visitBreakStmt(const BreakStmtNode *node) { | |
| 155 |
1/2✓ Branch 3 → 4 taken 1044 times.
✗ Branch 3 → 11 not taken.
|
1044 | const auto [targetScope, targetBlock] = breakTargets.at(breakTargets.size() - node->breakTimes); |
| 156 | |||
| 157 | // Clean up all scopes between here and the loop/switch statement we are breaking out of | ||
| 158 |
1/2✓ Branch 4 → 5 taken 1044 times.
✗ Branch 4 → 11 not taken.
|
1044 | generateScopeCleanupUpTo(node, targetScope); |
| 159 | |||
| 160 | // Jump to destination block | ||
| 161 |
1/2✓ Branch 5 → 6 taken 1044 times.
✗ Branch 5 → 11 not taken.
|
1044 | insertJump(targetBlock); |
| 162 | |||
| 163 |
1/2✓ Branch 6 → 7 taken 1044 times.
✗ Branch 6 → 10 not taken.
|
2088 | return nullptr; |
| 164 | } | ||
| 165 | |||
| 166 | 1698 | std::any IRGenerator::visitContinueStmt(const ContinueStmtNode *node) { | |
| 167 |
1/2✓ Branch 3 → 4 taken 1698 times.
✗ Branch 3 → 11 not taken.
|
1698 | const auto [targetScope, targetBlock] = continueTargets.at(continueTargets.size() - node->continueTimes); |
| 168 | |||
| 169 | // Clean up all scopes between here and the loop statement we are continuing | ||
| 170 |
1/2✓ Branch 4 → 5 taken 1698 times.
✗ Branch 4 → 11 not taken.
|
1698 | generateScopeCleanupUpTo(node, targetScope); |
| 171 | |||
| 172 | // Jump to destination block | ||
| 173 |
1/2✓ Branch 5 → 6 taken 1698 times.
✗ Branch 5 → 11 not taken.
|
1698 | insertJump(targetBlock); |
| 174 | |||
| 175 |
1/2✓ Branch 6 → 7 taken 1698 times.
✗ Branch 6 → 10 not taken.
|
3396 | return nullptr; |
| 176 | } | ||
| 177 | |||
| 178 | 8 | std::any IRGenerator::visitFallthroughStmt(const FallthroughStmtNode *node) { | |
| 179 | // Jump to destination block | ||
| 180 | 8 | insertJump(fallthroughBlocks.top()); | |
| 181 | |||
| 182 |
1/2✓ Branch 4 → 5 taken 8 times.
✗ Branch 4 → 8 not taken.
|
16 | return nullptr; |
| 183 | } | ||
| 184 | |||
| 185 | 11043 | std::any IRGenerator::visitAssertStmt(const AssertStmtNode *node) { | |
| 186 | // Do not generate assertions in release mode | ||
| 187 |
1/2✗ Branch 2 → 3 not taken.
✓ Branch 2 → 6 taken 11043 times.
|
11043 | if (cliOptions.buildMode == BuildMode::RELEASE) |
| 188 | ✗ | return nullptr; | |
| 189 | |||
| 190 | 22052 | const auto generateBody = [&] { | |
| 191 | // Create constant for error message | ||
| 192 |
2/4✓ Branch 2 → 3 taken 11009 times.
✗ Branch 2 → 35 not taken.
✓ Branch 3 → 4 taken 11009 times.
✗ Branch 3 → 33 not taken.
|
11009 | const std::string errorMsg = "Assertion failed: Condition '" + node->expressionString + "' evaluated to false.\n"; |
| 193 |
4/8✓ Branch 7 → 8 taken 11009 times.
✗ Branch 7 → 41 not taken.
✓ Branch 8 → 9 taken 11009 times.
✗ Branch 8 → 39 not taken.
✓ Branch 9 → 10 taken 11009 times.
✗ Branch 9 → 37 not taken.
✓ Branch 11 → 12 taken 11009 times.
✗ Branch 11 → 36 not taken.
|
22018 | llvm::GlobalVariable *globalString = builder.CreateGlobalString(errorMsg, getUnusedGlobalName(ANON_GLOBAL_STRING_NAME)); |
| 194 | // If the output should be comparable, fix alignment to 4 bytes | ||
| 195 |
1/2✓ Branch 15 → 16 taken 11009 times.
✗ Branch 15 → 19 not taken.
|
11009 | if (cliOptions.comparableOutput) |
| 196 |
2/4✓ Branch 16 → 17 taken 11009 times.
✗ Branch 16 → 47 not taken.
✓ Branch 17 → 18 taken 11009 times.
✗ Branch 17 → 47 not taken.
|
11009 | globalString->setAlignment(llvm::Align(4)); |
| 197 | // Print the error message | ||
| 198 |
1/2✓ Branch 19 → 20 taken 11009 times.
✗ Branch 19 → 56 not taken.
|
11009 | llvm::Function *printfFct = stdFunctionManager.getPrintfFct(); |
| 199 |
4/8✓ Branch 20 → 21 taken 11009 times.
✗ Branch 20 → 51 not taken.
✓ Branch 22 → 23 taken 11009 times.
✗ Branch 22 → 48 not taken.
✓ Branch 23 → 24 taken 11009 times.
✗ Branch 23 → 48 not taken.
✓ Branch 24 → 25 taken 11009 times.
✗ Branch 24 → 56 not taken.
|
11009 | builder.CreateCall(printfFct, globalString); |
| 200 | // Generate call to exit() | ||
| 201 |
1/2✓ Branch 24 → 25 taken 11009 times.
✗ Branch 24 → 56 not taken.
|
11009 | llvm::Function *exitFct = stdFunctionManager.getExitFct(); |
| 202 |
5/10✓ Branch 25 → 26 taken 11009 times.
✗ Branch 25 → 55 not taken.
✓ Branch 26 → 27 taken 11009 times.
✗ Branch 26 → 53 not taken.
✓ Branch 28 → 29 taken 11009 times.
✗ Branch 28 → 52 not taken.
✓ Branch 29 → 30 taken 11009 times.
✗ Branch 29 → 52 not taken.
✓ Branch 30 → 31 taken 11009 times.
✗ Branch 30 → 56 not taken.
|
11009 | builder.CreateCall(exitFct, builder.getInt32(EXIT_FAILURE)); |
| 203 | // Create unreachable instruction | ||
| 204 |
1/2✓ Branch 30 → 31 taken 11009 times.
✗ Branch 30 → 56 not taken.
|
11009 | builder.CreateUnreachable(); |
| 205 | 11009 | blockAlreadyTerminated = true; | |
| 206 | 11009 | }; | |
| 207 | |||
| 208 | // If we have a compile time decision, only evaluate the respective branch | ||
| 209 |
3/4✓ Branch 6 → 7 taken 11043 times.
✗ Branch 6 → 42 not taken.
✓ Branch 7 → 8 taken 72 times.
✓ Branch 7 → 14 taken 10971 times.
|
11043 | if (node->assignExpr->hasCompileTimeValue(manIdx)) { |
| 210 |
3/4✓ Branch 8 → 9 taken 72 times.
✗ Branch 8 → 42 not taken.
✓ Branch 9 → 10 taken 38 times.
✓ Branch 9 → 11 taken 34 times.
|
72 | if (!node->assignExpr->getCompileTimeValue(manIdx).boolValue) |
| 211 |
1/2✓ Branch 10 → 11 taken 38 times.
✗ Branch 10 → 42 not taken.
|
38 | generateBody(); |
| 212 |
1/2✓ Branch 11 → 12 taken 72 times.
✗ Branch 11 → 32 not taken.
|
144 | return nullptr; |
| 213 | } | ||
| 214 | |||
| 215 | // Create blocks | ||
| 216 |
1/2✓ Branch 14 → 15 taken 10971 times.
✗ Branch 14 → 42 not taken.
|
10971 | const std::string &codeLine = node->codeLoc.toPrettyLine(); |
| 217 |
2/4✓ Branch 15 → 16 taken 10971 times.
✗ Branch 15 → 35 not taken.
✓ Branch 16 → 17 taken 10971 times.
✗ Branch 16 → 33 not taken.
|
10971 | llvm::BasicBlock *bThen = createBlock("assert.then." + codeLine); |
| 218 |
2/4✓ Branch 18 → 19 taken 10971 times.
✗ Branch 18 → 38 not taken.
✓ Branch 19 → 20 taken 10971 times.
✗ Branch 19 → 36 not taken.
|
10971 | llvm::BasicBlock *bExit = createBlock("assert.exit." + codeLine); |
| 219 | |||
| 220 | // Visit the assignExpr | ||
| 221 |
1/2✓ Branch 21 → 22 taken 10971 times.
✗ Branch 21 → 40 not taken.
|
10971 | llvm::Value *condValue = resolveValue(node->assignExpr); |
| 222 | |||
| 223 | // Create condition check | ||
| 224 |
1/2✓ Branch 22 → 23 taken 10971 times.
✗ Branch 22 → 40 not taken.
|
10971 | insertCondJump(condValue, bExit, bThen, Likelihood::LIKELY); |
| 225 | |||
| 226 | // Switch to then block | ||
| 227 |
1/2✓ Branch 23 → 24 taken 10971 times.
✗ Branch 23 → 40 not taken.
|
10971 | switchToBlock(bThen); |
| 228 |
1/2✓ Branch 24 → 25 taken 10971 times.
✗ Branch 24 → 40 not taken.
|
10971 | generateBody(); |
| 229 | |||
| 230 | // Switch to exit block | ||
| 231 |
1/2✓ Branch 25 → 26 taken 10971 times.
✗ Branch 25 → 40 not taken.
|
10971 | switchToBlock(bExit); |
| 232 | |||
| 233 |
1/2✓ Branch 26 → 27 taken 10971 times.
✗ Branch 26 → 39 not taken.
|
10971 | return nullptr; |
| 234 | 10971 | } | |
| 235 | |||
| 236 | } // namespace spice::compiler | ||
| 237 |