GCC Code Coverage Report

Directory: ../
Coverage: low: ≥ 0% medium: ≥ 75.0% high: ≥ 90.0%
Coverage Exec / Excl / Total
Lines: 95.8% 480 / 17 / 518
Functions: 95.0% 19 / 0 / 20
Branches: 56.9% 526 / 36 / 960
src/irgenerator/GenExpressions.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
7 #include <llvm/IR/Module.h>
8
9 namespace spice::compiler {
10
11 6695 std::any IRGenerator::visitAssignExpr(const AssignExprNode *node) {
12 6695 diGenerator.setSourceLocation(node);
13
14 // Visit ternary expression
15
1/2
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 6695 times.
 6695 if (node->ternaryExpr)
16 ✗ return visit(node->ternaryExpr);
17
18 // Assign or compound assign operation
19
1/2
✓ Branch 5 → 6 taken 6695 times.
✗ Branch 5 → 60 not taken.
 6695 if (node->op != AssignExprNode::AssignOp::OP_NONE) {
20 6695 const ExprNode *lhsNode = node->lhs;
21 6695 const ExprNode *rhsNode = node->rhs;
22
23 // Normal assignment
24
2/2
✓ Branch 6 → 7 taken 5863 times.
✓ Branch 6 → 11 taken 832 times.
 6695 if (node->op == AssignExprNode::AssignOp::OP_ASSIGN)
25
2/4
✓ Branch 7 → 8 taken 5863 times.
✗ Branch 7 → 69 not taken.
✓ Branch 8 → 9 taken 5863 times.
✗ Branch 8 → 69 not taken.
 5863 return doAssignment(lhsNode, rhsNode, node);
26
27 // Compound assignment
28 // Get symbol types of left and right side
29
1/2
✓ Branch 11 → 12 taken 832 times.
✗ Branch 11 → 85 not taken.
 832 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
30
1/2
✓ Branch 12 → 13 taken 832 times.
✗ Branch 12 → 85 not taken.
 832 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
31
32 // Retrieve rhs
33
2/4
✓ Branch 13 → 14 taken 832 times.
✗ Branch 13 → 72 not taken.
✓ Branch 14 → 15 taken 832 times.
✗ Branch 14 → 70 not taken.
 832 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
34 // Retrieve lhs
35
2/4
✓ Branch 16 → 17 taken 832 times.
✗ Branch 16 → 75 not taken.
✓ Branch 17 → 18 taken 832 times.
✗ Branch 17 → 73 not taken.
 832 auto lhs = std::any_cast<LLVMExprResult>(visit(lhsNode));
36
37 832 LLVMExprResult result;
38
10/11
✓ Branch 19 → 20 taken 276 times.
✓ Branch 19 → 22 taken 48 times.
✓ Branch 19 → 24 taken 50 times.
✓ Branch 19 → 26 taken 54 times.
✓ Branch 19 → 28 taken 16 times.
✓ Branch 19 → 30 taken 11 times.
✓ Branch 19 → 32 taken 12 times.
✓ Branch 19 → 34 taken 11 times.
✓ Branch 19 → 36 taken 11 times.
✓ Branch 19 → 38 taken 343 times.
✗ Branch 19 → 40 not taken.
 832 switch (node->op) {
39 276 case AssignExprNode::AssignOp::OP_PLUS_EQUAL:
40
1/2
✓ Branch 20 → 21 taken 276 times.
✗ Branch 20 → 85 not taken.
 276 result = conversionManager.getPlusEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
41 276 break;
42 48 case AssignExprNode::AssignOp::OP_MINUS_EQUAL:
43
1/2
✓ Branch 22 → 23 taken 48 times.
✗ Branch 22 → 85 not taken.
 48 result = conversionManager.getMinusEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
44 48 break;
45 50 case AssignExprNode::AssignOp::OP_MUL_EQUAL:
46
1/2
✓ Branch 24 → 25 taken 50 times.
✗ Branch 24 → 85 not taken.
 50 result = conversionManager.getMulEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
47 50 break;
48 54 case AssignExprNode::AssignOp::OP_DIV_EQUAL:
49
1/2
✓ Branch 26 → 27 taken 54 times.
✗ Branch 26 → 85 not taken.
 54 result = conversionManager.getDivEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
50 54 break;
51 16 case AssignExprNode::AssignOp::OP_REM_EQUAL:
52
1/2
✓ Branch 28 → 29 taken 16 times.
✗ Branch 28 → 85 not taken.
 16 result = conversionManager.getRemEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
53 16 break;
54 11 case AssignExprNode::AssignOp::OP_SHL_EQUAL:
55
1/2
✓ Branch 30 → 31 taken 11 times.
✗ Branch 30 → 85 not taken.
 11 result = conversionManager.getSHLEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
56 11 break;
57 12 case AssignExprNode::AssignOp::OP_SHR_EQUAL:
58
1/2
✓ Branch 32 → 33 taken 12 times.
✗ Branch 32 → 85 not taken.
 12 result = conversionManager.getSHREqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
59 12 break;
60 11 case AssignExprNode::AssignOp::OP_AND_EQUAL:
61
1/2
✓ Branch 34 → 35 taken 11 times.
✗ Branch 34 → 85 not taken.
 11 result = conversionManager.getAndEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
62 11 break;
63 11 case AssignExprNode::AssignOp::OP_OR_EQUAL:
64
1/2
✓ Branch 36 → 37 taken 11 times.
✗ Branch 36 → 85 not taken.
 11 result = conversionManager.getOrEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
65 11 break;
66 343 case AssignExprNode::AssignOp::OP_XOR_EQUAL:
67
1/2
✓ Branch 38 → 39 taken 343 times.
✗ Branch 38 → 85 not taken.
 343 result = conversionManager.getXorEqualInst(node, lhs, lhsSTy, rhs, rhsSTy);
68 343 break;
69 − default: // GCOV_EXCL_LINE
70 − throw CompilerError(UNHANDLED_BRANCH, "Assign op fall-through"); // GCOV_EXCL_LINE
71 }
72
73
1/2
✗ Branch 48 → 49 not taken.
✓ Branch 48 → 51 taken 832 times.
 832 if (result.ptr) { // The operation allocated more memory
74 ✗ if (lhs.entry)
75 ✗ lhs.entry->updateAddress(result.ptr);
76
2/2
✓ Branch 51 → 52 taken 684 times.
✓ Branch 51 → 57 taken 148 times.
 832 } else if (result.value) { // The operation only updated the value
77 // Store the result
78 684 lhs.value = result.value;
79
5/6
✓ Branch 52 → 53 taken 409 times.
✓ Branch 52 → 55 taken 275 times.
✓ Branch 53 → 54 taken 1 time.
✓ Branch 53 → 55 taken 408 times.
✓ Branch 56 → 57 taken 684 times.
✗ Branch 56 → 85 not taken.
 684 insertStore(lhs.value, lhs.ptr, lhs.entry && lhs.entry->isVolatile);
80 }
81
1/2
✓ Branch 57 → 58 taken 832 times.
✗ Branch 57 → 85 not taken.
 832 return lhs;
82 }
83
84 // This is a fallthrough case -> throw an error
85 − throw CompilerError(UNHANDLED_BRANCH, "AssignStmt fall-through"); // GCOV_EXCL_LINE
86 }
87
88 514 std::any IRGenerator::visitTernaryExpr(const TernaryExprNode *node) {
89 514 diGenerator.setSourceLocation(node);
90
91 // Check if only one operand is present -> loop through
92
1/2
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 5 taken 514 times.
 514 if (!node->falseExpr)
93 ✗ return visit(node->condition);
94
95 // It is a ternary
96 // Retrieve the condition value
97 514 llvm::Value *condValue = resolveValue(node->condition);
98
2/2
✓ Branch 6 → 7 taken 1 time.
✓ Branch 6 → 8 taken 513 times.
 514 const ExprNode *trueNode = node->isShortened ? node->condition : node->trueExpr;
99 514 const ExprNode *falseNode = node->falseExpr;
100
101 514 llvm::Value *resultValue = nullptr;
102 514 llvm::Value *resultPtr = nullptr;
103 514 SymbolTableEntry *anonymousSymbol = nullptr;
104
6/6
✓ Branch 10 → 11 taken 137 times.
✓ Branch 10 → 14 taken 377 times.
✓ Branch 12 → 13 taken 136 times.
✓ Branch 12 → 14 taken 1 time.
✓ Branch 15 → 16 taken 136 times.
✓ Branch 15 → 21 taken 378 times.
 514 if (trueNode->hasCompileTimeValue(manIdx) && falseNode->hasCompileTimeValue(manIdx)) {
105 // If both are constants, we can simply emit a selection instruction
106 136 llvm::Value *trueValue = resolveValue(trueNode);
107 136 llvm::Value *falseValue = resolveValue(falseNode);
108
2/4
✓ Branch 18 → 19 taken 136 times.
✗ Branch 18 → 147 not taken.
✓ Branch 19 → 20 taken 136 times.
✗ Branch 19 → 147 not taken.
 136 resultValue = builder.CreateSelect(condValue, trueValue, falseValue);
109 } else {
110 // We have at least one non-constant value, use branching to not perform both sides
111
1/2
✓ Branch 21 → 22 taken 378 times.
✗ Branch 21 → 206 not taken.
 378 const std::string codeLoc = node->codeLoc.toPrettyLineAndColumn();
112
2/4
✓ Branch 22 → 23 taken 378 times.
✗ Branch 22 → 150 not taken.
✓ Branch 23 → 24 taken 378 times.
✗ Branch 23 → 148 not taken.
 378 llvm::BasicBlock *condTrue = createBlock("cond.true." + codeLoc);
113
2/4
✓ Branch 25 → 26 taken 378 times.
✗ Branch 25 → 153 not taken.
✓ Branch 26 → 27 taken 378 times.
✗ Branch 26 → 151 not taken.
 378 llvm::BasicBlock *condFalse = createBlock("cond.false." + codeLoc);
114
2/4
✓ Branch 28 → 29 taken 378 times.
✗ Branch 28 → 156 not taken.
✓ Branch 29 → 30 taken 378 times.
✗ Branch 29 → 154 not taken.
 378 llvm::BasicBlock *condExit = createBlock("cond.exit." + codeLoc);
115
116 // Jump from original block to true or false block, depending on condition
117
1/2
✓ Branch 31 → 32 taken 378 times.
✗ Branch 31 → 204 not taken.
 378 insertCondJump(condValue, condTrue, condFalse);
118
119 // Fill true block
120
1/2
✓ Branch 32 → 33 taken 378 times.
✗ Branch 32 → 204 not taken.
 378 switchToBlock(condTrue);
121
1/2
✓ Branch 33 → 34 taken 378 times.
✗ Branch 33 → 204 not taken.
 378 const QualType &resultType = node->getEvaluatedSymbolType(manIdx);
122 378 llvm::Value *trueValue = nullptr;
123 378 llvm::Value *truePtr = nullptr;
124
7/8
✓ Branch 34 → 35 taken 370 times.
✓ Branch 34 → 37 taken 8 times.
✓ Branch 35 → 36 taken 370 times.
✗ Branch 35 → 204 not taken.
✓ Branch 36 → 37 taken 9 times.
✓ Branch 36 → 38 taken 361 times.
✓ Branch 39 → 40 taken 17 times.
✓ Branch 39 → 42 taken 361 times.
 378 if (node->falseSideCallsCopyCtor || resultType.isRef()) { // both sides or only the false side needs copy ctor call
125
1/2
✓ Branch 40 → 41 taken 17 times.
✗ Branch 40 → 204 not taken.
 17 truePtr = resolveAddress(trueNode);
126
2/2
✓ Branch 42 → 43 taken 2 times.
✓ Branch 42 → 58 taken 359 times.
 361 } else if (node->trueSideCallsCopyCtor) { // only true side needs copy ctor call
127
1/2
✓ Branch 43 → 44 taken 2 times.
✗ Branch 43 → 204 not taken.
 2 llvm::Value *originalPtr = resolveAddress(trueNode);
128
3/6
✓ Branch 46 → 47 taken 2 times.
✗ Branch 46 → 159 not taken.
✓ Branch 47 → 48 taken 2 times.
✗ Branch 47 → 157 not taken.
✓ Branch 48 → 49 taken 2 times.
✗ Branch 48 → 157 not taken.
 2 truePtr = insertAlloca(trueNode->getEvaluatedSymbolType(manIdx));
129
2/4
✓ Branch 53 → 54 taken 2 times.
✗ Branch 53 → 165 not taken.
✓ Branch 54 → 55 taken 2 times.
✗ Branch 54 → 163 not taken.
 6 generateCtorOrDtorCall(truePtr, node->calledCopyCtor, {originalPtr});
130 } else { // neither true nor false side need copy ctor call
131
1/2
✓ Branch 58 → 59 taken 359 times.
✗ Branch 58 → 204 not taken.
 359 trueValue = resolveValue(trueNode);
132 }
133 // Set the true block to the current insert point, since it could have changed in the meantime
134 378 condTrue = builder.GetInsertBlock();
135
1/2
✓ Branch 61 → 62 taken 378 times.
✗ Branch 61 → 204 not taken.
 378 insertJump(condExit);
136
137 // Fill false block
138
1/2
✓ Branch 62 → 63 taken 378 times.
✗ Branch 62 → 204 not taken.
 378 switchToBlock(condFalse);
139 378 llvm::Value *falseValue = nullptr;
140 378 llvm::Value *falsePtr = nullptr;
141
7/8
✓ Branch 63 → 64 taken 370 times.
✓ Branch 63 → 66 taken 8 times.
✓ Branch 64 → 65 taken 370 times.
✗ Branch 64 → 204 not taken.
✓ Branch 65 → 66 taken 9 times.
✓ Branch 65 → 67 taken 361 times.
✓ Branch 68 → 69 taken 17 times.
✓ Branch 68 → 71 taken 361 times.
 378 if (node->trueSideCallsCopyCtor || resultType.isRef()) { // both sides or only the true side needs copy ctor call
142
1/2
✓ Branch 69 → 70 taken 17 times.
✗ Branch 69 → 204 not taken.
 17 falsePtr = resolveAddress(falseNode);
143
2/2
✓ Branch 71 → 72 taken 2 times.
✓ Branch 71 → 87 taken 359 times.
 361 } else if (node->falseSideCallsCopyCtor) { // only false side needs copy ctor call
144
1/2
✓ Branch 72 → 73 taken 2 times.
✗ Branch 72 → 204 not taken.
 2 llvm::Value *originalPtr = resolveAddress(falseNode);
145
3/6
✓ Branch 75 → 76 taken 2 times.
✗ Branch 75 → 172 not taken.
✓ Branch 76 → 77 taken 2 times.
✗ Branch 76 → 170 not taken.
✓ Branch 77 → 78 taken 2 times.
✗ Branch 77 → 170 not taken.
 2 falsePtr = insertAlloca(falseNode->getEvaluatedSymbolType(manIdx));
146
2/4
✓ Branch 82 → 83 taken 2 times.
✗ Branch 82 → 178 not taken.
✓ Branch 83 → 84 taken 2 times.
✗ Branch 83 → 176 not taken.
 6 generateCtorOrDtorCall(falsePtr, node->calledCopyCtor, {originalPtr});
147 } else { // neither true nor false side need copy ctor call
148
1/2
✓ Branch 87 → 88 taken 359 times.
✗ Branch 87 → 204 not taken.
 359 falseValue = resolveValue(falseNode);
149 }
150 // Set the true block to the current insert point, since it could have changed in the meantime
151 378 condFalse = builder.GetInsertBlock();
152
1/2
✓ Branch 90 → 91 taken 378 times.
✗ Branch 90 → 204 not taken.
 378 insertJump(condExit);
153
154 // Fill the exit block
155
1/2
✓ Branch 91 → 92 taken 378 times.
✗ Branch 91 → 204 not taken.
 378 switchToBlock(condExit);
156
9/10
✓ Branch 92 → 93 taken 370 times.
✓ Branch 92 → 96 taken 8 times.
✓ Branch 93 → 94 taken 368 times.
✓ Branch 93 → 96 taken 2 times.
✓ Branch 94 → 95 taken 368 times.
✗ Branch 94 → 204 not taken.
✓ Branch 95 → 96 taken 9 times.
✓ Branch 95 → 97 taken 359 times.
✓ Branch 98 → 99 taken 19 times.
✓ Branch 98 → 121 taken 359 times.
 378 if (node->trueSideCallsCopyCtor || node->falseSideCallsCopyCtor || resultType.isRef()) { // one side calls copy ctor
157
3/6
✓ Branch 99 → 100 taken 19 times.
✗ Branch 99 → 183 not taken.
✓ Branch 100 → 101 taken 19 times.
✗ Branch 100 → 183 not taken.
✓ Branch 101 → 102 taken 19 times.
✗ Branch 101 → 183 not taken.
 19 llvm::PHINode *phiInst = builder.CreatePHI(builder.getPtrTy(), 2, "cond.result");
158
1/2
✓ Branch 102 → 103 taken 19 times.
✗ Branch 102 → 204 not taken.
 19 phiInst->addIncoming(truePtr, condTrue);
159
1/2
✓ Branch 103 → 104 taken 19 times.
✗ Branch 103 → 204 not taken.
 19 phiInst->addIncoming(falsePtr, condFalse);
160
4/4
✓ Branch 104 → 105 taken 8 times.
✓ Branch 104 → 119 taken 11 times.
✓ Branch 105 → 106 taken 6 times.
✓ Branch 105 → 119 taken 2 times.
 19 if (node->trueSideCallsCopyCtor && node->falseSideCallsCopyCtor) { // both sides need copy ctor call
161
2/4
✓ Branch 108 → 109 taken 6 times.
✗ Branch 108 → 186 not taken.
✓ Branch 109 → 110 taken 6 times.
✗ Branch 109 → 184 not taken.
 6 resultPtr = insertAlloca(resultType);
162
2/4
✓ Branch 114 → 115 taken 6 times.
✗ Branch 114 → 192 not taken.
✓ Branch 115 → 116 taken 6 times.
✗ Branch 115 → 190 not taken.
 18 generateCtorOrDtorCall(resultPtr, node->calledCopyCtor, {phiInst});
163 } else {
164 13 resultPtr = phiInst;
165 }
166 } else { // neither true nor false side calls copy ctor
167
1/2
✗ Branch 121 → 122 not taken.
✓ Branch 121 → 123 taken 359 times.
 359 assert(trueValue != nullptr);
168
3/6
✓ Branch 123 → 124 taken 359 times.
✗ Branch 123 → 197 not taken.
✓ Branch 124 → 125 taken 359 times.
✗ Branch 124 → 197 not taken.
✓ Branch 125 → 126 taken 359 times.
✗ Branch 125 → 197 not taken.
 359 llvm::PHINode *phiInst = builder.CreatePHI(resultType.toLLVMType(sourceFile), 2, "cond.result");
169
1/2
✓ Branch 126 → 127 taken 359 times.
✗ Branch 126 → 204 not taken.
 359 phiInst->addIncoming(trueValue, condTrue);
170
1/2
✓ Branch 127 → 128 taken 359 times.
✗ Branch 127 → 204 not taken.
 359 phiInst->addIncoming(falseValue, condFalse);
171 359 resultValue = phiInst;
172 }
173
174 // If we have an anonymous symbol for this ternary expr, make sure that it has an address to reference.
175
1/2
✓ Branch 129 → 130 taken 378 times.
✗ Branch 129 → 204 not taken.
 378 anonymousSymbol = currentScope->symbolTable.lookupAnonymous(node);
176
2/2
✓ Branch 130 → 131 taken 6 times.
✓ Branch 130 → 141 taken 372 times.
 378 if (anonymousSymbol != nullptr) {
177
1/2
✗ Branch 131 → 132 not taken.
✓ Branch 131 → 140 taken 6 times.
 6 if (!resultPtr) {
178 ✗ resultPtr = insertAlloca(anonymousSymbol->getQualType());
179 ✗ insertStore(resultValue, resultPtr);
180 }
181
1/2
✓ Branch 140 → 141 taken 6 times.
✗ Branch 140 → 204 not taken.
 6 anonymousSymbol->updateAddress(resultPtr);
182 }
183 378 }
184
185
1/2
✓ Branch 143 → 144 taken 514 times.
✗ Branch 143 → 207 not taken.
 1028 return LLVMExprResult{.value = resultValue, .ptr = resultPtr, .entry = anonymousSymbol};
186 }
187
188 988 std::any IRGenerator::visitLogicalOrExpr(const LogicalOrExprNode *node) {
189
1/2
✓ Branch 2 → 3 taken 988 times.
✗ Branch 2 → 96 not taken.
 988 diGenerator.setSourceLocation(node);
190
191 // Check if only one operand is present -> loop through
192
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 988 times.
 988 if (node->operands.size() == 1)
193 ✗ return visit(node->operands.front());
194
195 // It is a logical or expression
196 // Create exit block for short-circuiting
197
1/2
✓ Branch 8 → 9 taken 988 times.
✗ Branch 8 → 96 not taken.
 988 const std::string codeLoc = node->codeLoc.toPrettyLineAndColumn();
198
2/4
✓ Branch 9 → 10 taken 988 times.
✗ Branch 9 → 73 not taken.
✓ Branch 10 → 11 taken 988 times.
✗ Branch 10 → 71 not taken.
 988 llvm::BasicBlock *bExit = createBlock("lor.exit." + codeLoc);
199
200 // Visit the first operand
201
1/2
✓ Branch 13 → 14 taken 988 times.
✗ Branch 13 → 94 not taken.
 988 llvm::Value *firstOperandValue = resolveValue(node->operands.front());
202
203 // Prepare an array for value-to-block-mapping
204 988 std::vector<std::pair<llvm::BasicBlock *, llvm::Value *>> shortCircuitBlocks;
205
1/2
✓ Branch 15 → 16 taken 988 times.
✗ Branch 15 → 92 not taken.
 988 shortCircuitBlocks.reserve(node->operands.size());
206 // The first element is the first operand value with the original block
207
1/2
✓ Branch 17 → 18 taken 988 times.
✗ Branch 17 → 74 not taken.
 988 shortCircuitBlocks.emplace_back(builder.GetInsertBlock(), firstOperandValue);
208 // Create a block for each additional operand and save it to the mapping
209
2/2
✓ Branch 31 → 19 taken 1270 times.
✓ Branch 31 → 32 taken 988 times.
 2258 for (size_t i = 1; i < node->operands.size(); i++)
210
6/12
✓ Branch 19 → 20 taken 1270 times.
✗ Branch 19 → 83 not taken.
✓ Branch 20 → 21 taken 1270 times.
✗ Branch 20 → 81 not taken.
✓ Branch 21 → 22 taken 1270 times.
✗ Branch 21 → 79 not taken.
✓ Branch 22 → 23 taken 1270 times.
✗ Branch 22 → 77 not taken.
✓ Branch 23 → 24 taken 1270 times.
✗ Branch 23 → 75 not taken.
✓ Branch 24 → 25 taken 1270 times.
✗ Branch 24 → 75 not taken.
 1270 shortCircuitBlocks.emplace_back(createBlock("lor." + std::to_string(i) + "." + codeLoc), nullptr);
211 // Create conditional jump to the exit block if the first operand was true, otherwise to the next block
212
2/4
✓ Branch 32 → 33 taken 988 times.
✗ Branch 32 → 92 not taken.
✓ Branch 33 → 34 taken 988 times.
✗ Branch 33 → 92 not taken.
 988 insertCondJump(firstOperandValue, bExit, shortCircuitBlocks.at(1).first);
213
214 // Create block for each operand
215
2/2
✓ Branch 50 → 35 taken 1270 times.
✓ Branch 50 → 51 taken 988 times.
 2258 for (size_t i = 1; i < node->operands.size(); i++) {
216 // Switch to the next block
217
2/4
✓ Branch 35 → 36 taken 1270 times.
✗ Branch 35 → 92 not taken.
✓ Branch 36 → 37 taken 1270 times.
✗ Branch 36 → 92 not taken.
 1270 switchToBlock(shortCircuitBlocks.at(i).first);
218 // Evaluate operand and save the result in the mapping
219
2/4
✓ Branch 38 → 39 taken 1270 times.
✗ Branch 38 → 92 not taken.
✓ Branch 39 → 40 taken 1270 times.
✗ Branch 39 → 92 not taken.
 1270 shortCircuitBlocks.at(i).second = resolveValue(node->operands[i]);
220 // Replace the array entry with the current insert block, since the insert block could have changed in the meantime
221
1/2
✓ Branch 41 → 42 taken 1270 times.
✗ Branch 41 → 92 not taken.
 1270 shortCircuitBlocks.at(i).first = builder.GetInsertBlock();
222 // Check if there are more blocks to process
223
2/2
✓ Branch 43 → 44 taken 988 times.
✓ Branch 43 → 45 taken 282 times.
 1270 if (i == node->operands.size() - 1) {
224 // Insert a simple jump to the exit block for the last block
225
1/2
✓ Branch 44 → 48 taken 988 times.
✗ Branch 44 → 92 not taken.
 988 insertJump(bExit);
226 } else {
227 // Create conditional jump to the exit block if the first operand was true, otherwise to the next block
228
3/6
✓ Branch 45 → 46 taken 282 times.
✗ Branch 45 → 92 not taken.
✓ Branch 46 → 47 taken 282 times.
✗ Branch 46 → 92 not taken.
✓ Branch 47 → 48 taken 282 times.
✗ Branch 47 → 92 not taken.
 282 insertCondJump(shortCircuitBlocks.at(i).second, bExit, shortCircuitBlocks.at(i + 1).first);
229 }
230 }
231
232 // Get the result with the phi node
233
1/2
✓ Branch 51 → 52 taken 988 times.
✗ Branch 51 → 92 not taken.
 988 switchToBlock(bExit);
234
2/4
✓ Branch 52 → 53 taken 988 times.
✗ Branch 52 → 89 not taken.
✓ Branch 55 → 56 taken 988 times.
✗ Branch 55 → 89 not taken.
 988 llvm::PHINode *result = builder.CreatePHI(firstOperandValue->getType(), node->operands.size(), "lor_phi");
235
2/2
✓ Branch 64 → 58 taken 2258 times.
✓ Branch 64 → 65 taken 988 times.
 3246 for (const auto &[incomingBlock, value] : shortCircuitBlocks)
236
1/2
✓ Branch 61 → 62 taken 2258 times.
✗ Branch 61 → 90 not taken.
 2258 result->addIncoming(value, incomingBlock);
237
238 // Return the result
239
1/2
✓ Branch 65 → 66 taken 988 times.
✗ Branch 65 → 91 not taken.
 988 return LLVMExprResult{.value = result};
240 988 }
241
242 188 std::any IRGenerator::visitLogicalAndExpr(const LogicalAndExprNode *node) {
243
1/2
✓ Branch 2 → 3 taken 188 times.
✗ Branch 2 → 96 not taken.
 188 diGenerator.setSourceLocation(node);
244
245 // Check if only one operand is present -> loop through
246
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 188 times.
 188 if (node->operands.size() == 1)
247 ✗ return visit(node->operands.front());
248
249 // It is a logical and expression
250 // Create exit block for short-circuiting
251
1/2
✓ Branch 8 → 9 taken 188 times.
✗ Branch 8 → 96 not taken.
 188 const std::string codeLoc = node->codeLoc.toPrettyLineAndColumn();
252
2/4
✓ Branch 9 → 10 taken 188 times.
✗ Branch 9 → 73 not taken.
✓ Branch 10 → 11 taken 188 times.
✗ Branch 10 → 71 not taken.
 188 llvm::BasicBlock *bExit = createBlock("land.exit." + codeLoc);
253
254 // Visit the first operand
255
1/2
✓ Branch 13 → 14 taken 188 times.
✗ Branch 13 → 94 not taken.
 188 llvm::Value *firstOperandValue = resolveValue(node->operands.front());
256
257 // Prepare an array for value-to-block-mapping
258 188 std::vector<std::pair<llvm::BasicBlock *, llvm::Value *>> shortCircuitBlocks;
259
1/2
✓ Branch 15 → 16 taken 188 times.
✗ Branch 15 → 92 not taken.
 188 shortCircuitBlocks.reserve(node->operands.size());
260 // The first element is the first operand value with the original block
261
1/2
✓ Branch 17 → 18 taken 188 times.
✗ Branch 17 → 74 not taken.
 188 shortCircuitBlocks.emplace_back(builder.GetInsertBlock(), firstOperandValue);
262 // Create a block for each additional operand and save it to the mapping
263
2/2
✓ Branch 31 → 19 taken 221 times.
✓ Branch 31 → 32 taken 188 times.
 409 for (size_t i = 1; i < node->operands.size(); i++)
264
6/12
✓ Branch 19 → 20 taken 221 times.
✗ Branch 19 → 83 not taken.
✓ Branch 20 → 21 taken 221 times.
✗ Branch 20 → 81 not taken.
✓ Branch 21 → 22 taken 221 times.
✗ Branch 21 → 79 not taken.
✓ Branch 22 → 23 taken 221 times.
✗ Branch 22 → 77 not taken.
✓ Branch 23 → 24 taken 221 times.
✗ Branch 23 → 75 not taken.
✓ Branch 24 → 25 taken 221 times.
✗ Branch 24 → 75 not taken.
 221 shortCircuitBlocks.emplace_back(createBlock("land." + std::to_string(i) + "." + codeLoc), nullptr);
265 // Create conditional jump to the exit block if the first operand was true, otherwise to the next block
266
2/4
✓ Branch 32 → 33 taken 188 times.
✗ Branch 32 → 92 not taken.
✓ Branch 33 → 34 taken 188 times.
✗ Branch 33 → 92 not taken.
 188 insertCondJump(firstOperandValue, shortCircuitBlocks.at(1).first, bExit);
267
268 // Create block for each operand
269
2/2
✓ Branch 50 → 35 taken 221 times.
✓ Branch 50 → 51 taken 188 times.
 409 for (size_t i = 1; i < node->operands.size(); i++) {
270 // Switch to the next block
271
2/4
✓ Branch 35 → 36 taken 221 times.
✗ Branch 35 → 92 not taken.
✓ Branch 36 → 37 taken 221 times.
✗ Branch 36 → 92 not taken.
 221 switchToBlock(shortCircuitBlocks.at(i).first);
272 // Evaluate operand and save the result in the mapping
273
2/4
✓ Branch 38 → 39 taken 221 times.
✗ Branch 38 → 92 not taken.
✓ Branch 39 → 40 taken 221 times.
✗ Branch 39 → 92 not taken.
 221 shortCircuitBlocks.at(i).second = resolveValue(node->operands[i]);
274 // Replace the array entry with the current insert block, since the insert block could have changed in the meantime
275
1/2
✓ Branch 41 → 42 taken 221 times.
✗ Branch 41 → 92 not taken.
 221 shortCircuitBlocks.at(i).first = builder.GetInsertBlock();
276 // Check if there are more blocks to process
277
2/2
✓ Branch 43 → 44 taken 188 times.
✓ Branch 43 → 45 taken 33 times.
 221 if (i == node->operands.size() - 1) {
278 // Insert a simple jump to the exit block for the last block
279
1/2
✓ Branch 44 → 48 taken 188 times.
✗ Branch 44 → 92 not taken.
 188 insertJump(bExit);
280 } else {
281 // Create conditional jump to the exit block if the operand was true, otherwise to the next block
282
3/6
✓ Branch 45 → 46 taken 33 times.
✗ Branch 45 → 92 not taken.
✓ Branch 46 → 47 taken 33 times.
✗ Branch 46 → 92 not taken.
✓ Branch 47 → 48 taken 33 times.
✗ Branch 47 → 92 not taken.
 33 insertCondJump(shortCircuitBlocks.at(i).second, shortCircuitBlocks.at(i + 1).first, bExit);
283 }
284 }
285
286 // Get the result with the phi node
287
1/2
✓ Branch 51 → 52 taken 188 times.
✗ Branch 51 → 92 not taken.
 188 switchToBlock(bExit);
288
2/4
✓ Branch 52 → 53 taken 188 times.
✗ Branch 52 → 89 not taken.
✓ Branch 55 → 56 taken 188 times.
✗ Branch 55 → 89 not taken.
 188 llvm::PHINode *result = builder.CreatePHI(firstOperandValue->getType(), node->operands.size(), "land_phi");
289
2/2
✓ Branch 64 → 58 taken 409 times.
✓ Branch 64 → 65 taken 188 times.
 597 for (const auto &[incomingBlock, value] : shortCircuitBlocks)
290
1/2
✓ Branch 61 → 62 taken 409 times.
✗ Branch 61 → 90 not taken.
 409 result->addIncoming(value, incomingBlock);
291
292 // Return the result
293
1/2
✓ Branch 65 → 66 taken 188 times.
✗ Branch 65 → 91 not taken.
 188 return LLVMExprResult{.value = result};
294 188 }
295
296 89 std::any IRGenerator::visitBitwiseOrExpr(const BitwiseOrExprNode *node) {
297
1/2
✓ Branch 2 → 3 taken 89 times.
✗ Branch 2 → 34 not taken.
 89 diGenerator.setSourceLocation(node);
298
299 // Check if only one operand is present -> loop through
300
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 89 times.
 89 if (node->operands.size() == 1)
301 ✗ return visit(node->operands.front());
302
303 // It is a bitwise or expression
304 // Evaluate first operand
305 89 const ExprNode *lhsNode = node->operands.front();
306
1/2
✓ Branch 9 → 10 taken 89 times.
✗ Branch 9 → 34 not taken.
 89 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
307
2/4
✓ Branch 10 → 11 taken 89 times.
✗ Branch 10 → 29 not taken.
✓ Branch 11 → 12 taken 89 times.
✗ Branch 11 → 27 not taken.
 89 auto result = std::any_cast<LLVMExprResult>(visit(lhsNode));
308
309 // Evaluate all additional operands
310
2/2
✓ Branch 22 → 14 taken 90 times.
✓ Branch 22 → 23 taken 89 times.
 179 for (size_t i = 1; i < node->operands.size(); i++) {
311 // Evaluate the operand
312 90 const ExprNode *rhsNode = node->operands[i];
313
1/2
✓ Branch 15 → 16 taken 90 times.
✗ Branch 15 → 33 not taken.
 90 const QualType rhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
314
2/4
✓ Branch 16 → 17 taken 90 times.
✗ Branch 16 → 32 not taken.
✓ Branch 17 → 18 taken 90 times.
✗ Branch 17 → 30 not taken.
 90 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
315
1/2
✓ Branch 19 → 20 taken 90 times.
✗ Branch 19 → 33 not taken.
 90 result = conversionManager.getBitwiseOrInst(node, result, lhsSTy, rhs, rhsSTy, i - 1);
316 }
317
318 // Return result
319
1/2
✓ Branch 23 → 24 taken 89 times.
✗ Branch 23 → 34 not taken.
 89 return result;
320 }
321
322 14 std::any IRGenerator::visitBitwiseXorExpr(const BitwiseXorExprNode *node) {
323
1/2
✓ Branch 2 → 3 taken 14 times.
✗ Branch 2 → 34 not taken.
 14 diGenerator.setSourceLocation(node);
324
325 // Check if only one operand is present -> loop through
326
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 14 times.
 14 if (node->operands.size() == 1)
327 ✗ return visit(node->operands.front());
328
329 // It is a bitwise xor expression
330 // Evaluate first operand
331 14 const ExprNode *lhsNode = node->operands.front();
332
1/2
✓ Branch 9 → 10 taken 14 times.
✗ Branch 9 → 34 not taken.
 14 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
333
2/4
✓ Branch 10 → 11 taken 14 times.
✗ Branch 10 → 29 not taken.
✓ Branch 11 → 12 taken 14 times.
✗ Branch 11 → 27 not taken.
 14 auto result = std::any_cast<LLVMExprResult>(visit(lhsNode));
334
335 // Evaluate all additional operands
336
2/2
✓ Branch 22 → 14 taken 15 times.
✓ Branch 22 → 23 taken 14 times.
 29 for (size_t i = 1; i < node->operands.size(); i++) {
337 // Evaluate the operand
338 15 const ExprNode *rhsNode = node->operands[i];
339
1/2
✓ Branch 15 → 16 taken 15 times.
✗ Branch 15 → 33 not taken.
 15 const QualType rhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
340
2/4
✓ Branch 16 → 17 taken 15 times.
✗ Branch 16 → 32 not taken.
✓ Branch 17 → 18 taken 15 times.
✗ Branch 17 → 30 not taken.
 15 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
341
1/2
✓ Branch 19 → 20 taken 15 times.
✗ Branch 19 → 33 not taken.
 15 result = conversionManager.getBitwiseXorInst(node, result, lhsSTy, rhs, rhsSTy);
342 }
343
344 // Return result
345
1/2
✓ Branch 23 → 24 taken 14 times.
✗ Branch 23 → 34 not taken.
 14 return result;
346 }
347
348 44 std::any IRGenerator::visitBitwiseAndExpr(const BitwiseAndExprNode *node) {
349
1/2
✓ Branch 2 → 3 taken 44 times.
✗ Branch 2 → 34 not taken.
 44 diGenerator.setSourceLocation(node);
350
351 // Check if only one operand is present -> loop through
352
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 44 times.
 44 if (node->operands.size() == 1)
353 ✗ return visit(node->operands.front());
354
355 // It is a bitwise and expression
356 // Evaluate first operand
357 44 const ExprNode *lhsNode = node->operands.front();
358
1/2
✓ Branch 9 → 10 taken 44 times.
✗ Branch 9 → 34 not taken.
 44 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
359
2/4
✓ Branch 10 → 11 taken 44 times.
✗ Branch 10 → 29 not taken.
✓ Branch 11 → 12 taken 44 times.
✗ Branch 11 → 27 not taken.
 44 auto result = std::any_cast<LLVMExprResult>(visit(lhsNode));
360
361 // Evaluate all additional operands
362
2/2
✓ Branch 22 → 14 taken 45 times.
✓ Branch 22 → 23 taken 44 times.
 89 for (size_t i = 1; i < node->operands.size(); i++) {
363 // Evaluate the operand
364 45 const ExprNode *rhsNode = node->operands[i];
365
1/2
✓ Branch 15 → 16 taken 45 times.
✗ Branch 15 → 33 not taken.
 45 const QualType rhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
366
2/4
✓ Branch 16 → 17 taken 45 times.
✗ Branch 16 → 32 not taken.
✓ Branch 17 → 18 taken 45 times.
✗ Branch 17 → 30 not taken.
 45 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
367
1/2
✓ Branch 19 → 20 taken 45 times.
✗ Branch 19 → 33 not taken.
 45 result = conversionManager.getBitwiseAndInst(rhsNode, result, lhsSTy, rhs, rhsSTy, i - 1);
368 }
369
370 // Return result
371
1/2
✓ Branch 23 → 24 taken 44 times.
✗ Branch 23 → 34 not taken.
 44 return result;
372 }
373
374 5891 std::any IRGenerator::visitEqualityExpr(const EqualityExprNode *node) {
375
1/2
✓ Branch 2 → 3 taken 5891 times.
✗ Branch 2 → 50 not taken.
 5891 diGenerator.setSourceLocation(node);
376
377 // Check if only one operand is present -> loop through
378
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 5891 times.
 5891 if (node->operands.size() == 1)
379 ✗ return visit(node->operands.front());
380
381 // It is an equality expression
382 // Evaluate lhs
383 5891 const ExprNode *lhsNode = node->operands[0];
384
1/2
✓ Branch 9 → 10 taken 5891 times.
✗ Branch 9 → 50 not taken.
 5891 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
385
2/4
✓ Branch 10 → 11 taken 5891 times.
✗ Branch 10 → 37 not taken.
✓ Branch 11 → 12 taken 5891 times.
✗ Branch 11 → 35 not taken.
 5891 auto result = std::any_cast<LLVMExprResult>(visit(lhsNode));
386
387 // Evaluate rhs
388 5891 const ExprNode *rhsNode = node->operands[1];
389
1/2
✓ Branch 14 → 15 taken 5891 times.
✗ Branch 14 → 50 not taken.
 5891 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
390
2/4
✓ Branch 15 → 16 taken 5891 times.
✗ Branch 15 → 40 not taken.
✓ Branch 16 → 17 taken 5891 times.
✗ Branch 16 → 38 not taken.
 5891 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
391
392 // Retrieve the result value, based on the exact operator
393
2/3
✓ Branch 18 → 19 taken 4304 times.
✓ Branch 18 → 21 taken 1587 times.
✗ Branch 18 → 23 not taken.
 5891 switch (node->op) {
394 4304 case EqualityExprNode::EqualityOp::OP_EQUAL:
395
1/2
✓ Branch 19 → 20 taken 4304 times.
✗ Branch 19 → 50 not taken.
 4304 result = conversionManager.getEqualInst(node, result, lhsSTy, rhs, rhsSTy);
396 4304 break;
397 1587 case EqualityExprNode::EqualityOp::OP_NOT_EQUAL:
398
1/2
✓ Branch 21 → 22 taken 1587 times.
✗ Branch 21 → 50 not taken.
 1587 result = conversionManager.getNotEqualInst(node, result, lhsSTy, rhs, rhsSTy);
399 1587 break;
400 − default: // GCOV_EXCL_LINE
401 − throw CompilerError(UNHANDLED_BRANCH, "EqualityExpr fall-through"); // GCOV_EXCL_LINE
402 }
403
404 // Return the result
405
1/2
✓ Branch 31 → 32 taken 5891 times.
✗ Branch 31 → 50 not taken.
 5891 return result;
406 }
407
408 3915 std::any IRGenerator::visitRelationalExpr(const RelationalExprNode *node) {
409
1/2
✓ Branch 2 → 3 taken 3915 times.
✗ Branch 2 → 54 not taken.
 3915 diGenerator.setSourceLocation(node);
410
411 // Check if only one operand is present -> loop through
412
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 3915 times.
 3915 if (node->operands.size() == 1)
413 ✗ return visit(node->operands.front());
414
415 // It is a relational expression
416 // Evaluate lhs
417 3915 const ExprNode *lhsNode = node->operands[0];
418
1/2
✓ Branch 9 → 10 taken 3915 times.
✗ Branch 9 → 54 not taken.
 3915 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
419
2/4
✓ Branch 10 → 11 taken 3915 times.
✗ Branch 10 → 41 not taken.
✓ Branch 11 → 12 taken 3915 times.
✗ Branch 11 → 39 not taken.
 3915 auto result = std::any_cast<LLVMExprResult>(visit(lhsNode));
420
421 // Evaluate rhs
422 3915 const ExprNode *rhsNode = node->operands[1];
423
1/2
✓ Branch 14 → 15 taken 3915 times.
✗ Branch 14 → 54 not taken.
 3915 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
424
2/4
✓ Branch 15 → 16 taken 3915 times.
✗ Branch 15 → 44 not taken.
✓ Branch 16 → 17 taken 3915 times.
✗ Branch 16 → 42 not taken.
 3915 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
425
426 // Retrieve the result value, based on the exact operator
427
4/5
✓ Branch 18 → 19 taken 1914 times.
✓ Branch 18 → 21 taken 547 times.
✓ Branch 18 → 23 taken 414 times.
✓ Branch 18 → 25 taken 1040 times.
✗ Branch 18 → 27 not taken.
 3915 switch (node->op) {
428 1914 case RelationalExprNode::RelationalOp::OP_LESS:
429
1/2
✓ Branch 19 → 20 taken 1914 times.
✗ Branch 19 → 54 not taken.
 1914 result = conversionManager.getLessInst(node, result, lhsSTy, rhs, rhsSTy);
430 1914 break;
431 547 case RelationalExprNode::RelationalOp::OP_GREATER:
432
1/2
✓ Branch 21 → 22 taken 547 times.
✗ Branch 21 → 54 not taken.
 547 result = conversionManager.getGreaterInst(node, result, lhsSTy, rhs, rhsSTy);
433 547 break;
434 414 case RelationalExprNode::RelationalOp::OP_LESS_EQUAL:
435
1/2
✓ Branch 23 → 24 taken 414 times.
✗ Branch 23 → 54 not taken.
 414 result = conversionManager.getLessEqualInst(node, result, lhsSTy, rhs, rhsSTy);
436 414 break;
437 1040 case RelationalExprNode::RelationalOp::OP_GREATER_EQUAL:
438
1/2
✓ Branch 25 → 26 taken 1040 times.
✗ Branch 25 → 54 not taken.
 1040 result = conversionManager.getGreaterEqualInst(node, result, lhsSTy, rhs, rhsSTy);
439 1040 break;
440 − default: // GCOV_EXCL_LINE
441 − throw CompilerError(UNHANDLED_BRANCH, "EqualityExpr fall-through"); // GCOV_EXCL_LINE
442 }
443
444 // Return the result
445
1/2
✓ Branch 35 → 36 taken 3915 times.
✗ Branch 35 → 54 not taken.
 3915 return result;
446 }
447
448 131 std::any IRGenerator::visitShiftExpr(const ShiftExprNode *node) {
449
1/2
✓ Branch 2 → 3 taken 131 times.
✗ Branch 2 → 64 not taken.
 131 diGenerator.setSourceLocation(node);
450
451 // Check if only one operand is present -> loop through
452
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 131 times.
 131 if (node->operands.size() == 1)
453 ✗ return visit(node->operands.front());
454
455 // It is a shift expression
456 // Evaluate first operand
457 131 const ExprNode *lhsNode = node->operands.front();
458
1/2
✓ Branch 9 → 10 taken 131 times.
✗ Branch 9 → 64 not taken.
 131 QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
459
2/4
✓ Branch 10 → 11 taken 131 times.
✗ Branch 10 → 48 not taken.
✓ Branch 11 → 12 taken 131 times.
✗ Branch 11 → 46 not taken.
 131 auto lhs = std::any_cast<LLVMExprResult>(visit(lhsNode));
460
461
1/2
✓ Branch 13 → 14 taken 131 times.
✗ Branch 13 → 64 not taken.
 131 auto opQueue = node->opQueue;
462 131 size_t operandIndex = 1;
463
2/2
✓ Branch 40 → 15 taken 171 times.
✓ Branch 40 → 41 taken 131 times.
 302 while (!opQueue.empty()) {
464 171 const size_t operatorIndex = operandIndex - 1;
465 // Evaluate next operand
466 171 const ExprNode *rhsNode = node->operands[operandIndex++];
467
1/2
✗ Branch 16 → 17 not taken.
✓ Branch 16 → 18 taken 171 times.
 171 assert(rhsNode != nullptr);
468
1/2
✓ Branch 18 → 19 taken 171 times.
✗ Branch 18 → 61 not taken.
 171 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
469
2/4
✓ Branch 19 → 20 taken 171 times.
✗ Branch 19 → 51 not taken.
✓ Branch 20 → 21 taken 171 times.
✗ Branch 20 → 49 not taken.
 171 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
470
471 // Retrieve the result, based on the exact operator
472
2/3
✓ Branch 23 → 24 taken 104 times.
✓ Branch 23 → 26 taken 67 times.
✗ Branch 23 → 28 not taken.
 171 switch (opQueue.front().first) {
473 104 case ShiftExprNode::ShiftOp::OP_SHIFT_LEFT:
474
1/2
✓ Branch 24 → 25 taken 104 times.
✗ Branch 24 → 61 not taken.
 104 lhs = conversionManager.getShiftLeftInst(node, lhs, lhsSTy, rhs, rhsSTy, operatorIndex);
475 104 break;
476 67 case ShiftExprNode::ShiftOp::OP_SHIFT_RIGHT:
477
1/2
✓ Branch 26 → 27 taken 67 times.
✗ Branch 26 → 61 not taken.
 67 lhs = conversionManager.getShiftRightInst(node, lhs, lhsSTy, rhs, rhsSTy, operatorIndex);
478 67 break;
479 − default: // GCOV_EXCL_LINE
480 − throw CompilerError(UNHANDLED_BRANCH, "AdditiveExpr fall-through"); // GCOV_EXCL_LINE
481 }
482
483 // Retrieve the new lhs symbol type
484 171 lhsSTy = opQueue.front().second;
485
486 171 opQueue.pop();
487 }
488
489 // Return the result
490
1/2
✓ Branch 41 → 42 taken 131 times.
✗ Branch 41 → 62 not taken.
 131 return lhs;
491 131 }
492
493 4335 std::any IRGenerator::visitAdditiveExpr(const AdditiveExprNode *node) {
494
1/2
✓ Branch 2 → 3 taken 4335 times.
✗ Branch 2 → 64 not taken.
 4335 diGenerator.setSourceLocation(node);
495
496 // Check if only one operand is present -> loop through
497
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 4335 times.
 4335 if (node->operands.size() == 1)
498 ✗ return visit(node->operands.front());
499
500 // It is an additive expression
501 // Evaluate first operand
502 4335 const ExprNode *lhsNode = node->operands[0];
503
1/2
✓ Branch 9 → 10 taken 4335 times.
✗ Branch 9 → 64 not taken.
 4335 QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
504
2/4
✓ Branch 10 → 11 taken 4335 times.
✗ Branch 10 → 48 not taken.
✓ Branch 11 → 12 taken 4335 times.
✗ Branch 11 → 46 not taken.
 4335 auto lhs = std::any_cast<LLVMExprResult>(visit(lhsNode));
505
506
1/2
✓ Branch 13 → 14 taken 4335 times.
✗ Branch 13 → 64 not taken.
 4335 auto opQueue = node->opQueue;
507 4335 size_t operandIndex = 1;
508
2/2
✓ Branch 40 → 15 taken 4934 times.
✓ Branch 40 → 41 taken 4335 times.
 9269 while (!opQueue.empty()) {
509 4934 const size_t operatorIndex = operandIndex - 1;
510 // Evaluate next operand
511 4934 const ExprNode *rhsNode = node->operands[operandIndex++];
512
1/2
✗ Branch 16 → 17 not taken.
✓ Branch 16 → 18 taken 4934 times.
 4934 assert(rhsNode != nullptr);
513
1/2
✓ Branch 18 → 19 taken 4934 times.
✗ Branch 18 → 61 not taken.
 4934 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
514
2/4
✓ Branch 19 → 20 taken 4934 times.
✗ Branch 19 → 51 not taken.
✓ Branch 20 → 21 taken 4934 times.
✗ Branch 20 → 49 not taken.
 4934 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
515
516 // Retrieve the result, based on the exact operator
517
2/3
✓ Branch 23 → 24 taken 3013 times.
✓ Branch 23 → 26 taken 1921 times.
✗ Branch 23 → 28 not taken.
 4934 switch (opQueue.front().first) {
518 3013 case AdditiveExprNode::AdditiveOp::OP_PLUS:
519
1/2
✓ Branch 24 → 25 taken 3013 times.
✗ Branch 24 → 61 not taken.
 3013 lhs = conversionManager.getPlusInst(node, lhs, lhsSTy, rhs, rhsSTy, operatorIndex);
520 3013 break;
521 1921 case AdditiveExprNode::AdditiveOp::OP_MINUS:
522
1/2
✓ Branch 26 → 27 taken 1921 times.
✗ Branch 26 → 61 not taken.
 1921 lhs = conversionManager.getMinusInst(node, lhs, lhsSTy, rhs, rhsSTy, operatorIndex);
523 1921 break;
524 − default: // GCOV_EXCL_LINE
525 − throw CompilerError(UNHANDLED_BRANCH, "AdditiveExpr fall-through"); // GCOV_EXCL_LINE
526 }
527
528 // Retrieve the new lhs symbol type
529 4934 lhsSTy = opQueue.front().second;
530
531 4934 opQueue.pop();
532 }
533
534 // Return the result
535
1/2
✓ Branch 41 → 42 taken 4335 times.
✗ Branch 41 → 62 not taken.
 4335 return lhs;
536 4335 }
537
538 947 std::any IRGenerator::visitMultiplicativeExpr(const MultiplicativeExprNode *node) {
539
1/2
✓ Branch 2 → 3 taken 947 times.
✗ Branch 2 → 66 not taken.
 947 diGenerator.setSourceLocation(node);
540
541 // Check if only one operand is present -> loop through
542
1/2
✗ Branch 4 → 5 not taken.
✓ Branch 4 → 8 taken 947 times.
 947 if (node->operands.size() == 1)
543 ✗ return visit(node->operands.front());
544
545 // It is an additive expression
546 // Evaluate first operand
547 947 const ExprNode *lhsNode = node->operands[0];
548
1/2
✓ Branch 9 → 10 taken 947 times.
✗ Branch 9 → 66 not taken.
 947 QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
549
2/4
✓ Branch 10 → 11 taken 947 times.
✗ Branch 10 → 50 not taken.
✓ Branch 11 → 12 taken 947 times.
✗ Branch 11 → 48 not taken.
 947 auto result = std::any_cast<LLVMExprResult>(visit(lhsNode));
550
551
1/2
✓ Branch 13 → 14 taken 947 times.
✗ Branch 13 → 66 not taken.
 947 auto opQueue = node->opQueue;
552 947 size_t operandIndex = 1;
553
2/2
✓ Branch 42 → 15 taken 967 times.
✓ Branch 42 → 43 taken 947 times.
 1914 while (!opQueue.empty()) {
554 967 const size_t operatorIndex = operandIndex - 1;
555 // Evaluate next operand
556 967 const ExprNode *rhsNode = node->operands[operandIndex++];
557
1/2
✗ Branch 16 → 17 not taken.
✓ Branch 16 → 18 taken 967 times.
 967 assert(rhsNode != nullptr);
558
1/2
✓ Branch 18 → 19 taken 967 times.
✗ Branch 18 → 63 not taken.
 967 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
559
2/4
✓ Branch 19 → 20 taken 967 times.
✗ Branch 19 → 53 not taken.
✓ Branch 20 → 21 taken 967 times.
✗ Branch 20 → 51 not taken.
 967 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
560
561 // Retrieve the result, based on the exact operator
562
3/4
✓ Branch 23 → 24 taken 784 times.
✓ Branch 23 → 26 taken 158 times.
✓ Branch 23 → 28 taken 25 times.
✗ Branch 23 → 30 not taken.
 967 switch (opQueue.front().first) {
563 784 case MultiplicativeExprNode::MultiplicativeOp::OP_MUL:
564
1/2
✓ Branch 24 → 25 taken 784 times.
✗ Branch 24 → 63 not taken.
 784 result = conversionManager.getMulInst(node, result, lhsSTy, rhs, rhsSTy, operatorIndex);
565 784 break;
566 158 case MultiplicativeExprNode::MultiplicativeOp::OP_DIV:
567
1/2
✓ Branch 26 → 27 taken 158 times.
✗ Branch 26 → 63 not taken.
 158 result = conversionManager.getDivInst(node, result, lhsSTy, rhs, rhsSTy, operatorIndex);
568 158 break;
569 25 case MultiplicativeExprNode::MultiplicativeOp::OP_REM:
570
1/2
✓ Branch 28 → 29 taken 25 times.
✗ Branch 28 → 63 not taken.
 25 result = conversionManager.getRemInst(node, result, lhsSTy, rhs, rhsSTy);
571 25 break;
572 − default: // GCOV_EXCL_LINE
573 − throw CompilerError(UNHANDLED_BRANCH, "MultiplicativeExpr fall-through"); // GCOV_EXCL_LINE
574 }
575
576 // Retrieve the new lhs symbol type
577 967 lhsSTy = opQueue.front().second;
578 967 opQueue.pop();
579 }
580
581 // Return the result
582
1/2
✓ Branch 43 → 44 taken 947 times.
✗ Branch 43 → 64 not taken.
 947 return result;
583 947 }
584
585 2717 std::any IRGenerator::visitCastExpr(const CastExprNode *node) {
586
1/2
✓ Branch 2 → 3 taken 2717 times.
✗ Branch 2 → 19 not taken.
 2717 diGenerator.setSourceLocation(node);
587
588 // Check if only one operand is present -> loop through
589
1/2
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 6 taken 2717 times.
 2717 if (!node->isCast)
590 ✗ return visit(node->prefixUnaryExpr);
591
592 // It is a cast expression
593 // Retrieve target symbol type
594
1/2
✓ Branch 6 → 7 taken 2717 times.
✗ Branch 6 → 19 not taken.
 2717 const QualType targetSTy = node->getEvaluatedSymbolType(manIdx);
595
596 // Evaluate rhs
597 2717 const ExprNode *rhsNode = node->assignExpr;
598
1/2
✓ Branch 7 → 8 taken 2717 times.
✗ Branch 7 → 19 not taken.
 2717 const QualType rhsSTy = rhsNode->getEvaluatedSymbolType(manIdx);
599
2/4
✓ Branch 8 → 9 taken 2717 times.
✗ Branch 8 → 18 not taken.
✓ Branch 9 → 10 taken 2717 times.
✗ Branch 9 → 16 not taken.
 2717 auto rhs = std::any_cast<LLVMExprResult>(visit(rhsNode));
600
601 // Retrieve the result value
602
1/2
✓ Branch 11 → 12 taken 2717 times.
✗ Branch 11 → 19 not taken.
 2717 const LLVMExprResult result = conversionManager.getCastInst(node, targetSTy, rhs, rhsSTy);
603
604 // Return the result
605
1/2
✓ Branch 12 → 13 taken 2717 times.
✗ Branch 12 → 19 not taken.
 2717 return result;
606 }
607
608 2090 std::any IRGenerator::visitPrefixUnaryExpr(const PrefixUnaryExprNode *node) {
609
1/2
✓ Branch 2 → 3 taken 2090 times.
✗ Branch 2 → 117 not taken.
 2090 diGenerator.setSourceLocation(node);
610
611 // If no operator is applied, simply visit the atomic expression
612
1/2
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 6 taken 2090 times.
 2090 if (node->op == PrefixUnaryExprNode::PrefixUnaryOp::OP_NONE)
613 ✗ return visit(node->postfixUnaryExpr);
614
615 // Evaluate lhs
616 2090 const ExprNode *lhsNode = node->prefixUnaryExpr;
617
1/2
✓ Branch 6 → 7 taken 2090 times.
✗ Branch 6 → 117 not taken.
 2090 const QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
618
2/4
✓ Branch 7 → 8 taken 2090 times.
✗ Branch 7 → 87 not taken.
✓ Branch 8 → 9 taken 2090 times.
✗ Branch 8 → 85 not taken.
 2090 auto lhs = std::any_cast<LLVMExprResult>(visit(lhsNode));
619
620
7/8
✓ Branch 10 → 11 taken 893 times.
✓ Branch 10 → 21 taken 21 times.
✓ Branch 10 → 36 taken 7 times.
✓ Branch 10 → 51 taken 762 times.
✓ Branch 10 → 53 taken 5 times.
✓ Branch 10 → 55 taken 227 times.
✓ Branch 10 → 64 taken 175 times.
✗ Branch 10 → 73 not taken.
 2090 switch (node->op) {
621 893 case PrefixUnaryExprNode::PrefixUnaryOp::OP_MINUS: {
622 // Execute operation
623
1/2
✓ Branch 11 → 12 taken 893 times.
✗ Branch 11 → 117 not taken.
 893 lhs = conversionManager.getPrefixMinusInst(node, lhs, lhsSTy);
624
625 // This operator can not work in-place, so we need additional memory
626
1/2
✓ Branch 16 → 17 taken 893 times.
✗ Branch 16 → 88 not taken.
 893 lhs.ptr = insertAlloca(lhs.value->getType());
627
628 // Store the new value
629
1/2
✓ Branch 19 → 20 taken 893 times.
✗ Branch 19 → 117 not taken.
 893 insertStore(lhs.value, lhs.ptr);
630
631 893 break;
632 }
633 21 case PrefixUnaryExprNode::PrefixUnaryOp::OP_PLUS_PLUS: {
634 // Execute operation
635
1/2
✓ Branch 21 → 22 taken 21 times.
✗ Branch 21 → 94 not taken.
 21 lhs.value = conversionManager.getPrefixPlusPlusInst(node, lhs, lhsSTy).value;
636
637 // If this operation happens on a volatile variable, store the value directly
638
3/4
✓ Branch 22 → 23 taken 20 times.
✓ Branch 22 → 25 taken 1 time.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 25 taken 20 times.
 21 if (lhs.entry && lhs.entry->isVolatile)
639 ✗ insertStore(lhs.value, lhs.ptr, true);
640
641 // Save to the existing address if possible, otherwise (e.g. for literals) allocate new space
642
2/2
✓ Branch 25 → 26 taken 1 time.
✓ Branch 25 → 34 taken 20 times.
 21 if (!lhs.ptr)
643
1/2
✓ Branch 30 → 31 taken 1 time.
✗ Branch 30 → 95 not taken.
 1 lhs.ptr = insertAlloca(lhs.value->getType());
644
645 // Store the new value
646
1/2
✓ Branch 34 → 35 taken 21 times.
✗ Branch 34 → 117 not taken.
 21 insertStore(lhs.value, lhs.ptr);
647
648 21 break;
649 }
650 7 case PrefixUnaryExprNode::PrefixUnaryOp::OP_MINUS_MINUS: {
651 // Execute operation
652
1/2
✓ Branch 36 → 37 taken 7 times.
✗ Branch 36 → 101 not taken.
 7 lhs.value = conversionManager.getPrefixMinusMinusInst(node, lhs, lhsSTy).value;
653
654 // If this operation happens on a volatile variable, store the value directly
655
3/4
✓ Branch 37 → 38 taken 6 times.
✓ Branch 37 → 40 taken 1 time.
✗ Branch 38 → 39 not taken.
✓ Branch 38 → 40 taken 6 times.
 7 if (lhs.entry && lhs.entry->isVolatile)
656 ✗ insertStore(lhs.value, lhs.ptr, true);
657
658 // Save to the existing address if possible, otherwise (e.g. for literals) allocate new space
659
2/2
✓ Branch 40 → 41 taken 1 time.
✓ Branch 40 → 49 taken 6 times.
 7 if (!lhs.ptr)
660
1/2
✓ Branch 45 → 46 taken 1 time.
✗ Branch 45 → 102 not taken.
 1 lhs.ptr = insertAlloca(lhs.value->getType());
661
662 // Store the new value
663
1/2
✓ Branch 49 → 50 taken 7 times.
✗ Branch 49 → 117 not taken.
 7 insertStore(lhs.value, lhs.ptr);
664
665 7 break;
666 }
667 762 case PrefixUnaryExprNode::PrefixUnaryOp::OP_NOT: {
668 // Execute operation
669
1/2
✓ Branch 51 → 52 taken 762 times.
✗ Branch 51 → 117 not taken.
 762 lhs = conversionManager.getPrefixNotInst(node, lhs, lhsSTy);
670 762 break;
671 }
672 5 case PrefixUnaryExprNode::PrefixUnaryOp::OP_BITWISE_NOT: {
673 // Execute operation
674
1/2
✓ Branch 53 → 54 taken 5 times.
✗ Branch 53 → 117 not taken.
 5 lhs = conversionManager.getPrefixBitwiseNotInst(node, lhs, lhsSTy);
675 5 break;
676 }
677 227 case PrefixUnaryExprNode::PrefixUnaryOp::OP_DEREFERENCE: {
678 // If only .refPtr is filled, we can't simply rewire the fields, but need to actually perform a load.
679 // For that we can use resolveValue().
680
4/4
✓ Branch 55 → 56 taken 220 times.
✓ Branch 55 → 58 taken 7 times.
✓ Branch 56 → 57 taken 8 times.
✓ Branch 56 → 58 taken 212 times.
 227 const bool onlyRefPtrIsFilled = lhs.value == nullptr && lhs.ptr == nullptr;
681 // Rewire the fields
682
3/4
✓ Branch 59 → 60 taken 8 times.
✓ Branch 59 → 62 taken 219 times.
✓ Branch 60 → 61 taken 8 times.
✗ Branch 60 → 117 not taken.
 227 llvm::Value *newRefPtr = onlyRefPtrIsFilled ? resolveValue(lhsNode, lhs) : lhs.ptr;
683 227 llvm::Value *newPtr = lhs.value;
684 227 lhs = {.ptr = newPtr, .refPtr = newRefPtr};
685 227 break;
686 }
687 175 case PrefixUnaryExprNode::PrefixUnaryOp::OP_ADDRESS_OF: {
688 // If only .value is filled, we can't simply rewire the fields, but need to actually perform alloca + store.
689 // For that we can use resolveAddress().
690
4/4
✓ Branch 64 → 65 taken 10 times.
✓ Branch 64 → 67 taken 165 times.
✓ Branch 65 → 66 taken 2 times.
✓ Branch 65 → 67 taken 8 times.
 175 const bool onlyValueIsFilled = lhs.ptr == nullptr && lhs.refPtr == nullptr;
691 // Rewire the fields
692
3/4
✓ Branch 68 → 69 taken 2 times.
✓ Branch 68 → 71 taken 173 times.
✓ Branch 69 → 70 taken 2 times.
✗ Branch 69 → 117 not taken.
 175 llvm::Value *newValue = onlyValueIsFilled ? resolveAddress(lhs) : lhs.ptr;
693 175 llvm::Value *newPtr = lhs.refPtr;
694 175 lhs = {.value = newValue, .ptr = newPtr};
695 175 break;
696 }
697 − default: // GCOV_EXCL_LINE
698 − throw CompilerError(UNHANDLED_BRANCH, "PrefixUnaryExpr fall-through"); // GCOV_EXCL_LINE
699 }
700
701
1/2
✓ Branch 81 → 82 taken 2090 times.
✗ Branch 81 → 117 not taken.
 2090 return lhs;
702 }
703
704 22173 std::any IRGenerator::visitPostfixUnaryExpr(const PostfixUnaryExprNode *node) {
705
1/2
✓ Branch 2 → 3 taken 22173 times.
✗ Branch 2 → 241 not taken.
 22173 diGenerator.setSourceLocation(node);
706
707 // If no operator is applied, simply visit the atomic expression
708
1/2
✗ Branch 3 → 4 not taken.
✓ Branch 3 → 6 taken 22173 times.
 22173 if (node->op == PostfixUnaryExprNode::PostfixUnaryOp::OP_NONE)
709 ✗ return visit(node->atomicExpr);
710
711 // Evaluate lhs
712 22173 const ExprNode *lhsNode = node->postfixUnaryExpr;
713
1/2
✓ Branch 6 → 7 taken 22173 times.
✗ Branch 6 → 241 not taken.
 22173 QualType lhsSTy = lhsNode->getEvaluatedSymbolType(manIdx);
714
2/4
✓ Branch 7 → 8 taken 22173 times.
✗ Branch 7 → 163 not taken.
✓ Branch 8 → 9 taken 22173 times.
✗ Branch 8 → 161 not taken.
 22173 auto lhs = std::any_cast<LLVMExprResult>(visit(lhsNode));
715
716
4/5
✓ Branch 10 → 11 taken 3424 times.
✓ Branch 10 → 62 taken 16513 times.
✓ Branch 10 → 101 taken 1823 times.
✓ Branch 10 → 125 taken 413 times.
✗ Branch 10 → 149 not taken.
 22173 switch (node->op) {
717 3424 case PostfixUnaryExprNode::PostfixUnaryOp::OP_SUBSCRIPT: {
718 3424 const ExprNode *indexExpr = node->subscriptIndexExpr;
719
720 // Check if we need to generate a call to an overloaded operator function
721
3/4
✓ Branch 11 → 12 taken 3424 times.
✗ Branch 11 → 199 not taken.
✓ Branch 12 → 13 taken 117 times.
✓ Branch 12 → 29 taken 3307 times.
 3424 if (conversionManager.callsOverloadedOpFct(node, 0)) {
722
1/2
✓ Branch 13 → 14 taken 117 times.
✗ Branch 13 → 164 not taken.
 117 ResolverFct lhsV = [&] { return resolveValue(lhsSTy, lhs); };
723 234 ResolverFct lhsP = [&] { return resolveAddress(lhs); };
724 228 ResolverFct idxV = [&] { return resolveValue(indexExpr); };
725 123 ResolverFct idxP = [&] { return resolveAddress(indexExpr); };
726 117 lhs = conversionManager.callOperatorOverloadFct<2>(node, {lhsV, lhsP, idxV, idxP}, 0);
727 117 break;
728 117 }
729
730
1/2
✓ Branch 29 → 30 taken 3307 times.
✗ Branch 29 → 182 not taken.
 3307 lhsSTy = lhsSTy.removeReferenceWrapper();
731
732 // Get the index value
733
1/2
✓ Branch 30 → 31 taken 3307 times.
✗ Branch 30 → 199 not taken.
 3307 llvm::Value *indexValue = resolveValue(indexExpr);
734 // Come up with the address
735
8/10
✓ Branch 31 → 32 taken 3307 times.
✗ Branch 31 → 199 not taken.
✓ Branch 32 → 33 taken 186 times.
✓ Branch 32 → 36 taken 3121 times.
✓ Branch 33 → 34 taken 186 times.
✗ Branch 33 → 199 not taken.
✓ Branch 34 → 35 taken 145 times.
✓ Branch 34 → 36 taken 41 times.
✓ Branch 37 → 38 taken 145 times.
✓ Branch 37 → 49 taken 3162 times.
 3307 if (lhsSTy.isArray() && lhsSTy.getArraySize() != ARRAY_SIZE_UNKNOWN) { // Array
736 // Make sure the address is present
737
1/2
✓ Branch 38 → 39 taken 145 times.
✗ Branch 38 → 190 not taken.
 145 resolveAddress(lhs);
738
739 // Calculate address of array item
740
1/2
✓ Branch 39 → 40 taken 145 times.
✗ Branch 39 → 190 not taken.
 145 llvm::Type *lhsTy = lhsSTy.toLLVMType(sourceFile);
741
1/2
✓ Branch 40 → 41 taken 145 times.
✗ Branch 40 → 190 not taken.
 145 llvm::Value *indices[2] = {builder.getInt64(0), indexValue};
742
1/2
✓ Branch 45 → 46 taken 145 times.
✗ Branch 45 → 183 not taken.
 145 lhs.ptr = insertInBoundsGEP(lhsTy, lhs.ptr, indices);
743 } else { // Pointer
744 // Now the pointer is the value
745
1/2
✓ Branch 49 → 50 taken 3162 times.
✗ Branch 49 → 199 not taken.
 3162 lhs.ptr = resolveValue(lhsNode, lhs);
746
747
2/4
✓ Branch 50 → 51 taken 3162 times.
✗ Branch 50 → 191 not taken.
✓ Branch 51 → 52 taken 3162 times.
✗ Branch 51 → 191 not taken.
 3162 llvm::Type *lhsTy = lhsSTy.getContained().toLLVMType(sourceFile);
748 // Calculate address of pointer item
749
1/2
✓ Branch 56 → 57 taken 3162 times.
✗ Branch 56 → 192 not taken.
 3162 lhs.ptr = insertInBoundsGEP(lhsTy, lhs.ptr, indexValue);
750 }
751
752 // Reset value and entry
753 3307 lhs.value = nullptr;
754 3307 lhs.entry = nullptr;
755 3307 break;
756 }
757 16513 case PostfixUnaryExprNode::PostfixUnaryOp::OP_MEMBER_ACCESS: {
758 // Get the address of the struct instance
759
1/2
✓ Branch 62 → 63 taken 16513 times.
✗ Branch 62 → 217 not taken.
 16513 resolveAddress(lhs);
760
1/2
✓ Branch 63 → 64 taken 16513 times.
✗ Branch 63 → 200 not taken.
 16513 lhsSTy = lhsSTy.removeReferenceWrapper();
761
762 // Auto de-reference pointer
763
1/2
✓ Branch 64 → 65 taken 16513 times.
✗ Branch 64 → 217 not taken.
 16513 autoDeReferencePtr(lhs.ptr, lhsSTy);
764
2/4
✓ Branch 65 → 66 taken 16513 times.
✗ Branch 65 → 217 not taken.
✗ Branch 66 → 67 not taken.
✓ Branch 66 → 68 taken 16513 times.
 16513 assert(lhsSTy.is(TY_STRUCT));
765
766 // Retrieve struct scope
767 16513 const std::string &fieldName = node->identifier;
768
1/2
✓ Branch 68 → 69 taken 16513 times.
✗ Branch 68 → 217 not taken.
 16513 Scope *structScope = lhsSTy.getBodyScope();
769
770 // Retrieve field entry
771 16513 std::vector<size_t> indexPath;
772
1/2
✓ Branch 69 → 70 taken 16513 times.
✗ Branch 69 → 215 not taken.
 16513 lhs.entry = structScope->symbolTable.lookupInComposedFields(fieldName, indexPath);
773
1/2
✗ Branch 70 → 71 not taken.
✓ Branch 70 → 72 taken 16513 times.
 16513 assert(lhs.entry != nullptr);
774
1/2
✓ Branch 72 → 73 taken 16513 times.
✗ Branch 72 → 215 not taken.
 16513 const QualType fieldSymbolType = lhs.entry->getQualType();
775
776 // Get address of the field in the struct instance
777
2/4
✓ Branch 73 → 74 taken 16513 times.
✗ Branch 73 → 204 not taken.
✓ Branch 76 → 77 taken 16513 times.
✗ Branch 76 → 201 not taken.
 33026 std::vector<llvm::Value *> indices = {builder.getInt64(0)};
778
2/2
✓ Branch 85 → 80 taken 16551 times.
✓ Branch 85 → 86 taken 16513 times.
 33064 for (const size_t index : indexPath)
779
2/4
✓ Branch 81 → 82 taken 16551 times.
✗ Branch 81 → 205 not taken.
✓ Branch 82 → 83 taken 16551 times.
✗ Branch 82 → 205 not taken.
 16551 indices.push_back(builder.getInt32(index));
780
1/2
✓ Branch 86 → 87 taken 16513 times.
✗ Branch 86 → 213 not taken.
 16513 const std::string name = fieldName + ".addr";
781
3/6
✓ Branch 87 → 88 taken 16513 times.
✗ Branch 87 → 210 not taken.
✓ Branch 89 → 90 taken 16513 times.
✗ Branch 89 → 207 not taken.
✓ Branch 90 → 91 taken 16513 times.
✗ Branch 90 → 207 not taken.
 16513 llvm::Value *memberAddr = insertInBoundsGEP(lhsSTy.toLLVMType(sourceFile), lhs.ptr, indices, name);
782
783 // Set as ptr or refPtr, depending on the type
784
3/4
✓ Branch 92 → 93 taken 16513 times.
✗ Branch 92 → 211 not taken.
✓ Branch 93 → 94 taken 200 times.
✓ Branch 93 → 95 taken 16313 times.
 16513 if (fieldSymbolType.isRef()) {
785 200 lhs.ptr = nullptr;
786 200 lhs.refPtr = memberAddr;
787 } else {
788 16313 lhs.ptr = memberAddr;
789 16313 lhs.refPtr = nullptr;
790 }
791
792 // Reset the value
793 16513 lhs.value = nullptr;
794 16513 break;
795 16513 }
796 1823 case PostfixUnaryExprNode::PostfixUnaryOp::OP_PLUS_PLUS: {
797 // Make sure a value is present
798
1/2
✓ Branch 101 → 102 taken 1823 times.
✗ Branch 101 → 224 not taken.
 1823 resolveValue(lhsNode, lhs);
799
800 // Allocate new local variable if required
801
2/2
✓ Branch 102 → 103 taken 2 times.
✓ Branch 102 → 113 taken 1821 times.
 1823 if (!lhs.ptr) {
802
1/2
✗ Branch 103 → 104 not taken.
✓ Branch 103 → 105 taken 2 times.
 2 assert(lhs.value != nullptr);
803
1/2
✓ Branch 109 → 110 taken 2 times.
✗ Branch 109 → 218 not taken.
 2 lhs.ptr = insertAlloca(lhs.value->getType());
804 }
805
806 // Execute operation
807
1/2
✓ Branch 113 → 114 taken 1823 times.
✗ Branch 113 → 224 not taken.
 1823 const LLVMExprResult result = conversionManager.getPostfixPlusPlusInst(node, lhs, lhsSTy);
808
809 // Save the new value to the old address
810
3/4
✓ Branch 114 → 115 taken 1823 times.
✗ Branch 114 → 224 not taken.
✓ Branch 115 → 116 taken 9 times.
✓ Branch 115 → 117 taken 1814 times.
 1823 if (conversionManager.callsOverloadedOpFct(node, 0)) {
811 9 lhs.value = result.value;
812 9 lhs.ptr = result.ptr;
813 } else {
814
5/6
✓ Branch 117 → 118 taken 1811 times.
✓ Branch 117 → 120 taken 3 times.
✓ Branch 118 → 119 taken 3 times.
✓ Branch 118 → 120 taken 1808 times.
✓ Branch 121 → 122 taken 1814 times.
✗ Branch 121 → 224 not taken.
 1814 insertStore(result.value, lhs.ptr, lhs.entry && lhs.entry->isVolatile);
815 1814 lhs.ptr = nullptr;
816 }
817 1823 break;
818 }
819 413 case PostfixUnaryExprNode::PostfixUnaryOp::OP_MINUS_MINUS: {
820 // Make sure a value is present
821
1/2
✓ Branch 125 → 126 taken 413 times.
✗ Branch 125 → 231 not taken.
 413 resolveValue(lhsNode, lhs);
822
823 // Allocate new local variable if required
824
2/2
✓ Branch 126 → 127 taken 2 times.
✓ Branch 126 → 137 taken 411 times.
 413 if (!lhs.ptr) {
825
1/2
✗ Branch 127 → 128 not taken.
✓ Branch 127 → 129 taken 2 times.
 2 assert(lhs.value != nullptr);
826
1/2
✓ Branch 133 → 134 taken 2 times.
✗ Branch 133 → 225 not taken.
 2 lhs.ptr = insertAlloca(lhs.value->getType());
827 }
828
829 // Execute operation
830
1/2
✓ Branch 137 → 138 taken 413 times.
✗ Branch 137 → 231 not taken.
 413 const LLVMExprResult result = conversionManager.getPostfixMinusMinusInst(node, lhs, lhsSTy);
831
832 // Save the new value to the old address
833
3/4
✓ Branch 138 → 139 taken 413 times.
✗ Branch 138 → 231 not taken.
✓ Branch 139 → 140 taken 7 times.
✓ Branch 139 → 141 taken 406 times.
 413 if (conversionManager.callsOverloadedOpFct(node, 0)) {
834 7 lhs.value = result.value;
835 7 lhs.ptr = result.ptr;
836 } else {
837
4/6
✓ Branch 141 → 142 taken 404 times.
✓ Branch 141 → 144 taken 2 times.
✗ Branch 142 → 143 not taken.
✓ Branch 142 → 144 taken 404 times.
✓ Branch 145 → 146 taken 406 times.
✗ Branch 145 → 231 not taken.
 406 insertStore(result.value, lhs.ptr, lhs.entry && lhs.entry->isVolatile);
838 406 lhs.ptr = nullptr;
839 }
840 413 break;
841 }
842 − default: // GCOV_EXCL_LINE
843 − throw CompilerError(UNHANDLED_BRANCH, "PostfixUnaryExpr fall-through"); // GCOV_EXCL_LINE
844 }
845
846
1/2
✓ Branch 157 → 158 taken 22173 times.
✗ Branch 157 → 241 not taken.
 22173 return lhs;
847
5/14
✓ Branch 17 → 18 taken 117 times.
✗ Branch 17 → 167 not taken.
✓ Branch 18 → 19 taken 117 times.
✗ Branch 18 → 167 not taken.
✓ Branch 19 → 20 taken 117 times.
✗ Branch 19 → 167 not taken.
✓ Branch 20 → 21 taken 117 times.
✗ Branch 20 → 167 not taken.
✓ Branch 21 → 22 taken 117 times.
✗ Branch 21 → 165 not taken.
✗ Branch 167 → 168 not taken.
✗ Branch 167 → 171 not taken.
✗ Branch 169 → 170 not taken.
✗ Branch 169 → 171 not taken.
 117 }
848
849 97022 std::any IRGenerator::visitAtomicExpr(const AtomicExprNode *node) {
850
1/2
✓ Branch 2 → 3 taken 97022 times.
✗ Branch 2 → 86 not taken.
 97022 diGenerator.setSourceLocation(node);
851
852 // If constant
853
2/2
✓ Branch 3 → 4 taken 17485 times.
✓ Branch 3 → 10 taken 79537 times.
 97022 if (node->constant) {
854
2/4
✓ Branch 4 → 5 taken 17485 times.
✗ Branch 4 → 78 not taken.
✓ Branch 5 → 6 taken 17485 times.
✗ Branch 5 → 76 not taken.
 17485 const auto constantValue = std::any_cast<llvm::Constant *>(visit(node->constant));
855
1/2
✓ Branch 7 → 8 taken 17485 times.
✗ Branch 7 → 79 not taken.
 34970 return LLVMExprResult{.constant = constantValue};
856 }
857
858 // If value
859
2/2
✓ Branch 10 → 11 taken 21169 times.
✓ Branch 10 → 13 taken 58368 times.
 79537 if (node->value)
860
1/2
✓ Branch 11 → 12 taken 21169 times.
✗ Branch 11 → 86 not taken.
 21169 return visit(node->value);
861
862 // Is assign expression
863
2/2
✓ Branch 13 → 14 taken 592 times.
✓ Branch 13 → 16 taken 57776 times.
 58368 if (node->assignExpr)
864
1/2
✓ Branch 14 → 15 taken 592 times.
✗ Branch 14 → 86 not taken.
 592 return visit(node->assignExpr);
865
866 // Identifier (local or global variable access)
867
1/2
✗ Branch 17 → 18 not taken.
✓ Branch 17 → 19 taken 57776 times.
 57776 assert(!node->identifierFragments.empty());
868
869 // Get symbol table entry
870
1/2
✓ Branch 19 → 20 taken 57776 times.
✗ Branch 19 → 86 not taken.
 57776 const auto &[entry, accessScope, capture] = node->data.at(manIdx);
871
1/2
✗ Branch 20 → 21 not taken.
✓ Branch 20 → 22 taken 57776 times.
 57776 assert(entry != nullptr);
872
1/2
✗ Branch 22 → 23 not taken.
✓ Branch 22 → 24 taken 57776 times.
 57776 assert(accessScope != nullptr);
873
1/2
✓ Branch 24 → 25 taken 57776 times.
✗ Branch 24 → 86 not taken.
 57776 const QualType varSymbolType = entry->getQualType();
874
1/2
✓ Branch 25 → 26 taken 57776 times.
✗ Branch 25 → 86 not taken.
 57776 llvm::Type *varType = varSymbolType.toLLVMType(sourceFile);
875
876 // Check if external global variable
877
7/8
✓ Branch 26 → 27 taken 1596 times.
✓ Branch 26 → 30 taken 56180 times.
✓ Branch 27 → 28 taken 1596 times.
✗ Branch 27 → 86 not taken.
✓ Branch 28 → 29 taken 81 times.
✓ Branch 28 → 30 taken 1515 times.
✓ Branch 31 → 32 taken 81 times.
✓ Branch 31 → 35 taken 57695 times.
 57776 if (entry->global && accessScope->isImportedBy(rootScope)) {
878 // External global variables need to be declared and allocated in the current module
879
1/2
✓ Branch 33 → 34 taken 81 times.
✗ Branch 33 → 80 not taken.
 81 llvm::Value *varAddress = module->getOrInsertGlobal(entry->name, varType);
880
1/2
✓ Branch 34 → 35 taken 81 times.
✗ Branch 34 → 86 not taken.
 81 entry->updateAddress(varAddress);
881 }
882
883 // Check if enum item
884
2/2
✓ Branch 35 → 36 taken 283 times.
✓ Branch 35 → 47 taken 57493 times.
 57776 if (accessScope->type == ScopeType::ENUM) {
885
1/2
✓ Branch 36 → 37 taken 283 times.
✗ Branch 36 → 38 not taken.
 283 const auto itemNode = spice_pointer_cast<const EnumItemNode *>(entry->declNode);
886
1/2
✓ Branch 43 → 44 taken 283 times.
✗ Branch 43 → 86 not taken.
 283 llvm::Constant *constantItemValue = llvm::ConstantInt::get(varType, itemNode->itemValue);
887
1/2
✓ Branch 44 → 45 taken 283 times.
✗ Branch 44 → 81 not taken.
 566 return LLVMExprResult{.constant = constantItemValue, .entry = entry};
888 }
889
890
1/2
✓ Branch 47 → 48 taken 57493 times.
✗ Branch 47 → 86 not taken.
 57493 llvm::Value *address = entry->getAddress();
891
1/2
✗ Branch 48 → 49 not taken.
✓ Branch 48 → 50 taken 57493 times.
 57493 assert(address != nullptr);
892
893 // If this is a function/procedure reference, return it as value
894
7/8
✓ Branch 50 → 51 taken 1596 times.
✓ Branch 50 → 54 taken 55897 times.
✓ Branch 51 → 52 taken 1596 times.
✗ Branch 51 → 82 not taken.
✓ Branch 52 → 53 taken 15 times.
✓ Branch 52 → 54 taken 1581 times.
✓ Branch 55 → 56 taken 15 times.
✓ Branch 55 → 60 taken 57478 times.
 57493 if (entry->global && varSymbolType.isOneOf({TY_FUNCTION, TY_PROCEDURE})) {
895
1/2
✓ Branch 56 → 57 taken 15 times.
✗ Branch 56 → 86 not taken.
 15 llvm::Value *fatPtr = buildFatFctPtr(nullptr, nullptr, address);
896
1/2
✓ Branch 57 → 58 taken 15 times.
✗ Branch 57 → 83 not taken.
 30 return LLVMExprResult{.ptr = fatPtr, .entry = entry};
897 }
898
899 // Load the address of the referenced variable
900
10/12
✓ Branch 60 → 61 taken 57478 times.
✗ Branch 60 → 86 not taken.
✓ Branch 61 → 62 taken 53981 times.
✓ Branch 61 → 65 taken 3497 times.
✓ Branch 62 → 63 taken 26 times.
✓ Branch 62 → 66 taken 53955 times.
✓ Branch 63 → 64 taken 26 times.
✗ Branch 63 → 86 not taken.
✓ Branch 64 → 65 taken 11 times.
✓ Branch 64 → 66 taken 15 times.
✓ Branch 67 → 68 taken 3508 times.
✓ Branch 67 → 71 taken 53970 times.
 57478 if (varSymbolType.isRef() || (capture && capture->getMode() == BY_REFERENCE))
901
1/2
✓ Branch 68 → 69 taken 3508 times.
✗ Branch 68 → 84 not taken.
 7016 return LLVMExprResult{.refPtr = address, .entry = entry};
902
903
1/2
✓ Branch 71 → 72 taken 53970 times.
✗ Branch 71 → 85 not taken.
 107940 return LLVMExprResult{.ptr = address, .entry = entry};
904 }
905
906 } // namespace spice::compiler
907