deno_graph 0.108.1

Module graph analysis for deno
Documentation
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
// Copyright 2018-2024 the Deno authors. MIT license.

use std::borrow::Cow;
use std::cell::RefCell;
use std::collections::BTreeMap;
use std::sync::Arc;

use async_trait::async_trait;
use deno_ast::ModuleSpecifier;
use deno_graph::GraphKind;
use deno_graph::ModuleGraph;
use deno_graph::NpmLoadError;
use deno_graph::NpmResolvePkgReqsResult;
use deno_graph::WorkspaceFastCheckOption;
use deno_graph::WorkspaceMember;
use deno_graph::ast::CapturingModuleAnalyzer;
use deno_graph::fast_check::FastCheckCache;
use deno_graph::fast_check::FastCheckCacheItem;
use deno_graph::fast_check::FastCheckCacheKey;
use deno_graph::packages::JsrVersionResolver;
use deno_graph::packages::NewestDependencyDateOptions;
use deno_graph::source::CacheInfo;
use deno_graph::source::CacheSetting;
use deno_graph::source::HashMapLocker;
use deno_graph::source::LoadFuture;
use deno_graph::source::LoadOptions;
use deno_graph::source::Loader;
use deno_graph::source::LoaderChecksum;
use deno_graph::source::Locker;
use deno_graph::source::MemoryLoader;
use deno_graph::source::NpmResolver;
use deno_semver::Version;
use deno_semver::jsr::JsrPackageReqReference;
use deno_semver::package::PackageNv;
use deno_semver::package::PackageReq;
use futures::FutureExt;

#[derive(Default)]
pub struct TestLoader {
  pub cache: MemoryLoader,
  pub remote: MemoryLoader,
}

impl Loader for TestLoader {
  fn get_cache_info(&self, specifier: &ModuleSpecifier) -> Option<CacheInfo> {
    self.cache.get_cache_info(specifier)
  }

  fn load(
    &self,
    specifier: &ModuleSpecifier,
    options: LoadOptions,
  ) -> LoadFuture {
    let checksum = options.maybe_checksum.clone();
    let future = match options.cache_setting {
      // todo(dsherret): in the future, actually make this use the cache
      CacheSetting::Use => self.remote.load(specifier, options),
      // todo(dsherret): in the future, make this update the cache
      CacheSetting::Reload => self.remote.load(specifier, options),
      CacheSetting::Only => self.cache.load(specifier, options),
    };
    async move {
      let response = future.await?;
      if let Some(deno_graph::source::LoadResponse::Module { content, .. }) =
        &response
        && let Some(checksum) = checksum
      {
        checksum.check_source(content)?;
      }
      Ok(response)
    }
    .boxed_local()
  }
}

#[cfg(feature = "symbols")]
pub mod symbols {
  pub struct SymbolsResult {
    #[allow(unused)]
    pub output: String,
  }
}

pub struct BuildResult {
  #[allow(unused)]
  pub locker: Option<HashMapLocker>,
  pub graph: ModuleGraph,
  pub analyzer: CapturingModuleAnalyzer,
  #[allow(unused)]
  pub fast_check_cache: Option<TestFastCheckCache>,
}

#[cfg(feature = "symbols")]
impl BuildResult {
  pub fn root_symbol(&self) -> deno_graph::symbols::RootSymbol<'_> {
    self.graph.valid().unwrap(); // assert valid
    deno_graph::symbols::RootSymbol::new(&self.graph, &self.analyzer)
  }
}

#[derive(Debug)]
pub struct TestNpmResolver;

#[async_trait(?Send)]
impl NpmResolver for TestNpmResolver {
  fn load_and_cache_npm_package_info(&self, _package_name: &str) {}

  async fn resolve_pkg_reqs(
    &self,
    package_reqs: &[PackageReq],
  ) -> NpmResolvePkgReqsResult {
    // for now, this requires version reqs that are resolved
    NpmResolvePkgReqsResult {
      results: package_reqs
        .iter()
        .map(|pkg_req| {
          match Version::parse_from_npm(&pkg_req.version_req.to_string()) {
            Ok(_) => Ok(()),
            Err(err) => Err(NpmLoadError::PackageReqResolution(Arc::new(err))),
          }
        })
        .collect::<Vec<_>>(),
      dep_graph_result: Ok(()),
    }
  }
}

