GCC Code Coverage Report

Directory: ../
File: src/typechecker/TypeCheckerExpressions.cpp
Date: 2025-12-12 07:25:08
Coverage Exec Excl Total
Lines: 97.5% 397 10 417
Functions: 100.0% 16 0 16
Branches: 55.8% 678 32 1247
Line Branch Exec Source
1 // Copyright (c) 2021-2025 ChilliBits. All rights reserved.
2
3 #include "TypeChecker.h"
4
5 #include <SourceFile.h>
6 #include <global/GlobalResourceManager.h>
7 #include <symboltablebuilder/SymbolTableBuilder.h>
8 #include <typechecker/MacroDefs.h>
9
10 namespace spice::compiler {
11
12 84169 std::any TypeChecker::visitAssignExpr(AssignExprNode *node) {
13 // Check if ternary
14
2/2
✓ Branch 2 → 3 taken 77327 times.
✓ Branch 2 → 10 taken 6842 times.
 84169 if (node->ternaryExpr) {
15
3/4
✓ Branch 3 → 4 taken 77309 times.
✓ Branch 3 → 97 taken 18 times.
✓ Branch 4 → 5 taken 77309 times.
✗ Branch 4 → 95 not taken.
 77327 auto result = std::any_cast<ExprResult>(visit(node->ternaryExpr));
16
1/2
✓ Branch 6 → 7 taken 77309 times.
✗ Branch 6 → 98 not taken.
 77309 node->setEvaluatedSymbolType(result.type, manIdx);
17
1/2
✓ Branch 7 → 8 taken 77309 times.
✗ Branch 7 → 98 not taken.
 77309 return result;
18 }
19
20 // Check if assignment
21
1/2
✓ Branch 10 → 11 taken 6842 times.
✗ Branch 10 → 86 not taken.
 6842 if (node->op != AssignExprNode::AssignOp::OP_NONE) {
22 // Visit the right side first
23
2/4
✓ Branch 11 → 12 taken 6842 times.
✗ Branch 11 → 101 not taken.
✓ Branch 12 → 13 taken 6842 times.
✗ Branch 12 → 99 not taken.
 6842 auto rhs = std::any_cast<ExprResult>(visit(node->rhs));
24 6842 auto [rhsType, rhsEntry] = rhs;
25
5/8
✓ Branch 14 → 15 taken 6842 times.
✗ Branch 14 → 120 not taken.
✓ Branch 15 → 16 taken 1 time.
✓ Branch 15 → 20 taken 6841 times.
✓ Branch 16 → 17 taken 1 time.
✗ Branch 16 → 102 not taken.
✓ Branch 17 → 18 taken 1 time.
✗ Branch 17 → 102 not taken.
 6842 HANDLE_UNRESOLVED_TYPE_ER(rhsType)
26 // Then visit the left side
27
2/4
✓ Branch 20 → 21 taken 6841 times.
✗ Branch 20 → 105 not taken.
✓ Branch 21 → 22 taken 6841 times.
✗ Branch 21 → 103 not taken.
 6841 auto lhs = std::any_cast<ExprResult>(visit(node->lhs));
28 6841 auto [lhsType, lhsVar] = lhs;
29
5/8
✓ Branch 23 → 24 taken 6841 times.
✗ Branch 23 → 120 not taken.
✓ Branch 24 → 25 taken 1 time.
✓ Branch 24 → 29 taken 6840 times.
✓ Branch 25 → 26 taken 1 time.
✗ Branch 25 → 106 not taken.
✓ Branch 26 → 27 taken 1 time.
✗ Branch 26 → 106 not taken.
 6841 HANDLE_UNRESOLVED_TYPE_ER(lhsType)
30
31 // Take a look at the operator
32
2/2
✓ Branch 29 → 30 taken 5991 times.
✓ Branch 29 → 42 taken 849 times.
 6840 if (node->op == AssignExprNode::AssignOp::OP_ASSIGN) {
33
8/10
✓ Branch 30 → 31 taken 5990 times.
✓ Branch 30 → 37 taken 1 time.
✓ Branch 31 → 32 taken 5990 times.
✗ Branch 31 → 120 not taken.
✓ Branch 32 → 33 taken 4740 times.
✓ Branch 32 → 37 taken 1250 times.
✓ Branch 34 → 35 taken 4740 times.
✗ Branch 34 → 120 not taken.
✓ Branch 35 → 36 taken 1519 times.
✓ Branch 35 → 37 taken 3221 times.
 5991 const bool isDecl = lhs.entry != nullptr && lhs.entry->isField() && !lhs.entry->getLifecycle().isInitialized();
34
2/2
✓ Branch 38 → 39 taken 5990 times.
✓ Branch 38 → 107 taken 1 time.
 5991 rhsType = opRuleManager.getAssignResultType(node, lhs, rhs, isDecl).first;
35
36 // If there is an anonymous entry attached (e.g. for struct instantiation), delete it
37
4/4
✓ Branch 39 → 40 taken 2844 times.
✓ Branch 39 → 72 taken 3146 times.
✓ Branch 40 → 41 taken 218 times.
✓ Branch 40 → 72 taken 2626 times.
 5990 if (rhsEntry != nullptr && rhsEntry->anonymous)
38
1/2
✓ Branch 41 → 72 taken 218 times.
✗ Branch 41 → 120 not taken.
 218 currentScope->symbolTable.deleteAnonymous(rhsEntry->name);
39
2/2
✓ Branch 42 → 43 taken 276 times.
✓ Branch 42 → 45 taken 573 times.
 849 } else if (node->op == AssignExprNode::AssignOp::OP_PLUS_EQUAL) {
40
1/2
✓ Branch 43 → 44 taken 276 times.
✗ Branch 43 → 108 not taken.
 276 rhsType = opRuleManager.getPlusEqualResultType(node, lhs, rhs, 0).type;
41
2/2
✓ Branch 45 → 46 taken 48 times.
✓ Branch 45 → 48 taken 525 times.
 573 } else if (node->op == AssignExprNode::AssignOp::OP_MINUS_EQUAL) {
42
1/2
✓ Branch 46 → 47 taken 48 times.
✗ Branch 46 → 109 not taken.
 48 rhsType = opRuleManager.getMinusEqualResultType(node, lhs, rhs, 0).type;
43
2/2
✓ Branch 48 → 49 taken 50 times.
✓ Branch 48 → 51 taken 475 times.
 525 } else if (node->op == AssignExprNode::AssignOp::OP_MUL_EQUAL) {
44
1/2
✓ Branch 49 → 50 taken 50 times.
✗ Branch 49 → 110 not taken.
 50 rhsType = opRuleManager.getMulEqualResultType(node, lhs, rhs, 0).type;
45
2/2
✓ Branch 51 → 52 taken 55 times.
✓ Branch 51 → 54 taken 420 times.
 475 } else if (node->op == AssignExprNode::AssignOp::OP_DIV_EQUAL) {
46
1/2
✓ Branch 52 → 53 taken 55 times.
✗ Branch 52 → 111 not taken.
 55 rhsType = opRuleManager.getDivEqualResultType(node, lhs, rhs, 0).type;
47
2/2
✓ Branch 54 → 55 taken 17 times.
✓ Branch 54 → 57 taken 403 times.
 420 } else if (node->op == AssignExprNode::AssignOp::OP_REM_EQUAL) {
48
1/2
✓ Branch 55 → 56 taken 17 times.
✗ Branch 55 → 112 not taken.
 17 rhsType = opRuleManager.getRemEqualResultType(node, lhs, rhs);
49
2/2
✓ Branch 57 → 58 taken 12 times.
✓ Branch 57 → 60 taken 391 times.
 403 } else if (node->op == AssignExprNode::AssignOp::OP_SHL_EQUAL) {
50
1/2
✓ Branch 58 → 59 taken 12 times.
✗ Branch 58 → 113 not taken.
 12 rhsType = opRuleManager.getSHLEqualResultType(node, lhs, rhs);
51
2/2
✓ Branch 60 → 61 taken 13 times.
✓ Branch 60 → 63 taken 378 times.
 391 } else if (node->op == AssignExprNode::AssignOp::OP_SHR_EQUAL) {
52
1/2
✓ Branch 61 → 62 taken 13 times.
✗ Branch 61 → 114 not taken.
 13 rhsType = opRuleManager.getSHREqualResultType(node, lhs, rhs);
53
2/2
✓ Branch 63 → 64 taken 11 times.
✓ Branch 63 → 66 taken 367 times.
 378 } else if (node->op == AssignExprNode::AssignOp::OP_AND_EQUAL) {
54
1/2
✓ Branch 64 → 65 taken 11 times.
✗ Branch 64 → 115 not taken.
 11 rhsType = opRuleManager.getAndEqualResultType(node, lhs, rhs);
55
2/2
✓ Branch 66 → 67 taken 11 times.
✓ Branch 66 → 69 taken 356 times.
 367 } else if (node->op == AssignExprNode::AssignOp::OP_OR_EQUAL) {
56
1/2
✓ Branch 67 → 68 taken 11 times.
✗ Branch 67 → 116 not taken.
 11 rhsType = opRuleManager.getOrEqualResultType(node, lhs, rhs);
57
1/2
✓ Branch 69 → 70 taken 356 times.
✗ Branch 69 → 72 not taken.
 356 } else if (node->op == AssignExprNode::AssignOp::OP_XOR_EQUAL) {
58
1/2
✓ Branch 70 → 71 taken 356 times.
✗ Branch 70 → 117 not taken.
 356 rhsType = opRuleManager.getXorEqualResultType(node, lhs, rhs);
59 }
60
61
1/2
✓ Branch 72 → 73 taken 6839 times.
✗ Branch 72 → 81 not taken.
 6839 if (lhsVar) { // Variable is involved on the left side
62 // Perform type inference
63
3/4
✓ Branch 73 → 74 taken 6839 times.
✗ Branch 73 → 120 not taken.
✓ Branch 74 → 75 taken 1 time.
✓ Branch 74 → 76 taken 6838 times.
 6839 if (lhsType.is(TY_DYN))
64
1/2
✓ Branch 75 → 76 taken 1 time.
✗ Branch 75 → 120 not taken.
 1 lhsVar->updateType(rhsType, false);
65
66 // In case the lhs variable is captured, notify the capture about the write access
67
3/4
✓ Branch 76 → 77 taken 6839 times.
✗ Branch 76 → 120 not taken.
✓ Branch 77 → 78 taken 3 times.
✓ Branch 77 → 79 taken 6836 times.
 6839 if (Capture *lhsCapture = currentScope->symbolTable.lookupCapture(lhsVar->name); lhsCapture)
68
1/2
✓ Branch 78 → 79 taken 3 times.
✗ Branch 78 → 120 not taken.
 3 lhsCapture->setAccessType(READ_WRITE);
69
70 // Update the state of the variable
71
1/2
✓ Branch 79 → 80 taken 6839 times.
✗ Branch 79 → 118 not taken.
 6839 lhsVar->updateState(INITIALIZED, node);
72 }
73
74
2/4
✓ Branch 81 → 82 taken 6839 times.
✗ Branch 81 → 119 not taken.
✓ Branch 82 → 83 taken 6839 times.
✗ Branch 82 → 119 not taken.
 6839 return ExprResult{node->setEvaluatedSymbolType(rhsType, manIdx)};
75 }
76
77 − throw CompilerError(UNHANDLED_BRANCH, "AssignExpr fall-through"); // GCOV_EXCL_LINE
78 }
79
80 78117 std::any TypeChecker::visitTernaryExpr(TernaryExprNode *node) {
81 // Check if there is a ternary operator applied
82
2/2
✓ Branch 2 → 3 taken 77604 times.
✓ Branch 2 → 5 taken 513 times.
 78117 if (!node->falseExpr)
83
2/2
✓ Branch 3 → 4 taken 77586 times.
✓ Branch 3 → 150 taken 18 times.
 77604 return visit(node->condition);
84
85 // Visit condition
86
2/4
✓ Branch 5 → 6 taken 513 times.
✗ Branch 5 → 115 not taken.
✓ Branch 6 → 7 taken 513 times.
✗ Branch 6 → 113 not taken.
 513 const auto condition = std::any_cast<ExprResult>(visit(node->condition));
87
2/8
✓ Branch 8 → 9 taken 513 times.
✗ Branch 8 → 150 not taken.
✗ Branch 9 → 10 not taken.
✓ Branch 9 → 14 taken 513 times.
✗ Branch 10 → 11 not taken.
✗ Branch 10 → 116 not taken.
✗ Branch 11 → 12 not taken.
✗ Branch 11 → 116 not taken.
 513 HANDLE_UNRESOLVED_TYPE_ER(condition.type)
88
6/10
✓ Branch 14 → 15 taken 1 time.
✓ Branch 14 → 16 taken 512 times.
✓ Branch 16 → 17 taken 512 times.
✗ Branch 16 → 117 not taken.
✓ Branch 17 → 18 taken 512 times.
✗ Branch 17 → 117 not taken.
✓ Branch 18 → 19 taken 512 times.
✓ Branch 18 → 20 taken 1 time.
✗ Branch 117 → 118 not taken.
✗ Branch 117 → 119 not taken.
 513 const auto trueExpr = node->isShortened ? condition : std::any_cast<ExprResult>(visit(node->trueExpr));
89 513 const auto [trueType, trueEntry] = trueExpr;
90
2/8
✓ Branch 20 → 21 taken 513 times.
✗ Branch 20 → 150 not taken.
✗ Branch 21 → 22 not taken.
✓ Branch 21 → 26 taken 513 times.
✗ Branch 22 → 23 not taken.
✗ Branch 22 → 121 not taken.
✗ Branch 23 → 24 not taken.
✗ Branch 23 → 121 not taken.
 513 HANDLE_UNRESOLVED_TYPE_ER(trueType)
91
2/4
✓ Branch 26 → 27 taken 513 times.
✗ Branch 26 → 124 not taken.
✓ Branch 27 → 28 taken 513 times.
✗ Branch 27 → 122 not taken.
 513 const auto falseExpr = std::any_cast<ExprResult>(visit(node->falseExpr));
92 513 const auto [falseType, falseEntry] = falseExpr;
93
2/8
✓ Branch 29 → 30 taken 513 times.
✗ Branch 29 → 150 not taken.
✗ Branch 30 → 31 not taken.
✓ Branch 30 → 35 taken 513 times.
✗ Branch 31 → 32 not taken.
✗ Branch 31 → 125 not taken.
✗ Branch 32 → 33 not taken.
✗ Branch 32 → 125 not taken.
 513 HANDLE_UNRESOLVED_TYPE_ER(falseType)
94
95 // Check if the condition evaluates to bool
96
3/4
✓ Branch 35 → 36 taken 513 times.
✗ Branch 35 → 150 not taken.
✓ Branch 36 → 37 taken 1 time.
✓ Branch 36 → 47 taken 512 times.
 513 if (!condition.type.is(TY_BOOL))
97
4/8
✓ Branch 39 → 40 taken 1 time.
✗ Branch 39 → 128 not taken.
✓ Branch 40 → 41 taken 1 time.
✗ Branch 40 → 126 not taken.
✓ Branch 43 → 44 taken 1 time.
✗ Branch 43 → 132 not taken.
✓ Branch 44 → 45 taken 1 time.
✗ Branch 44 → 132 not taken.
 3 SOFT_ERROR_ER(node->condition, OPERATOR_WRONG_DATA_TYPE, "Condition operand in ternary must be a bool")
98
99 // Check if trueType and falseType are matching
100
1/2
✓ Branch 47 → 48 taken 512 times.
✗ Branch 47 → 150 not taken.
 512 const QualType trueTypeModified = trueType.removeReferenceWrapper();
101
1/2
✓ Branch 48 → 49 taken 512 times.
✗ Branch 48 → 150 not taken.
 512 const QualType falseTypeModified = falseType.removeReferenceWrapper();
102
3/4
✓ Branch 49 → 50 taken 512 times.
✗ Branch 49 → 150 not taken.
✓ Branch 50 → 51 taken 1 time.
✓ Branch 50 → 66 taken 511 times.
 512 if (!trueTypeModified.matches(falseTypeModified, false, true, false))
103
8/16
✓ Branch 51 → 52 taken 1 time.
✗ Branch 51 → 146 not taken.
✓ Branch 52 → 53 taken 1 time.
✗ Branch 52 → 141 not taken.
✓ Branch 53 → 54 taken 1 time.
✗ Branch 53 → 139 not taken.
✓ Branch 54 → 55 taken 1 time.
✗ Branch 54 → 137 not taken.
✓ Branch 55 → 56 taken 1 time.
✗ Branch 55 → 135 not taken.
✓ Branch 56 → 57 taken 1 time.
✗ Branch 56 → 133 not taken.
✓ Branch 62 → 63 taken 1 time.
✗ Branch 62 → 148 not taken.
✓ Branch 63 → 64 taken 1 time.
✗ Branch 63 → 148 not taken.
 1 SOFT_ERROR_ER(node, OPERATOR_WRONG_DATA_TYPE,
104 "True and false operands in ternary must be of same data type. Got " + trueType.getName(true) + " and " +
105 falseType.getName(true))
106
107 // If there is an anonymous symbol attached to left or right, remove it,
108 // since the result takes over the ownership of any destructible object.
109 511 bool removedAnonymousSymbols = false;
110
2/2
✓ Branch 66 → 67 taken 136 times.
✓ Branch 66 → 78 taken 375 times.
 511 if (trueEntry) {
111
2/2
✓ Branch 67 → 68 taken 90 times.
✓ Branch 67 → 70 taken 46 times.
 136 if (trueEntry->anonymous) {
112
1/2
✓ Branch 68 → 69 taken 90 times.
✗ Branch 68 → 150 not taken.
 90 currentScope->symbolTable.deleteAnonymous(trueEntry->name);
113 90 removedAnonymousSymbols = true;
114
8/10
✓ Branch 70 → 71 taken 46 times.
✗ Branch 70 → 150 not taken.
✓ Branch 71 → 72 taken 38 times.
✓ Branch 71 → 75 taken 8 times.
✓ Branch 72 → 73 taken 38 times.
✗ Branch 72 → 150 not taken.
✓ Branch 73 → 74 taken 8 times.
✓ Branch 73 → 75 taken 30 times.
✓ Branch 76 → 77 taken 8 times.
✓ Branch 76 → 78 taken 38 times.
 46 } else if (!trueType.isRef() && !trueType.isTriviallyCopyable(node)) {
115 8 node->trueSideCallsCopyCtor = true;
116 }
117 }
118
2/2
✓ Branch 78 → 79 taken 347 times.
✓ Branch 78 → 90 taken 164 times.
 511 if (falseEntry) {
119
2/2
✓ Branch 79 → 80 taken 89 times.
✓ Branch 79 → 82 taken 258 times.
 347 if (falseEntry->anonymous) {
120
1/2
✓ Branch 80 → 81 taken 89 times.
✗ Branch 80 → 150 not taken.
 89 currentScope->symbolTable.deleteAnonymous(falseEntry->name);
121 89 removedAnonymousSymbols = true;
122
8/10
✓ Branch 82 → 83 taken 258 times.
✗ Branch 82 → 150 not taken.
✓ Branch 83 → 84 taken 249 times.
✓ Branch 83 → 87 taken 9 times.
✓ Branch 84 → 85 taken 249 times.
✗ Branch 84 → 150 not taken.
✓ Branch 85 → 86 taken 8 times.
✓ Branch 85 → 87 taken 241 times.
✓ Branch 88 → 89 taken 8 times.
✓ Branch 88 → 90 taken 250 times.
 258 } else if (!falseType.isRef() && !falseType.isTriviallyCopyable(node)) {
123 8 node->falseSideCallsCopyCtor = true;
124 }
125 }
126
127 // Create a new anonymous symbol for the result if required
128 511 const QualType &resultType = trueType;
129 511 SymbolTableEntry *anonymousSymbol = nullptr;
130
4/4
✓ Branch 90 → 91 taken 503 times.
✓ Branch 90 → 92 taken 8 times.
✓ Branch 91 → 92 taken 2 times.
✓ Branch 91 → 93 taken 501 times.
 511 const bool calledCopyCtor = node->trueSideCallsCopyCtor || node->falseSideCallsCopyCtor;
131
9/10
✓ Branch 94 → 95 taken 419 times.
✓ Branch 94 → 98 taken 92 times.
✓ Branch 95 → 96 taken 413 times.
✓ Branch 95 → 98 taken 6 times.
✓ Branch 96 → 97 taken 413 times.
✗ Branch 96 → 150 not taken.
✓ Branch 97 → 98 taken 9 times.
✓ Branch 97 → 99 taken 404 times.
✓ Branch 100 → 101 taken 107 times.
✓ Branch 100 → 103 taken 404 times.
 511 if (removedAnonymousSymbols || calledCopyCtor || resultType.isRef())
132
1/2
✓ Branch 101 → 102 taken 107 times.
✗ Branch 101 → 150 not taken.
 107 anonymousSymbol = currentScope->symbolTable.insertAnonymous(resultType, node);
133
134 // Look up the copy ctor if at least one side needs it
135
4/4
✓ Branch 103 → 104 taken 503 times.
✓ Branch 103 → 105 taken 8 times.
✓ Branch 104 → 105 taken 2 times.
✓ Branch 104 → 107 taken 501 times.
 511 if (node->trueSideCallsCopyCtor || node->falseSideCallsCopyCtor)
136
1/2
✓ Branch 105 → 106 taken 10 times.
✗ Branch 105 → 150 not taken.
 10 node->calledCopyCtor = matchCopyCtor(trueTypeModified, node);
137
138
2/4
✓ Branch 107 → 108 taken 511 times.
✗ Branch 107 → 149 not taken.
✓ Branch 108 → 109 taken 511 times.
✗ Branch 108 → 149 not taken.
 511 return ExprResult{node->setEvaluatedSymbolType(resultType, manIdx), anonymousSymbol};
139 }
140
141 79142 std::any TypeChecker::visitLogicalOrExpr(LogicalOrExprNode *node) {
142 // Check if a logical or operator is applied
143
2/2
✓ Branch 3 → 4 taken 78174 times.
✓ Branch 3 → 7 taken 968 times.
 79142 if (node->operands.size() == 1)
144
2/2
✓ Branch 5 → 6 taken 78157 times.
✓ Branch 5 → 46 taken 17 times.
 78174 return visit(node->operands.front());
145
146 // Visit leftmost operand
147
2/4
✓ Branch 8 → 9 taken 968 times.
✗ Branch 8 → 39 not taken.
✓ Branch 9 → 10 taken 968 times.
✗ Branch 9 → 37 not taken.
 968 auto currentOperand = std::any_cast<ExprResult>(visit(node->operands[0]));
148
2/8
✓ Branch 11 → 12 taken 968 times.
✗ Branch 11 → 46 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 968 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 40 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 40 not taken.
 968 HANDLE_UNRESOLVED_TYPE_ER(currentOperand.type)
149
150 // Loop through all remaining operands
151
2/2
✓ Branch 31 → 18 taken 1241 times.
✓ Branch 31 → 32 taken 967 times.
 2208 for (size_t i = 1; i < node->operands.size(); i++) {
152
2/4
✓ Branch 19 → 20 taken 1241 times.
✗ Branch 19 → 43 not taken.
✓ Branch 20 → 21 taken 1241 times.
✗ Branch 20 → 41 not taken.
 1241 auto rhsOperand = std::any_cast<ExprResult>(visit(node->operands[i]));
153
2/8
✓ Branch 22 → 23 taken 1241 times.
✗ Branch 22 → 45 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 1241 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 44 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 44 not taken.
 1241 HANDLE_UNRESOLVED_TYPE_ER(rhsOperand.type)
154
2/2
✓ Branch 28 → 29 taken 1240 times.
✓ Branch 28 → 45 taken 1 time.
 1241 currentOperand = {OpRuleManager::getLogicalOrResultType(node, currentOperand, rhsOperand)};
155 }
156
157
1/2
✓ Branch 32 → 33 taken 967 times.
✗ Branch 32 → 46 not taken.
 967 node->setEvaluatedSymbolType(currentOperand.type, manIdx);
158
1/2
✓ Branch 33 → 34 taken 967 times.
✗ Branch 33 → 46 not taken.
 967 return currentOperand;
159 }
160
161 80383 std::any TypeChecker::visitLogicalAndExpr(LogicalAndExprNode *node) {
162 // Check if a logical and operator is applied
163
2/2
✓ Branch 3 → 4 taken 80197 times.
✓ Branch 3 → 7 taken 186 times.
 80383 if (node->operands.size() == 1)
164
2/2
✓ Branch 5 → 6 taken 80180 times.
✓ Branch 5 → 46 taken 17 times.
 80197 return visit(node->operands.front());
165
166 // Visit leftmost operand
167
2/4
✓ Branch 8 → 9 taken 186 times.
✗ Branch 8 → 39 not taken.
✓ Branch 9 → 10 taken 186 times.
✗ Branch 9 → 37 not taken.
 186 auto currentOperand = std::any_cast<ExprResult>(visit(node->operands[0]));
168
2/8
✓ Branch 11 → 12 taken 186 times.
✗ Branch 11 → 46 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 186 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 40 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 40 not taken.
 186 HANDLE_UNRESOLVED_TYPE_ER(currentOperand.type)
169
170 // Loop through all remaining operands
171
2/2
✓ Branch 31 → 18 taken 221 times.
✓ Branch 31 → 32 taken 186 times.
 407 for (size_t i = 1; i < node->operands.size(); i++) {
172
2/4
✓ Branch 19 → 20 taken 221 times.
✗ Branch 19 → 43 not taken.
✓ Branch 20 → 21 taken 221 times.
✗ Branch 20 → 41 not taken.
 221 auto rhsOperand = std::any_cast<ExprResult>(visit(node->operands[i]));
173
2/8
✓ Branch 22 → 23 taken 221 times.
✗ Branch 22 → 45 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 221 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 44 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 44 not taken.
 221 HANDLE_UNRESOLVED_TYPE_ER(rhsOperand.type)
174
1/2
✓ Branch 28 → 29 taken 221 times.
✗ Branch 28 → 45 not taken.
 221 currentOperand = {OpRuleManager::getLogicalAndResultType(node, currentOperand, rhsOperand)};
175 }
176
177
1/2
✓ Branch 32 → 33 taken 186 times.
✗ Branch 32 → 46 not taken.
 186 node->setEvaluatedSymbolType(currentOperand.type, manIdx);
178
1/2
✓ Branch 33 → 34 taken 186 times.
✗ Branch 33 → 46 not taken.
 186 return currentOperand;
179 }
180
181 80604 std::any TypeChecker::visitBitwiseOrExpr(BitwiseOrExprNode *node) {
182 // Check if a bitwise or operator is applied
183
2/2
✓ Branch 3 → 4 taken 80510 times.
✓ Branch 3 → 7 taken 94 times.
 80604 if (node->operands.size() == 1)
184
2/2
✓ Branch 5 → 6 taken 80494 times.
✓ Branch 5 → 46 taken 16 times.
 80510 return visit(node->operands.front());
185
186 // Visit leftmost operand
187
2/4
✓ Branch 8 → 9 taken 94 times.
✗ Branch 8 → 39 not taken.
✓ Branch 9 → 10 taken 94 times.
✗ Branch 9 → 37 not taken.
 94 auto currentOperand = std::any_cast<ExprResult>(visit(node->operands[0]));
188
2/8
✓ Branch 11 → 12 taken 94 times.
✗ Branch 11 → 46 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 94 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 40 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 40 not taken.
 94 HANDLE_UNRESOLVED_TYPE_ER(currentOperand.type)
189
190 // Loop through all remaining operands
191
2/2
✓ Branch 31 → 18 taken 97 times.
✓ Branch 31 → 32 taken 93 times.
 190 for (size_t i = 1; i < node->operands.size(); i++) {
192
2/4
✓ Branch 19 → 20 taken 97 times.
✗ Branch 19 → 43 not taken.
✓ Branch 20 → 21 taken 97 times.
✗ Branch 20 → 41 not taken.
 97 auto rhsOperand = std::any_cast<ExprResult>(visit(node->operands[i]));
193
2/8
✓ Branch 22 → 23 taken 97 times.
✗ Branch 22 → 45 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 97 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 44 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 44 not taken.
 97 HANDLE_UNRESOLVED_TYPE_ER(rhsOperand.type)
194
2/2
✓ Branch 28 → 29 taken 96 times.
✓ Branch 28 → 45 taken 1 time.
 97 currentOperand = {OpRuleManager::getBitwiseOrResultType(node, currentOperand, rhsOperand)};
195 }
196
197
1/2
✓ Branch 32 → 33 taken 93 times.
✗ Branch 32 → 46 not taken.
 93 node->setEvaluatedSymbolType(currentOperand.type, manIdx);
198
1/2
✓ Branch 33 → 34 taken 93 times.
✗ Branch 33 → 46 not taken.
 93 return currentOperand;
199 }
200
201 80701 std::any TypeChecker::visitBitwiseXorExpr(BitwiseXorExprNode *node) {
202 // Check if a bitwise xor operator is applied
203
2/2
✓ Branch 3 → 4 taken 80685 times.
✓ Branch 3 → 7 taken 16 times.
 80701 if (node->operands.size() == 1)
204
2/2
✓ Branch 5 → 6 taken 80669 times.
✓ Branch 5 → 46 taken 16 times.
 80685 return visit(node->operands.front());
205
206 // Visit leftmost operand
207
2/4
✓ Branch 8 → 9 taken 16 times.
✗ Branch 8 → 39 not taken.
✓ Branch 9 → 10 taken 16 times.
✗ Branch 9 → 37 not taken.
 16 auto currentOperand = std::any_cast<ExprResult>(visit(node->operands[0]));
208
2/8
✓ Branch 11 → 12 taken 16 times.
✗ Branch 11 → 46 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 16 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 40 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 40 not taken.
 16 HANDLE_UNRESOLVED_TYPE_ER(currentOperand.type)
209
210 // Loop through all remaining operands
211
2/2
✓ Branch 31 → 18 taken 19 times.
✓ Branch 31 → 32 taken 16 times.
 35 for (size_t i = 1; i < node->operands.size(); i++) {
212
2/4
✓ Branch 19 → 20 taken 19 times.
✗ Branch 19 → 43 not taken.
✓ Branch 20 → 21 taken 19 times.
✗ Branch 20 → 41 not taken.
 19 auto rhsOperand = std::any_cast<ExprResult>(visit(node->operands[i]));
213
2/8
✓ Branch 22 → 23 taken 19 times.
✗ Branch 22 → 45 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 19 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 44 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 44 not taken.
 19 HANDLE_UNRESOLVED_TYPE_ER(rhsOperand.type)
214
1/2
✓ Branch 28 → 29 taken 19 times.
✗ Branch 28 → 45 not taken.
 19 currentOperand = {OpRuleManager::getBitwiseXorResultType(node, currentOperand, rhsOperand)};
215 }
216
217
1/2
✓ Branch 32 → 33 taken 16 times.
✗ Branch 32 → 46 not taken.
 16 node->setEvaluatedSymbolType(currentOperand.type, manIdx);
218
1/2
✓ Branch 33 → 34 taken 16 times.
✗ Branch 33 → 46 not taken.
 16 return currentOperand;
219 }
220
221 80720 std::any TypeChecker::visitBitwiseAndExpr(BitwiseAndExprNode *node) {
222 // Check if a bitwise and operator is applied
223
2/2
✓ Branch 3 → 4 taken 80672 times.
✓ Branch 3 → 7 taken 48 times.
 80720 if (node->operands.size() == 1)
224
2/2
✓ Branch 5 → 6 taken 80656 times.
✓ Branch 5 → 46 taken 16 times.
 80672 return visit(node->operands.front());
225
226 // Visit leftmost operand
227
2/4
✓ Branch 8 → 9 taken 48 times.
✗ Branch 8 → 39 not taken.
✓ Branch 9 → 10 taken 48 times.
✗ Branch 9 → 37 not taken.
 48 auto currentOperand = std::any_cast<ExprResult>(visit(node->operands[0]));
228
2/8
✓ Branch 11 → 12 taken 48 times.
✗ Branch 11 → 46 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 48 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 40 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 40 not taken.
 48 HANDLE_UNRESOLVED_TYPE_ER(currentOperand.type)
229
230 // Loop through all remaining operands
231
2/2
✓ Branch 31 → 18 taken 51 times.
✓ Branch 31 → 32 taken 48 times.
 99 for (size_t i = 1; i < node->operands.size(); i++) {
232
2/4
✓ Branch 19 → 20 taken 51 times.
✗ Branch 19 → 43 not taken.
✓ Branch 20 → 21 taken 51 times.
✗ Branch 20 → 41 not taken.
 51 auto rhsOperand = std::any_cast<ExprResult>(visit(node->operands[i]));
233
2/8
✓ Branch 22 → 23 taken 51 times.
✗ Branch 22 → 45 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 51 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 44 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 44 not taken.
 51 HANDLE_UNRESOLVED_TYPE_ER(rhsOperand.type)
234
1/2
✓ Branch 28 → 29 taken 51 times.
✗ Branch 28 → 45 not taken.
 51 currentOperand = {OpRuleManager::getBitwiseAndResultType(node, currentOperand, rhsOperand)};
235 }
236
237
1/2
✓ Branch 32 → 33 taken 48 times.
✗ Branch 32 → 46 not taken.
 48 node->setEvaluatedSymbolType(currentOperand.type, manIdx);
238
1/2
✓ Branch 33 → 34 taken 48 times.
✗ Branch 33 → 46 not taken.
 48 return currentOperand;
239 }
240
241 80771 std::any TypeChecker::visitEqualityExpr(EqualityExprNode *node) {
242 // Check if at least one equality operator is applied
243
2/2
✓ Branch 3 → 4 taken 74791 times.
✓ Branch 3 → 7 taken 5980 times.
 80771 if (node->operands.size() == 1)
244
2/2
✓ Branch 5 → 6 taken 74776 times.
✓ Branch 5 → 73 taken 15 times.
 74791 return visit(node->operands.front());
245
246 // Visit right side first, then left side
247
2/4
✓ Branch 8 → 9 taken 5980 times.
✗ Branch 8 → 58 not taken.
✓ Branch 9 → 10 taken 5980 times.
✗ Branch 9 → 56 not taken.
 5980 const auto rhs = std::any_cast<ExprResult>(visit(node->operands[1]));
248
2/8
✓ Branch 11 → 12 taken 5980 times.
✗ Branch 11 → 73 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 5980 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 59 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 59 not taken.
 5980 HANDLE_UNRESOLVED_TYPE_ER(rhs.type)
249
2/4
✓ Branch 18 → 19 taken 5980 times.
✗ Branch 18 → 62 not taken.
✓ Branch 19 → 20 taken 5980 times.
✗ Branch 19 → 60 not taken.
 5980 const auto lhs = std::any_cast<ExprResult>(visit(node->operands[0]));
250
2/8
✓ Branch 21 → 22 taken 5980 times.
✗ Branch 21 → 73 not taken.
✗ Branch 22 → 23 not taken.
✓ Branch 22 → 27 taken 5980 times.
✗ Branch 23 → 24 not taken.
✗ Branch 23 → 63 not taken.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 63 not taken.
 5980 HANDLE_UNRESOLVED_TYPE_ER(lhs.type)
251
252 // Check if we need the string runtime to perform a string comparison
253
10/14
✓ Branch 27 → 28 taken 5980 times.
✗ Branch 27 → 73 not taken.
✓ Branch 28 → 29 taken 152 times.
✓ Branch 28 → 36 taken 5828 times.
✓ Branch 29 → 30 taken 152 times.
✗ Branch 29 → 73 not taken.
✓ Branch 30 → 31 taken 151 times.
✓ Branch 30 → 36 taken 1 time.
✓ Branch 31 → 32 taken 151 times.
✗ Branch 31 → 73 not taken.
✓ Branch 34 → 35 taken 151 times.
✗ Branch 34 → 36 not taken.
✓ Branch 37 → 38 taken 151 times.
✓ Branch 37 → 39 taken 5829 times.
 6131 if (lhs.type.is(TY_STRING) && rhs.type.is(TY_STRING) && !sourceFile->isStringRT())
254
1/2
✓ Branch 38 → 39 taken 151 times.
✗ Branch 38 → 73 not taken.
 151 sourceFile->requestRuntimeModule(STRING_RT);
255
256 // Check operator
257 5980 ExprResult result;
258
2/2
✓ Branch 39 → 40 taken 4358 times.
✓ Branch 39 → 41 taken 1622 times.
 5980 if (node->op == EqualityExprNode::EqualityOp::OP_EQUAL) // Operator was equal
259
2/2
✓ Branch 40 → 51 taken 4357 times.
✓ Branch 40 → 73 taken 1 time.
 4358 result = opRuleManager.getEqualResultType(node, lhs, rhs, 0);
260
1/2
✓ Branch 41 → 42 taken 1622 times.
✗ Branch 41 → 43 not taken.
 1622 else if (node->op == EqualityExprNode::EqualityOp::OP_NOT_EQUAL) // Operator was not equal
261
1/2
✓ Branch 42 → 51 taken 1622 times.
✗ Branch 42 → 73 not taken.
 1622 result = opRuleManager.getNotEqualResultType(node, lhs, rhs, 0);
262 else
263 − throw CompilerError(UNHANDLED_BRANCH, "EqualityExpr fall-through"); // GCOV_EXCL_LINE
264
265
1/2
✓ Branch 51 → 52 taken 5979 times.
✗ Branch 51 → 73 not taken.
 5979 node->setEvaluatedSymbolType(result.type, manIdx);
266
1/2
✓ Branch 52 → 53 taken 5979 times.
✗ Branch 52 → 73 not taken.
 5979 return result;
267 }
268
269 86751 std::any TypeChecker::visitRelationalExpr(RelationalExprNode *node) {
270 // Check if a relational operator is applied
271
2/2
✓ Branch 3 → 4 taken 82728 times.
✓ Branch 3 → 7 taken 4023 times.
 86751 if (node->operands.size() == 1)
272
2/2
✓ Branch 5 → 6 taken 82714 times.
✓ Branch 5 → 75 taken 14 times.
 82728 return visit(node->operands.front());
273
274 // Visit right side first, then left side
275
2/4
✓ Branch 8 → 9 taken 4023 times.
✗ Branch 8 → 55 not taken.
✓ Branch 9 → 10 taken 4023 times.
✗ Branch 9 → 53 not taken.
 4023 const auto rhs = std::any_cast<ExprResult>(visit(node->operands[1]));
276
5/8
✓ Branch 11 → 12 taken 4023 times.
✗ Branch 11 → 75 not taken.
✓ Branch 12 → 13 taken 1 time.
✓ Branch 12 → 17 taken 4022 times.
✓ Branch 13 → 14 taken 1 time.
✗ Branch 13 → 56 not taken.
✓ Branch 14 → 15 taken 1 time.
✗ Branch 14 → 56 not taken.
 4023 HANDLE_UNRESOLVED_TYPE_ER(rhs.type)
277
2/4
✓ Branch 18 → 19 taken 4022 times.
✗ Branch 18 → 59 not taken.
✓ Branch 19 → 20 taken 4022 times.
✗ Branch 19 → 57 not taken.
 4022 const auto lhs = std::any_cast<ExprResult>(visit(node->operands[0]));
278
2/8
✓ Branch 21 → 22 taken 4022 times.
✗ Branch 21 → 75 not taken.
✗ Branch 22 → 23 not taken.
✓ Branch 22 → 27 taken 4022 times.
✗ Branch 23 → 24 not taken.
✗ Branch 23 → 60 not taken.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 60 not taken.
 4022 HANDLE_UNRESOLVED_TYPE_ER(lhs.type)
279
280 // Check operator
281 4022 QualType resultType;
282
2/2
✓ Branch 27 → 28 taken 1978 times.
✓ Branch 27 → 30 taken 2044 times.
 4022 if (node->op == RelationalExprNode::RelationalOp::OP_LESS) // Operator was less
283
1/2
✓ Branch 28 → 29 taken 1978 times.
✗ Branch 28 → 61 not taken.
 1978 resultType = OpRuleManager::getLessResultType(node, lhs, rhs);
284
2/2
✓ Branch 30 → 31 taken 564 times.
✓ Branch 30 → 33 taken 1480 times.
 2044 else if (node->op == RelationalExprNode::RelationalOp::OP_GREATER) // Operator was greater
285
2/2
✓ Branch 31 → 32 taken 563 times.
✓ Branch 31 → 62 taken 1 time.
 564 resultType = OpRuleManager::getGreaterResultType(node, lhs, rhs);
286
2/2
✓ Branch 33 → 34 taken 424 times.
✓ Branch 33 → 36 taken 1056 times.
 1480 else if (node->op == RelationalExprNode::RelationalOp::OP_LESS_EQUAL) // Operator was less equal
287
1/2
✓ Branch 34 → 35 taken 424 times.
✗ Branch 34 → 63 not taken.
 424 resultType = OpRuleManager::getLessEqualResultType(node, lhs, rhs);
288
1/2
✓ Branch 36 → 37 taken 1056 times.
✗ Branch 36 → 39 not taken.
 1056 else if (node->op == RelationalExprNode::RelationalOp::OP_GREATER_EQUAL) // Operator was greater equal
289
1/2
✓ Branch 37 → 38 taken 1056 times.
✗ Branch 37 → 64 not taken.
 1056 resultType = OpRuleManager::getGreaterEqualResultType(node, lhs, rhs);
290 else
291 − throw CompilerError(UNHANDLED_BRANCH, "RelationalExpr fall-through"); // GCOV_EXCL_LINE
292
293
2/4
✓ Branch 47 → 48 taken 4021 times.
✗ Branch 47 → 74 not taken.
✓ Branch 48 → 49 taken 4021 times.
✗ Branch 48 → 74 not taken.
 4021 return ExprResult{node->setEvaluatedSymbolType(resultType, manIdx)};
294 }
295
296 90773 std::any TypeChecker::visitShiftExpr(ShiftExprNode *node) {
297 // Check if at least one shift operator is applied
298
2/2
✓ Branch 3 → 4 taken 90634 times.
✓ Branch 3 → 7 taken 139 times.
 90773 if (node->operands.size() == 1)
299
2/2
✓ Branch 5 → 6 taken 90620 times.
✓ Branch 5 → 69 taken 14 times.
 90634 return visit(node->operands.front());
300
301 // Visit leftmost operand
302
2/4
✓ Branch 8 → 9 taken 139 times.
✗ Branch 8 → 53 not taken.
✓ Branch 9 → 10 taken 139 times.
✗ Branch 9 → 51 not taken.
 139 auto currentResult = std::any_cast<ExprResult>(visit(node->operands[0]));
303
2/8
✓ Branch 11 → 12 taken 139 times.
✗ Branch 11 → 69 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 139 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 54 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 54 not taken.
 139 HANDLE_UNRESOLVED_TYPE_ER(currentResult.type)
304
305 // Loop through remaining operands
306
2/2
✓ Branch 45 → 18 taken 179 times.
✓ Branch 45 → 46 taken 139 times.
 318 for (size_t i = 0; i < node->opQueue.size(); i++) {
307
2/4
✓ Branch 19 → 20 taken 179 times.
✗ Branch 19 → 57 not taken.
✓ Branch 20 → 21 taken 179 times.
✗ Branch 20 → 55 not taken.
 179 auto operandResult = std::any_cast<ExprResult>(visit(node->operands[i + 1]));
308
2/8
✓ Branch 22 → 23 taken 179 times.
✗ Branch 22 → 68 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 179 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 58 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 58 not taken.
 179 HANDLE_UNRESOLVED_TYPE_ER(operandResult.type)
309
310 // Check operator
311 179 const ShiftExprNode::ShiftOp &op = node->opQueue.front().first;
312
2/2
✓ Branch 29 → 30 taken 110 times.
✓ Branch 29 → 31 taken 69 times.
 179 if (op == ShiftExprNode::ShiftOp::OP_SHIFT_LEFT)
313
1/2
✓ Branch 30 → 41 taken 110 times.
✗ Branch 30 → 68 not taken.
 110 currentResult = opRuleManager.getShiftLeftResultType(node, currentResult, operandResult, i);
314
1/2
✓ Branch 31 → 32 taken 69 times.
✗ Branch 31 → 33 not taken.
 69 else if (op == ShiftExprNode::ShiftOp::OP_SHIFT_RIGHT)
315
1/2
✓ Branch 32 → 41 taken 69 times.
✗ Branch 32 → 68 not taken.
 69 currentResult = opRuleManager.getShiftRightResultType(node, currentResult, operandResult, i);
316 else
317 − throw CompilerError(UNHANDLED_BRANCH, "ShiftExpr fall-through"); // GCOV_EXCL_LINE
318
319 // Push the new item and pop the old one on the other side of the queue
320
1/2
✓ Branch 41 → 42 taken 179 times.
✗ Branch 41 → 68 not taken.
 179 node->opQueue.emplace(op, currentResult.type);
321 179 node->opQueue.pop();
322 }
323
324
1/2
✓ Branch 46 → 47 taken 139 times.
✗ Branch 46 → 69 not taken.
 139 node->setEvaluatedSymbolType(currentResult.type, manIdx);
325
1/2
✓ Branch 47 → 48 taken 139 times.
✗ Branch 47 → 69 not taken.
 139 return currentResult;
326 }
327
328 90952 std::any TypeChecker::visitAdditiveExpr(AdditiveExprNode *node) {
329 // Check if at least one additive operator is applied
330
2/2
✓ Branch 3 → 4 taken 86501 times.
✓ Branch 3 → 7 taken 4451 times.
 90952 if (node->operands.size() == 1)
331
2/2
✓ Branch 5 → 6 taken 86488 times.
✓ Branch 5 → 69 taken 13 times.
 86501 return visit(node->operands.front());
332
333 // Visit leftmost operand
334
2/4
✓ Branch 8 → 9 taken 4451 times.
✗ Branch 8 → 53 not taken.
✓ Branch 9 → 10 taken 4451 times.
✗ Branch 9 → 51 not taken.
 4451 auto currentResult = std::any_cast<ExprResult>(visit(node->operands[0]));
335
2/8
✓ Branch 11 → 12 taken 4451 times.
✗ Branch 11 → 69 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 4451 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 54 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 54 not taken.
 4451 HANDLE_UNRESOLVED_TYPE_ER(currentResult.type)
336
337 // Loop through remaining operands
338
2/2
✓ Branch 45 → 18 taken 5078 times.
✓ Branch 45 → 46 taken 4450 times.
 9528 for (size_t i = 0; i < node->opQueue.size(); i++) {
339
2/4
✓ Branch 19 → 20 taken 5078 times.
✗ Branch 19 → 57 not taken.
✓ Branch 20 → 21 taken 5078 times.
✗ Branch 20 → 55 not taken.
 5078 auto operandResult = std::any_cast<ExprResult>(visit(node->operands[i + 1]));
340
2/8
✓ Branch 22 → 23 taken 5078 times.
✗ Branch 22 → 68 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 5078 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 58 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 58 not taken.
 5078 HANDLE_UNRESOLVED_TYPE_ER(operandResult.type)
341
342 // Check operator
343 5078 const AdditiveExprNode::AdditiveOp &op = node->opQueue.front().first;
344
2/2
✓ Branch 29 → 30 taken 3102 times.
✓ Branch 29 → 31 taken 1976 times.
 5078 if (op == AdditiveExprNode::AdditiveOp::OP_PLUS)
345
2/2
✓ Branch 30 → 41 taken 3101 times.
✓ Branch 30 → 68 taken 1 time.
 3102 currentResult = opRuleManager.getPlusResultType(node, currentResult, operandResult, i);
346
1/2
✓ Branch 31 → 32 taken 1976 times.
✗ Branch 31 → 33 not taken.
 1976 else if (op == AdditiveExprNode::AdditiveOp::OP_MINUS)
347
1/2
✓ Branch 32 → 41 taken 1976 times.
✗ Branch 32 → 68 not taken.
 1976 currentResult = opRuleManager.getMinusResultType(node, currentResult, operandResult, i);
348 else
349 − throw CompilerError(UNHANDLED_BRANCH, "AdditiveExpr fall-through"); // GCOV_EXCL_LINE
350
351 // Push the new item and pop the old one on the other side of the queue
352
1/2
✓ Branch 41 → 42 taken 5077 times.
✗ Branch 41 → 68 not taken.
 5077 node->opQueue.emplace(op, currentResult.type);
353 5077 node->opQueue.pop();
354 }
355
356
1/2
✓ Branch 46 → 47 taken 4450 times.
✗ Branch 46 → 69 not taken.
 4450 node->setEvaluatedSymbolType(currentResult.type, manIdx);
357
1/2
✓ Branch 47 → 48 taken 4450 times.
✗ Branch 47 → 69 not taken.
 4450 return currentResult;
358 }
359
360 96030 std::any TypeChecker::visitMultiplicativeExpr(MultiplicativeExprNode *node) {
361 // Check if at least one multiplicative operator is applied
362
2/2
✓ Branch 3 → 4 taken 95054 times.
✓ Branch 3 → 7 taken 976 times.
 96030 if (node->operands.size() == 1)
363
2/2
✓ Branch 5 → 6 taken 95042 times.
✓ Branch 5 → 71 taken 12 times.
 95054 return visit(node->operands.front());
364
365 // Visit leftmost operand
366
2/4
✓ Branch 8 → 9 taken 976 times.
✗ Branch 8 → 55 not taken.
✓ Branch 9 → 10 taken 976 times.
✗ Branch 9 → 53 not taken.
 976 auto currentResult = std::any_cast<ExprResult>(visit(node->operands[0]));
367
2/8
✓ Branch 11 → 12 taken 976 times.
✗ Branch 11 → 71 not taken.
✗ Branch 12 → 13 not taken.
✓ Branch 12 → 17 taken 976 times.
✗ Branch 13 → 14 not taken.
✗ Branch 13 → 56 not taken.
✗ Branch 14 → 15 not taken.
✗ Branch 14 → 56 not taken.
 976 HANDLE_UNRESOLVED_TYPE_ER(currentResult.type)
368 // Loop through remaining operands
369
2/2
✓ Branch 47 → 18 taken 1000 times.
✓ Branch 47 → 48 taken 975 times.
 1975 for (size_t i = 0; i < node->opQueue.size(); i++) {
370
2/4
✓ Branch 19 → 20 taken 1000 times.
✗ Branch 19 → 59 not taken.
✓ Branch 20 → 21 taken 1000 times.
✗ Branch 20 → 57 not taken.
 1000 auto operandResult = std::any_cast<ExprResult>(visit(node->operands[i + 1]));
371
2/8
✓ Branch 22 → 23 taken 1000 times.
✗ Branch 22 → 70 not taken.
✗ Branch 23 → 24 not taken.
✓ Branch 23 → 28 taken 1000 times.
✗ Branch 24 → 25 not taken.
✗ Branch 24 → 60 not taken.
✗ Branch 25 → 26 not taken.
✗ Branch 25 → 60 not taken.
 1000 HANDLE_UNRESOLVED_TYPE_ER(operandResult.type)
372
373 // Check operator
374 1000 const MultiplicativeExprNode::MultiplicativeOp &op = node->opQueue.front().first;
375
2/2
✓ Branch 29 → 30 taken 816 times.
✓ Branch 29 → 31 taken 184 times.
 1000 if (op == MultiplicativeExprNode::MultiplicativeOp::OP_MUL)
376
2/2
✓ Branch 30 → 43 taken 815 times.
✓ Branch 30 → 70 taken 1 time.
 816 currentResult = opRuleManager.getMulResultType(node, currentResult, operandResult, i);
377
2/2
✓ Branch 31 → 32 taken 162 times.
✓ Branch 31 → 33 taken 22 times.
 184 else if (op == MultiplicativeExprNode::MultiplicativeOp::OP_DIV)
378
1/2
✓ Branch 32 → 43 taken 162 times.
✗ Branch 32 → 70 not taken.
 162 currentResult = opRuleManager.getDivResultType(node, currentResult, operandResult, i);
379
1/2
✓ Branch 33 → 34 taken 22 times.
✗ Branch 33 → 35 not taken.
 22 else if (op == MultiplicativeExprNode::MultiplicativeOp::OP_REM)
380
1/2
✓ Branch 34 → 43 taken 22 times.
✗ Branch 34 → 70 not taken.
 22 currentResult = OpRuleManager::getRemResultType(node, currentResult, operandResult);
381 else
382 − throw CompilerError(UNHANDLED_BRANCH, "Multiplicative fall-through"); // GCOV_EXCL_LINE
383
384 // Push the new item and pop the old one on the other side of the queue
385
1/2
✓ Branch 43 → 44 taken 999 times.
✗ Branch 43 → 70 not taken.
 999 node->opQueue.emplace(op, currentResult.type);
386 999 node->opQueue.pop();
387 }
388
389
1/2
✓ Branch 48 → 49 taken 975 times.
✗ Branch 48 → 71 not taken.
 975 node->setEvaluatedSymbolType(currentResult.type, manIdx);
390
1/2
✓ Branch 49 → 50 taken 975 times.
✗ Branch 49 → 71 not taken.
 975 return currentResult;
391 }
392
393 97030 std::any TypeChecker::visitCastExpr(CastExprNode *node) {
394 // Check if cast is applied
395
2/2
✓ Branch 2 → 3 taken 94329 times.
✓ Branch 2 → 5 taken 2701 times.
 97030 if (!node->isCast)
396
2/2
✓ Branch 3 → 4 taken 94317 times.
✓ Branch 3 → 65 taken 12 times.
 94329 return visit(node->prefixUnaryExpr);
397
398 // Visit destination type
399
2/4
✓ Branch 5 → 6 taken 2701 times.
✗ Branch 5 → 49 not taken.
✓ Branch 6 → 7 taken 2701 times.
✗ Branch 6 → 47 not taken.
 2701 const auto dstType = std::any_cast<QualType>(visit(node->dataType));
400
2/8
✓ Branch 8 → 9 taken 2701 times.
✗ Branch 8 → 65 not taken.
✗ Branch 9 → 10 not taken.
✓ Branch 9 → 14 taken 2701 times.
✗ Branch 10 → 11 not taken.
✗ Branch 10 → 50 not taken.
✗ Branch 11 → 12 not taken.
✗ Branch 11 → 50 not taken.
 2701 HANDLE_UNRESOLVED_TYPE_ER(dstType)
401 // Visit source type
402
2/4
✓ Branch 14 → 15 taken 2701 times.
✗ Branch 14 → 53 not taken.
✓ Branch 15 → 16 taken 2701 times.
✗ Branch 15 → 51 not taken.
 2701 const auto src = std::any_cast<ExprResult>(visit(node->assignExpr));
403
2/8
✓ Branch 17 → 18 taken 2701 times.
✗ Branch 17 → 65 not taken.
✗ Branch 18 → 19 not taken.
✓ Branch 18 → 23 taken 2701 times.
✗ Branch 19 → 20 not taken.
✗ Branch 19 → 54 not taken.
✗ Branch 20 → 21 not taken.
✗ Branch 20 → 54 not taken.
 2701 HANDLE_UNRESOLVED_TYPE_ER(src.type)
404
405 // Check for identity cast
406
3/4
✓ Branch 23 → 24 taken 2701 times.
✗ Branch 23 → 65 not taken.
✓ Branch 24 → 25 taken 271 times.
✓ Branch 24 → 34 taken 2430 times.
 2701 if (src.type == dstType) {
407
2/4
✓ Branch 27 → 28 taken 271 times.
✗ Branch 27 → 57 not taken.
✓ Branch 28 → 29 taken 271 times.
✗ Branch 28 → 55 not taken.
 271 const CompilerWarning warning(node->codeLoc, IDENTITY_CAST, "You cast from a type to itself. Thus, this can be simplified.");
408
1/2
✓ Branch 31 → 32 taken 271 times.
✗ Branch 31 → 61 not taken.
 271 sourceFile->compilerOutput.warnings.push_back(warning);
409 271 }
410
411 // Get result type
412
1/2
✓ Branch 34 → 35 taken 2701 times.
✗ Branch 34 → 65 not taken.
 2701 const QualType resultType = opRuleManager.getCastResultType(node, dstType, src);
413
414
1/2
✓ Branch 35 → 36 taken 2701 times.
✗ Branch 35 → 65 not taken.
 2701 const bool typesMatch = dstType.matches(src.type, false, true, true);
415
1/2
✓ Branch 36 → 37 taken 2701 times.
✗ Branch 36 → 65 not taken.
 2701 const bool sameContainerType = src.type.isSameContainerTypeAs(dstType);
416
4/4
✓ Branch 37 → 38 taken 2430 times.
✓ Branch 37 → 39 taken 271 times.
✓ Branch 38 → 39 taken 139 times.
✓ Branch 38 → 40 taken 2291 times.
 2701 SymbolTableEntry *entry = typesMatch || sameContainerType ? src.entry : nullptr;
417
2/4
✓ Branch 41 → 42 taken 2701 times.
✗ Branch 41 → 64 not taken.
✓ Branch 42 → 43 taken 2701 times.
✗ Branch 42 → 64 not taken.
 2701 return ExprResult{node->setEvaluatedSymbolType(resultType, manIdx), entry};
418 }
419
420 103298 std::any TypeChecker::visitPrefixUnaryExpr(PrefixUnaryExprNode *node) {
421 // If no operator is applied, simply visit the postfix unary expression
422
2/2
✓ Branch 2 → 3 taken 101170 times.
✓ Branch 2 → 5 taken 2128 times.
 103298 if (node->op == PrefixUnaryExprNode::PrefixUnaryOp::OP_NONE)
423
2/2
✓ Branch 3 → 4 taken 101160 times.
✓ Branch 3 → 78 taken 10 times.
 101170 return visit(node->postfixUnaryExpr);
424
425 // Visit the right side
426 2128 PrefixUnaryExprNode *rhsNode = node->prefixUnaryExpr;
427
2/4
✓ Branch 5 → 6 taken 2128 times.
✗ Branch 5 → 57 not taken.
✓ Branch 6 → 7 taken 2128 times.
✗ Branch 6 → 55 not taken.
 2128 auto operand = std::any_cast<ExprResult>(visit(rhsNode));
428 2128 auto [operandType, operandEntry] = operand;
429
5/8
✓ Branch 8 → 9 taken 2128 times.
✗ Branch 8 → 78 not taken.
✓ Branch 9 → 10 taken 1 time.
✓ Branch 9 → 14 taken 2127 times.
✓ Branch 10 → 11 taken 1 time.
✗ Branch 10 → 58 not taken.
✓ Branch 11 → 12 taken 1 time.
✗ Branch 11 → 58 not taken.
 2128 HANDLE_UNRESOLVED_TYPE_ER(operandType)
430 // Determine action, based on the given operator
431
7/8
✓ Branch 14 → 15 taken 893 times.
✓ Branch 14 → 17 taken 26 times.
✓ Branch 14 → 25 taken 11 times.
✓ Branch 14 → 33 taken 777 times.
✓ Branch 14 → 35 taken 5 times.
✓ Branch 14 → 37 taken 234 times.
✓ Branch 14 → 39 taken 181 times.
✗ Branch 14 → 41 not taken.
 2127 switch (node->op) {
432 893 case PrefixUnaryExprNode::PrefixUnaryOp::OP_MINUS:
433
1/2
✓ Branch 15 → 16 taken 893 times.
✗ Branch 15 → 59 not taken.
 893 operandType = OpRuleManager::getPrefixMinusResultType(node, operand);
434 893 break;
435 26 case PrefixUnaryExprNode::PrefixUnaryOp::OP_PLUS_PLUS:
436
1/2
✓ Branch 17 → 18 taken 26 times.
✗ Branch 17 → 60 not taken.
 26 operandType = opRuleManager.getPrefixPlusPlusResultType(node, operand);
437
438
2/2
✓ Branch 18 → 19 taken 23 times.
✓ Branch 18 → 24 taken 3 times.
 26 if (operandEntry) {
439 // In case the lhs is captured, notify the capture about the write access
440
2/4
✓ Branch 19 → 20 taken 23 times.
✗ Branch 19 → 78 not taken.
✗ Branch 20 → 21 not taken.
✓ Branch 20 → 22 taken 23 times.
 23 if (Capture *lhsCapture = currentScope->symbolTable.lookupCapture(operandEntry->name); lhsCapture)
441 ✗ lhsCapture->setAccessType(READ_WRITE);
442
443 // Update the state of the variable
444
1/2
✓ Branch 22 → 23 taken 23 times.
✗ Branch 22 → 61 not taken.
 23 operandEntry->updateState(INITIALIZED, node);
445 }
446
447 26 break;
448 11 case PrefixUnaryExprNode::PrefixUnaryOp::OP_MINUS_MINUS:
449
2/2
✓ Branch 25 → 26 taken 10 times.
✓ Branch 25 → 62 taken 1 time.
 11 operandType = opRuleManager.getPrefixMinusMinusResultType(node, operand);
450
451
2/2
✓ Branch 26 → 27 taken 7 times.
✓ Branch 26 → 32 taken 3 times.
 10 if (operandEntry) {
452 // In case the lhs is captured, notify the capture about the write access
453
2/4
✓ Branch 27 → 28 taken 7 times.
✗ Branch 27 → 78 not taken.
✗ Branch 28 → 29 not taken.
✓ Branch 28 → 30 taken 7 times.
 7 if (Capture *lhsCapture = currentScope->symbolTable.lookupCapture(operandEntry->name); lhsCapture)
454 ✗ lhsCapture->setAccessType(READ_WRITE);
455
456 // Update the state of the variable
457
1/2
✓ Branch 30 → 31 taken 7 times.
✗ Branch 30 → 63 not taken.
 7 operandEntry->updateState(INITIALIZED, node);
458 }
459
460 10 break;
461 777 case PrefixUnaryExprNode::PrefixUnaryOp::OP_NOT:
462
1/2
✓ Branch 33 → 34 taken 777 times.
✗ Branch 33 → 64 not taken.
 777 operandType = OpRuleManager::getPrefixNotResultType(node, operand);
463 777 break;
464 5 case PrefixUnaryExprNode::PrefixUnaryOp::OP_BITWISE_NOT:
465
1/2
✓ Branch 35 → 36 taken 5 times.
✗ Branch 35 → 65 not taken.
 5 operandType = OpRuleManager::getPrefixBitwiseNotResultType(node, operand);
466 5 break;
467 234 case PrefixUnaryExprNode::PrefixUnaryOp::OP_DEREFERENCE:
468
2/2
✓ Branch 37 → 38 taken 233 times.
✓ Branch 37 → 66 taken 1 time.
 234 operandType = OpRuleManager::getPrefixMulResultType(node, operand);
469 233 break;
470 181 case PrefixUnaryExprNode::PrefixUnaryOp::OP_ADDRESS_OF:
471
1/2
✓ Branch 39 → 40 taken 181 times.
✗ Branch 39 → 67 not taken.
 181 operandType = OpRuleManager::getPrefixBitwiseAndResultType(node, operand);
472 181 break;
473 − default: // GCOV_EXCL_LINE
474 − throw CompilerError(UNHANDLED_BRANCH, "PrefixUnaryExpr fall-through"); // GCOV_EXCL_LINE
475 }
476
477
2/4
✓ Branch 49 → 50 taken 2125 times.
✗ Branch 49 → 77 not taken.
✓ Branch 50 → 51 taken 2125 times.
✗ Branch 50 → 77 not taken.
 2125 return ExprResult{node->setEvaluatedSymbolType(operandType, manIdx), operandEntry};
478 }
479
480 123963 std::any TypeChecker::visitPostfixUnaryExpr(PostfixUnaryExprNode *node) {
481 // If no operator is applied, simply visit the atomic expression
482
2/2
✓ Branch 2 → 3 taken 101170 times.
✓ Branch 2 → 5 taken 22793 times.
 123963 if (node->op == PostfixUnaryExprNode::PostfixUnaryOp::OP_NONE)
483
2/2
✓ Branch 3 → 4 taken 101162 times.
✓ Branch 3 → 316 taken 8 times.
 101170 return visit(node->atomicExpr);
484
485 // Visit left side
486 22793 PostfixUnaryExprNode *lhsNode = node->postfixUnaryExpr;
487
2/4
✓ Branch 5 → 6 taken 22793 times.
✗ Branch 5 → 211 not taken.
✓ Branch 6 → 7 taken 22793 times.
✗ Branch 6 → 209 not taken.
 22793 auto operand = std::any_cast<ExprResult>(visit(lhsNode));
488 22793 auto [operandType, operandEntry] = operand;
489
5/8
✓ Branch 8 → 9 taken 22793 times.
✗ Branch 8 → 316 not taken.
✓ Branch 9 → 10 taken 6 times.
✓ Branch 9 → 14 taken 22787 times.
✓ Branch 10 → 11 taken 6 times.
✗ Branch 10 → 212 not taken.
✓ Branch 11 → 12 taken 6 times.
✗ Branch 11 → 212 not taken.
 22793 HANDLE_UNRESOLVED_TYPE_ER(operandType)
490
491
4/5
✓ Branch 14 → 15 taken 3536 times.
✓ Branch 14 → 101 taken 16926 times.
✓ Branch 14 → 159 taken 1890 times.
✓ Branch 14 → 167 taken 435 times.
✗ Branch 14 → 175 not taken.
 22787 switch (node->op) {
492 3536 case PostfixUnaryExprNode::PostfixUnaryOp::OP_SUBSCRIPT: {
493 // Visit index assignment
494 3536 AssignExprNode *indexAssignExpr = node->subscriptIndexExpr;
495
2/4
✓ Branch 15 → 16 taken 3536 times.
✗ Branch 15 → 215 not taken.
✓ Branch 16 → 17 taken 3536 times.
✗ Branch 16 → 213 not taken.
 3536 const auto index = std::any_cast<ExprResult>(visit(indexAssignExpr));
496
2/8
✓ Branch 18 → 19 taken 3536 times.
✗ Branch 18 → 258 not taken.
✗ Branch 19 → 20 not taken.
✓ Branch 19 → 24 taken 3536 times.
✗ Branch 20 → 21 not taken.
✗ Branch 20 → 216 not taken.
✗ Branch 21 → 22 not taken.
✗ Branch 21 → 216 not taken.
 3536 HANDLE_UNRESOLVED_TYPE_ER(index.type)
497
498 // Check is there is an overloaded operator function available, if yes accept it
499
1/2
✓ Branch 24 → 25 taken 3536 times.
✗ Branch 24 → 217 not taken.
 3536 const auto [type, _] = opRuleManager.isOperatorOverloadingFctAvailable<2>(node, OP_FCT_SUBSCRIPT, {operand, index}, 0);
500
3/4
✓ Branch 25 → 26 taken 3536 times.
✗ Branch 25 → 258 not taken.
✓ Branch 26 → 27 taken 121 times.
✓ Branch 26 → 28 taken 3415 times.
 3536 if (!type.is(TY_INVALID)) {
501 121 operandType = type;
502 3534 break;
503 }
504
505
1/2
✓ Branch 28 → 29 taken 3415 times.
✗ Branch 28 → 218 not taken.
 3415 operandType = operandType.removeReferenceWrapper();
506
507 // Check if the index is of the right type
508
3/4
✓ Branch 29 → 30 taken 3415 times.
✗ Branch 29 → 219 not taken.
✓ Branch 30 → 31 taken 1 time.
✓ Branch 30 → 41 taken 3414 times.
 3415 if (!index.type.isOneOf({TY_INT, TY_LONG}))
509
4/8
✓ Branch 33 → 34 taken 1 time.
✗ Branch 33 → 222 not taken.
✓ Branch 34 → 35 taken 1 time.
✗ Branch 34 → 220 not taken.
✓ Branch 37 → 38 taken 1 time.
✗ Branch 37 → 226 not taken.
✓ Branch 38 → 39 taken 1 time.
✗ Branch 38 → 226 not taken.
 3 SOFT_ERROR_ER(node, ARRAY_INDEX_NOT_INT_OR_LONG, "Array index must be of type int or long")
510
511 // Check if we can apply the subscript operator on the lhs type
512
2/4
✓ Branch 41 → 42 taken 3414 times.
✗ Branch 41 → 227 not taken.
✗ Branch 42 → 43 not taken.
✓ Branch 42 → 52 taken 3414 times.
 3414 if (!operandType.isOneOf({TY_ARRAY, TY_PTR, TY_STRING}))
513 ✗ SOFT_ERROR_ER(node, OPERATOR_WRONG_DATA_TYPE,
514 "Can only apply subscript operator on array type, got " + operandType.getName(true))
515
516 // Check if we have an unsafe operation
517
6/10
✓ Branch 52 → 53 taken 3414 times.
✗ Branch 52 → 258 not taken.
✓ Branch 53 → 54 taken 2416 times.
✓ Branch 53 → 57 taken 998 times.
✓ Branch 54 → 55 taken 2416 times.
✗ Branch 54 → 258 not taken.
✗ Branch 55 → 56 not taken.
✓ Branch 55 → 57 taken 2416 times.
✗ Branch 58 → 59 not taken.
✓ Branch 58 → 69 taken 3414 times.
 3414 if (operandType.isPtr() && !currentScope->doesAllowUnsafeOperations())
518 ✗ SOFT_ERROR_ER(
519 node, UNSAFE_OPERATION_IN_SAFE_CONTEXT,
520 "The subscript operator on pointers is an unsafe operation. Use unsafe blocks if you know what you are doing.")
521
522 // In case of compile time index value and known array size, perform a compile time out-of-bounds check
523
11/14
✓ Branch 69 → 70 taken 3414 times.
✗ Branch 69 → 258 not taken.
✓ Branch 70 → 71 taken 187 times.
✓ Branch 70 → 76 taken 3227 times.
✓ Branch 71 → 72 taken 187 times.
✗ Branch 71 → 258 not taken.
✓ Branch 72 → 73 taken 146 times.
✓ Branch 72 → 76 taken 41 times.
✓ Branch 73 → 74 taken 146 times.
✗ Branch 73 → 258 not taken.
✓ Branch 74 → 75 taken 81 times.
✓ Branch 74 → 76 taken 65 times.
✓ Branch 77 → 78 taken 81 times.
✓ Branch 77 → 96 taken 3333 times.
 3414 if (operandType.isArray() && operandType.getArraySize() != ARRAY_SIZE_UNKNOWN && indexAssignExpr->hasCompileTimeValue()) {
524
1/2
✓ Branch 78 → 79 taken 81 times.
✗ Branch 78 → 258 not taken.
 81 const int32_t constIndex = indexAssignExpr->getCompileTimeValue().intValue;
525
1/2
✓ Branch 79 → 80 taken 81 times.
✗ Branch 79 → 258 not taken.
 81 const unsigned int constSize = operandType.getArraySize();
526 // Check if we are accessing out-of-bounds memory
527
2/2
✓ Branch 80 → 81 taken 1 time.
✓ Branch 80 → 96 taken 80 times.
 81 if (constIndex >= static_cast<int32_t>(constSize)) {
528 1 const std::string idxStr = std::to_string(constIndex);
529 1 const std::string sizeStr = std::to_string(constSize);
530
6/12
✓ Branch 83 → 84 taken 1 time.
✗ Branch 83 → 248 not taken.
✓ Branch 84 → 85 taken 1 time.
✗ Branch 84 → 246 not taken.
✓ Branch 85 → 86 taken 1 time.
✗ Branch 85 → 244 not taken.
✓ Branch 86 → 87 taken 1 time.
✗ Branch 86 → 242 not taken.
✓ Branch 90 → 91 taken 1 time.
✗ Branch 90 → 251 not taken.
✓ Branch 91 → 92 taken 1 time.
✗ Branch 91 → 251 not taken.
 1 SOFT_ERROR_ER(node, ARRAY_INDEX_OUT_OF_BOUNDS,
531 "You are trying to access element with index " + idxStr + " of an array with size " + sizeStr)
532 1 }
533 }
534
535 // Get item type
536
1/2
✓ Branch 96 → 97 taken 3413 times.
✗ Branch 96 → 257 not taken.
 3413 operandType = operandType.getContained();
537
538 // Remove heap qualifier
539 3413 operandType.getQualifiers().isHeap = false;
540
541 3413 break;
542 }
543 16926 case PostfixUnaryExprNode::PostfixUnaryOp::OP_MEMBER_ACCESS: {
544 16926 const std::string &fieldName = node->identifier;
545
546 // Check if lhs is enum or strobj
547
1/2
✓ Branch 101 → 102 taken 16926 times.
✗ Branch 101 → 286 not taken.
 16926 const QualType lhsBaseTy = operandType.autoDeReference();
548
3/4
✓ Branch 102 → 103 taken 16926 times.
✗ Branch 102 → 286 not taken.
✓ Branch 103 → 104 taken 1 time.
✓ Branch 103 → 113 taken 16925 times.
 16926 if (!lhsBaseTy.is(TY_STRUCT))
549
5/10
✓ Branch 104 → 105 taken 1 time.
✗ Branch 104 → 263 not taken.
✓ Branch 105 → 106 taken 1 time.
✗ Branch 105 → 261 not taken.
✓ Branch 106 → 107 taken 1 time.
✗ Branch 106 → 259 not taken.
✓ Branch 109 → 110 taken 1 time.
✗ Branch 109 → 265 not taken.
✓ Branch 110 → 111 taken 1 time.
✗ Branch 110 → 265 not taken.
 1 SOFT_ERROR_ER(node, INVALID_MEMBER_ACCESS, "Cannot apply member access operator on " + operandType.getName(false))
550
551 // Retrieve registry entry
552
1/2
✓ Branch 113 → 114 taken 16925 times.
✗ Branch 113 → 286 not taken.
 16925 const std::string &structName = lhsBaseTy.getSubType();
553
1/2
✓ Branch 114 → 115 taken 16925 times.
✗ Branch 114 → 286 not taken.
 16925 Scope *structScope = lhsBaseTy.getBodyScope();
554
555 // If we only have the generic struct scope, lookup the concrete manifestation scope
556
2/2
✓ Branch 115 → 116 taken 119 times.
✓ Branch 115 → 120 taken 16806 times.
 16925 if (structScope->isGenericScope) {
557
1/2
✓ Branch 116 → 117 taken 119 times.
✗ Branch 116 → 286 not taken.
 119 const Struct *spiceStruct = lhsBaseTy.getStruct(node);
558
1/2
✗ Branch 117 → 118 not taken.
✓ Branch 117 → 119 taken 119 times.
 119 assert(spiceStruct != nullptr);
559 119 structScope = spiceStruct->scope;
560 }
561
1/2
✗ Branch 120 → 121 not taken.
✓ Branch 120 → 122 taken 16925 times.
 16925 assert(!structScope->isGenericScope); // At this point we always expect a substantiation scope
562
563 // Get accessed field
564 16925 std::vector<size_t> indexPath;
565
1/2
✓ Branch 122 → 123 taken 16925 times.
✗ Branch 122 → 284 not taken.
 16925 SymbolTableEntry *memberEntry = structScope->symbolTable.lookupInComposedFields(fieldName, indexPath);
566
2/2
✓ Branch 123 → 124 taken 2 times.
✓ Branch 123 → 135 taken 16923 times.
 16925 if (!memberEntry)
567
6/12
✓ Branch 124 → 125 taken 2 times.
✗ Branch 124 → 272 not taken.
✓ Branch 125 → 126 taken 2 times.
✗ Branch 125 → 270 not taken.
✓ Branch 126 → 127 taken 2 times.
✗ Branch 126 → 268 not taken.
✓ Branch 127 → 128 taken 2 times.
✗ Branch 127 → 266 not taken.
✓ Branch 131 → 132 taken 2 times.
✗ Branch 131 → 275 not taken.
✓ Branch 132 → 133 taken 2 times.
✗ Branch 132 → 275 not taken.
 2 SOFT_ERROR_ER(node, REFERENCED_UNDEFINED_VARIABLE, "Field '" + node->identifier + "' not found in struct " + structName)
568
1/2
✓ Branch 135 → 136 taken 16923 times.
✗ Branch 135 → 284 not taken.
 16923 const QualType memberType = memberEntry->getQualType();
569
570 // Check for insufficient visibility
571
8/14
✓ Branch 136 → 137 taken 16923 times.
✗ Branch 136 → 276 not taken.
✓ Branch 137 → 138 taken 90 times.
✓ Branch 137 → 143 taken 16833 times.
✓ Branch 138 → 139 taken 90 times.
✗ Branch 138 → 276 not taken.
✓ Branch 139 → 140 taken 90 times.
✗ Branch 139 → 276 not taken.
✓ Branch 140 → 141 taken 90 times.
✗ Branch 140 → 276 not taken.
✗ Branch 141 → 142 not taken.
✓ Branch 141 → 143 taken 90 times.
✗ Branch 144 → 145 not taken.
✓ Branch 144 → 154 taken 16923 times.
 16923 if (structScope->isImportedBy(rootScope) && !memberEntry->getQualType().getBase().isPublic())
572 ✗ SOFT_ERROR_ER(node, INSUFFICIENT_VISIBILITY, "Cannot access field '" + fieldName + "' due to its private visibility")
573
574 // Set field to used
575 16923 memberEntry->used = true;
576
577 // Overwrite type and entry of left side with member type and entry
578 16923 operandType = memberType;
579 16923 operandEntry = memberEntry;
580 16923 break;
581
2/2
✓ Branch 156 → 157 taken 2 times.
✓ Branch 156 → 158 taken 16923 times.
 16925 }
582 1890 case PostfixUnaryExprNode::PostfixUnaryOp::OP_PLUS_PLUS: {
583
2/2
✓ Branch 159 → 160 taken 1888 times.
✓ Branch 159 → 287 taken 2 times.
 1890 operandType = opRuleManager.getPostfixPlusPlusResultType(node, operand, 0).type;
584
585
2/2
✓ Branch 160 → 161 taken 1884 times.
✓ Branch 160 → 166 taken 4 times.
 1888 if (operandEntry) {
586 // In case the lhs is captured, notify the capture about the write access
587
3/4
✓ Branch 161 → 162 taken 1884 times.
✗ Branch 161 → 316 not taken.
✓ Branch 162 → 163 taken 4 times.
✓ Branch 162 → 164 taken 1880 times.
 1884 if (Capture *lhsCapture = currentScope->symbolTable.lookupCapture(operandEntry->name); lhsCapture)
588
1/2
✓ Branch 163 → 164 taken 4 times.
✗ Branch 163 → 316 not taken.
 4 lhsCapture->setAccessType(READ_WRITE);
589
590 // Update the state of the variable
591
1/2
✓ Branch 164 → 165 taken 1884 times.
✗ Branch 164 → 288 not taken.
 1884 operandEntry->updateState(INITIALIZED, node);
592 }
593
594 1888 break;
595 }
596 435 case PostfixUnaryExprNode::PostfixUnaryOp::OP_MINUS_MINUS: {
597
1/2
✓ Branch 167 → 168 taken 435 times.
✗ Branch 167 → 289 not taken.
 435 operandType = opRuleManager.getPostfixMinusMinusResultType(node, operand, 0).type;
598
599
2/2
✓ Branch 168 → 169 taken 431 times.
✓ Branch 168 → 174 taken 4 times.
 435 if (operandEntry) {
600 // In case the lhs is captured, notify the capture about the write access
601
2/4
✓ Branch 169 → 170 taken 431 times.
✗ Branch 169 → 316 not taken.
✗ Branch 170 → 171 not taken.
✓ Branch 170 → 172 taken 431 times.
 431 if (Capture *lhsCapture = currentScope->symbolTable.lookupCapture(operandEntry->name); lhsCapture)
602 ✗ lhsCapture->setAccessType(READ_WRITE);
603
604 // Update the state of the variable
605
1/2
✓ Branch 172 → 173 taken 431 times.
✗ Branch 172 → 290 not taken.
 431 operandEntry->updateState(INITIALIZED, node);
606 }
607
608 435 break;
609 }
610 − default: // GCOV_EXCL_LINE
611 − throw CompilerError(UNHANDLED_BRANCH, "PostfixUnaryExpr fall-through"); // GCOV_EXCL_LINE
612 }
613
614
2/4
✓ Branch 183 → 184 taken 22780 times.
✗ Branch 183 → 316 not taken.
✗ Branch 184 → 185 not taken.
✓ Branch 184 → 203 taken 22780 times.
 22780 if (operandType.is(TY_INVALID)) {
615 ✗ const std::string &varName = operandEntry ? operandEntry->name : "";
616 ✗ SOFT_ERROR_ER(node, REFERENCED_UNDEFINED_VARIABLE, "Variable '" + varName + "' was referenced before declared")
617 ✗ }
618
619
2/4
✓ Branch 203 → 204 taken 22780 times.
✗ Branch 203 → 315 not taken.
✓ Branch 204 → 205 taken 22780 times.
✗ Branch 204 → 315 not taken.
 22780 return ExprResult{node->setEvaluatedSymbolType(operandType, manIdx), operandEntry};
620 }
621
622 101170 std::any TypeChecker::visitAtomicExpr(AtomicExprNode *node) {
623 // Check if constant
624
2/2
✓ Branch 2 → 3 taken 20116 times.
✓ Branch 2 → 5 taken 81054 times.
 101170 if (node->constant)
625
1/2
✓ Branch 3 → 4 taken 20116 times.
✗ Branch 3 → 219 not taken.
 20116 return visit(node->constant);
626
627 // Check if value
628
2/2
✓ Branch 5 → 6 taken 19682 times.
✓ Branch 5 → 8 taken 61372 times.
 81054 if (node->value)
629
2/2
✓ Branch 6 → 7 taken 19678 times.
✓ Branch 6 → 219 taken 4 times.
 19682 return visit(node->value);
630
631 // Check for builtin calls
632
2/2
✓ Branch 8 → 9 taken 1843 times.
✓ Branch 8 → 11 taken 59529 times.
 61372 if (node->builtinCall)
633
2/2
✓ Branch 9 → 10 taken 1842 times.
✓ Branch 9 → 219 taken 1 time.
 1843 return visit(node->builtinCall);
634
635 // Check for assign expression within parentheses
636
2/2
✓ Branch 11 → 12 taken 615 times.
✓ Branch 11 → 14 taken 58914 times.
 59529 if (node->assignExpr)
637
2/2
✓ Branch 12 → 13 taken 612 times.
✓ Branch 12 → 219 taken 3 times.
 615 return visit(node->assignExpr);
638
639 // Identifier (local or global variable access)
640
1/2
✗ Branch 15 → 16 not taken.
✓ Branch 15 → 17 taken 58914 times.
 58914 assert(!node->fqIdentifier.empty());
641
642
1/2
✓ Branch 17 → 18 taken 58914 times.
✗ Branch 17 → 219 not taken.
 58914 auto &[entry, accessScope, capture] = node->data.at(manIdx);
643 58914 accessScope = currentScope;
644
645 // Check if a local or global variable can be found by searching for the name
646
2/2
✓ Branch 19 → 20 taken 58626 times.
✓ Branch 19 → 25 taken 288 times.
 58914 if (node->identifierFragments.size() == 1)
647 117252 entry = accessScope->lookup(node->identifierFragments.back());
648
649 // If no local or global was found, search in the name registry
650
2/2
✓ Branch 25 → 26 taken 368 times.
✓ Branch 25 → 38 taken 58546 times.
 58914 if (!entry) {
651
1/2
✓ Branch 26 → 27 taken 368 times.
✗ Branch 26 → 219 not taken.
 368 const NameRegistryEntry *registryEntry = sourceFile->getNameRegistryEntry(node->fqIdentifier);
652
2/2
✓ Branch 27 → 28 taken 1 time.
✓ Branch 27 → 37 taken 367 times.
 368 if (!registryEntry)
653
5/10
✓ Branch 28 → 29 taken 1 time.
✗ Branch 28 → 167 not taken.
✓ Branch 29 → 30 taken 1 time.
✗ Branch 29 → 165 not taken.
✓ Branch 30 → 31 taken 1 time.
✗ Branch 30 → 163 not taken.
✓ Branch 33 → 34 taken 1 time.
✗ Branch 33 → 169 not taken.
✓ Branch 34 → 35 taken 1 time.
✗ Branch 34 → 169 not taken.
 1 SOFT_ERROR_ER(node, REFERENCED_UNDEFINED_VARIABLE, "The variable '" + node->fqIdentifier + "' could not be found")
654 367 entry = registryEntry->targetEntry;
655 367 accessScope = registryEntry->targetScope;
656 }
657
1/2
✗ Branch 38 → 39 not taken.
✓ Branch 38 → 40 taken 58913 times.
 58913 assert(entry != nullptr);
658 58913 entry->used = true;
659
1/2
✓ Branch 40 → 41 taken 58913 times.
✗ Branch 40 → 219 not taken.
 58913 capture = accessScope->symbolTable.lookupCapture(entry->name);
660
661
1/2
✓ Branch 41 → 42 taken 58913 times.
✗ Branch 41 → 219 not taken.
 58913 const QualType varType = entry->getQualType();
662
5/8
✓ Branch 42 → 43 taken 58913 times.
✗ Branch 42 → 219 not taken.
✓ Branch 43 → 44 taken 9 times.
✓ Branch 43 → 48 taken 58904 times.
✓ Branch 44 → 45 taken 9 times.
✗ Branch 44 → 170 not taken.
✓ Branch 45 → 46 taken 9 times.
✗ Branch 45 → 170 not taken.
 58913 HANDLE_UNRESOLVED_TYPE_ER(varType)
663
3/4
✓ Branch 48 → 49 taken 58904 times.
✗ Branch 48 → 219 not taken.
✓ Branch 49 → 50 taken 2 times.
✓ Branch 49 → 59 taken 58902 times.
 58904 if (varType.is(TY_INVALID))
664
5/10
✓ Branch 50 → 51 taken 2 times.
✗ Branch 50 → 175 not taken.
✓ Branch 51 → 52 taken 2 times.
✗ Branch 51 → 173 not taken.
✓ Branch 52 → 53 taken 2 times.
✗ Branch 52 → 171 not taken.
✓ Branch 55 → 56 taken 2 times.
✗ Branch 55 → 177 not taken.
✓ Branch 56 → 57 taken 2 times.
✗ Branch 56 → 177 not taken.
 2 SOFT_ERROR_ER(node, USED_BEFORE_DECLARED, "Symbol '" + entry->name + "' was used before declared.")
665
666
7/8
✓ Branch 59 → 60 taken 58902 times.
✗ Branch 59 → 178 not taken.
✓ Branch 60 → 61 taken 55 times.
✓ Branch 60 → 63 taken 58847 times.
✓ Branch 61 → 62 taken 13 times.
✓ Branch 61 → 63 taken 42 times.
✓ Branch 64 → 65 taken 13 times.
✓ Branch 64 → 93 taken 58889 times.
 58902 if (varType.isOneOf({TY_FUNCTION, TY_PROCEDURE}) && entry->global) {
667 // Check if overloaded function was referenced
668
1/2
✓ Branch 65 → 66 taken 13 times.
✗ Branch 65 → 219 not taken.
 13 const std::vector<Function *> *manifestations = entry->declNode->getFctManifestations(entry->name);
669
2/2
✓ Branch 67 → 68 taken 1 time.
✓ Branch 67 → 78 taken 12 times.
 13 if (manifestations->size() > 1)
670
4/8
✓ Branch 70 → 71 taken 1 time.
✗ Branch 70 → 181 not taken.
✓ Branch 71 → 72 taken 1 time.
✗ Branch 71 → 179 not taken.
✓ Branch 74 → 75 taken 1 time.
✗ Branch 74 → 185 not taken.
✓ Branch 75 → 76 taken 1 time.
✗ Branch 75 → 185 not taken.
 3 SOFT_ERROR_ER(node, REFERENCED_OVERLOADED_FCT, "Overloaded functions / functions with optional params cannot be referenced")
671
2/2
✓ Branch 80 → 81 taken 1 time.
✓ Branch 80 → 91 taken 11 times.
 12 if (!manifestations->front()->templateTypes.empty())
672
4/8
✓ Branch 83 → 84 taken 1 time.
✗ Branch 83 → 188 not taken.
✓ Branch 84 → 85 taken 1 time.
✗ Branch 84 → 186 not taken.
✓ Branch 87 → 88 taken 1 time.
✗ Branch 87 → 192 not taken.
✓ Branch 88 → 89 taken 1 time.
✗ Branch 88 → 192 not taken.
 3 SOFT_ERROR_ER(node, REFERENCED_OVERLOADED_FCT, "Generic functions cannot be referenced")
673 // Set referenced function to used
674 11 Function *referencedFunction = manifestations->front();
675 11 referencedFunction->used = true;
676 11 referencedFunction->entry->used = true;
677 }
678
679 // The base type should be an extended primitive
680
1/2
✓ Branch 93 → 94 taken 58900 times.
✗ Branch 93 → 219 not taken.
 58900 const QualType baseType = varType.getBase();
681
6/10
✓ Branch 94 → 95 taken 58900 times.
✗ Branch 94 → 219 not taken.
✓ Branch 95 → 96 taken 2 times.
✓ Branch 95 → 99 taken 58898 times.
✓ Branch 96 → 97 taken 2 times.
✗ Branch 96 → 219 not taken.
✗ Branch 97 → 98 not taken.
✓ Branch 97 → 99 taken 2 times.
✗ Branch 100 → 101 not taken.
✓ Branch 100 → 112 taken 58900 times.
 58900 if (!baseType.isExtendedPrimitive() && !baseType.is(TY_DYN))
682 ✗ SOFT_ERROR_ER(node, INVALID_SYMBOL_ACCESS, "A symbol of type " + varType.getName(false) + " cannot be accessed here")
683
684 // Check if we have seen a 'this.' prefix, because the generator needs that
685
6/8
✓ Branch 112 → 113 taken 1 time.
✓ Branch 112 → 117 taken 58899 times.
✓ Branch 114 → 115 taken 1 time.
✗ Branch 114 → 219 not taken.
✓ Branch 115 → 116 taken 1 time.
✗ Branch 115 → 117 not taken.
✓ Branch 118 → 119 taken 1 time.
✓ Branch 118 → 128 taken 58899 times.
 58900 if (entry->scope->type == ScopeType::STRUCT && node->identifierFragments.front() != THIS_VARIABLE_NAME)
686
5/10
✓ Branch 119 → 120 taken 1 time.
✗ Branch 119 → 207 not taken.
✓ Branch 120 → 121 taken 1 time.
✗ Branch 120 → 205 not taken.
✓ Branch 121 → 122 taken 1 time.
✗ Branch 121 → 203 not taken.
✓ Branch 124 → 125 taken 1 time.
✗ Branch 124 → 209 not taken.
✓ Branch 125 → 126 taken 1 time.
✗ Branch 125 → 209 not taken.
 1 SOFT_ERROR_ER(node, REFERENCED_UNDEFINED_VARIABLE,
687 "The symbol '" + node->fqIdentifier + "' could not be found. Missing 'this.' prefix?")
688
689 // Ensure that the entry is public, if the symbol is imported.
690 // An exception are enum items. There it is sufficient, that the enum itself is public.
691
7/8
✓ Branch 128 → 129 taken 58899 times.
✗ Branch 128 → 219 not taken.
✓ Branch 129 → 130 taken 202 times.
✓ Branch 129 → 132 taken 58697 times.
✓ Branch 130 → 131 taken 78 times.
✓ Branch 130 → 132 taken 124 times.
✓ Branch 133 → 134 taken 78 times.
✓ Branch 133 → 147 taken 58821 times.
 58899 if (accessScope->isImportedBy(rootScope) && accessScope->type != ScopeType::ENUM)
692
5/8
✓ Branch 134 → 135 taken 78 times.
✗ Branch 134 → 210 not taken.
✓ Branch 135 → 136 taken 78 times.
✗ Branch 135 → 210 not taken.
✓ Branch 136 → 137 taken 78 times.
✗ Branch 136 → 210 not taken.
✓ Branch 137 → 138 taken 1 time.
✓ Branch 137 → 147 taken 77 times.
 78 if (!entry->getQualType().getBase().isPublic())
693
5/10
✓ Branch 138 → 139 taken 1 time.
✗ Branch 138 → 215 not taken.
✓ Branch 139 → 140 taken 1 time.
✗ Branch 139 → 213 not taken.
✓ Branch 140 → 141 taken 1 time.
✗ Branch 140 → 211 not taken.
✓ Branch 143 → 144 taken 1 time.
✗ Branch 143 → 217 not taken.
✓ Branch 144 → 145 taken 1 time.
✗ Branch 144 → 217 not taken.
 1 SOFT_ERROR_ER(node, INSUFFICIENT_VISIBILITY, "Cannot access '" + entry->name + "' due to its private visibility")
694
695 // For enum item access, use access scope of the enum
696
2/2
✓ Branch 147 → 148 taken 283 times.
✓ Branch 147 → 149 taken 58615 times.
 58898 if (entry->scope->type == ScopeType::ENUM)
697 283 accessScope = entry->scope;
698
699 // For struct access, use access scope of the struct
700
3/4
✓ Branch 149 → 150 taken 58898 times.
✗ Branch 149 → 219 not taken.
✓ Branch 150 → 151 taken 19173 times.
✓ Branch 150 → 157 taken 39725 times.
 58898 if (baseType.is(TY_STRUCT)) {
701
1/2
✓ Branch 151 → 152 taken 19173 times.
✗ Branch 151 → 219 not taken.
 19173 const std::string &structName = baseType.getSubType();
702
1/2
✓ Branch 152 → 153 taken 19173 times.
✗ Branch 152 → 219 not taken.
 19173 const NameRegistryEntry *nameRegistryEntry = sourceFile->getNameRegistryEntry(structName);
703
1/2
✗ Branch 153 → 154 not taken.
✓ Branch 153 → 155 taken 19173 times.
 19173 assert(nameRegistryEntry != nullptr);
704 19173 accessScope = nameRegistryEntry->targetScope;
705
1/2
✗ Branch 155 → 156 not taken.
✓ Branch 155 → 157 taken 19173 times.
 19173 assert(accessScope != nullptr);
706 }
707
708
2/4
✓ Branch 157 → 158 taken 58898 times.
✗ Branch 157 → 218 not taken.
✓ Branch 158 → 159 taken 58898 times.
✗ Branch 158 → 218 not taken.
 58898 return ExprResult{node->setEvaluatedSymbolType(varType, manIdx), entry};
709 }
710
711 } // namespace spice::compiler
712