-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconditionals.rs
More file actions
456 lines (397 loc) · 13.4 KB
/
conditionals.rs
File metadata and controls
456 lines (397 loc) · 13.4 KB
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
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
//! Conditionals - if/unless/case type inference
//!
//! Collects types from each branch and merges them into a Union
//! via edges into a single result Vertex.
use crate::env::{GlobalEnv, LocalEnv};
use crate::graph::{ChangeSet, VertexId};
use crate::types::Type;
use ruby_prism::{
ArrayPatternNode, CapturePatternNode, CaseMatchNode, CaseNode, ElseNode, FindPatternNode,
HashPatternNode, IfNode, InNode, Node, UnlessNode, WhenNode,
};
use super::bytes_to_name;
use super::install::{install_node, install_statements};
use super::variables::install_local_var_write;
/// Process IfNode: if/elsif/else chain
pub(crate) fn process_if_node(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
if_node: &IfNode,
) -> Option<VertexId> {
// Process predicate for side effects
install_node(genv, lenv, changes, source, &if_node.predicate());
let result_vtx = genv.new_vertex();
// then branch
let vtx_then = if_node
.statements()
.and_then(|stmts| install_statements(genv, lenv, changes, source, &stmts));
if let Some(vtx) = vtx_then {
genv.add_edge(vtx, result_vtx);
}
// elsif/else branch (subsequent)
let has_else = if let Some(subsequent) = if_node.subsequent() {
let vtx_sub = process_subsequent(genv, lenv, changes, source, &subsequent);
if let Some(vtx) = vtx_sub {
genv.add_edge(vtx, result_vtx);
}
true
} else {
false
};
// No else clause → add nil
if !has_else {
let nil_vtx = genv.new_source(Type::Nil);
genv.add_edge(nil_vtx, result_vtx);
}
Some(result_vtx)
}
/// Process UnlessNode: unless/else
pub(crate) fn process_unless_node(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
unless_node: &UnlessNode,
) -> Option<VertexId> {
// Process predicate for side effects
install_node(genv, lenv, changes, source, &unless_node.predicate());
let result_vtx = genv.new_vertex();
// body branch
let vtx_body = unless_node
.statements()
.and_then(|stmts| install_statements(genv, lenv, changes, source, &stmts));
if let Some(vtx) = vtx_body {
genv.add_edge(vtx, result_vtx);
}
// else clause
let has_else = if let Some(else_node) = unless_node.else_clause() {
let vtx_else = process_else_clause(genv, lenv, changes, source, &else_node);
if let Some(vtx) = vtx_else {
genv.add_edge(vtx, result_vtx);
}
true
} else {
false
};
// No else clause → add nil
if !has_else {
let nil_vtx = genv.new_source(Type::Nil);
genv.add_edge(nil_vtx, result_vtx);
}
Some(result_vtx)
}
/// Process CaseNode: case/when/else
pub(crate) fn process_case_node(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
case_node: &CaseNode,
) -> Option<VertexId> {
// Process predicate for side effects
if let Some(pred) = case_node.predicate() {
install_node(genv, lenv, changes, source, &pred);
}
let result_vtx = genv.new_vertex();
// Process each when clause
for condition in &case_node.conditions() {
if let Some(when_node) = condition.as_when_node() {
let vtx_when = process_when_clause(genv, lenv, changes, source, &when_node);
if let Some(vtx) = vtx_when {
genv.add_edge(vtx, result_vtx);
}
}
}
// else clause
let has_else = if let Some(else_node) = case_node.else_clause() {
let vtx_else = process_else_clause(genv, lenv, changes, source, &else_node);
if let Some(vtx) = vtx_else {
genv.add_edge(vtx, result_vtx);
}
true
} else {
false
};
// No else clause → add nil
if !has_else {
let nil_vtx = genv.new_source(Type::Nil);
genv.add_edge(nil_vtx, result_vtx);
}
Some(result_vtx)
}
/// Process CaseMatchNode: case/in pattern matching
pub(crate) fn process_case_match_node(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
node: &CaseMatchNode,
) -> Option<VertexId> {
let predicate_vtx = node
.predicate()
.and_then(|pred| install_node(genv, lenv, changes, source, &pred));
let result_vtx = genv.new_vertex();
for condition in &node.conditions() {
if let Some(in_node) = condition.as_in_node() {
let vtx = process_in_clause(genv, lenv, changes, source, &in_node, predicate_vtx);
if let Some(vtx) = vtx {
genv.add_edge(vtx, result_vtx);
}
}
}
let has_else = if let Some(else_node) = node.else_clause() {
let vtx = process_else_clause(genv, lenv, changes, source, &else_node);
if let Some(vtx) = vtx {
genv.add_edge(vtx, result_vtx);
}
true
} else {
false
};
if !has_else {
let nil_vtx = genv.new_source(Type::Nil);
genv.add_edge(nil_vtx, result_vtx);
}
Some(result_vtx)
}
/// Process subsequent node (elsif chain or else)
fn process_subsequent(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
node: &Node,
) -> Option<VertexId> {
// elsif: subsequent is another IfNode
if let Some(if_node) = node.as_if_node() {
return process_if_node(genv, lenv, changes, source, &if_node);
}
// else: subsequent is an ElseNode
if let Some(else_node) = node.as_else_node() {
return process_else_clause(genv, lenv, changes, source, &else_node);
}
None
}
/// Process ElseNode
fn process_else_clause(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
else_node: &ElseNode,
) -> Option<VertexId> {
else_node
.statements()
.and_then(|stmts| install_statements(genv, lenv, changes, source, &stmts))
}
/// Process WhenNode
fn process_when_clause(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
when_node: &WhenNode,
) -> Option<VertexId> {
// Process when conditions for side effects
for cond in &when_node.conditions() {
install_node(genv, lenv, changes, source, &cond);
}
when_node
.statements()
.and_then(|stmts| install_statements(genv, lenv, changes, source, &stmts))
}
/// Process InNode clause body
fn process_in_clause(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
in_node: &InNode,
predicate_vtx: Option<VertexId>,
) -> Option<VertexId> {
process_pattern(genv, lenv, changes, source, &in_node.pattern(), predicate_vtx);
in_node
.statements()
.and_then(|s| install_statements(genv, lenv, changes, source, &s))
}
/// Dispatch pattern processing based on pattern type
fn process_pattern(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
pattern: &Node,
predicate_vtx: Option<VertexId>,
) {
// Guard pattern (in x if condition)
if let Some(if_node) = pattern.as_if_node() {
if let Some(stmts) = if_node.statements() {
for stmt in &stmts.body() {
process_pattern(genv, lenv, changes, source, &stmt, predicate_vtx);
}
}
install_node(genv, lenv, changes, source, &if_node.predicate());
return;
}
if let Some(cap) = pattern.as_capture_pattern_node() {
process_capture_pattern(genv, lenv, changes, source, &cap);
return;
}
// ImplicitNode: hash shorthand pattern { name: } wraps LocalVariableTargetNode
if let Some(implicit) = pattern.as_implicit_node() {
process_pattern(genv, lenv, changes, source, &implicit.value(), predicate_vtx);
return;
}
// LocalVariableTargetNode: single variable binding (in x)
if let Some(target) = pattern.as_local_variable_target_node() {
let var_name = bytes_to_name(target.name().as_slice());
let type_vtx = predicate_vtx.unwrap_or_else(|| genv.new_source(Type::Bot));
install_local_var_write(genv, lenv, changes, var_name, type_vtx);
return;
}
if let Some(arr) = pattern.as_array_pattern_node() {
process_array_pattern(genv, lenv, changes, source, &arr, predicate_vtx);
return;
}
if let Some(find) = pattern.as_find_pattern_node() {
process_find_pattern(genv, lenv, changes, source, &find, predicate_vtx);
return;
}
if let Some(hash) = pattern.as_hash_pattern_node() {
process_hash_pattern(genv, lenv, changes, source, &hash, predicate_vtx);
return;
}
// AlternationPatternNode: 1 | 2 | 3
if let Some(alt) = pattern.as_alternation_pattern_node() {
process_pattern(genv, lenv, changes, source, &alt.left(), predicate_vtx);
process_pattern(genv, lenv, changes, source, &alt.right(), predicate_vtx);
return;
}
// PinnedVariableNode: ^x
if let Some(pinned) = pattern.as_pinned_variable_node() {
install_node(genv, lenv, changes, source, &pinned.variable());
return;
}
// PinnedExpressionNode: ^(expr)
if let Some(pinned) = pattern.as_pinned_expression_node() {
install_node(genv, lenv, changes, source, &pinned.expression());
return;
}
// Literal patterns (Integer, String, etc.) - side effects only
install_node(genv, lenv, changes, source, pattern);
}
/// Process capture pattern: Integer => x, Api::User => u
fn process_capture_pattern(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
cap: &CapturePatternNode,
) {
let value_node = cap.value();
let target = cap.target();
let var_name = bytes_to_name(target.name().as_slice());
let type_vtx = if let Some(name) = super::definitions::extract_constant_path(&value_node) {
genv.new_source(Type::instance(&name))
} else {
install_node(genv, lenv, changes, source, &value_node)
.unwrap_or_else(|| genv.new_vertex())
};
install_local_var_write(genv, lenv, changes, var_name, type_vtx);
}
// TODO: Remove clone
fn type_arg_source(genv: &mut GlobalEnv, vtx: VertexId, index: usize) -> Option<VertexId> {
let source = genv.get_source(vtx)?;
let ty = match &source.ty {
Type::Generic { type_args, .. } => type_args.get(index)?.clone(),
_ => return None,
};
Some(genv.new_source(ty))
}
/// Process array pattern: [x, y] or [x, *rest]
fn process_array_pattern(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
arr: &ArrayPatternNode,
predicate_vtx: Option<VertexId>,
) {
let element_vtx = predicate_vtx.and_then(|vtx| type_arg_source(genv, vtx, 0));
for elem in &arr.requireds() {
process_pattern(genv, lenv, changes, source, &elem, element_vtx);
}
if let Some(target) = arr
.rest()
.and_then(|r| r.as_splat_node())
.and_then(|s| s.expression())
.and_then(|e| e.as_local_variable_target_node())
{
let var_name = bytes_to_name(target.name().as_slice());
let rest_vtx = predicate_vtx.unwrap_or_else(|| genv.new_source(Type::array_of(Type::Bot)));
install_local_var_write(genv, lenv, changes, var_name, rest_vtx);
}
for elem in &arr.posts() {
process_pattern(genv, lenv, changes, source, &elem, element_vtx);
}
}
/// Process hash pattern: { name:, age: }
fn process_hash_pattern(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
hash: &HashPatternNode,
predicate_vtx: Option<VertexId>,
) {
let value_vtx = predicate_vtx.and_then(|vtx| type_arg_source(genv, vtx, 1));
for elem in &hash.elements() {
if let Some(assoc) = elem.as_assoc_node() {
process_pattern(genv, lenv, changes, source, &assoc.value(), value_vtx);
}
}
if let Some(target) = hash
.rest()
.and_then(|r| r.as_assoc_splat_node())
.and_then(|s| s.value())
.and_then(|v| v.as_local_variable_target_node())
{
let var_name = bytes_to_name(target.name().as_slice());
let hash_vtx = genv.new_source(Type::hash());
install_local_var_write(genv, lenv, changes, var_name, hash_vtx);
}
}
/// Process find pattern: [*, x, *]
fn process_find_pattern(
genv: &mut GlobalEnv,
lenv: &mut LocalEnv,
changes: &mut ChangeSet,
source: &str,
find: &FindPatternNode,
predicate_vtx: Option<VertexId>,
) {
let element_vtx = predicate_vtx.and_then(|vtx| type_arg_source(genv, vtx, 0));
let rest_vtx = predicate_vtx.unwrap_or_else(|| genv.new_source(Type::array_of(Type::Bot)));
if let Some(target) = find
.left()
.expression()
.and_then(|e| e.as_local_variable_target_node())
{
let var_name = bytes_to_name(target.name().as_slice());
install_local_var_write(genv, lenv, changes, var_name, rest_vtx);
}
for elem in &find.requireds() {
process_pattern(genv, lenv, changes, source, &elem, element_vtx);
}
if let Some(target) = find
.right()
.as_splat_node()
.and_then(|s| s.expression())
.and_then(|e| e.as_local_variable_target_node())
{
let var_name = bytes_to_name(target.name().as_slice());
install_local_var_write(genv, lenv, changes, var_name, rest_vtx);
}
}