#[derive(Default)]
pub struct TestFastCheckCache {
  // BTreeMap because the cache items are inserted non-deterministically
  pub inner: RefCell<BTreeMap<FastCheckCacheKey, FastCheckCacheItem>>,
}

impl FastCheckCache for TestFastCheckCache {
  fn hash_seed(&self) -> &'static str {
    "stable-for-tests"
  }

  fn get(&self, key: FastCheckCacheKey) -> Option<FastCheckCacheItem> {
    self.inner.borrow().get(&key).cloned()
  }

  fn set(&self, key: FastCheckCacheKey, value: FastCheckCacheItem) {
    self.inner.borrow_mut().insert(key, value);
  }
}

pub struct TestBuilder {
  locker: Option<HashMapLocker>,
  graph: ModuleGraph,
  loader: TestLoader,
  entry_point: String,
  entry_point_types: String,
  fast_check_cache: bool,
  lockfile_jsr_packages: BTreeMap<PackageReq, PackageNv>,
  newest_dependency_date: NewestDependencyDateOptions,
  resolver: Option<Box<dyn deno_graph::source::Resolver>>,
  skip_dynamic_deps: bool,
  workspace_members: Vec<WorkspaceMember>,
  workspace_fast_check: bool,
  unstable_bytes_imports: bool,
  unstable_text_imports: bool,
}

impl TestBuilder {
  pub fn new() -> Self {
    Self {
      locker: Default::default(),
      graph: ModuleGraph::new(GraphKind::All),
      loader: Default::default(),
      entry_point: "file:///mod.ts".to_string(),
      entry_point_types: "file:///mod.ts".to_string(),
      fast_check_cache: false,
      lockfile_jsr_packages: Default::default(),
      newest_dependency_date: Default::default(),
      skip_dynamic_deps: false,
      resolver: None,
      workspace_members: Default::default(),
      workspace_fast_check: false,
      unstable_bytes_imports: false,
      unstable_text_imports: false,
    }
  }

  pub fn with_loader(
    &mut self,
    mut action: impl FnMut(&mut TestLoader),
  ) -> &mut Self {
    action(&mut self.loader);
    self
  }

  #[allow(unused)]
  pub fn entry_point(&mut self, value: impl AsRef<str>) -> &mut Self {
    self.entry_point = value.as_ref().to_string();
    self
  }

  #[allow(unused)]
  pub fn entry_point_types(&mut self, value: impl AsRef<str>) -> &mut Self {
    self.entry_point_types = value.as_ref().to_string();
    self
  }

  #[allow(unused)]
  pub fn newest_dependency_date(
    &mut self,
    value: NewestDependencyDateOptions,
  ) -> &mut Self {
    self.newest_dependency_date = value;
    self
  }

  #[allow(unused)]
  pub fn lockfile_jsr_packages(
    &mut self,
    lockfile_jsr_packages: BTreeMap<PackageReq, PackageNv>,
  ) -> &mut Self {
    self.lockfile_jsr_packages = lockfile_jsr_packages;
    self
  }

  #[allow(unused)]
  pub fn fast_check_cache(&mut self, value: bool) -> &mut Self {
    self.fast_check_cache = value;
    self
  }

  #[allow(unused)]
  pub fn resolver(
    &mut self,
    resolver: impl deno_graph::source::Resolver + 'static,
  ) -> &mut Self {
    self.resolver = Some(Box::new(resolver));
    self
  }

  #[allow(unused)]
  pub fn skip_dynamic_deps(&mut self, value: bool) -> &mut Self {
    self.skip_dynamic_deps = value;
    self
  }

  #[allow(unused)]
  pub fn workspace_members(
    &mut self,
    members: Vec<WorkspaceMember>,
  ) -> &mut Self {
    self.workspace_members = members;
    self
  }

  #[allow(unused)]
  pub fn workspace_fast_check(&mut self, value: bool) -> &mut Self {
    self.workspace_fast_check = value;
    self
  }

  #[allow(unused)]
  pub fn unstable_bytes_imports(&mut self, value: bool) -> &mut Self {
    self.unstable_bytes_imports = value;
    self
  }

  #[allow(unused)]
  pub fn unstable_text_imports(&mut self, value: bool) -> &mut Self {
    self.unstable_text_imports = value;
    self
  }

