Repository navigation
Expand file tree
/
Copy pathmod.rs
More file actions
1090 lines (1006 loc) · 42.2 KB
/
Copy pathmod.rs
File metadata and controls
1090 lines (1006 loc) · 42.2 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
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//! TypeScript / TSX / JavaScript / JSX extraction — a faithful Rust port of
//! `TreeSitterExtractor`'s TS/JS paths (src/extraction/tree-sitter.ts) plus
//! the typescript/javascript LanguageExtractor configs.
//!
//! Porting contract (R2 of the migration plan): behavior parity with the wasm
//! path, verified by scripts/kernel-parity.mjs over real repos — including
//! bug-for-bug fidelity where the TS code has quirks. Every function notes the
//! TS function it mirrors; if you change one side, change the other or the
//! parity gate fails. Positions are emitted in UTF-16 code units (what
//! web-tree-sitter reports), see util::col16.
mod extractors;
mod fnref;
use crate::textutil as util;
use crate::buffers::{
build_meta, edge_kind_index, node_kind_index, Arena, BoolFlags, EdgeRow, EmitOut, NodeRow,
RefRow, StrRef, Tables, FLAG_IS_ASYNC, FLAG_IS_EXPORTED, FLAG_IS_STATIC, FUNCTION_REF_CODE,
NONE, NONE_STR,
};
use crate::ids;
use crate::langs;
use std::collections::{HashMap, HashSet};
use tree_sitter::{Node, Parser};
#[derive(Clone, Copy, PartialEq, Eq)]
pub enum Variant {
Typescript,
Tsx,
Javascript,
Jsx,
}
impl Variant {
pub fn from_language(language: &str) -> Option<Variant> {
match language {
"typescript" => Some(Variant::Typescript),
"tsx" => Some(Variant::Tsx),
"javascript" => Some(Variant::Javascript),
"jsx" => Some(Variant::Jsx),
_ => None,
}
}
/// TS-family (typescript/tsx): type annotations, interfaces, enums,
/// aliases, visibility, isStatic. The JS family lacks all of those hooks.
fn is_ts(self) -> bool {
matches!(self, Variant::Typescript | Variant::Tsx)
}
/// VALUE_REF_LANGS includes typescript/tsx/javascript but NOT jsx.
fn value_refs(self) -> bool {
!matches!(self, Variant::Jsx)
}
}
/// typescriptExtractor.methodTypes / javascriptExtractor.methodTypes.
fn is_method_type(v: Variant, kind: &str) -> bool {
kind == "method_definition"
|| (v.is_ts() && matches!(kind, "public_field_definition" | "method_signature"))
|| (!v.is_ts() && kind == "field_definition")
}
/// typescriptExtractor.propertyTypes. The interface counterpart of
/// `public_field_definition`: it carries no value, so it is always a property
/// and never goes through classify_ts_class_member (#1638).
fn is_property_type(v: Variant, kind: &str) -> bool {
v.is_ts() && kind == "property_signature"
}
/// Method node types that spell a SIGNATURE — a declaration with no body (#1638).
///
/// They are a method of whatever type declares them and nothing on their own, so
/// they must not take `extract_method`'s "no class-like parent, so treat it as a
/// free function" fallback. The other method types can: a `method_definition`
/// outside a class really is a function. This one appears outside a class only
/// inside a type literal (`type Handle = { stop(): void }`), whose members
/// `extract_ts_type_alias_members` already extracts and attaches to the alias
/// (#359) — take the fallback and the file gains a phantom top-level
/// `function stop` beside the real `Handle::stop`. Mirrors the TS extractor's
/// SIGNATURE_METHOD_NODE_TYPES (extraction/tree-sitter.ts).
fn is_signature_method_type(kind: &str) -> bool {
kind == "method_signature"
}
fn is_function_type(kind: &str) -> bool {
matches!(kind, "function_declaration" | "generator_function_declaration" | "arrow_function" | "function_expression" | "generator_function")
}
fn is_class_type(v: Variant, kind: &str) -> bool {
kind == "class_declaration" || (v.is_ts() && kind == "abstract_class_declaration")
}
fn is_variable_type(kind: &str) -> bool {
matches!(kind, "lexical_declaration" | "variable_declaration")
}
/// LITERAL_RECEIVER_TYPES (tree-sitter.ts) — full set; only a handful occur in
/// TS/JS grammars but membership is what the TS code tests.
fn is_literal_receiver(kind: &str) -> bool {
matches!(
kind,
"string" | "string_literal" | "interpreted_string_literal" | "raw_string_literal"
| "template_string" | "concatenated_string" | "formatted_string" | "f_string"
| "line_string_literal" | "string_content" | "heredoc_body"
| "number" | "number_literal" | "integer" | "integer_literal" | "float"
| "float_literal" | "int_literal" | "decimal_integer_literal" | "real_literal"
| "char_literal" | "character_literal" | "rune_literal" | "regex" | "regex_literal"
| "true" | "false" | "boolean_literal" | "bool_literal" | "none" | "null" | "nil"
| "null_literal" | "undefined"
| "list" | "list_literal" | "array" | "array_literal" | "array_creation_expression"
| "dictionary" | "dict_literal" | "object" | "tuple" | "set"
)
}
/// BUILTIN_TYPES (tree-sitter.ts) — names that never become type references.
fn is_builtin_type(name: &str) -> bool {
matches!(
name,
"string" | "number" | "boolean" | "void" | "null" | "undefined" | "never" | "any"
| "unknown" | "object" | "symbol" | "bigint" | "true" | "false"
| "str" | "bool" | "i8" | "i16" | "i32" | "i64" | "i128" | "isize"
| "u8" | "u16" | "u32" | "u64" | "u128" | "usize" | "f32" | "f64" | "char"
| "int" | "long" | "short" | "byte" | "float" | "double"
| "int8" | "int16" | "int32" | "int64" | "uint8" | "uint16" | "uint32" | "uint64"
| "float32" | "float64" | "complex64" | "complex128" | "rune" | "error"
| "Int" | "Long" | "Short" | "Byte" | "Float" | "Double" | "Boolean" | "Char"
| "Unit" | "String" | "Any" | "AnyRef" | "AnyVal" | "Nothing" | "Null"
)
}
/// REACT_COMPONENT_HOCS (tree-sitter.ts, #841).
fn is_react_hoc(callee: &str) -> bool {
matches!(callee, "forwardRef" | "memo" | "React.forwardRef" | "React.memo")
}
fn is_vue_collection_name(name: &str) -> bool {
matches!(name, "actions" | "mutations" | "getters")
}
/// One scope-stack entry (TS keeps node IDs; rows are our equivalent).
struct Scope {
row: u32,
kind: &'static str,
name: String,
}
/// Extra node properties, per-extract-site (mirrors createNode's `extra`).
#[derive(Default)]
struct Extra {
docstring: Option<String>,
signature: Option<String>,
visibility: Option<u8>,
is_exported: Option<bool>,
is_async: Option<bool>,
is_static: Option<bool>,
qualified_name: Option<String>,
}
struct ValueScope<'t> {
row: u32,
node: Node<'t>,
name: String,
}
pub struct Walker<'t> {
src: &'t str,
file_path: &'t str,
variant: Variant,
line_starts: Vec<usize>,
arena: Arena,
node_id_allocator: ids::NodeIdAllocator,
tables: Tables,
stack: Vec<Scope>,
/// Node id string per row. Rows are unique but IDS COLLIDE for same
/// (kind, name, line) nodes — routine in minified one-line files — and the
/// TS extractor's fn-ref dedupe and value-ref self-checks key on the ID,
/// so parity requires comparing ids, not rows.
node_ids: Vec<String>,
/// Function/method names defined in this file (fn-ref flush gate).
defined_fn_names: HashSet<String>,
/// Simple names from `imports` refs (fn-ref flush gate).
imported_names: HashSet<String>,
fn_ref_cands: Vec<(u32, fnref::Candidate)>,
// Value-reference bookkeeping (flushValueRefs).
fs_values: HashMap<String, u32>,
fs_value_counts: HashMap<String, u32>,
value_scopes: Vec<ValueScope<'t>>,
vue_store_file: Option<bool>,
}
const MAX_VALUE_REF_NODES: usize = 20_000;
pub fn extract(file_path: &str, source: &str, language: &str) -> Result<EmitOut, String> {
let variant = Variant::from_language(language)
.ok_or_else(|| format!("tsjs walker does not handle language: {language}"))?;
let grammar = langs::grammar_for(language)
.ok_or_else(|| format!("no grammar for language: {language}"))?;
let t0 = std::time::Instant::now();
let mut parser = Parser::new();
parser
.set_language(&grammar)
.map_err(|e| format!("set_language({language}) failed: {e}"))?;
let tree = parser
.parse(source, None)
.ok_or_else(|| "parser returned null tree".to_string())?;
// Files with parse ERRORS defer to the wasm extractor (the `defer:` prefix
// tells the TS side this is expected routing, not a malfunction). Reason:
// tree-sitter's error RECOVERY — same grammar, same core version — resolves
// differently under UTF-8 (native) vs UTF-16 (web-tree-sitter) parsing, so
// an erroring file's tree can differ between the paths (proven on vscode:
// `readonly import('x').T[]` recovered with the ERROR inside vs outside the
// type annotation). Erroring files are rare (0-0.42% across express/
// excalidraw/vscode) and per-file wasm fallback keeps routing graph-neutral
// by construction; clean files — 99.6%+ — stay on the fast path.
if tree.root_node().has_error() {
return Err("defer: parse tree contains errors — wasm recovery is canonical".to_string());
}
let mut w = Walker {
src: source,
file_path,
variant,
line_starts: util::line_starts(source),
arena: Arena::default(),
node_id_allocator: ids::NodeIdAllocator::default(),
tables: Tables::default(),
stack: Vec::new(),
node_ids: Vec::new(),
defined_fn_names: HashSet::new(),
imported_names: HashSet::new(),
fn_ref_cands: Vec::new(),
fs_values: HashMap::new(),
fs_value_counts: HashMap::new(),
value_scopes: Vec::new(),
vue_store_file: None,
};
// File node (TreeSitterExtractor.extract): id `file:<path>`, endLine =
// newline count + 1, isExported explicitly false.
let line_count = source.bytes().filter(|b| *b == b'\n').count() as u32 + 1;
let base_name = file_path.rsplit(['/', '\\']).next().unwrap_or(file_path);
let mut flags = BoolFlags::default();
flags.set(FLAG_IS_EXPORTED, false);
let file_id = w.arena.put(&ids::file_node_id(file_path));
let name_ref = w.arena.put(base_name);
let qn_ref = w.arena.put(file_path);
w.tables.push_node(&NodeRow {
kind: node_kind_index("file").unwrap(),
visibility: 0,
flags,
start_line: 1,
end_line: line_count,
start_column: 0,
end_column: 0,
name: name_ref,
qualified_name: qn_ref,
id: file_id,
docstring: NONE_STR,
signature: NONE_STR,
decorators: NONE_STR,
type_parameters: NONE_STR,
return_type: NONE_STR,
extra_json: NONE_STR,
});
w.node_ids.push(ids::file_node_id(file_path));
w.stack.push(Scope { row: 0, kind: "file", name: base_name.to_string() });
w.visit_node(tree.root_node());
// End-of-file passes, in the TS extract() order.
w.flush_fn_ref_candidates();
w.flush_value_refs(tree.root_node());
w.stack.pop();
let duration_ms = t0.elapsed().as_secs_f64() * 1000.0;
let meta = build_meta(&w.tables, w.arena.len(), NONE_STR, duration_ms);
Ok(EmitOut {
meta,
nodes: w.tables.nodes,
edges: w.tables.edges,
refs: w.tables.refs,
arena: w.arena.into_vec(),
})
}
impl<'t> Walker<'t> {
// --- small helpers --------------------------------------------------------
fn text(&self, node: Node) -> &'t str {
&self.src[node.byte_range()]
}
fn line_of(&self, node: Node) -> u32 {
node.start_position().row as u32 + 1
}
fn col_of(&self, node: Node) -> u32 {
util::col16(self.src, &self.line_starts, node.start_position().row, node.start_byte())
}
fn end_col_of(&self, node: Node) -> u32 {
util::col16(self.src, &self.line_starts, node.end_position().row, node.end_byte())
}
fn top_row(&self) -> u32 {
self.stack.last().map(|s| s.row).unwrap_or(0)
}
/// isInsideClassLikeNode.
fn inside_class_like(&self) -> bool {
self.stack
.last()
.map(|s| matches!(s.kind, "class" | "struct" | "interface" | "trait" | "enum" | "module"))
.unwrap_or(false)
}
fn push_ref(&mut self, from_row: u32, name: &str, kind_code: u8, node: Node) {
let name_ref = self.arena.put(name);
self.tables.push_ref(&RefRow {
from_idx: from_row,
kind: kind_code,
line: self.line_of(node),
column: self.col_of(node),
reference_name: name_ref,
candidates: NONE_STR,
from_id_str: NONE_STR,
});
if kind_code == edge_kind_index("imports").unwrap() {
// Feed the fn-ref flush gate the same way flushFnRefCandidates
// derives importedNames from `imports` refs.
if util::simple_name().is_match(name) {
self.imported_names.insert(name.to_string());
} else if let Some(c) = util::qualified_import().captures(name) {
self.imported_names.insert(c[1].to_string());
}
}
}
fn push_call_ref(&mut self, name: &str, node: Node) {
self.push_ref(self.top_row(), name, edge_kind_index("calls").unwrap(), node);
}
// --- createNode -----------------------------------------------------------
/// createNode (tree-sitter.ts): id, qualified name from the scope stack,
/// contains edge from the parent scope, value-ref bookkeeping.
fn create_node(&mut self, kind: &'static str, name: &str, node: Node<'t>, extra: Extra) -> Option<u32> {
if name.is_empty() {
return None;
}
let start_line = self.line_of(node);
let column = self.col_of(node);
let id = self.node_id_allocator.generate(self.file_path, kind, name, start_line, column);
// endLine body extension: resolveBody only (TS/JS: function-valued
// class fields whose body nests in the arrow / HOF-wrapped arrow).
let mut end_line = node.end_position().row as u32 + 1;
if (kind == "function" || kind == "method") && matches!(node.kind(), "public_field_definition" | "field_definition")
{
if let Some(body) = resolve_field_body(node) {
let be = body.end_position().row as u32 + 1;
if be > end_line {
end_line = be;
}
}
}
let qualified = extra.qualified_name.unwrap_or_else(|| {
let mut parts: Vec<&str> = Vec::new();
for s in &self.stack {
if s.kind != "file" {
parts.push(&s.name);
}
}
let mut qn = parts.join("::");
if !qn.is_empty() {
qn.push_str("::");
}
qn.push_str(name);
qn
});
let mut flags = BoolFlags::default();
if let Some(v) = extra.is_exported {
flags.set(FLAG_IS_EXPORTED, v);
}
if let Some(v) = extra.is_async {
flags.set(FLAG_IS_ASYNC, v);
}
if let Some(v) = extra.is_static {
flags.set(FLAG_IS_STATIC, v);
}
let name_ref = self.arena.put(name);
let qn_ref = self.arena.put(&qualified);
let id_ref = self.arena.put(&id);
let doc_ref = opt_str(&mut self.arena, extra.docstring.as_deref());
let sig_ref = opt_str(&mut self.arena, extra.signature.as_deref());
let row = self.tables.push_node(&NodeRow {
kind: node_kind_index(kind).unwrap(),
visibility: extra.visibility.unwrap_or(0),
flags,
start_line,
end_line,
start_column: self.col_of(node),
end_column: self.end_col_of(node),
name: name_ref,
qualified_name: qn_ref,
id: id_ref,
docstring: doc_ref,
signature: sig_ref,
decorators: NONE_STR,
type_parameters: NONE_STR,
return_type: NONE_STR,
extra_json: NONE_STR,
});
// Containment edge from the current scope.
let parent_row = self.top_row();
self.tables.push_edge(&EdgeRow {
source_idx: parent_row,
target_idx: row,
kind: edge_kind_index("contains").unwrap(),
provenance: 0,
line: NONE,
column: NONE,
metadata_json: NONE_STR,
source_id_str: NONE_STR,
target_id_str: NONE_STR,
});
self.node_ids.push(id);
if kind == "function" || kind == "method" {
self.defined_fn_names.insert(name.to_string());
}
self.capture_value_ref_scope(kind, name, row, node);
Some(row)
}
// --- value references (captureValueRefScope / flushValueRefs) --------------
fn capture_value_ref_scope(&mut self, kind: &'static str, name: &str, row: u32, node: Node<'t>) {
if !self.variant.value_refs() {
return;
}
let target_kind_ok = kind == "constant" || kind == "variable";
if target_kind_ok
&& util::utf16_len(name) >= 3
&& util::has_upper_or_underscore().is_match(name)
{
let parent_ok = self
.stack
.last()
.map(|s| matches!(s.kind, "file" | "class" | "module" | "struct" | "enum"))
.unwrap_or(false);
if parent_ok {
self.fs_values.insert(name.to_string(), row);
*self.fs_value_counts.entry(name.to_string()).or_insert(0) += 1;
}
}
if matches!(kind, "function" | "method" | "constant" | "variable") {
self.value_scopes.push(ValueScope { row, node, name: name.to_string() });
}
}
fn flush_value_refs(&mut self, root: Node<'t>) {
let scopes = std::mem::take(&mut self.value_scopes);
let mut targets = std::mem::take(&mut self.fs_values);
let counts = std::mem::take(&mut self.fs_value_counts);
if !self.variant.value_refs() || std::env::var("CODEGRAPH_VALUE_REFS").as_deref() == Ok("0") {
return;
}
if targets.is_empty() || scopes.is_empty() || util::is_generated_file(self.file_path) {
return;
}
// Shadow prune: count declarators of each target name across the whole
// tree; more declarators than file-scope nodes ⇒ an inner re-binding
// shadows the target. (TS/JS declarators are `variable_declarator`;
// the other kinds in the TS switch belong to other grammars.)
let mut decl_counts: HashMap<&str, u32> = HashMap::new();
let mut dstack: Vec<Node> = vec![root];
let mut dvisited = 0usize;
while let Some(n) = dstack.pop() {
if dvisited >= MAX_VALUE_REF_NODES {
break;
}
dvisited += 1;
if n.kind() == "variable_declarator" {
if let Some(first) = n.named_child(0) {
if first.kind() == "identifier" {
let nm = self.text(first);
if targets.contains_key(nm) {
*decl_counts.entry(nm).or_insert(0) += 1;
}
}
}
}
for i in 0..n.named_child_count() {
if let Some(c) = n.named_child(i) {
dstack.push(c);
}
}
}
let shadowed: Vec<String> = decl_counts
.iter()
.filter(|(nm, c)| **c > counts.get(**nm).copied().unwrap_or(1))
.map(|(nm, _)| nm.to_string())
.collect();
for nm in shadowed {
targets.remove(&nm);
}
if targets.is_empty() {
return;
}
let refs_kind = edge_kind_index("references").unwrap();
for scope in &scopes {
// Self-skip and per-scope dedupe compare node ID STRINGS (which
// collide for same-(kind, name, line) nodes), matching the TS side.
let mut seen: HashSet<&str> = HashSet::new();
let mut stack: Vec<Node> = vec![scope.node];
let mut visited = 0usize;
while let Some(n) = stack.pop() {
if visited >= MAX_VALUE_REF_NODES {
break;
}
visited += 1;
if matches!(n.kind(), "identifier" | "constant" | "name" | "simple_identifier") {
let ref_name = self.text(n);
if let Some(&target_row) = targets.get(ref_name) {
let target_id = self.node_ids[target_row as usize].as_str();
if target_id != self.node_ids[scope.row as usize]
&& ref_name != scope.name
&& !seen.contains(&target_id)
{
seen.insert(target_id);
let meta = self.arena.put(r#"{"valueRef":true}"#);
self.tables.push_edge(&EdgeRow {
source_idx: scope.row,
target_idx: target_row,
kind: refs_kind,
provenance: 0,
line: NONE,
column: NONE,
metadata_json: meta,
source_id_str: NONE_STR,
target_id_str: NONE_STR,
});
}
}
}
for i in 0..n.named_child_count() {
if let Some(c) = n.named_child(i) {
stack.push(c);
}
}
}
}
}
// --- function-as-value refs (#756) -----------------------------------------
fn maybe_capture_fn_refs(&mut self, node: Node<'t>) {
let Some(mode) = fnref::dispatch(node.kind()) else { return };
if self.stack.is_empty() {
return;
}
let from = self.top_row();
for (cand, _mode) in fnref::capture(node, mode, self.src) {
self.fn_ref_cands.push((from, cand));
}
}
/// scanFnRefSubtree: capture-only walk of subtrees the main walkers skip.
fn scan_fn_ref_subtree(&mut self, node: Node<'t>, depth: u32) {
stack_guard!();
if depth > 12 {
return;
}
let kind = node.kind();
if depth > 0
&& (is_function_type(kind) || matches!(kind, "lambda_literal" | "lambda_expression"))
{
return;
}
self.maybe_capture_fn_refs(node);
for i in 0..node.named_child_count() {
if let Some(c) = node.named_child(i) {
self.scan_fn_ref_subtree(c, depth + 1);
}
}
}
fn flush_fn_ref_candidates(&mut self) {
let cands = std::mem::take(&mut self.fn_ref_cands);
if cands.is_empty() || util::is_generated_file(self.file_path) {
return;
}
let mut seen: HashSet<(String, String)> = HashSet::new();
for (from, c) in cands {
// Gate: `this.<member>` always flushes; everything else must match
// a same-file function/method or an imported name. (The `::` and
// ungated-mode policies belong to other languages' specs.)
if !c.name.starts_with("this.")
&& !c.name.contains("::")
&& !self.defined_fn_names.contains(&c.name)
&& !self.imported_names.contains(&c.name)
{
continue;
}
// Dedupe on the node ID STRING, not the row — ids collide for
// same-(kind, name, line) nodes (minified one-liners) and the TS
// side keys its dedupe on `${fromNodeId}|${name}`.
if !seen.insert((self.node_ids[from as usize].clone(), c.name.clone())) {
continue;
}
let column = util::col16(self.src, &self.line_starts, c.row, c.column_byte);
let name_ref = self.arena.put(&c.name);
self.tables.push_ref(&RefRow {
from_idx: from,
kind: FUNCTION_REF_CODE,
line: c.line,
column,
reference_name: name_ref,
candidates: NONE_STR,
from_id_str: NONE_STR,
});
}
}
// --- the dispatcher (visitNode) --------------------------------------------
fn visit_node(&mut self, node: Node<'t>) {
stack_guard!();
let kind = node.kind();
let mut skip_children = false;
// Function-as-value capture — independent of the dispatch ladder.
self.maybe_capture_fn_refs(node);
if is_function_type(kind) {
// (the isInsideClassLike + methodTypes overlap is Python/Ruby-only)
self.extract_function(node, None);
skip_children = true;
} else if is_class_type(self.variant, kind) {
self.extract_class(node);
skip_children = true;
} else if is_method_type(self.variant, kind)
&& (!is_signature_method_type(kind) || self.inside_class_like())
{
if classify_ts_class_member(node) == Member::Property {
let prop = self.extract_property(node);
if let (Some((row, name)), Some(value)) = (prop, node.child_by_field_name("value")) {
self.stack.push(Scope { row, kind: "property", name });
self.visit_function_body(value);
self.stack.pop();
}
self.scan_fn_ref_subtree(node, 0);
} else {
self.extract_method(node);
}
skip_children = true;
} else if self.variant.is_ts() && kind == "interface_declaration" {
self.extract_interface(node);
skip_children = true;
} else if self.variant.is_ts() && kind == "enum_declaration" {
self.extract_enum(node);
skip_children = true;
} else if self.variant.is_ts() && kind == "type_alias_declaration" {
skip_children = self.extract_type_alias(node);
} else if is_variable_type(kind) && !self.inside_class_like() {
self.extract_variable(node);
self.scan_fn_ref_subtree(node, 0);
skip_children = true;
} else if kind == "import_statement" {
self.extract_import(node);
} else if kind == "export_statement" && node.child_by_field_name("source").is_some() {
// Re-export: `export { X } from './y'`.
self.emit_re_export_refs(node);
} else if kind == "export_statement" && self.looks_like_vue_store_file() {
// Vuex MODULE default export (`export default { actions: {…} }`).
if let Some(exported) = node.child_by_field_name("value") {
if matches!(exported.kind(), "object" | "object_expression") {
self.extract_store_collection_methods(exported);
skip_children = true;
}
}
} else if kind == "call_expression" {
self.extract_call(node);
} else if kind == "new_expression" {
self.extract_instantiation(node);
} else if is_property_type(self.variant, kind) && self.inside_class_like() {
// NOTE: `property_signature` / `method_signature` used to be handled
// here together, hanging their type annotations off the ENCLOSING
// INTERFACE — the only anchor available while the members themselves
// went unextracted. Since #1638 `method_signature` is a method type
// and `property_signature` a property type, so the method branch
// above claims the first (under the same inside_class_like guard
// this branch had) and this one extracts the second as a real node.
// The `references` edges survive — extract_method and
// extract_property each call extract_type_annotations — but now hang
// off the member, the more precise anchor: `Api::fetch → PageId`
// says which member wants the type, where `Api → PageId` only said
// the file did.
self.extract_property(node);
self.scan_fn_ref_subtree(node, 0);
skip_children = true;
}
if !skip_children {
for i in 0..node.named_child_count() {
if let Some(c) = node.named_child(i) {
self.visit_node(c);
}
}
}
}
// --- visitFunctionBody ------------------------------------------------------
fn visit_function_body(&mut self, body: Node<'t>) {
self.visit_for_calls_and_structure(body);
}
fn visit_for_calls_and_structure(&mut self, node: Node<'t>) {
stack_guard!();
let kind = node.kind();
self.maybe_capture_fn_refs(node);
if kind == "call_expression" {
self.extract_call(node);
} else if kind == "new_expression" {
self.extract_instantiation(node);
}
// Local variable type annotations (TS family only).
if self.variant.is_ts() && kind == "variable_declarator" {
let owner = self.top_row();
self.extract_variable_type_annotation(node, owner);
}
// Nested NAMED functions become their own nodes — and so does the
// function a React handler hook binds a name to (`const onPress =
// useCallback(() => {…}, [])`). Mirrors TreeSitterExtractor's
// reactHookBoundName.
if is_function_type(kind) {
let name = self.extract_name(node);
if name != "<anonymous>" {
self.extract_function(node, None);
return;
}
if let Some(bound) = self.react_hook_bound_name(node) {
self.extract_function(node, Some(bound));
return;
}
// `const run = Effect.fn("Session.run")(function* () {…})` (#1747):
// the same declarator binding through a curried wrapper. Mirrors
// TreeSitterExtractor's curriedWrapperBoundName.
if let Some(bound) = self.curried_wrapper_bound_name(node) {
self.extract_function(node, Some(bound));
return;
}
// `const handleClear = () => {…}` inside a body (#1669): named by
// its declarator, like at module scope. Mirrors
// TreeSitterExtractor's declaratorBoundFunction.
if self.declarator_bound_function(node) {
self.extract_function(node, None);
return;
}
}
if is_class_type(self.variant, kind) {
self.extract_class(node);
return;
}
if self.variant.is_ts() && kind == "enum_declaration" {
self.extract_enum(node);
return;
}
if self.variant.is_ts() && kind == "interface_declaration" {
self.extract_interface(node);
return;
}
for i in 0..node.named_child_count() {
if let Some(c) = node.named_child(i) {
self.visit_for_calls_and_structure(c);
}
}
}
// --- name / signature / modifier helpers ------------------------------------
/// Whether an anonymous function is the whole value of a
/// `variable_declarator` with a plain identifier name —
/// `const NAME = () => {…}` / `= function () {…}`.
fn declarator_bound_function(&self, node: Node<'t>) -> bool {
if !matches!(node.kind(), "arrow_function" | "function_expression") {
return false;
}
let Some(declarator) = node.parent() else { return false };
if declarator.kind() != "variable_declarator" {
return false;
}
let Some(value) = declarator.child_by_field_name("value") else { return false };
if value.start_byte() != node.start_byte() || value.end_byte() != node.end_byte() {
return false;
}
declarator
.child_by_field_name("name")
.map(|n| n.kind() == "identifier")
.unwrap_or(false)
}
/// The declarator name a React handler hook binds an anonymous function
/// to — `const NAME = useCallback(<node>, [...])` (also `React.useCallback`,
/// `useEffectEvent`, `useEvent`) — or None for any other shape. The node
/// must be the call's FIRST argument and the call's value must be bound
/// directly by a `variable_declarator`.
fn react_hook_bound_name(&self, node: Node<'t>) -> Option<String> {
if !matches!(node.kind(), "arrow_function" | "function_expression") {
return None;
}
let args = node.parent()?;
if args.kind() != "arguments" {
return None;
}
let first = args.named_child(0)?;
if first.start_byte() != node.start_byte() || first.end_byte() != node.end_byte() {
return None;
}
let call = args.parent()?;
if call.kind() != "call_expression" {
return None;
}
let callee = call.child_by_field_name("function")?;
let callee_text = self.text(callee);
let hook = callee_text.strip_prefix("React.").unwrap_or(callee_text);
if !matches!(hook, "useCallback" | "useEffectEvent" | "useEvent") {
return None;
}
let declarator = call.parent()?;
if declarator.kind() != "variable_declarator" {
return None;
}
let name_node = declarator.child_by_field_name("name")?;
if name_node.kind() != "identifier" {
return None;
}
Some(self.text(name_node).to_string())
}
/// The declarator name for an anonymous function passed to a CURRIED
/// wrapper call — `const NAME = factory(...)(function () {…})` — or the
/// property key when the call is an object member, `{ NAME: factory(...)(fn) }`;
/// else None.
///
/// `react_hook_bound_name` above names a function through the declarator
/// that binds it; the shape is general, but that method is bounded to the
/// three React handler hooks. This is the same shape with a different,
/// equally decidable bound: the callee is itself a call, i.e. a factory
/// that returns the wrapper (#1747). Requiring that keeps it narrow —
/// `useMemo(|| …, [])` and `arr.map(…)` are single calls and stay
/// anonymous, exactly as before.
///
/// Generators are admitted here and not in `react_hook_bound_name`: a
/// React handler is never a generator, while `function*` is the common
/// form in the ecosystem this shape comes from.
///
/// Mirrors TreeSitterExtractor's curriedWrapperBoundName.
fn curried_wrapper_bound_name(&self, node: Node<'t>) -> Option<String> {
if !matches!(
node.kind(),
"arrow_function" | "function_expression" | "generator_function"
) {
return None;
}
let args = node.parent()?;
if args.kind() != "arguments" {
return None;
}
let first = args.named_child(0)?;
if first.start_byte() != node.start_byte() || first.end_byte() != node.end_byte() {
return None;
}
let call = args.parent()?;
if call.kind() != "call_expression" {
return None;
}
// The bound that replaces the hook allowlist: the thing being called
// is itself a call, so this is a curried wrapper's second application.
let callee = call.child_by_field_name("function")?;
if callee.kind() != "call_expression" {
return None;
}
let binder = call.parent()?;
// `{ getMode: Effect.fn("…")(function* () {…}) }`: an object member is
// named by its property key, as extract_object_literal_functions names
// `key: () => {}`.
if binder.kind() == "pair" {
let key = binder.child_by_field_name("key")?;
let value = binder.child_by_field_name("value")?;
if value.start_byte() != call.start_byte() || value.end_byte() != call.end_byte() {
return None;
}
return Some(util::object_key_name(self.text(key)));
}
if binder.kind() != "variable_declarator" {
return None;
}
let name_node = binder.child_by_field_name("name")?;
if name_node.kind() != "identifier" {
return None;
}
Some(self.text(name_node).to_string())
}
/// extractName / extractNameRaw for the TS/JS configs.
fn extract_name(&self, node: Node) -> String {
// javascriptExtractor.resolveName: field_definition names its key the
// `property` field.
if !self.variant.is_ts() && node.kind() == "field_definition" {
if let Some(prop) = node.child_by_field_name("property") {
return self.text(prop).to_string();
}
}
if let Some(name_node) = node.child_by_field_name("name") {
return self.text(name_node).to_string();
}
if matches!(node.kind(), "arrow_function" | "function_expression" | "generator_function") {
return "<anonymous>".to_string();
}
for i in 0..node.named_child_count() {
if let Some(c) = node.named_child(i) {
if matches!(c.kind(), "identifier" | "type_identifier" | "simple_identifier" | "constant") {
return self.text(c).to_string();
}
}
}
"<anonymous>".to_string()
}
/// typescriptExtractor.getSignature / javascriptExtractor.getSignature.
fn signature_of(&self, node: Node) -> Option<String> {
let params = node.child_by_field_name("parameters")?;
let mut sig = self.text(params).to_string();
if self.variant.is_ts() {
if let Some(ret) = node.child_by_field_name("return_type") {
let ret_text = self.text(ret);
let stripped = ret_text.strip_prefix(':').unwrap_or(ret_text).trim_start();
sig.push_str(": ");
sig.push_str(stripped);
}
}
Some(sig)
}
/// typescriptExtractor.getVisibility (TS only — JS has no hook).
fn visibility_of(&self, node: Node) -> Option<u8> {
if !self.variant.is_ts() {
return None;
}
for i in 0..node.child_count() {
let child = node.child(i)?;
if child.kind() == "accessibility_modifier" {
return match self.text(child) {
"public" => Some(1),
"private" => Some(2),
"protected" => Some(3),
_ => None,
};
}
}
None
}
/// isExported: walk the parent chain for an export_statement.
fn is_exported(&self, node: Node) -> bool {
let mut cur = node.parent();
while let Some(p) = cur {
if p.kind() == "export_statement" {
return true;
}
cur = p.parent();
}
false
}
fn has_keyword_child(&self, node: Node, kw: &str) -> bool {
for i in 0..node.child_count() {
if let Some(c) = node.child(i) {
if c.kind() == kw {
return true;
}
}
}
false
}