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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
use super::Simplify;
use bit_set::BitSet;
use std::mem;
use toasty_core::stmt;
impl Simplify<'_> {
pub(super) fn simplify_expr_or(&mut self, expr: &mut stmt::ExprOr) -> Option<stmt::Expr> {
// Flatten any nested ors
for i in 0..expr.operands.len() {
if let stmt::Expr::Or(or) = &mut expr.operands[i] {
let mut nested = mem::take(&mut or.operands);
expr.operands[i] = false.into();
expr.operands.append(&mut nested);
}
}
// `or(..., true, ...) → true`
if expr.operands.iter().any(|e| e.is_true()) {
return Some(true.into());
}
// `or(..., false, ...) → or(..., ...)`
expr.operands.retain(|expr| !expr.is_false());
// Null propagation, `null or null` → `null`
// After removing false values, if all operands are null, return null.
if !expr.operands.is_empty() && expr.operands.iter().all(|e| e.is_value_null()) {
return Some(stmt::Expr::null());
}
// Idempotent law, `a or a` → `a`
// Note: O(n) lookups are acceptable here since operand lists are typically small.
// `is_equivalent_to` (not `PartialEq`) keeps this sound for non-deterministic
// operands like `LAST_INSERT_ID()` — two syntactically identical calls may
// return different values, so the second occurrence must survive.
let mut seen: Vec<stmt::Expr> = Vec::new();
expr.operands.retain(|operand| {
if seen.iter().any(|e| e.is_equivalent_to(operand)) {
false
} else {
seen.push(operand.clone());
true
}
});
// Absorption law, `x or (x and y)` → `x`
// If an operand is an AND that contains another operand of the OR, remove the AND.
let non_and_operands: Vec<_> = expr
.operands
.iter()
.filter(|op| !matches!(op, stmt::Expr::And(_)))
.cloned()
.collect();
expr.operands.retain(|operand| {
if let stmt::Expr::And(and_expr) = operand {
// Remove this AND if any of its operands appears as a direct operand of the OR
!and_expr
.operands
.iter()
.any(|op| non_and_operands.iter().any(|e| e.is_equivalent_to(op)))
} else {
true
}
});
// Factoring, `(a and b) or (a and c)` → `a and (b or c)`
// Find common factors across all AND operands and factor them out.
if let Some(factored) = self.try_factor_or(expr) {
return Some(factored);
}
// Complement law, `a or not(a)` → `true` (only if `a` is non-nullable)
if self.try_complement_or(expr) {
return Some(true.into());
}
// Variant tautology: `is_variant(x, 0) or is_variant(x, 1)` covering all
// variants of the enum → `true`
if self.try_variant_tautology_or(expr) {
return Some(true.into());
}
// OR-to-IN conversion, `a = 1 or a = 2 or a = 3` → `a in (1, 2, 3)`
if let Some(in_list) = self.try_or_to_in_list(expr) {
return Some(in_list);
}
if expr.operands.is_empty() {
Some(false.into())
} else if expr.operands.len() == 1 {
Some(expr.operands.remove(0))
} else {
None
}
}
/// Attempts to factor common terms from AND expressions within an OR.
/// `(a and b) or (a and c)` → `a and (b or c)`
/// `(a and b and c) or (a and b and d)` → `a and b and (c or d)`
fn try_factor_or(&self, expr: &mut stmt::ExprOr) -> Option<stmt::Expr> {
// Need at least 2 operands, all must be ANDs
if expr.operands.len() < 2 {
return None;
}
if !expr
.operands
.iter()
.all(|op| matches!(op, stmt::Expr::And(_)))
{
return None;
}
// Find all common factors by checking which operands from the first AND
// appear in all other ANDs
let first_and = match &expr.operands[0] {
stmt::Expr::And(and) => and,
_ => unreachable!(),
};
let common: Vec<_> = first_and
.operands
.iter()
.filter(|op| {
expr.operands[1..].iter().all(|other| {
if let stmt::Expr::And(other_and) = other {
other_and.operands.iter().any(|e| e.is_equivalent_to(op))
} else {
false
}
})
})
.cloned()
.collect();
if common.is_empty() {
return None;
}
// Remove all common factors from each AND
for operand in &mut expr.operands {
if let stmt::Expr::And(and) = operand {
and.operands
.retain(|op| !common.iter().any(|c| c.is_equivalent_to(op)));
// If only one operand left, unwrap the AND
if and.operands.len() == 1 {
*operand = and.operands.pop().unwrap();
} else if and.operands.is_empty() {
*operand = true.into();
}
}
}
// Common factors AND (the modified OR)
let mut result = common;
let or_expr = stmt::ExprOr {
operands: mem::take(&mut expr.operands),
};
result.push(stmt::Expr::Or(or_expr));
Some(stmt::Expr::and_from_vec(result))
}
/// Checks for complement law: `a or not(a)` → `true`
///
/// Returns true if a complementary pair is found and both are non-nullable.
fn try_complement_or(&self, expr: &stmt::ExprOr) -> bool {
// Collect all NOT expressions and their inner expressions
let negated: Vec<_> = expr
.operands
.iter()
.filter_map(|op| {
if let stmt::Expr::Not(not_expr) = op {
Some(not_expr.expr.as_ref())
} else {
None
}
})
.collect();
// Check if any operand has its negation also present
for operand in &expr.operands {
// Skip NOT expressions themselves
if matches!(operand, stmt::Expr::Not(_)) {
continue;
}
// Check if not(operand) exists and operand is non-nullable
if negated.iter().any(|n| n.is_equivalent_to(operand))
&& operand.is_always_non_nullable()
{
return true;
}
}
false
}
/// Checks for variant tautology: when all variants of an enum are tested
/// via `IsVariant` on the same expression, the OR is always true.
///
/// `is_variant(x, 0) or is_variant(x, 1)` over `{0, 1}` → `true`
fn try_variant_tautology_or(&self, expr: &stmt::ExprOr) -> bool {
// Find the first IsVariant to use as anchor
let Some(first) = expr.operands.iter().find_map(|op| match op {
stmt::Expr::IsVariant(iv) => Some(iv),
_ => None,
}) else {
return false;
};
let anchor_expr = &first.expr;
let model_id = first.variant.model;
let num_variants = self
.schema()
.app
.model(model_id)
.as_embedded_enum_unwrap()
.variants
.len();
let mut seen = BitSet::with_capacity(num_variants);
for operand in &expr.operands {
let stmt::Expr::IsVariant(iv) = operand else {
continue;
};
// Every `IsVariant` subject must be equivalent to the anchor:
// two syntactically different (or non-deterministic) subjects could
// disagree at runtime, so covering all variants of the anchor tells
// us nothing about them.
if !iv.expr.is_equivalent_to(anchor_expr) || iv.variant.model != model_id {
return false;
}
seen.insert(iv.variant.index);
}
seen.count() == num_variants
}
/// Converts disjunctive equality chains to IN lists.
///
/// `a = 1 or a = 2 or b = 3` → `a in (1, 2) or b = 3`
/// `a = 1 or a = 2 or b = 3 or b = 4` → `a in (1, 2) or b in (3, 4)`
///
/// Groups equality comparisons by their LHS and converts groups with 2+
/// values into IN lists. Non-equality operands are preserved.
fn try_or_to_in_list(&self, expr: &mut stmt::ExprOr) -> Option<stmt::Expr> {
use hashbrown::HashMap;
// Group equalities by their LHS expression
// Key: index into `lhs_exprs`, Value: list of RHS constant values
//
// TODO: this could be simplified to use `Expr` as the `HashMap` key
// directly if `Expr` ever implements `Hash`.
let mut lhs_exprs: Vec<stmt::Expr> = Vec::new();
let mut groups: HashMap<usize, Vec<stmt::Value>> = HashMap::new();
let mut other_operands: Vec<stmt::Expr> = Vec::new();
for operand in mem::take(&mut expr.operands) {
if let stmt::Expr::BinaryOp(bin_op) = &operand
&& bin_op.op.is_eq()
&& let stmt::Expr::Value(value) = bin_op.rhs.as_ref()
{
// Find or create index for this LHS. `is_equivalent_to` is
// crucial here: if the lhs is non-deterministic (e.g. `RAND()`),
// it is never equivalent to another occurrence of itself, so
// each instance falls into its own singleton group and no IN
// list is produced. Rewriting `RAND() = 1 OR RAND() = 2` into
// `RAND() IN (1, 2)` would collapse two independent draws into
// one, which is unsound.
let lhs_idx = lhs_exprs
.iter()
.position(|e| e.is_equivalent_to(bin_op.lhs.as_ref()))
.unwrap_or_else(|| {
lhs_exprs.push(bin_op.lhs.as_ref().clone());
lhs_exprs.len() - 1
});
groups.entry(lhs_idx).or_default().push(value.clone());
continue;
}
// Non-equality or non-constant RHS - keep as is
other_operands.push(operand);
}
// Check if any conversion will happen (any group with 2+ values)
let has_conversion = groups.values().any(|v| v.len() >= 2);
if !has_conversion {
// Restore original operands and return None
for (idx, values) in groups {
let lhs = &lhs_exprs[idx];
for value in values {
other_operands.push(stmt::Expr::eq(lhs.clone(), stmt::Expr::Value(value)));
}
}
expr.operands = other_operands;
return None;
}
// Build result operands
let mut result_operands = other_operands;
for (idx, values) in groups {
let lhs = lhs_exprs[idx].clone();
if values.len() >= 2 {
// Convert to IN list
result_operands.push(stmt::Expr::in_list(lhs, stmt::Expr::list(values)));
} else {
// Keep as equality
for value in values {
result_operands.push(stmt::Expr::eq(lhs.clone(), stmt::Expr::Value(value)));
}
}
}
if result_operands.len() == 1 {
Some(result_operands.remove(0))
} else {
expr.operands = result_operands;
None
}
}
}