mirror of
https://github.com/rust-lang/rust-analyzer
synced 2025-01-26 03:45:04 +00:00
docs for input queries
This commit is contained in:
parent
d8c6b8d999
commit
bb2bafb606
4 changed files with 51 additions and 18 deletions
|
@ -91,7 +91,9 @@ We use [salsa][https://github.com/salsa-rs/salsa] crate for incremental and
|
||||||
on-demand computation. Roughly, you can think of salsa as a key-value store, but
|
on-demand computation. Roughly, you can think of salsa as a key-value store, but
|
||||||
it also can compute derived values using specified functions. The `ra_db` crate
|
it also can compute derived values using specified functions. The `ra_db` crate
|
||||||
provides a basic infrastructure for interracting with salsa. Crucially, it
|
provides a basic infrastructure for interracting with salsa. Crucially, it
|
||||||
defines most of the "input" queries: facts supplied by the client of the analyzer.
|
defines most of the "input" queries: facts supplied by the client of the
|
||||||
|
analyzer. Reading the docs of the `ra_db::input` module should be useful:
|
||||||
|
everithing else is strictly derived from thouse inputs.
|
||||||
|
|
||||||
### `crates/ra_hir`
|
### `crates/ra_hir`
|
||||||
|
|
||||||
|
|
6
Cargo.lock
generated
6
Cargo.lock
generated
|
@ -546,7 +546,7 @@ name = "parking_lot"
|
||||||
version = "0.7.0"
|
version = "0.7.0"
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
dependencies = [
|
dependencies = [
|
||||||
"lock_api 0.1.4 (registry+https://github.com/rust-lang/crates.io-index)",
|
"lock_api 0.1.5 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"parking_lot_core 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
|
"parking_lot_core 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
]
|
]
|
||||||
|
|
||||||
|
@ -567,10 +567,10 @@ name = "parking_lot_core"
|
||||||
version = "0.4.0"
|
version = "0.4.0"
|
||||||
source = "registry+https://github.com/rust-lang/crates.io-index"
|
source = "registry+https://github.com/rust-lang/crates.io-index"
|
||||||
dependencies = [
|
dependencies = [
|
||||||
"libc 0.2.43 (registry+https://github.com/rust-lang/crates.io-index)",
|
"libc 0.2.45 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"rand 0.6.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
"rand 0.6.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"rustc_version 0.2.3 (registry+https://github.com/rust-lang/crates.io-index)",
|
"rustc_version 0.2.3 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"smallvec 0.6.5 (registry+https://github.com/rust-lang/crates.io-index)",
|
"smallvec 0.6.7 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
"winapi 0.3.6 (registry+https://github.com/rust-lang/crates.io-index)",
|
"winapi 0.3.6 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||||
]
|
]
|
||||||
|
|
||||||
|
|
|
@ -105,9 +105,6 @@ impl AnalysisHostImpl {
|
||||||
self.db
|
self.db
|
||||||
.query_mut(ra_db::FileTextQuery)
|
.query_mut(ra_db::FileTextQuery)
|
||||||
.set(remove_file.file_id, Default::default());
|
.set(remove_file.file_id, Default::default());
|
||||||
self.db
|
|
||||||
.query_mut(ra_db::FileRelativePathQuery)
|
|
||||||
.set(remove_file.file_id, Default::default());
|
|
||||||
source_root.files.remove(&remove_file.path);
|
source_root.files.remove(&remove_file.path);
|
||||||
}
|
}
|
||||||
self.db
|
self.db
|
||||||
|
|
|
@ -1,3 +1,6 @@
|
||||||
|
/// This modules specifies the input to rust-analyzer. In some sense, this is
|
||||||
|
/// **the** most important module, because all other fancy stuff is strickly
|
||||||
|
/// derived from this input.
|
||||||
use std::sync::Arc;
|
use std::sync::Arc;
|
||||||
|
|
||||||
use rustc_hash::{FxHashMap};
|
use rustc_hash::{FxHashMap};
|
||||||
|
@ -5,20 +8,48 @@ use relative_path::RelativePathBuf;
|
||||||
use ra_syntax::SmolStr;
|
use ra_syntax::SmolStr;
|
||||||
use salsa;
|
use salsa;
|
||||||
|
|
||||||
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]
|
/// `FileId` is an integer which uniquely identifies a file. File paths are
|
||||||
pub struct SourceRootId(pub u32);
|
/// messy and system-dependent, so most of the code should work directly with
|
||||||
|
/// `FileId`, without inspecting the path. The mapping between `FileId` and path
|
||||||
|
/// and `SourceRoot` is constant. File rename is represented as a pair of
|
||||||
|
/// deletion/creation.
|
||||||
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
|
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
|
||||||
pub struct FileId(pub u32);
|
pub struct FileId(pub u32);
|
||||||
|
|
||||||
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
|
/// Files are grouped into source roots. A source root is a directory on the
|
||||||
pub struct CrateId(pub u32);
|
/// file systems which is watched for changes. Typically it corresponds to a
|
||||||
|
/// Cargo package. Source roots *might* be nested: in this case, file belongs to
|
||||||
|
/// the nearest enclosing source root. Path to files are always relative to a
|
||||||
|
/// source root, and analyzer does not know the root path of the source root at
|
||||||
|
/// all. So, a file from one source root can't refere a file in another source
|
||||||
|
/// root by path.
|
||||||
|
#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash, PartialOrd, Ord)]
|
||||||
|
pub struct SourceRootId(pub u32);
|
||||||
|
|
||||||
|
#[derive(Default, Clone, Debug, PartialEq, Eq)]
|
||||||
|
pub struct SourceRoot {
|
||||||
|
pub files: FxHashMap<RelativePathBuf, FileId>,
|
||||||
|
}
|
||||||
|
|
||||||
|
/// `CrateGraph` is a bit of information which turns a set of text files into a
|
||||||
|
/// number of Rust crates. Each Crate is the `FileId` of it's root module, the
|
||||||
|
/// set of cfg flags (not yet implemented) and the set of dependencies. Note
|
||||||
|
/// that, due to cfg's, there might be several crates for a single `FileId`! As
|
||||||
|
/// in the rust-lang proper, a crate does not have a name. Instead, names are
|
||||||
|
/// specified on dependency edges. That is, a crate might be known under
|
||||||
|
/// different names in different dependant crates.
|
||||||
|
///
|
||||||
|
/// Note that `CrateGraph` is build-system agnostic: it's a concept of the Rust
|
||||||
|
/// langauge proper, not a concept of the build system. In practice, we get
|
||||||
|
/// `CrateGraph` by lowering `cargo metadata` output.
|
||||||
#[derive(Debug, Clone, Default, PartialEq, Eq)]
|
#[derive(Debug, Clone, Default, PartialEq, Eq)]
|
||||||
pub struct CrateGraph {
|
pub struct CrateGraph {
|
||||||
arena: FxHashMap<CrateId, CrateData>,
|
arena: FxHashMap<CrateId, CrateData>,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
|
||||||
|
pub struct CrateId(pub u32);
|
||||||
|
|
||||||
#[derive(Debug, Clone, PartialEq, Eq)]
|
#[derive(Debug, Clone, PartialEq, Eq)]
|
||||||
struct CrateData {
|
struct CrateData {
|
||||||
file_id: FileId,
|
file_id: FileId,
|
||||||
|
@ -57,7 +88,7 @@ impl CrateGraph {
|
||||||
assert!(prev.is_none());
|
assert!(prev.is_none());
|
||||||
crate_id
|
crate_id
|
||||||
}
|
}
|
||||||
//FIXME: check that we don't have cycles here.
|
// FIXME: check that we don't have cycles here.
|
||||||
// Just a simple depth first search from `to` should work,
|
// Just a simple depth first search from `to` should work,
|
||||||
// the graph is small.
|
// the graph is small.
|
||||||
pub fn add_dep(&mut self, from: CrateId, name: SmolStr, to: CrateId) {
|
pub fn add_dep(&mut self, from: CrateId, name: SmolStr, to: CrateId) {
|
||||||
|
@ -83,6 +114,7 @@ impl CrateGraph {
|
||||||
|
|
||||||
salsa::query_group! {
|
salsa::query_group! {
|
||||||
pub trait FilesDatabase: salsa::Database {
|
pub trait FilesDatabase: salsa::Database {
|
||||||
|
/// Text of the file.
|
||||||
fn file_text(file_id: FileId) -> Arc<String> {
|
fn file_text(file_id: FileId) -> Arc<String> {
|
||||||
type FileTextQuery;
|
type FileTextQuery;
|
||||||
storage input;
|
storage input;
|
||||||
|
@ -92,30 +124,32 @@ salsa::query_group! {
|
||||||
type FileRelativePathQuery;
|
type FileRelativePathQuery;
|
||||||
storage input;
|
storage input;
|
||||||
}
|
}
|
||||||
|
/// Source root of the file.
|
||||||
fn file_source_root(file_id: FileId) -> SourceRootId {
|
fn file_source_root(file_id: FileId) -> SourceRootId {
|
||||||
type FileSourceRootQuery;
|
type FileSourceRootQuery;
|
||||||
storage input;
|
storage input;
|
||||||
}
|
}
|
||||||
|
/// Contents of the source root.
|
||||||
fn source_root(id: SourceRootId) -> Arc<SourceRoot> {
|
fn source_root(id: SourceRootId) -> Arc<SourceRoot> {
|
||||||
type SourceRootQuery;
|
type SourceRootQuery;
|
||||||
storage input;
|
storage input;
|
||||||
}
|
}
|
||||||
|
/// The set of "local" (that is, from the current workspace) roots.
|
||||||
|
/// Files in local roots are assumed to change frequently.
|
||||||
fn local_roots() -> Arc<Vec<SourceRootId>> {
|
fn local_roots() -> Arc<Vec<SourceRootId>> {
|
||||||
type LocalRootsQuery;
|
type LocalRootsQuery;
|
||||||
storage input;
|
storage input;
|
||||||
}
|
}
|
||||||
|
/// The set of roots for crates.io libraries.
|
||||||
|
/// Files in libraries are assumed to never change.
|
||||||
fn library_roots() -> Arc<Vec<SourceRootId>> {
|
fn library_roots() -> Arc<Vec<SourceRootId>> {
|
||||||
type LibraryRootsQuery;
|
type LibraryRootsQuery;
|
||||||
storage input;
|
storage input;
|
||||||
}
|
}
|
||||||
|
/// The crate graph.
|
||||||
fn crate_graph() -> Arc<CrateGraph> {
|
fn crate_graph() -> Arc<CrateGraph> {
|
||||||
type CrateGraphQuery;
|
type CrateGraphQuery;
|
||||||
storage input;
|
storage input;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Default, Clone, Debug, PartialEq, Eq)]
|
|
||||||
pub struct SourceRoot {
|
|
||||||
pub files: FxHashMap<RelativePathBuf, FileId>,
|
|
||||||
}
|
|
||||||
|
|
Loading…
Reference in a new issue