  #[allow(unused)]
  pub fn ensure_locker(&mut self) -> &mut Self {
    self.locker.get_or_insert_with(Default::default);
    self
  }

  #[allow(unused)]
  pub fn add_remote_checksum(
    &mut self,
    specifier: &str,
    checksum: &str,
  ) -> &mut Self {
    let specifier = ModuleSpecifier::parse(specifier).unwrap();
    let loader_checksum = LoaderChecksum::new(checksum.to_string());
    let checksums = self.locker.get_or_insert_with(Default::default);
    checksums.set_remote_checksum(&specifier, loader_checksum);
    self
  }

  #[allow(unused)]
  pub fn add_pkg_manifest_checksum(
    &mut self,
    pkg_nv: &str,
    checksum: &str,
  ) -> &mut Self {
    let pkg_nv = PackageNv::from_str(pkg_nv).unwrap();
    let loader_checksum = LoaderChecksum::new(checksum.to_string());
    let checksums = self.locker.get_or_insert_with(Default::default);
    checksums.set_pkg_manifest_checksum(&pkg_nv, loader_checksum);
    self
  }

  pub async fn build(&mut self) -> BuildResult {
    let mut graph = self.graph.clone();
    for (req, nv) in &self.lockfile_jsr_packages {
      graph.packages.add_nv(req.clone(), nv.clone());
    }
    let entry_point_url = ModuleSpecifier::parse(&self.entry_point).unwrap();
    let roots = vec![entry_point_url.clone()];
    let capturing_analyzer = CapturingModuleAnalyzer::default();
    let workspace_resolver = WorkspaceMemberResolver {
      members: self.workspace_members.clone(),
    };
    graph
      .build(
        roots.clone(),
        Vec::new(),
        &self.loader,
        deno_graph::BuildOptions {
          module_analyzer: &capturing_analyzer,
          npm_resolver: Some(&TestNpmResolver),
          locker: self.locker.as_mut().map(|l| l as _),
          resolver: Some(if let Some(resolver) = &self.resolver {
            // providing a custom resolver while using workspace members hasn't been implemented
            assert_eq!(self.workspace_members.len(), 0);
            &**resolver
          } else {
            &workspace_resolver
          }),
          skip_dynamic_deps: self.skip_dynamic_deps,
          unstable_bytes_imports: self.unstable_bytes_imports,
          unstable_text_imports: self.unstable_text_imports,
          jsr_version_resolver: Cow::Owned(JsrVersionResolver {
            newest_dependency_date_options: self.newest_dependency_date.clone(),
          }),
          ..Default::default()
        },
      )
      .await;
    let fast_check_cache = if self.fast_check_cache {
      Some(TestFastCheckCache::default())
    } else {
      None
    };
    if graph.module_errors().next().is_none() {
      graph.build_fast_check_type_graph(
        deno_graph::BuildFastCheckTypeGraphOptions {
          fast_check_cache: fast_check_cache.as_ref().map(|c| c as _),
          fast_check_dts: !self.fast_check_cache,
          jsr_url_provider: Default::default(),
          es_parser: Some(&capturing_analyzer),
          resolver: None,
          workspace_fast_check: if self.workspace_fast_check {
            WorkspaceFastCheckOption::Enabled(&self.workspace_members)
          } else {
            WorkspaceFastCheckOption::Disabled
          },
        },
      );
    }
    BuildResult {
      locker: self.locker.clone(),
      graph,
      analyzer: capturing_analyzer,
      fast_check_cache,
    }
  }

