1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
// C++ Bitwise and Unary Operator Mutations: BOR, UOR
// Included from cpp_tree_sitter_mutations.rs
// ============================================================
// 4. BITWISE OPERATOR REPLACEMENT (BOR)
// ============================================================
/// C++ Bitwise Operator Mutation (BOR - Bitwise Operator Replacement)
/// Replaces bitwise operators: &, |, ^, <<, >>
/// Also handles unary bitwise NOT: ~
pub struct CppBitwiseOpMutation;
impl TreeSitterMutationOperator for CppBitwiseOpMutation {
fn name(&self) -> &str {
"CppBitwiseOp"
}
fn can_mutate(&self, node: &Node, _source: &[u8]) -> bool {
match node.kind() {
"binary_expression" => {
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
let kind = child.kind();
if matches!(kind, "&" | "|" | "^" | "<<" | ">>") {
return true;
}
}
false
}
"unary_expression" => {
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
if child.kind() == "~" {
return true;
}
}
false
}
_ => false,
}
}
fn mutate(&self, node: &Node, source: &[u8]) -> Vec<MutatedSource> {
if node.kind() == "unary_expression" {
// Handle unary ~ operator
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
if child.kind() == "~" {
// For unary ~, we can't easily replace it with another operator
// Skip mutation for now (would require semantic analysis)
return vec![];
}
}
return vec![];
}
// Handle binary bitwise operators
let mut cursor = node.walk();
let mut operator_node = None;
for child in node.children(&mut cursor) {
let kind = child.kind();
if matches!(kind, "&" | "|" | "^" | "<<" | ">>") {
operator_node = Some(child);
break;
}
}
let operator_node = match operator_node {
Some(n) => n,
None => return vec![],
};
let op_bytes = &source[operator_node.byte_range()];
let op_text = std::str::from_utf8(op_bytes).unwrap_or("");
let replacements = match op_text {
"&" => vec!["|", "^"],
"|" => vec!["&", "^"],
"^" => vec!["&", "|"],
"<<" => vec![">>"],
">>" => vec!["<<"],
_ => return vec![],
};
replacements
.into_iter()
.map(|new_op| {
let mut mutated = source.to_vec();
mutated.splice(operator_node.byte_range(), new_op.bytes());
MutatedSource {
source: String::from_utf8(mutated).expect(
"mutated source is valid UTF-8 (original source + ASCII operators)",
),
description: format!("{} → {}", op_text, new_op),
location: SourceLocation {
line: operator_node.start_position().row + 1,
column: operator_node.start_position().column + 1,
end_line: operator_node.end_position().row + 1,
end_column: operator_node.end_position().column + 1,
},
}
})
.collect()
}
}
// ============================================================
// 5. UNARY OPERATOR REPLACEMENT (UOR)
// ============================================================
/// C++ Unary Operator Mutation (UOR - Unary Operator Replacement)
/// Replaces unary operators: !, -, +
/// Also handles update expressions: ++, --
pub struct CppUnaryOpMutation;
impl TreeSitterMutationOperator for CppUnaryOpMutation {
fn name(&self) -> &str {
"CppUnaryOp"
}
fn can_mutate(&self, node: &Node, _source: &[u8]) -> bool {
match node.kind() {
"unary_expression" => {
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
let kind = child.kind();
if matches!(kind, "!" | "-" | "+") {
return true;
}
}
false
}
"update_expression" => {
let mut cursor = node.walk();
for child in node.children(&mut cursor) {
let kind = child.kind();
if matches!(kind, "++" | "--") {
return true;
}
}
false
}
_ => false,
}
}
fn mutate(&self, node: &Node, source: &[u8]) -> Vec<MutatedSource> {
let mut cursor = node.walk();
let mut operator_node = None;
for child in node.children(&mut cursor) {
let kind = child.kind();
if matches!(kind, "!" | "-" | "+" | "++" | "--") {
operator_node = Some(child);
break;
}
}
let operator_node = match operator_node {
Some(n) => n,
None => return vec![],
};
let op_bytes = &source[operator_node.byte_range()];
let op_text = std::str::from_utf8(op_bytes).unwrap_or("");
let replacements = match op_text {
"!" => vec![], // Can't replace ! without changing semantics drastically
"-" => vec!["+"],
"+" => vec!["-"],
"++" => vec!["--"],
"--" => vec!["++"],
_ => return vec![],
};
replacements
.into_iter()
.map(|new_op| {
let mut mutated = source.to_vec();
mutated.splice(operator_node.byte_range(), new_op.bytes());
MutatedSource {
source: String::from_utf8(mutated).expect(
"mutated source is valid UTF-8 (original source + ASCII operators)",
),
description: format!("{} → {}", op_text, new_op),
location: SourceLocation {
line: operator_node.start_position().row + 1,
column: operator_node.start_position().column + 1,
end_line: operator_node.end_position().row + 1,
end_column: operator_node.end_position().column + 1,
},
}
})
.collect()
}
}