  #[allow(unused)]
  #[cfg(feature = "symbols")]
  pub async fn symbols(&mut self) -> symbols::SymbolsResult {
    fn check_fatal_diagnostics(
      module: deno_graph::symbols::ModuleInfoRef,
    ) -> Vec<String> {
      let mut results = Vec::new();
      for symbol in module.symbols() {
        // ensure all decls have the same name as their symbol
        {
          let maybe_name = symbol.maybe_name();
          for decl in symbol.decls() {
            if decl.maybe_name() != maybe_name {
              results.push(format!(
                "Symbol {:?} with name {:?} had a decl with a different name: {:?}",
                symbol.symbol_id(),
                maybe_name,
                decl.maybe_name(),
              ));
            }
          }
        }

        if let Some(parent_id) = symbol.parent_id() {
          let parent_symbol = module.symbol(parent_id).unwrap();
          let has_child =
            parent_symbol.child_ids().any(|id| id == symbol.symbol_id());
          let has_member = parent_symbol
            .members()
            .iter()
            .any(|id| *id == symbol.symbol_id());
          let is_definition_decl =
            symbol.decls().iter().all(|d| d.kind.is_definition());
          if is_definition_decl {
            // ensure it's possible to go from a parent to its child
            if !has_child && !has_member {
              results.push(format!(
                "Parent {:#?} does not have child {:#?}",
                parent_symbol.symbol_id(),
                symbol.symbol_id()
              ));
            }
          } else if has_child || has_member {
            results.push(format!(
              "Parent {:#?} should not have the child or member {:#?}",
              parent_symbol.symbol_id(),
              symbol.symbol_id()
            ));
          }

          if has_child && has_member {
            results.push(format!(
              "Parent {:?} should not have both a child and a member {:?}",
              parent_symbol.symbol_id(),
              symbol.symbol_id()
            ));
          }
        }

        // ensure it's possible to get the module symbol id
        {
          let mut parent = symbol;
          let mut i = 0;
          while let Some(parent_id) = parent.parent_id() {
            parent = module.symbol(parent_id).unwrap();
            if i == 1000 {
              results.push(format!(
                "Could not find root from symbol: {:?}",
                symbol.symbol_id()
              ));
              break;
            }
            i += 1;
          }
        }
      }

      // from the root module, ensure everything is a tree
      fn ensure_no_multiple_paths(
        module: deno_graph::symbols::ModuleInfoRef,
        symbol: &deno_graph::symbols::Symbol,
        visited: &mut HashSet<deno_graph::symbols::SymbolId>,
      ) -> Vec<String> {
        let mut results = Vec::new();
        if !visited.insert(symbol.symbol_id()) {
          results.push(format!(
            "Found symbol in multiple paths: {:?}",
            symbol.symbol_id()
          ));
        } else {
          for id in symbol.child_ids().chain(symbol.members().iter().copied()) {
            let symbol = module.symbol(id).unwrap();
            results.extend(ensure_no_multiple_paths(module, symbol, visited));
          }
        }
        results
      }

      results.extend(ensure_no_multiple_paths(
        module,
        module.module_symbol(),
        &mut HashSet::new(),
      ));

      results
    }

    use std::collections::HashSet;

    use deno_graph::symbols::DefinitionOrUnresolved;
    use deno_graph::symbols::ModuleInfoRef;
    use deno_graph::symbols::ResolveDepsMode;

    let build_result = self.build().await;
    let graph = &build_result.graph;
    let entry_point_types_url =
      ModuleSpecifier::parse(&self.entry_point_types).unwrap();
    let root_symbol = build_result.root_symbol();
    symbols::SymbolsResult {
      output: {
        let entrypoint_symbol = root_symbol
          .module_from_specifier(&entry_point_types_url)
          .unwrap();
        let mut output_text = String::new();
        let mut specifiers =
          graph.specifiers().map(|(s, _)| s).collect::<Vec<_>>();
        specifiers.sort_unstable();
        for specifier in specifiers {
          let Some(module) = root_symbol.module_from_specifier(specifier)
          else {
            continue;
          };
          let module_output_text = format!(
            "{}: {}\n",
            specifier.as_str(),
            match module {
              ModuleInfoRef::Esm(m) => format!("{:#?}", m),
              ModuleInfoRef::Json(m) => format!("{:#?}", m),
            }
          );
          output_text.push_str(&module_output_text);

          fn get_symbol_deps_text_for_mode(
            module: ModuleInfoRef<'_>,
            resolve_mode: ResolveDepsMode,
          ) -> String {
            let mut symbol_deps_text = String::new();
            for symbol in module.symbols() {
              for decl in symbol.decls() {
                if let Some((node, source)) = decl.maybe_node_and_source() {
                  let deps = node.deps(resolve_mode);
                  if !deps.is_empty() {
                    symbol_deps_text.push_str(&format!(
                      "{:?}:{:?} {:?}\n",
                      symbol.symbol_id(),
                      decl.range.as_byte_range(source.range().start),
                      deps
                    ));
                  }
                }
              }
            }
            symbol_deps_text
          }

          let symbol_deps_text = get_symbol_deps_text_for_mode(
            module,
            ResolveDepsMode::TypesAndExpressions,
          );
          if !symbol_deps_text.is_empty() {
            output_text.push_str(&format!(
              "== symbol deps (types and exprs) ==\n{}\n",
              symbol_deps_text
            ));
          }
          let symbol_deps_text =
            get_symbol_deps_text_for_mode(module, ResolveDepsMode::TypesOnly);
          if !symbol_deps_text.is_empty() {
            output_text.push_str(&format!(
              "== symbol deps (types only) ==\n{}\n",
              symbol_deps_text
            ));
          }

          // analyze the module graph for any problems
          let diagnostics = check_fatal_diagnostics(module);
          if !diagnostics.is_empty() {
            eprintln!("== Output ==");
            eprintln!("{}", module_output_text);
            eprintln!("== Source ==");
            eprintln!("{}", module.text());
            eprintln!("== {} == \n\n{}", specifier, diagnostics.join("\n"));
            panic!("FAILED");
          }
        }
        let get_symbol_text =
          |module_symbol: deno_graph::symbols::ModuleInfoRef,
           symbol_id: deno_graph::symbols::SymbolId| {
            let symbol = module_symbol.symbol(symbol_id).unwrap();
            let items = root_symbol
              .go_to_definitions_or_unresolveds(module_symbol, symbol)
              .collect::<Vec<_>>();
            if items.is_empty() {
              "NONE".to_string()
            } else {
              let mut results = Vec::new();
              for definition_or_unresolved in items {
                match definition_or_unresolved {
                  DefinitionOrUnresolved::Definition(definition) => {
                    let decl_text = {
                      let decl_text = definition.text();
                      let lines = decl_text.split('\n').collect::<Vec<_>>();
                      if lines.len() > 4 {
                        lines[0..2]
                          .iter()
                          .chain(std::iter::once(&"..."))
                          .chain(&lines[lines.len() - 2..])
                          .cloned()
                          .collect::<Vec<_>>()
                      } else {
                        lines
                      }
                      .into_iter()
                      .map(|line| format!("  {}", line).trim_end().to_string())
                      .collect::<Vec<_>>()
                      .join("\n")
                    };
                    let range = definition.byte_range();
                    results.push(format!(
                      "{}:{}..{}\n{}",
                      definition.module.specifier(),
                      range.start,
                      range.end,
                      decl_text
                    ));
                  }
                  DefinitionOrUnresolved::Unresolved(unresolved) => results
                    .push(format!(
                      "{}\n  Unresolved {:?} ({:?})",
                      unresolved.module.specifier(),
                      unresolved.kind,
                      unresolved.parts,
                    )),
                }
              }
              results.join("\n")
            }
          };
        let exports = entrypoint_symbol.exports(&root_symbol).resolved;
        if !exports.is_empty() {
          output_text.push_str("== export definitions ==\n");
          for (name, resolved) in exports {
            let resolved = resolved.as_resolved_export();
            let position = get_symbol_text(resolved.module, resolved.symbol_id);
            output_text.push_str(&format!("[{}]: {}\n", name, position));
          }
        }
        output_text
      },
    }
  }
}

#[derive(Debug)]
struct WorkspaceMemberResolver {
  members: Vec<WorkspaceMember>,
}

impl deno_graph::source::Resolver for WorkspaceMemberResolver {
  fn resolve(
    &self,
    specifier_text: &str,
    referrer_range: &deno_graph::Range,
    _mode: deno_graph::source::ResolutionKind,
  ) -> Result<deno_ast::ModuleSpecifier, deno_graph::source::ResolveError> {
    if let Ok(package_ref) = JsrPackageReqReference::from_str(specifier_text) {
      for workspace_member in &self.members {
        if workspace_member.name == package_ref.req().name
          && workspace_member
            .version
            .as_ref()
            .map(|version| package_ref.req().version_req.matches(version))
            .unwrap_or(true)
        {
          let export_name = package_ref.sub_path().unwrap_or(".");
          let export = workspace_member.exports.get(export_name).unwrap();
          return Ok(workspace_member.base.join(export).unwrap());
        }
      }
    }
    Ok(deno_graph::resolve_import(
      specifier_text,
      &referrer_range.specifier,
    )?)
  }
}