diff --git a/.github/workflows/ci.yaml b/.github/workflows/ci.yaml index 347bbc29bd..2bc0d2bcfe 100644 --- a/.github/workflows/ci.yaml +++ b/.github/workflows/ci.yaml @@ -503,7 +503,12 @@ jobs: # work — and the 1942s run reached 45m mid-way through the dogfood steps and was killed. # Nextest's own total is the number to compare here: it stays flat across the merge, so the # budget is for the runner's variance, not for the suite growing. - timeout-minutes: 75 + # + # 75 in turn was overrun on 2026-09-23 by two runs of the same code a few hours apart: + # one finished in 46 minutes, and the other, on a newer runner image, summed 244 minutes + # of test time against 125 for the fast one and was killed at test 15000 of 15397. A + # machine half as fast is within the variance seen, and it takes the job past 90 minutes + timeout-minutes: 120 env: # Line-tables-only debug info: faster builds, backtraces still work. CARGO_PROFILE_DEV_DEBUG: line-tables-only @@ -660,7 +665,12 @@ jobs: # windows is the slow half of this matrix and came within two minutes of the previous # 45-minute budget on 2026-08-13 (42m54s, against 24m56s for macos on the same run), so it # gets the same headroom the linux job needed for the same reason - timeout-minutes: 75 + # + # that figure predates windows pinning an interpreter, which is what lets `by_build` + # compile anything there. with it, `by_build` alone is 77 of the 249 minutes of test time, + # and a whole run took 74m50s on 2026-09-23 on an ordinary runner — no headroom left at + # 75 for the variance the linux job sees + timeout-minutes: 120 env: # Line-tables-only debug info: faster builds, backtraces still work. CARGO_PROFILE_DEV_DEBUG: line-tables-only diff --git a/Cargo.lock b/Cargo.lock index 9ca868479f..9c2cc0537c 100644 --- a/Cargo.lock +++ b/Cargo.lock @@ -435,6 +435,7 @@ version = "0.0.0" dependencies = [ "anyhow", "by_transforms", + "dunce", "rayon", "ruff_db", "serde", @@ -4964,6 +4965,7 @@ dependencies = [ "ty_python_semantic", "ty_static", "ty_vendored", + "unicode-width", ] [[package]] diff --git a/crates/by_stage/Cargo.toml b/crates/by_stage/Cargo.toml index 6011aa89c3..40775522f1 100644 --- a/crates/by_stage/Cargo.toml +++ b/crates/by_stage/Cargo.toml @@ -21,6 +21,7 @@ ty_project = { workspace = true } ty_python_semantic = { workspace = true } anyhow = { workspace = true } +dunce = { workspace = true } rayon = { workspace = true } serde = { workspace = true } serde_json = { workspace = true } diff --git a/crates/by_stage/src/emit.rs b/crates/by_stage/src/emit.rs index f4f3e3c52c..3357ad542e 100644 --- a/crates/by_stage/src/emit.rs +++ b/crates/by_stage/src/emit.rs @@ -1,7 +1,7 @@ //! Checking a project's sources and turning the ones that pass into python. //! //! The one transpile path. `by run`, `by build`, `by transpile ` and the -//! server's single-file re-stage all arrive here, which is the point: two paths +//! server's re-stage of an edit all arrive here, which is the point: two paths //! could disagree about what a file lowers to, and a build tree whose modules were //! written by one and re-staged by the other is a tree the debugger will refuse — //! or worse, accept while the line table describes something else. @@ -130,9 +130,16 @@ pub fn check_and_transpile( // batching files into fewer jobs measured 4.5x slower, and cloning only every // 32 files gives the saving up entirely — so anything that reduces the number // of clones silently undoes this + // + // ignoring the check mode, because these files are what the output is made of: + // a language server whose mode reports diagnostics only for open files still + // has to refuse a closed one that does not check, before its bytes are written + // into a tree a program is running out of let checked: Vec> = handles .par_iter() - .map_with_db(db, |db, (_, file)| db.check_file(*file)) + .map_with_db(db, |db, (_, file)| { + ty_project::check_file_ignoring_check_mode(db, *file) + }) .collect(); for ((_, file), diags) in handles.iter().zip(checked) { if diags.iter().any(is_unusable_source) { diff --git a/crates/by_stage/src/layout.rs b/crates/by_stage/src/layout.rs new file mode 100644 index 0000000000..1a7ecf59a1 --- /dev/null +++ b/crates/by_stage/src/layout.rs @@ -0,0 +1,112 @@ +//! Where a project's build writes, and which file in it came from which source. +//! +//! An editor needs this for everything that relates a `.by` to what it becomes: opening the +//! generated module, going back from a generated module to its source, keeping the output out of +//! the editor's own index, telling a test runner not to collect a second copy of every test. Each of +//! those used to be an editor's guess — `out/.py` — and every part of +//! that guess went wrong: the directory is `build`, and the path inside it follows the *module* +//! tree, not the directory tree (see [`crate::staging::transpiled_destination`]). The build is the +//! only thing that knows, so this is the build's answer, asked of the same database and the same +//! file set a build reads. + +use std::path::{Path, PathBuf}; + +use ty_project::{Db as _, ProjectDatabase}; + +use crate::project::{BY_SOURCES, module_roots, project_sources}; +use crate::staging::transpiled_destination; + +/// The directory `by build` and `by compile` write to when they are not given `--out`, relative +/// to the project root — see [`default_build_directory`]. +const DEFAULT_OUTPUT_DIRECTORY: &str = "build"; + +/// Where the project rooted at `project_root` is built when no `--out` names somewhere else. +/// +/// Relative to the project, not to wherever a command happens to run: the output belongs to the +/// project the way its sources and its `.venv` do, so `by build` in `tests/` writes the same tree +/// as `by build` at the root, and the one place an editor is told the build writes is the place +/// it does. An explicit `--out` is the caller's own path and stays relative to where they typed it. +pub fn default_build_directory(project_root: &Path) -> PathBuf { + project_root.join(DEFAULT_OUTPUT_DIRECTORY) +} + +/// A path's place in its project's build. +#[derive(Debug, Clone, PartialEq, Eq, serde::Serialize, serde::Deserialize)] +#[serde(rename_all = "camelCase")] +pub struct BuildOutput { + /// The project root: the project a `by build` run anywhere inside it builds. + project_root: PathBuf, + + /// Where `by build`, run anywhere in the project with no `--out`, writes the project. + build_directory: PathBuf, + + /// When the path is a `.by` or `.byi` the build is made of, the file it is written to. + generated: Option, + + /// When the path is a file in [`Self::build_directory`] that a source is written to, that + /// source. + source: Option, +} + +/// Where `path` stands in the build of the project `db` holds. +/// +/// Answers for any path, including one that does not exist yet — a generated file before the first +/// build is still the place that build will write. Neither side of the mapping is checked against +/// the disk. +pub fn build_output(db: &ProjectDatabase, path: &Path) -> BuildOutput { + let declared_root = db.project().root(db).as_std_path(); + let root = canonical(declared_root); + let build_directory = default_build_directory(&root); + let roots = module_roots(db, &root); + let sources = project_sources(db, BY_SOURCES, &root, Some(&build_directory)); + let wanted = canonical(path); + + // resolved once for the whole sweep. both lookups below compare against every source, and + // `canonical` walks a path making a syscall per level, so resolving inside them would ask + // the file system the same questions once per source per lookup + let resolved: Vec<(PathBuf, PathBuf)> = sources + .iter() + .map(|(source, _)| { + let source = canonical(source); + let destination = transpiled_destination(&roots, &root, &source); + (source, destination) + }) + .collect(); + + let generated = resolved + .iter() + .find(|(source, _)| *source == wanted) + .map(|(_, destination)| build_directory.join(destination)); + + let source = wanted + .strip_prefix(&build_directory) + .ok() + .and_then(|relative| { + resolved + .iter() + .find(|(_, destination)| destination == relative) + .map(|(source, _)| source.clone()) + }); + + BuildOutput { + project_root: root, + build_directory, + generated, + source, + } +} + +/// `path` with its links resolved, or as given when it cannot be — a path that does not exist yet is +/// resolved through its nearest parent that does, so it still compares equal to the resolved form. +/// +/// On Windows resolving answers with a verbatim `\\?\C:\…` path, which is dropped back to the +/// `C:\…` spelling a client sends and a client can open. +fn canonical(path: &Path) -> PathBuf { + if let Ok(resolved) = std::fs::canonicalize(path) { + return dunce::simplified(&resolved).to_path_buf(); + } + match (path.parent(), path.file_name()) { + (Some(parent), Some(name)) => canonical(parent).join(name), + _ => path.to_path_buf(), + } +} diff --git a/crates/by_stage/src/lib.rs b/crates/by_stage/src/lib.rs index 2442af103e..8a86c944b5 100644 --- a/crates/by_stage/src/lib.rs +++ b/crates/by_stage/src/lib.rs @@ -43,12 +43,19 @@ //! entry at a time by a re-stage. //! - [`record`] — `_by_build.json`, what a tree says about the build that wrote //! it. -//! - [`restage`] — one file's slot in an existing tree, recomputed. +//! - [`restage`] — the slots of an edit's files in an existing tree, and the +//! one sourcemap describing them, recomputed. +//! - [`layout`] — where a project's build writes, and which output came from +//! which source, for an editor to ask. +//! - [`run_module`] — which file `by run ` executes, and the module a +//! file runs as. pub mod emit; +pub mod layout; pub mod project; pub mod record; pub mod restage; +pub mod run_module; pub mod runtime; pub mod sourcemap; pub mod staging; diff --git a/crates/by_stage/src/restage.rs b/crates/by_stage/src/restage.rs index 23674a2448..c7af1e95bb 100644 --- a/crates/by_stage/src/restage.rs +++ b/crates/by_stage/src/restage.rs @@ -1,4 +1,4 @@ -//! Re-staging one file into a build tree that already exists. +//! Re-staging a set of edited files into a build tree that already exists. //! //! A build tree is what actually runs. `by run` transpiles the project into a //! temp directory, copies every other project file into it, and runs the program @@ -12,7 +12,7 @@ //! that is about 165 milliseconds. A button press can afford the second number and //! not the first, and the difference is the entire reason this operation exists. //! -//! Two rules shape everything below. +//! Three rules shape everything below. //! //! **It writes nothing.** The result is the bytes and where they go. The plugin //! writes them, because the plugin is the only party that can roll that write back @@ -20,12 +20,22 @@ //! replacement the debugger then refused is a tree that lies about what is //! running. //! +//! **It answers for the whole set at once.** `_by_sourcemap.py` is one file +//! holding an entry for every transpiled module, so a set of edits has one map, +//! not one per file. Answering each file on its own would hand back a map per +//! file, each holding the tree's map plus that one file's entry — and whichever a +//! caller wrote last would silently drop every other edit's line table. So the +//! set goes in as a set and comes back with one map that carries all of it. +//! //! **It refuses rather than guesses.** Every refusal below is a case where the //! bytes produced would not be the bytes the build would have produced, or where //! the tree cannot be told what it is. A refusal costs the user a rebuild; a wrong //! answer costs them a debug session that reports lines from a file that no longer -//! exists. +//! exists. One file refused refuses the set, for the reason the debugger applies a +//! replacement that way: a tree holding half of an edit describes a program that +//! never existed. +use std::collections::HashSet; use std::path::{Path, PathBuf}; use ruff_db::diagnostic::{ @@ -48,14 +58,12 @@ use crate::verbatim::verbatim_destination; #[derive(Debug, Clone, PartialEq, Eq, serde::Serialize, serde::Deserialize)] #[serde(rename_all = "camelCase")] pub struct Restaged { + /// the file in the project this was produced from, as it was asked about + source: PathBuf, /// where the bytes go: absolute, inside the build directory generated: PathBuf, /// the full text to write there content: String, - /// the full new text of `_by_sourcemap.py`, or `None` when nothing about the - /// map changed — including for a file that has no entry in it, which is every - /// file the build copied rather than transpiled - sourcemap: Option, /// sha-256 of the source bytes this was produced from by_digest: String, /// sha-256 of `content` @@ -70,16 +78,43 @@ pub struct Restaged { changed: bool, } -/// Why nothing was produced. +/// Every slot of the set, and the one map that describes all of them. +#[derive(Debug, Clone, PartialEq, Eq, serde::Serialize, serde::Deserialize)] +#[serde(rename_all = "camelCase")] +pub struct RestagedSet { + /// one per distinct file asked about, in the order they were asked + files: Vec, + /// the full new text of `_by_sourcemap.py` with the entry of every + /// transpiled file of the set moved in it, or `None` when nothing about the + /// map changed — which includes a set of nothing but files the build copied + /// rather than transpiled, since none of those has an entry + sourcemap: Option, +} + +/// Why nothing was produced for one file, or for the tree as a whole. #[derive(Debug, Clone, PartialEq, Eq, serde::Serialize, serde::Deserialize)] #[serde(rename_all = "camelCase")] pub struct Refusal { + /// the file this is about, or `None` when it is about the tree — a record + /// that cannot be read, a tree another `by` built — and so about every file + file: Option, /// one sentence, written for a user rather than for a log - pub refused: String, + refused: String, /// the diagnostics behind it, when the refusal was the check gate. empty /// otherwise #[serde(default)] - pub diagnostics: Vec, + diagnostics: Vec, +} + +/// Every reason the set was refused. +/// +/// All of them rather than the first: a user who fixes one file and presses +/// reload only to be told about the next has been made to find them one at a +/// time. +#[derive(Debug, Clone, PartialEq, Eq, serde::Serialize, serde::Deserialize)] +#[serde(rename_all = "camelCase")] +pub struct Refused { + refusals: Vec, } /// The answer, either way. @@ -91,32 +126,50 @@ pub struct Refusal { #[derive(Debug, Clone, PartialEq, Eq, serde::Serialize, serde::Deserialize)] #[serde(untagged)] pub enum Restage { - Ready(Restaged), - Refused(Refusal), + Ready(RestagedSet), + Refused(Refused), } impl Restage { - fn refuse(reason: impl Into) -> Self { - Self::Refused(Refusal { - refused: reason.into(), - diagnostics: Vec::new(), + /// The whole set refused, for a reason that is not about any one file. + pub fn refuse(reason: impl Into) -> Self { + Self::Refused(Refused { + refusals: vec![Refusal { + file: None, + refused: reason.into(), + diagnostics: Vec::new(), + }], }) } } -/// Produce what `file`'s slot in `build_directory` should now contain. +/// What the tree and the project say, read once for the whole set. +struct Tree<'a> { + db: &'a ProjectDatabase, + directory: &'a Path, + record: BuildRecord, + config: by_transforms::config::Config, + rebuilder: Rebuilder, + /// the build's own source files, asked the way the build asks, each beside the path with + /// its links resolved — worked out once, because every file of the set is looked up against + /// all of them and resolving a path costs a syscall + sources: Vec<(PathBuf, ruff_db::files::File, PathBuf)>, +} + +/// Produce what each of `files`' slots in `build_directory` should now contain, +/// and the one `_by_sourcemap.py` that describes them together. /// -/// `db` is the project database the file belongs to. The language server passes +/// `db` is the project database the files belong to. The language server passes /// its own, warm and already indexed, which is the whole reason this is fast /// enough to sit behind a button; the CLI builds one first. Either way the source /// text comes out of the db, so an editor's unsaved buffer is what gets /// transpiled — the answer the user means by "reload this". The digest recorded /// for the `.by` is then over that buffer, so an unsaved file's tracebacks read as /// stale until it is saved, which is the honest report rather than a wrong line. -pub fn restage_one( +pub fn restage( db: &ProjectDatabase, build_directory: &Path, - file: &Path, + files: &[PathBuf], ) -> anyhow::Result { // absolute from here down, whatever the caller spelled. `generated` is a path // the caller writes bytes to and `_by_sourcemap.py` keys its tables by the @@ -134,6 +187,12 @@ pub fn restage_one( &owned }; + if files.is_empty() { + return Ok(Restage::refuse( + "no files were named, and an empty set has nothing in it to reload", + )); + } + let record = match BuildRecord::read(build_directory) { Ok(record) => record, Err(error) => return Ok(Restage::refuse(error.to_string())), @@ -163,60 +222,140 @@ pub fn restage_one( Err(error) => return Ok(Restage::refuse(error.to_string())), }; - let is_source = file - .extension() - .and_then(std::ffi::OsStr::to_str) - .is_some_and(|extension| BY_SOURCES.contains(&extension)); - if is_source { - restage_transpiled(db, build_directory, &record, &config, file) + // one file named twice — or under two spellings of one path — is one slot, + // and answering for it twice would hand a caller two writes to one file + let mut seen = HashSet::new(); + let files: Vec<&Path> = files + .iter() + .filter(|file| seen.insert(std::fs::canonicalize(file).unwrap_or_else(|_| (*file).clone()))) + .map(PathBuf::as_path) + .collect(); + + // read once for the set, and only when the set holds something the map + // describes: a set of copied files has no line table to move + let existing_map = if files.iter().any(|file| is_source(file)) { + match std::fs::read_to_string(build_directory.join(BY_SOURCEMAP_FILENAME)) { + Ok(existing) => Some(existing), + Err(error) => { + return Ok(Restage::refuse(format!( + "`{}` has no {BY_SOURCEMAP_FILENAME}, so a reloaded module would have no \ + line table: {error}", + build_directory.display(), + ))); + } + } } else { - restage_verbatim(db, build_directory, &record, file) + None + }; + + let tree = Tree { + db, + directory: build_directory, + sources: project_sources(db, BY_SOURCES, &record.project_root, Some(build_directory)) + .into_iter() + .map(|(path, file)| { + let resolved = std::fs::canonicalize(&path).unwrap_or_else(|_| path.clone()); + (path, file, resolved) + }) + .collect(), + rebuilder: Rebuilder::for_project(db), + record, + config, + }; + + // every entry of the set moved in one text, one after another. each move + // substitutes that entry's two lines and nothing else, so the order they are + // applied in cannot change the result + let mut merged = existing_map.clone(); + let mut restaged = Vec::with_capacity(files.len()); + let mut refusals = Vec::new(); + for file in files { + // which of the two a file goes through is decided by the file, never by whether a map + // happened to be read: a `.by` staged verbatim would copy basedpython into the tree + let outcome = if is_source(file) { + let Some(map) = merged.as_mut() else { + return Ok(Restage::refuse(format!( + "`{}` is a source file and the set was read without a {BY_SOURCEMAP_FILENAME}", + file.display(), + ))); + }; + restage_transpiled(&tree, file, map)? + } else { + restage_verbatim(&tree, file)? + }; + match outcome { + Ok(one) => restaged.push(one), + Err(refusal) => refusals.push(refusal), + } + } + + if !refusals.is_empty() { + return Ok(Restage::Refused(Refused { refusals })); + } + Ok(Restage::Ready(RestagedSet { + files: restaged, + sourcemap: merged.filter(|merged| Some(merged) != existing_map.as_ref()), + })) +} + +/// Whether the build transpiled `file` rather than copying it. +fn is_source(file: &Path) -> bool { + file.extension() + .and_then(std::ffi::OsStr::to_str) + .is_some_and(|extension| BY_SOURCES.contains(&extension)) +} + +/// A refusal about one file of the set. +fn refuse_file(file: &Path, refused: String, diagnostics: Vec) -> Refusal { + Refusal { + file: Some(file.to_path_buf()), + refused, + diagnostics, } } -/// A `.by`: transpile it as the build would have, and move its one entry in the -/// sourcemap. +/// A `.by`: transpile it as the build would have, and move its one entry in +/// `map`, the set's sourcemap so far. fn restage_transpiled( - db: &ProjectDatabase, - build_directory: &Path, - record: &BuildRecord, - config: &by_transforms::config::Config, + tree: &Tree<'_>, file: &Path, -) -> anyhow::Result { - // the build's own file set, asked the way the build asks it — so a source the - // project excludes is refused here rather than transpiled into a slot the - // build never wrote - let sources = project_sources(db, BY_SOURCES, &record.project_root, Some(build_directory)); + map: &mut String, +) -> anyhow::Result> { + let db = tree.db; + // the build's own file set, so a source the project excludes is refused here + // rather than transpiled into a slot the build never wrote let wanted = std::fs::canonicalize(file).unwrap_or_else(|_| file.to_path_buf()); - let Some(handle) = sources.into_iter().find(|(path, _)| { - *path == wanted || std::fs::canonicalize(path).is_ok_and(|path| path == wanted) - }) else { - return Ok(Restage::refuse(format!( - "`{}` is not one of the files `{}` was built from", - file.display(), - build_directory.display(), + let Some((source, source_file, _)) = tree + .sources + .iter() + .find(|(path, _, resolved)| *path == wanted || *resolved == wanted) + else { + return Ok(Err(refuse_file( + file, + format!( + "`{}` is not one of the files `{}` was built from", + file.display(), + tree.directory.display(), + ), + Vec::new(), ))); }; // the path the *db* holds, not the caller's spelling of it, so the destination // is computed against roots recorded in the same form - let relative = transpiled_destination(&record.module_roots, &record.project_root, &handle.0); - - let existing_map = match std::fs::read_to_string(build_directory.join(BY_SOURCEMAP_FILENAME)) { - Ok(existing) => existing, - Err(error) => { - return Ok(Restage::refuse(format!( - "`{}` has no {BY_SOURCEMAP_FILENAME}, so a reloaded module would have no line \ - table: {error}", - build_directory.display(), - ))); - } - }; - let Some(key) = sourcemap_key_for(&existing_map, &relative) else { - return Ok(Restage::refuse(format!( - "`{}` has no entry in {BY_SOURCEMAP_FILENAME} for `{}`, so it is not part of that build", - build_directory.display(), - file.display(), + let relative = + transpiled_destination(&tree.record.module_roots, &tree.record.project_root, source); + + let Some(key) = sourcemap_key_for(map, &relative) else { + return Ok(Err(refuse_file( + file, + format!( + "`{}` has no entry in {BY_SOURCEMAP_FILENAME} for `{}`, so it is not part of that \ + build", + tree.directory.display(), + file.display(), + ), + Vec::new(), ))); }; @@ -226,22 +365,21 @@ fn restage_transpiled( let mut produced: Option<(crate::sourcemap::TracebackEntry, String)> = None; let outcome = check_and_transpile( db, - std::slice::from_ref(&handle), + std::slice::from_ref(&(source.clone(), *source_file)), &mut Emit { - config, + config: &tree.config, // the gate `by run` uses: a program that fails `by check` must not // run, and a module reloaded into a running one is that program // continuing gate: CheckGate::AllErrors, - rebuilder: &Rebuilder::for_project(db), + rebuilder: &tree.rebuilder, requirements: &mut by_transforms::RuntimeRequirements::default(), - // a re-stage writes one module back into a tree the build already - // laid out, so what it claims is thrown away: whatever copy of the - // runtime that module imports is already sitting where the build - // put it + // a re-stage writes modules back into a tree the build already laid + // out, so what it claims is thrown away: whatever copy of the runtime + // a module imports is already sitting where the build put it runtime: Some(&mut RuntimeLayout::default()), - roots: &record.module_roots, - root: &record.project_root, + roots: &tree.record.module_roots, + root: &tree.record.project_root, }, |emitted: &Transpiled<'_>| { produced = Some((describe_module(emitted), emitted.python.to_owned())); @@ -250,29 +388,30 @@ fn restage_transpiled( )?; let Some((mut entry, python)) = produced.filter(|_| outcome.ok) else { - return Ok(Restage::Refused(Refusal { - refused: format!( + return Ok(Err(refuse_file( + file, + format!( "`{}` does not check, so it cannot be reloaded into a running program", file.display(), ), - diagnostics: render_diagnostics(db, &outcome.diagnostics), - })); + render_diagnostics(db, &outcome.diagnostics), + ))); }; // the key the map already holds, so the rewritten file differs in the two // lines that had to move and in nothing else entry.py_path = key; - let rewritten = rewrite_sourcemap_entry(&existing_map, &entry).map_err(|refusal| { + *map = rewrite_sourcemap_entry(map, &entry).map_err(|refusal| { anyhow::anyhow!( "the sourcemap entry vanished between being found and being written: {refusal:?}" ) })?; - let generated = build_directory.join(&relative); - Ok(Restage::Ready(Restaged { + let generated = tree.directory.join(&relative); + Ok(Ok(Restaged { + source: file.to_path_buf(), changed: differs_on_disk(&generated, &entry.py_digest), content: python, - sourcemap: (rewritten != existing_map).then_some(rewritten), by_digest: entry.by_digest, py_digest: entry.py_digest, generated, @@ -281,23 +420,22 @@ fn restage_transpiled( /// A hand-written `.py`, or anything else the build copies: its own bytes, at the /// place the build copied them to. -fn restage_verbatim( - db: &ProjectDatabase, - build_directory: &Path, - record: &BuildRecord, - file: &Path, -) -> anyhow::Result { +fn restage_verbatim(tree: &Tree<'_>, file: &Path) -> anyhow::Result> { let Some(relative) = verbatim_destination( - db, - &record.project_root, - &record.module_roots, - build_directory, + tree.db, + &tree.record.project_root, + &tree.record.module_roots, + tree.directory, file, ) else { - return Ok(Restage::refuse(format!( - "`{}` is not one of the files `{}` was built from", - file.display(), - build_directory.display(), + return Ok(Err(refuse_file( + file, + format!( + "`{}` is not one of the files `{}` was built from", + file.display(), + tree.directory.display(), + ), + Vec::new(), ))); }; @@ -307,22 +445,25 @@ fn restage_verbatim( // encoding json has no way to hold is one the build can stage and this cannot, // and saying so is better than handing back something lossy let Ok(content) = String::from_utf8(bytes) else { - return Ok(Restage::refuse(format!( - "`{}` is not utf-8, so its bytes cannot be sent back as text — rebuild to pick it up", - file.display(), + return Ok(Err(refuse_file( + file, + format!( + "`{}` is not utf-8, so its bytes cannot be sent back as text — rebuild to pick \ + it up", + file.display(), + ), + Vec::new(), ))); }; // one set of bytes, so one digest under both names: the file the build read // and the file it wrote are the same file let digest = content_digest(content.as_bytes()); - let generated = build_directory.join(&relative); - Ok(Restage::Ready(Restaged { + let generated = tree.directory.join(&relative); + Ok(Ok(Restaged { + source: file.to_path_buf(), changed: differs_on_disk(&generated, &digest), content, - // a copied file has no line table to move, and a map rewritten to say so - // would be a map that changed for nothing - sourcemap: None, by_digest: digest.clone(), py_digest: digest, generated, diff --git a/crates/by_stage/src/run_module.rs b/crates/by_stage/src/run_module.rs new file mode 100644 index 0000000000..59af8cea21 --- /dev/null +++ b/crates/by_stage/src/run_module.rs @@ -0,0 +1,77 @@ +//! Which file `by run ` executes, and which module a file runs as. +//! +//! `by run` stages every first-party module into a tree mirroring the module +//! tree (see [`crate::staging::transpiled_destination`]) and hands the name to +//! `runpy` there. So a name means what the project's resolver makes of it, +//! restricted to the module roots the build stages — and an editor asking "what +//! does `by run app.cli` run" or "what do I pass `by run` to run this file" has +//! to be told that, not a walk of the directory tree that agrees with it most of +//! the time. +//! +//! One name is one file here. Two files that build to the same module — a +//! `main.by` beside a `main.py`, or `main.by` at the project root beside +//! `src/main.by` — are refused by the staging step itself, so neither runs until +//! one is renamed; until then the name is reported for the file the resolver +//! finds first, and the other runs under none. + +use std::path::Path; + +use ruff_db::files::File; +use ty_module_resolver::{ModuleName, file_to_module, resolve_module_confident}; +use ty_project::{Db as _, ProjectDatabase}; +use ty_python_semantic::Db as _; + +use crate::project::module_roots; + +/// The module `by run` executes when none is named: the project's `run.main`. +pub fn configured_main(db: &ProjectDatabase) -> Option { + let options = db.project().metadata(db).options(); + let main = options.run.as_ref()?.main.as_ref()?; + Some((**main).clone()) +} + +/// The file `by run ` executes, or `None` when the name resolves to +/// nothing the build stages. +/// +/// A package runs as its `__main__`, which is what `runpy` does with one. +pub fn module_file(db: &ProjectDatabase, module: &str) -> Option { + let name = ModuleName::new(module.trim())?; + let environment = db.project().program(db).resolver_environment(db); + let resolved = resolve_module_confident(db, environment, &name)?; + let resolved = if resolved.kind(db).is_package() { + let main = ModuleName::new(&format!("{name}.__main__"))?; + resolve_module_confident(db, environment, &main)? + } else { + resolved + }; + let file = resolved.file(db)?; + is_staged(db, file).then_some(file) +} + +/// The name `by run` is given to execute `file`, or `None` when no name runs it. +/// +/// `None` for a file outside every module root the build stages, for a file +/// whose name the resolver finds another file for first, and for a package's +/// `__init__`, since running a package runs its `__main__` instead. +pub fn module_name(db: &ProjectDatabase, file: File) -> Option { + if !is_staged(db, file) { + return None; + } + let program_file = db.program_file(file); + let module = file_to_module(db, program_file.resolver_file(db))?; + if module.kind(db).is_package() { + return None; + } + Some(module.name(db).to_string()) +} + +/// Whether `file` lies under a module root `by run` stages. +fn is_staged(db: &ProjectDatabase, file: File) -> bool { + let Some(path) = file.path(db).as_system_path() else { + return false; + }; + let root = Path::new(db.project().root(db).as_str()); + module_roots(db, root) + .iter() + .any(|candidate| Path::new(path.as_str()).starts_with(candidate)) +} diff --git a/crates/by_stage/src/runtime.rs b/crates/by_stage/src/runtime.rs index 6bfc67ae2f..07d418fed3 100644 --- a/crates/by_stage/src/runtime.rs +++ b/crates/by_stage/src/runtime.rs @@ -29,7 +29,7 @@ use ruff_db::system::{System, SystemPath}; /// the copies a build writes /// /// claimed for every module rather than only those that turned out to call a -/// helper: `by restage` recomputes one module against a tree an earlier build +/// helper: `by restage` recomputes modules against a tree an earlier build /// wrote, and an edit that newly reaches for a helper has to find the copy there #[derive(Debug, Default)] pub struct RuntimeLayout { diff --git a/crates/by_stage/src/sourcemap.rs b/crates/by_stage/src/sourcemap.rs index d6be88e6db..56f2f5817e 100644 --- a/crates/by_stage/src/sourcemap.rs +++ b/crates/by_stage/src/sourcemap.rs @@ -62,7 +62,7 @@ pub fn stage_module( /// The same description [`stage_module`] produces, for a caller that is not going /// to write the file itself. /// -/// The language server's single-file re-stage is that caller: it returns the bytes +/// The language server's re-stage of an edit is that caller: it returns the bytes /// and lets the plugin write them, because only the plugin can roll the write back /// together with the debugger request that follows it. Its `py_path` is filled in /// by the caller, which is the one thing a description without a staging cannot diff --git a/crates/by_transforms/src/lib.rs b/crates/by_transforms/src/lib.rs index 62b2f4bac4..d2fc27fe9a 100644 --- a/crates/by_transforms/src/lib.rs +++ b/crates/by_transforms/src/lib.rs @@ -7,6 +7,14 @@ pub(crate) mod type_info; pub use config::{Config, FloatLiteralLowering, PythonVersion, SoundnessPositions}; +/// A module's `main` as the program's command line — the reading the entry-point +/// guard and its argument parser are generated from. +pub mod entry_point { + pub use crate::transforms::main_function::{ + Choice, CliSpelling, EntryParameter, EntryPoint, ParameterKind, entry_point, main_guards, + }; +} + use std::collections::{BTreeSet, HashSet}; use ruff_db::files::{File, system_path_to_file}; diff --git a/crates/by_transforms/src/transforms/annotation.rs b/crates/by_transforms/src/transforms/annotation.rs index f1096ad712..fc124c3a07 100644 --- a/crates/by_transforms/src/transforms/annotation.rs +++ b/crates/by_transforms/src/transforms/annotation.rs @@ -2,7 +2,7 @@ use std::cell::{Cell, RefCell}; use ruff_diagnostics::{Edit, Fix}; use ruff_python_ast::{Expr, PythonVersion, Stmt}; -use ruff_text_size::Ranged; +use ruff_text_size::{Ranged, TextRange}; use crate::Config; use crate::config::FloatLiteralLowering; @@ -51,6 +51,10 @@ pub(crate) struct TupleLiteralType<'src> { /// dedicated passes' edits inside it are dropped — without this an element /// would reach the output as surface syntax leaves: RefCell>, + /// the operations `symbolic_type_op` folded, with their rendered types. our + /// replacement covers a folded operation nested inside a tuple type, so it + /// has to carry the fold rather than re-emit the operation + symbolic_substitutions: &'src [(TextRange, String)], edits: Vec, } @@ -60,13 +64,19 @@ impl<'src> TupleLiteralType<'src> { types: &'src dyn TypeInfo, min_version: PythonVersion, float_literals: FloatLiteralLowering, + symbolic_substitutions: &'src [(TextRange, String)], ) -> Self { + let mut leaves = CallableSyntax::new(source, float_literals).with_types(types); + for (range, rendered) in symbolic_substitutions { + leaves.add_substitution(*range, rendered.clone()); + } Self { source, types, min_version, needs_unpack_import: Cell::new(false), - leaves: RefCell::new(CallableSyntax::new(source, float_literals).with_types(types)), + leaves: RefCell::new(leaves), + symbolic_substitutions, edits: Vec::new(), } } @@ -147,14 +157,25 @@ impl<'src> TupleLiteralType<'src> { Some(format!("tuple[{}]", lowered.join(", "))) } - // `A | B` — propagate into both arms + // `(int, str) * n` — an operation `symbolic_type_op` folded is the type it + // folded to + Expr::BinOp(b) + if let Some((_, rendered)) = self + .symbolic_substitutions + .iter() + .find(|(range, _)| *range == b.range()) => + { + Some(rendered.clone()) + } + + // `A | B` — propagate into both operands Expr::BinOp(b) => { let left = self.transform_annotation(&b.left); let right = self.transform_annotation(&b.right); if left.is_some() || right.is_some() { let l = left.unwrap_or_else(|| self.fallback_src(&b.left)); let r = right.unwrap_or_else(|| self.fallback_src(&b.right)); - Some(format!("{l} | {r}")) + Some(format!("{l} {} {r}", b.op.as_str())) } else { None } @@ -333,6 +354,12 @@ impl TypeExprVisitor for TupleLiteralType<'_> { { return Recurse::Stop; } + // an unpacked annotation, `*args: *(int, str)`, keeps its star: `unpack` lowers that + // to python's spelling on its own. rewriting the whole expression here would write over + // that edit, so the type inside the star is rewritten on its own range + if matches!(expr, Expr::Starred(_)) { + return Recurse::Descend; + } // `transform_annotation` is a deep recursive rewriter that produces // a single replacement string for the whole expression. emit the // edit at the expression's range and tell the walker to stop — @@ -360,11 +387,13 @@ impl<'src> TupleLiteralTypePass<'src> { impl TypeAwarePass for TupleLiteralTypePass<'_> { fn run(&self, stmts: &[Stmt], types: &dyn TypeInfo, ctx: &mut PassContext) { + let symbolic_substitutions = ctx.symbolic_substitutions.clone(); let mut inner = TupleLiteralType::new( self.source, types, self.config.min_version, self.config.float_literals, + &symbolic_substitutions, ); walk_type_positions(stmts, Some(types), &mut inner); for fix in inner.edits { diff --git a/crates/by_transforms/src/transforms/main_function.rs b/crates/by_transforms/src/transforms/main_function.rs index da860039d2..95ef058ef9 100644 --- a/crates/by_transforms/src/transforms/main_function.rs +++ b/crates/by_transforms/src/transforms/main_function.rs @@ -15,7 +15,9 @@ //! existing `__main__` guard or a bare top-level `main()` call — so the entry //! point never runs twice -use ruff_python_ast::{self as ast, CmpOp, Expr, ModModule, Parameters, Stmt, StmtFunctionDef}; +use ruff_python_ast::{ + self as ast, CmpOp, Expr, ModModule, ParameterWithDefault, Parameters, Stmt, StmtFunctionDef, +}; use super::ast_driver::{AstPass, PassContext}; use super::source_util::{is_synthetic_decorator, python_string_literal}; @@ -28,16 +30,6 @@ impl<'src> MainFunction<'src> { pub(crate) fn new(source: &'src str) -> Self { Self { source } } - - /// true when `main` carries the synthetic `private` modifier, which the - /// modifiers pass renames to `_main` — so it is not a public entry point - /// and a synthesised `main()` call would dangle - fn is_private(&self, func: &StmtFunctionDef) -> bool { - func.decorator_list.iter().any(|dec| { - is_synthetic_decorator(self.source, dec) - && matches!(&dec.expression, Expr::Name(name) if name.id.as_str() == "private") - }) - } } impl AstPass for MainFunction<'_> { @@ -48,31 +40,27 @@ impl AstPass for MainFunction<'_> { } fn run(&self, module: &mut ModModule, ctx: &mut PassContext) { - let Some(main) = last_top_level_main(&module.body) else { + let Some(entry) = entry_point(&module.body, self.source) else { return; }; - if self.is_private(main) { - return; - } - let Some(params) = cli_params(&main.parameters) else { - return; - }; - // respect a hand-written entry point; never invoke `main` twice - if module_invokes_main(&module.body) { + // a `private main` is renamed, a `main` the command line cannot fill + // cannot be called, and a module that invokes `main` itself keeps its + // own entry point — `main` never runs twice + if !entry.generates_guard() { return; } ctx.epilogue.push("if __name__ == \"__main__\":".to_owned()); - let extra = extra_arguments_converter(&main.parameters); - let call = if params.is_empty() && extra.is_none() { + let spec: Vec = entry.exposed().map(EntryParameter::spec_entry).collect(); + let extra = entry.extra_arguments; + let call = if spec.is_empty() && extra.is_none() { "main()".to_owned() } else { ctx.runtime.insert(crate::runtime::MAIN_ARGS); ctx.epilogue .push(" _by_args, _by_kwargs = _by_main_args(main, [".to_owned()); - for param in ¶ms { - ctx.epilogue - .push(format!(" {},", param.spec_entry())); + for entry in spec { + ctx.epilogue.push(format!(" {entry},")); } let close = match extra { Some(converter) => format!(" ], {converter})"), @@ -81,7 +69,7 @@ impl AstPass for MainFunction<'_> { ctx.epilogue.push(close); "main(*_by_args, **_by_kwargs)".to_owned() }; - if main.is_async { + if entry.function.is_async { ctx.epilogue.push(format!(" asyncio.run({call})")); ctx.required_imports.push("import asyncio".to_owned()); } else { @@ -90,77 +78,242 @@ impl AstPass for MainFunction<'_> { } } -/// how a `main` parameter is spelled on the command line -enum CliType { - /// takes a value, converted by the named callable - Value(&'static str), - /// a `--name` / `--no-name` flag pair - Flag, +/// A module's top-level `main`, and what the transpiler makes of it as the +/// program's command line. +/// +/// This is the one reading of `main` there is: the pass above generates the +/// guard and the argument parser from it, and anything else that needs to know +/// a program's command line — an editor offering to fill in its arguments — +/// asks [`entry_point`] rather than reading the signature a second way. +pub struct EntryPoint<'a> { + /// the last top-level `def main` / `async def main` + pub function: &'a StmtFunctionDef, + /// `private def main` is renamed to `_main`, so it is no entry point and a + /// synthesised `main()` call would dangle + pub is_private: bool, + /// the module already invokes `main` itself — a `__main__` guard or a bare + /// top-level `main(...)` call + pub module_invokes_main: bool, + /// every parameter that is not variadic, in declared order + pub parameters: Vec>, + /// the converter for the arguments the interface does not claim, when a + /// leading `*rest` asks for them — see `extra_arguments_converter` + pub extra_arguments: Option<&'static str>, +} + +impl EntryPoint<'_> { + /// The first required parameter the command line cannot supply. Invoking + /// `main` would raise `TypeError`, so such a `main` is no entry point. + pub fn blocked_by(&self) -> Option<&EntryParameter<'_>> { + self.parameters + .iter() + .find(|param| param.is_required() && param.spelling.is_none()) + } + + /// Whether the transpiler appends the `__main__` guard that runs `main`. + pub fn generates_guard(&self) -> bool { + !self.is_private && !self.module_invokes_main && self.blocked_by().is_none() + } + + /// The parameters the generated command-line interface fills. + fn exposed(&self) -> impl Iterator> { + self.parameters + .iter() + .filter(|param| param.spelling.is_some()) + } + + /// `main`'s docstring — the generated parser's `--help` description, which + /// it reads from `main.__doc__`. + pub fn docstring(&self) -> Option<&str> { + let Stmt::Expr(expr) = self.function.body.first()? else { + return None; + }; + let Expr::StringLiteral(string) = &*expr.value else { + return None; + }; + Some(string.value.to_str()) + } } -/// a `main` parameter the generated command-line interface fills -struct CliParam { - name: String, - ty: CliType, - /// how the parameter can be passed to `main` itself: `positional` - /// (positional-only), `keyword` (keyword-only), or `any` - kind: &'static str, - required: bool, - /// the values the annotation admits, rendered as python literals, when it - /// is a literal union — argparse rejects anything else before `main` runs - choices: Option>, +/// How a `main` parameter can be passed to `main` itself. +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +pub enum ParameterKind { + /// positional-only: always handed over positionally + Positional, + /// either way + Any, + /// keyword-only: takes no positional slot + Keyword, } -impl CliParam { +impl ParameterKind { + /// the spelling the `_by_main_args` spec carries + pub fn as_str(self) -> &'static str { + match self { + Self::Positional => "positional", + Self::Any => "any", + Self::Keyword => "keyword", + } + } +} + +/// One non-variadic parameter of `main`. +pub struct EntryParameter<'a> { + pub parameter: &'a ParameterWithDefault, + pub kind: ParameterKind, + /// how the command line spells it; `None` when the annotation has no + /// command-line spelling, so the parameter is not exposed + pub spelling: Option, +} + +impl EntryParameter<'_> { + pub fn name(&self) -> &str { + self.parameter.parameter.name.as_str() + } + + pub fn is_required(&self) -> bool { + self.parameter.default.is_none() + } + + /// The option spellings `_by_main_args` registers for this parameter, dash + /// form first; a name with an underscore also answers to it as written. + pub fn flags(&self) -> Vec { + let name = self.name(); + let mut flags = vec![format!("--{}", name.replace('_', "-"))]; + if name.contains('_') { + flags.push(format!("--{name}")); + } + flags + } + + /// The `--no-…` spellings `_by_main_args` registers to set a flag false; + /// empty for a parameter that takes a value. + pub fn negative_flags(&self) -> Vec { + if !matches!( + self.spelling, + Some(CliSpelling { + converter: None, + .. + }) + ) { + return Vec::new(); + } + self.flags() + .iter() + .map(|flag| format!("--no-{}", &flag[2..])) + .collect() + } + /// the `(name, converter, kind, required, choices)` tuple `_by_main_args` - /// consumes + /// consumes; only an exposed parameter has one fn spec_entry(&self) -> String { - let converter = match &self.ty { - CliType::Value(callable) => (*callable).to_owned(), - CliType::Flag => "None".to_owned(), + let (converter, choices) = match &self.spelling { + Some(spelling) => (spelling.converter.unwrap_or("None"), &spelling.choices), + None => ("None", &None), }; - let required = if self.required { "True" } else { "False" }; - let name = &self.name; - let kind = self.kind; - let choices = match &self.choices { - Some(values) => format!("({},)", values.join(", ")), + let required = if self.is_required() { "True" } else { "False" }; + let name = self.name(); + let kind = self.kind.as_str(); + let choices = match choices { + Some(values) => format!( + "({},)", + values + .iter() + .map(|choice| choice.literal.as_str()) + .collect::>() + .join(", ") + ), None => "None".to_owned(), }; format!("(\"{name}\", {converter}, \"{kind}\", {required}, {choices})") } } -/// The parameters of `main` that the command line fills, or `None` when the -/// signature has a required parameter the command line can't supply — such a -/// `main` isn't an entry point, because invoking it would raise `TypeError`. +/// How a `main` parameter is spelled on the command line. +#[derive(Clone, Debug, PartialEq, Eq)] +pub struct CliSpelling { + /// the callable that converts the argument, as the source names it; `None` + /// for a `--name` / `--no-name` flag pair, which takes no value + pub converter: Option<&'static str>, + /// the values the annotation admits, when it is a literal union — argparse + /// rejects anything else before `main` runs + pub choices: Option>, +} + +/// One value a literal-union parameter admits. +#[derive(Clone, Debug, PartialEq, Eq)] +pub struct Choice { + /// the value as a python literal, as the parser's `choices` holds it + pub literal: String, + /// the value as it is written on the command line + pub value: String, +} + +/// The module's entry point, or `None` when it has no top-level `main`. /// -/// A parameter whose annotation has no command-line spelling is skipped rather -/// than exposed, so it keeps its default. Variadics are skipped for the same -/// reason: they never require an argument. -fn cli_params(params: &Parameters) -> Option> { +/// `source` is the text `body` was parsed from; the `private` modifier is read +/// against it. +pub fn entry_point<'a>(body: &'a [Stmt], source: &str) -> Option> { + let function = last_top_level_main(body)?; + Some(EntryPoint { + function, + is_private: is_private(source, function), + module_invokes_main: module_invokes_main(body), + parameters: parameters(&function.parameters), + extra_arguments: extra_arguments_converter(&function.parameters), + }) +} + +/// true when `main` carries the synthetic `private` modifier, which the +/// modifiers pass renames to `_main` +fn is_private(source: &str, func: &StmtFunctionDef) -> bool { + func.decorator_list.iter().any(|dec| { + is_synthetic_decorator(source, dec) + && matches!(&dec.expression, Expr::Name(name) if name.id.as_str() == "private") + }) +} + +/// Every non-variadic parameter of `main`, with its command-line spelling. +/// +/// A parameter whose annotation has no command-line spelling is not exposed, +/// so it keeps its default — or, when it has none, stops `main` being an entry +/// point ([`EntryPoint::blocked_by`]). Variadics never require an argument, so +/// they are left out. +fn parameters(params: &Parameters) -> Vec> { let groups = [ - (¶ms.posonlyargs, "positional"), - (¶ms.args, "any"), - (¶ms.kwonlyargs, "keyword"), + (¶ms.posonlyargs, ParameterKind::Positional), + (¶ms.args, ParameterKind::Any), + (¶ms.kwonlyargs, ParameterKind::Keyword), ]; - let mut cli = Vec::new(); - for (group, kind) in groups { - for param in group { - let required = param.default.is_none(); - match param.parameter.annotation.as_deref().and_then(cli_type) { - Some((ty, choices)) => cli.push(CliParam { - name: param.parameter.name.to_string(), - ty, - kind, - required, - choices, - }), - None if required => return None, - None => {} - } - } - } - Some(cli) + groups + .into_iter() + .flat_map(|(group, kind)| { + group.iter().map(move |parameter| EntryParameter { + parameter, + kind, + spelling: parameter + .parameter + .annotation + .as_deref() + .and_then(cli_type) + .map(|(ty, choices)| CliSpelling { + converter: match ty { + CliType::Value(callable) => Some(callable), + CliType::Flag => None, + }, + choices, + }), + }) + }) + .collect() +} + +/// how a `main` parameter is spelled on the command line +enum CliType { + /// takes a value, converted by the named callable + Value(&'static str), + /// a `--name` / `--no-name` flag pair + Flag, } /// The command-line spelling of an annotation — its converter and, for a @@ -169,7 +322,7 @@ fn cli_params(params: &Parameters) -> Option> { /// Matched on the annotation as written: the converter emitted into the spec /// is the same name the source used, so it resolves to whatever that name is /// bound to at runtime. -fn cli_type(annotation: &Expr) -> Option<(CliType, Option>)> { +fn cli_type(annotation: &Expr) -> Option<(CliType, Option>)> { match annotation { Expr::Name(name) => { let ty = match name.id.as_str() { @@ -193,7 +346,7 @@ fn cli_type(annotation: &Expr) -> Option<(CliType, Option>)> { // a union: either `T | None`, which is `T?` written out, or a union of // literals, which argparse expresses as `choices` Expr::BinOp(bin_op) if matches!(bin_op.op, ast::Operator::BitOr) => { - let mut named: Option<(CliType, Option>)> = None; + let mut named: Option<(CliType, Option>)> = None; let mut literals = Vec::new(); let mut literal_converter: Option<&'static str> = None; for operand in union_operands(annotation) { @@ -311,12 +464,27 @@ fn is_none_literal(expr: &Expr) -> bool { expr.is_none_literal_expr() } -/// a literal the command line can carry, as `(converter, python literal)` -fn literal_choice(expr: &Expr) -> Option<(&'static str, String)> { +/// a literal the command line can carry, as its converter and the value +fn literal_choice(expr: &Expr) -> Option<(&'static str, Choice)> { match expr { - Expr::StringLiteral(string) => Some(("str", python_string_literal(string.value.to_str()))), + Expr::StringLiteral(string) => { + let value = string.value.to_str(); + Some(( + "str", + Choice { + literal: python_string_literal(value), + value: value.to_owned(), + }, + )) + } Expr::NumberLiteral(number) => match &number.value { - ast::Number::Int(int) => Some(("int", int.to_string())), + ast::Number::Int(int) => Some(( + "int", + Choice { + literal: int.to_string(), + value: int.to_string(), + }, + )), _ => None, }, _ => None, @@ -343,6 +511,15 @@ fn module_invokes_main(body: &[Stmt]) -> bool { }) } +/// The module's own top-level `if __name__ == "__main__":` statements — each an +/// entry point written by hand, whatever the module's `main` is. +pub fn main_guards(body: &[Stmt]) -> impl Iterator { + body.iter().filter_map(|stmt| match stmt { + Stmt::If(if_stmt) if is_dunder_main_guard(&if_stmt.test) => Some(if_stmt), + _ => None, + }) +} + /// matches `__name__ == "__main__"`, accepting either operand order fn is_dunder_main_guard(test: &Expr) -> bool { let Expr::Compare(cmp) = test else { @@ -789,6 +966,74 @@ mod tests { "}); } + fn parsed(source: &str) -> ruff_python_parser::Parsed { + ruff_python_parser::parse_unchecked_source( + source, + ruff_python_ast::PySourceType::BasedPython, + ) + } + + /// the reading an editor asks for is the one the guard is generated from, so + /// a generic `main` is still `main`, and its parameters are still its own + #[test] + fn a_generic_main_is_the_entry_point() { + let source = "def main[T](name: str, count: int = 1):\n pass\n"; + assert!(guard(source).contains("(\"name\", str, \"any\", True, None),")); + let module = parsed(source); + let entry = super::entry_point(&module.syntax().body, source).expect("a main"); + assert!(entry.generates_guard()); + let names: Vec<&str> = entry + .parameters + .iter() + .map(super::EntryParameter::name) + .collect(); + assert_eq!(names, ["name", "count"]); + } + + #[test] + fn a_main_the_command_line_cannot_fill_names_what_blocks_it() { + let source = "def main(a: int, argv, b: str = \"x\"):\n \"\"\"Adds.\"\"\"\n"; + let module = parsed(source); + let entry = super::entry_point(&module.syntax().body, source).expect("a main"); + assert_eq!( + entry.blocked_by().map(super::EntryParameter::name), + Some("argv") + ); + assert!(!entry.generates_guard()); + assert_eq!(entry.docstring(), Some("Adds.")); + } + + #[test] + fn a_main_call_inside_a_docstring_is_not_an_invocation() { + let source = "\"\"\"\nmain()\n\"\"\"\ndef main():\n pass\n"; + let module = parsed(source); + let entry = super::entry_point(&module.syntax().body, source).expect("a main"); + assert!(!entry.module_invokes_main); + assert!(guard(source).contains(" main()")); + } + + #[test] + fn flags_are_the_spellings_the_runtime_registers() { + let source = "def main(out_dir: Path, dry_run: bool = False, mode: \"a\" | \"b\" = \"a\"):\n pass\n"; + let module = parsed(source); + let entry = super::entry_point(&module.syntax().body, source).expect("a main"); + let [out_dir, dry_run, mode] = entry.parameters.as_slice() else { + panic!("three parameters"); + }; + assert_eq!(out_dir.flags(), ["--out-dir", "--out_dir"]); + assert!(out_dir.negative_flags().is_empty()); + assert_eq!(dry_run.negative_flags(), ["--no-dry-run", "--no-dry_run"]); + let choices: Vec<&str> = mode + .spelling + .as_ref() + .and_then(|spelling| spelling.choices.as_ref()) + .expect("choices") + .iter() + .map(|choice| choice.value.as_str()) + .collect(); + assert_eq!(choices, ["a", "b"]); + } + /// a stub is never run as a script, so it declares `main` and nothing calls it #[test] fn a_stub_gets_no_entry_point() { diff --git a/crates/by_transforms/src/transforms/symbolic_type_op.rs b/crates/by_transforms/src/transforms/symbolic_type_op.rs index 4d35e7ad13..96f515fa5c 100644 --- a/crates/by_transforms/src/transforms/symbolic_type_op.rs +++ b/crates/by_transforms/src/transforms/symbolic_type_op.rs @@ -29,7 +29,9 @@ use ruff_python_parser::parse_expression; use ruff_text_size::{Ranged, TextRange}; use super::ast_driver::{AstPass, PassContext}; -use super::type_expr_walker::{Recurse, TypeExprVisitor, TypePos, walk_type_positions}; +use super::type_expr_walker::{ + Recurse, TypeExprVisitor, TypePos, walk_one_type_expr, walk_type_positions, +}; use crate::type_info::TypeInfo; /// One resolved operation: the replacement node (spliced into the working AST) @@ -140,6 +142,19 @@ impl TypeExprVisitor for FoldCollector<'_> { // type parameter's bound — python cannot express the dependency on `T`, and // the bound's member type is the guarantee every specialization satisfies Expr::Attribute(_) => self.types.is_attribute_type(expr), + // the shared walker stops at a tuple type, which `annotation` lowers as a + // whole, carrying the folds found inside it: `(str, *(int, str) * n)` + Expr::Tuple(tuple) if !tuple.is_anon_named_tuple => { + for element in &tuple.elts { + let element = match element { + Expr::Starred(starred) => starred.value.as_ref(), + Expr::Named(named) => named.value.as_ref(), + element => element, + }; + walk_one_type_expr(element, self); + } + return Recurse::Stop; + } _ => false, }; if !foldable { @@ -502,6 +517,32 @@ mod tests { ); } + #[test] + fn tuple_repetition() { + // python has no spelling for a tuple whose elements repeat in order, so the + // annotation keeps only which types its elements can be + check("x: (int, str) * int\n", "x: tuple[int | str, ...]\n"); + } + + #[test] + fn tuple_repetition_nested_in_subscript() { + check( + "x: list[(int, str) * int]\ny: dict[str, (int, str) * 2]\n", + "x: list[tuple[int | str, ...]]\ny: dict[str, tuple[int, str, int, str]]\n", + ); + } + + #[test] + fn tuple_repetition_unpacked_in_tuple_type() { + check( + "x: (bytes, *(int, str) * int, bytes)\n", + indoc! {" + from typing_extensions import Unpack + x: tuple[bytes, Unpack[tuple[int | str, ...]], bytes] + "}, + ); + } + #[test] fn typeof_operand_nested_in_subscript() { // the fold consumes the `typeof` operand even inside a subscript slice, diff --git a/crates/by_transforms/src/transforms/type_expr_walker.rs b/crates/by_transforms/src/transforms/type_expr_walker.rs index de6c993228..fa92e88d41 100644 --- a/crates/by_transforms/src/transforms/type_expr_walker.rs +++ b/crates/by_transforms/src/transforms/type_expr_walker.rs @@ -189,6 +189,13 @@ impl TypePosWalker<'_> { // edit (leaving the narrow transform's `needs_import` flag set // even though the edit was dropped) Expr::Tuple(_) => {} + // basedpython: the annotation of a variadic parameter, `*args: *(int, str)`, and an + // unpacked element of a generic argument list, `tuple[*Ts]`. the star itself is + // lowered by `unpack`, whose edit covers the star alone, so the type inside it is a + // type position like any other + Expr::Starred(s) => { + self.visit_type_expr(&s.value, TypePos::Nested); + } // an inline protocol is hoisted to a synthesized class by // `protocol_type`, which renders every member type through its own // lowerer. descending would let sibling transforms emit narrow diff --git a/crates/by_transforms/src/transforms/unpack.rs b/crates/by_transforms/src/transforms/unpack.rs index aea9e73b3f..ec25f0ddb2 100644 --- a/crates/by_transforms/src/transforms/unpack.rs +++ b/crates/by_transforms/src/transforms/unpack.rs @@ -16,7 +16,7 @@ use ruff_python_ast::PythonVersion; use ruff_python_ast::helpers::top_star_slice_elements; use ruff_python_ast::visitor::{Visitor, walk_expr, walk_stmt}; use ruff_python_ast::{Expr, ModModule, Stmt}; -use ruff_text_size::{Ranged, TextRange}; +use ruff_text_size::{Ranged, TextRange, TextSize}; use super::ast_driver::{AstPass, PassContext}; use crate::config::Config; @@ -131,6 +131,15 @@ impl<'ast> Visitor<'ast> for PackForwarding { } } +/// The `*` of an unpack, which is what [`Unpack`] replaces. +/// +/// Only the star itself: the type after it can be parenthesized, `*((int, str) * n)`, and a +/// range reaching to the start of that type would take the opening parenthesis with it, and +/// collide with the edit that lowers the type inside it. +fn star_token_range(unpack: TextRange) -> TextRange { + TextRange::at(unpack.start(), TextSize::from(1)) +} + struct State { edits: RefCell>, needs_import: bool, @@ -140,7 +149,7 @@ struct State { impl State { fn rewrite_subscript_starred(&mut self, starred: &ruff_python_ast::ExprStarred) { self.needs_import = true; - let star_range = TextRange::new(starred.range().start(), starred.value.range().start()); + let star_range = star_token_range(starred.range()); self.edits .borrow_mut() .push((star_range, "Unpack[".to_owned())); @@ -159,7 +168,7 @@ impl State { return; } self.needs_import = true; - let star_range = TextRange::new(ann.range().start(), starred.value.range().start()); + let star_range = star_token_range(ann.range()); self.edits .borrow_mut() .push((star_range, "Unpack[".to_owned())); @@ -216,6 +225,17 @@ mod tests { ); } + fn check_py311(input: &str, expected: &str) { + let config = Config { + min_version: PythonVersion::PY311, + ..Config::test_default() + }; + assert_eq!( + transpile(input, &config).unwrap(), + crate::python_passthrough::lazify_expected(expected) + ); + } + #[test] fn rewrites_starred_vararg_annotation() { check( @@ -227,6 +247,29 @@ mod tests { ); } + /// a tuple type inside an unpacked annotation is lowered like any other type position. the + /// `Unpack[` replacement covers the star alone, so it does not collide with the lowering of a + /// parenthesized type after it + #[test] + fn rewrites_tuple_type_inside_starred_vararg_annotation() { + check( + "def f(*args: *(int, str)): ...\ndef g(*args: *((int, str) * int)): ...\n", + indoc! {" + from typing_extensions import Unpack + def f(*args: Unpack[tuple[int, str]]): ... + def g(*args: Unpack[(tuple[int | str, ...])]): ... + "}, + ); + } + + #[test] + fn starred_vararg_annotation_keeps_the_star_on_py311() { + check_py311( + "def f(*args: *((int, str) * 2)): ...\n", + "def f(*args: *(tuple[int, str, int, str])): ...\n", + ); + } + /// a keyword pack is a `ParamSpec` at runtime, so `**kwargs: **Kwargs` takes its `.kwargs` /// spelling. the pep695 polyfill's rename must still reach the pack's name #[test] diff --git a/crates/ruff_python_ast/src/generated_names.rs b/crates/ruff_python_ast/src/generated_names.rs new file mode 100644 index 0000000000..f990af1db3 --- /dev/null +++ b/crates/ruff_python_ast/src/generated_names.rs @@ -0,0 +1,78 @@ +//! basedpython: the name nodes the parser writes rather than the author +//! +//! several constructs stand for code nobody typed. `init(let x: int)` stands for +//! a `self.x = x`, a property accessor's `field` stands for a read of the +//! property's backing storage, and an enum variant's anonymous field is declared +//! under a name the parser counts out (`_0`, `_1`, …). the nodes built for those +//! carry a source range all the same — a diagnostic about one has to point +//! somewhere the reader can see — so a range is not enough to tell them apart +//! from what the author wrote +//! +//! the parser records each one here instead, and a consumer that cares whether a +//! name in the tree is the author's asks [`GeneratedNames`] rather than reading +//! the source back. `used-underscore-name` is the consumer this exists for: it +//! reports a use of a name the author spelled with a leading underscore, and both +//! halves of that question — is this use one the author wrote, and is the +//! declaration it resolves to spelled by the author — are answered here + +use ruff_text_size::TextRange; +use rustc_hash::FxHashMap; + +use crate::name::Name; + +/// whose name a generated node carries +#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)] +#[cfg_attr(feature = "get-size", derive(get_size2::GetSize))] +pub enum GeneratedName { + /// the parser wrote the node, under a name the author wrote elsewhere: the + /// `self.x = x` of `init(let x: int)` names the parameter `x` + AuthorName, + /// the parser wrote the node *and* the name it carries: a property's backing + /// storage `__age`, an enum variant's anonymous field `_0` + ParserName, +} + +/// every name node the parser wrote in one file, by the range and name it carries +/// +/// two generated nodes can share a range — an `init` parameter's `self.x` target +/// and the `x` it reads both sit on the parameter — so the name is part of the +/// key. a node the author wrote is never recorded, and looking one up answers +/// `None` +#[derive(Clone, Debug, Default, PartialEq, Eq)] +pub struct GeneratedNames(FxHashMap<(TextRange, Name), GeneratedName>); + +impl GeneratedNames { + pub fn insert(&mut self, range: TextRange, name: Name, generated: GeneratedName) { + self.0.insert((range, name), generated); + } + + pub fn extend(&mut self, other: Self) { + self.0.extend(other.0); + } + + /// what wrote the name `name` at `range`, or `None` where the author did + pub fn get(&self, range: TextRange, name: Name) -> Option { + self.0.get(&(range, name)).copied() + } + + pub fn is_empty(&self) -> bool { + self.0.is_empty() + } + + pub fn shrink_to_fit(&mut self) { + self.0.shrink_to_fit(); + } +} + +#[cfg(feature = "get-size")] +impl get_size2::GetSize for GeneratedNames { + fn get_heap_size(&self) -> usize { + let entry = size_of::<((TextRange, Name), GeneratedName)>(); + self.0.capacity() * entry + + self + .0 + .keys() + .map(|(_, name)| get_size2::GetSize::get_heap_size(name)) + .sum::() + } +} diff --git a/crates/ruff_python_ast/src/lib.rs b/crates/ruff_python_ast/src/lib.rs index 03f1393d47..6f3637a1d0 100644 --- a/crates/ruff_python_ast/src/lib.rs +++ b/crates/ruff_python_ast/src/lib.rs @@ -14,6 +14,7 @@ pub mod docstrings; mod expression; pub mod find_node; mod generated; +pub mod generated_names; pub mod helpers; pub mod identifier; mod int; diff --git a/crates/ruff_python_formatter/resources/test/fixtures/ruff/tuple_repetition.by b/crates/ruff_python_formatter/resources/test/fixtures/ruff/tuple_repetition.by new file mode 100644 index 0000000000..2e047f661d --- /dev/null +++ b/crates/ruff_python_formatter/resources/test/fixtures/ruff/tuple_repetition.by @@ -0,0 +1,17 @@ +# a repeated tuple type is a tuple type multiplied by `int`, and fixed elements around +# the repetitions unpack it into an outer tuple type + + +def pairs(n: int) -> (int, str) * int: + return (1, "a") * n + + +framed: (bytes, *(int, str) * int, bytes) +framed_loose: (bytes,*( int,str )*int,bytes) +nested: list[(int, str)*int] + +type Pairs = (int, str) * int + + +def variadic(*args: *((int, str) * int)) -> None: + pass diff --git a/crates/ruff_python_formatter/tests/snapshots/format@tuple_repetition.by.snap b/crates/ruff_python_formatter/tests/snapshots/format@tuple_repetition.by.snap new file mode 100644 index 0000000000..1e61ec7710 --- /dev/null +++ b/crates/ruff_python_formatter/tests/snapshots/format@tuple_repetition.by.snap @@ -0,0 +1,45 @@ +--- +source: crates/ruff_python_formatter/tests/fixtures.rs +input_file: crates/ruff_python_formatter/resources/test/fixtures/ruff/tuple_repetition.by +--- +## Input +```bython +# a repeated tuple type is a tuple type multiplied by `int`, and fixed elements around +# the repetitions unpack it into an outer tuple type + + +def pairs(n: int) -> (int, str) * int: + return (1, "a") * n + + +framed: (bytes, *(int, str) * int, bytes) +framed_loose: (bytes,*( int,str )*int,bytes) +nested: list[(int, str)*int] + +type Pairs = (int, str) * int + + +def variadic(*args: *((int, str) * int)) -> None: + pass +``` + +## Output +```bython +# a repeated tuple type is a tuple type multiplied by `int`, and fixed elements around +# the repetitions unpack it into an outer tuple type + + +def pairs(n: int) -> (int, str) * int: + return (1, "a") * n + + +framed: (bytes, *(int, str) * int, bytes) +framed_loose: (bytes, *(int, str) * int, bytes) +nested: list[(int, str) * int] + +type Pairs = (int, str) * int + + +def variadic(*args: *((int, str) * int)) -> None: + pass +``` diff --git a/crates/ruff_python_parser/src/lib.rs b/crates/ruff_python_parser/src/lib.rs index 7732b25c1f..91a3219b2e 100644 --- a/crates/ruff_python_parser/src/lib.rs +++ b/crates/ruff_python_parser/src/lib.rs @@ -71,6 +71,7 @@ pub use crate::parser::ParseOptions; use crate::parser::Parser; +use ruff_python_ast::generated_names::GeneratedNames; use ruff_python_ast::token::{Token, TokenFlags, TokenKind, Tokens}; use ruff_python_ast::{ AtomicNodeIndex, Expr, Mod, ModExpression, ModModule, PySourceType, StringFlags, StringLiteral, @@ -320,6 +321,7 @@ pub fn parse_cells_unchecked( let mut tokens = Vec::new(); let mut errors = Vec::new(); let mut unsupported_syntax_errors = Vec::new(); + let mut generated_names = GeneratedNames::default(); let mut module_range: Option = None; while let Some(range) = ranges.next() { @@ -335,6 +337,7 @@ pub fn parse_cells_unchecked( tokens: cell_tokens, errors: cell_errors, unsupported_syntax_errors: cell_unsupported_syntax_errors, + generated_names: cell_generated_names, } = Parser::new_starts_at(cell_source, range.start(), options.clone()) .parse() .try_into_module() @@ -344,6 +347,7 @@ pub fn parse_cells_unchecked( tokens.extend(cell_tokens); errors.extend(cell_errors); unsupported_syntax_errors.extend(cell_unsupported_syntax_errors); + generated_names.extend(cell_generated_names); // Each range excludes its trailing `\n` separator (see the doc comment above), leaving a // one-byte gap in the token stream. Cover it with a `NonLogicalNewline` so token-based @@ -369,6 +373,7 @@ pub fn parse_cells_unchecked( tokens.shrink_to_fit(); errors.shrink_to_fit(); unsupported_syntax_errors.shrink_to_fit(); + generated_names.shrink_to_fit(); Parsed { syntax: ModModule { @@ -377,6 +382,7 @@ pub fn parse_cells_unchecked( body, }, tokens: Tokens::new(tokens), + generated_names, errors, unsupported_syntax_errors, } @@ -389,6 +395,7 @@ pub struct Parsed { tokens: Tokens, errors: Vec, unsupported_syntax_errors: Vec, + generated_names: GeneratedNames, } impl Parsed { @@ -412,6 +419,11 @@ impl Parsed { &self.unsupported_syntax_errors } + /// basedpython: the name nodes the parser wrote rather than the author + pub fn generated_names(&self) -> &GeneratedNames { + &self.generated_names + } + /// Consumes the [`Parsed`] output and returns the contained syntax node. pub fn into_syntax(self) -> T { self.syntax @@ -498,6 +510,7 @@ impl Parsed { tokens: self.tokens, errors: self.errors, unsupported_syntax_errors: self.unsupported_syntax_errors, + generated_names: self.generated_names, }), Mod::Expression(_) => None, } @@ -518,6 +531,7 @@ impl Parsed { tokens: self.tokens, errors: self.errors, unsupported_syntax_errors: self.unsupported_syntax_errors, + generated_names: self.generated_names, }), } } diff --git a/crates/ruff_python_parser/src/parser/mod.rs b/crates/ruff_python_parser/src/parser/mod.rs index 8c562e80be..72074c35cf 100644 --- a/crates/ruff_python_parser/src/parser/mod.rs +++ b/crates/ruff_python_parser/src/parser/mod.rs @@ -3,6 +3,7 @@ use std::cmp::Ordering; use std::str::FromStr; use bitflags::bitflags; +use ruff_python_ast::generated_names::{GeneratedName, GeneratedNames}; use ruff_python_ast::name::Name; use ruff_python_ast::token::TokenKind; use ruff_python_ast::{ @@ -117,6 +118,10 @@ pub(crate) struct Parser<'src> { /// by `class_body_depth > 0`), empty everywhere else. pending_members: Vec, + /// basedpython: the name nodes this parse wrote rather than the author — + /// see [`GeneratedNames`] + generated_names: GeneratedNames, + /// basedpython: `(property, backing field)` pairs declared in the class body /// currently being parsed whose getter is a pure field read. In-class *reads* /// of those properties are retargeted at the backing field once the body is @@ -194,6 +199,7 @@ impl<'src> Parser<'src> { current_token_id: TokenId::default(), class_body_depth: 0, function_body_depth: 0, + generated_names: GeneratedNames::default(), pending_members: Vec::new(), pending_narrow_props: Vec::new(), expr_consumed_suite: false, @@ -316,6 +322,7 @@ impl<'src> Parser<'src> { tokens: Tokens::new(tokens), errors: parse_errors, unsupported_syntax_errors: self.unsupported_syntax_errors, + generated_names: self.generated_names, }; } @@ -348,9 +355,17 @@ impl<'src> Parser<'src> { tokens: Tokens::new(tokens), errors: merged, unsupported_syntax_errors: self.unsupported_syntax_errors, + generated_names: self.generated_names, } } + /// basedpython: records that this parse, rather than the author, wrote the + /// name `name` at `range` — see [`GeneratedNames`] for why a range is not + /// enough to tell the two apart + fn record_generated_name(&mut self, range: TextRange, name: Name, generated: GeneratedName) { + self.generated_names.insert(range, name, generated); + } + /// Returns the start position for a node that starts at the current token. fn node_start(&self) -> TextSize { self.current_token_range().start() diff --git a/crates/ruff_python_parser/src/parser/statement.rs b/crates/ruff_python_parser/src/parser/statement.rs index 7a7dab25dc..41effc25ce 100644 --- a/crates/ruff_python_parser/src/parser/statement.rs +++ b/crates/ruff_python_parser/src/parser/statement.rs @@ -2,6 +2,7 @@ use std::fmt::{Display, Write}; use thin_vec::ThinVec; +use ruff_python_ast::generated_names::GeneratedName; use ruff_python_ast::helpers::{ DeclarationMarker, DeclarationMarkerKind, MemberVisibility, declaration_annotation_type, is_compound_statement, property_backing_name, written_annotation_type, @@ -282,6 +283,10 @@ fn synthetic_variant_decorator(marker: &'static str, range: TextRange) -> ast::D struct FieldRewriter { backing: Name, seen: std::cell::Cell, + /// where the rewrite wrote the backing name. the author wrote `field` at each + /// of these ranges, not `__x` — see + /// [`ruff_python_ast::generated_names::GeneratedNames`] + rewritten: std::cell::RefCell>, } /// Whether an accessor body is exactly a read of the backing field — the shape an @@ -327,6 +332,10 @@ struct RetargetPropertyAccess<'a> { properties: &'a [PropertyRetarget], /// the enclosing method's first parameter, i.e. what `self` is called here receiver: &'a str, + /// what each retarget wrote. the author wrote the property's own name at each + /// of these ranges, not the name it was pointed at — see + /// [`ruff_python_ast::generated_names::GeneratedNames`] + retargeted: std::cell::RefCell>, } impl ruff_python_ast::visitor::transformer::Transformer for RetargetPropertyAccess<'_> { @@ -351,14 +360,21 @@ impl ruff_python_ast::visitor::transformer::Transformer for RetargetPropertyAcce } else { property.write.clone() }; + self.retargeted + .borrow_mut() + .push((attr.attr.range, attr.attr.id.clone())); } ruff_python_ast::visitor::transformer::walk_expr(self, expr); } } /// Applies [`RetargetPropertyAccess`] to every method in a class body. -fn narrow_property_reads(body: &mut [Stmt], properties: &[PropertyRetarget]) { +fn narrow_property_reads( + body: &mut [Stmt], + properties: &[PropertyRetarget], +) -> Vec<(TextRange, Name)> { use ruff_python_ast::visitor::transformer::Transformer; + let mut retargeted = Vec::new(); for member in body { let Stmt::FunctionDef(func) = member else { continue; @@ -377,11 +393,14 @@ fn narrow_property_reads(body: &mut [Stmt], properties: &[PropertyRetarget]) { let rewriter = RetargetPropertyAccess { properties, receiver: receiver.as_str(), + retargeted: std::cell::RefCell::new(Vec::new()), }; for stmt in &mut func.body { rewriter.visit_stmt(stmt); } + retargeted.extend(rewriter.retargeted.take()); } + retargeted } /// A zero-width synthetic parameter for a synthesised accessor signature. @@ -454,6 +473,9 @@ fn build_property_fn( /// An attribute access on the implicit `self`, used to reach a property's /// backing storage (`self._`) from a synthesised accessor body. +/// +/// The caller records the name at its range, because the author did not write it +/// — see [`ruff_python_ast::generated_names::GeneratedNames`]. fn synth_backing_attr(backing: &Name, ctx: ExprContext, at: TextSize) -> Expr { let range = TextRange::empty(at); Expr::Attribute(ast::ExprAttribute { @@ -532,6 +554,7 @@ impl ruff_python_ast::visitor::transformer::Transformer for FieldRewriter { { self.seen.set(true); let range = name.range; + self.rewritten.borrow_mut().push(range); let ctx = name.ctx; *expr = Expr::Attribute(ast::ExprAttribute { value: Box::new(Expr::Name(ast::ExprName { @@ -2608,10 +2631,11 @@ impl<'src> Parser<'src> { self.bump(TokenKind::Colon); (ident.id, ident.range) } else { - ( - Name::from(format!("_{index}").as_str()), - TextRange::empty(self.current_token_range().start()), - ) + // the parser counts the anonymous fields out; nobody wrote `_0` + let name = Name::from(format!("_{index}").as_str()); + let range = TextRange::empty(self.current_token_range().start()); + self.record_generated_name(range, name.clone(), GeneratedName::ParserName); + (name, range) }; let annotation = self.parse_conditional_expression_or_higher().expr; let value = if self.eat(TokenKind::Equal) { @@ -5522,7 +5546,7 @@ impl<'src> Parser<'src> { /// and its name — the parser consumes the modifier keywords but does not /// record them on the `Parameter` node. A `private` prefix name-mangles the /// synthesised attribute to `self.__name` - fn synthesize_let_assignments(&self, params: &ast::Parameters) -> Vec { + fn synthesize_let_assignments(&mut self, params: &ast::Parameters) -> Vec { let mut out = Vec::new(); for p in ¶ms.posonlyargs { self.maybe_synth_let_assign(&p.parameter, &mut out); @@ -5542,7 +5566,7 @@ impl<'src> Parser<'src> { out } - fn maybe_synth_let_assign(&self, param: &ast::Parameter, out: &mut Vec) { + fn maybe_synth_let_assign(&mut self, param: &ast::Parameter, out: &mut Vec) { let prefix_start = usize::from(param.range.start()); let prefix_end = usize::from(param.name.range.start()); let prefix = &self.source[prefix_start..prefix_end]; @@ -5557,6 +5581,11 @@ impl<'src> Parser<'src> { // the visibility is the annotation marker's job, below let visibility = prefix_visibility(prefix); let attr_id = name_id.clone(); + // the parser writes the assignment, but the author wrote the name: both + // nodes carry the parameter's own name, so the attribute it declares is + // the author's to rename and the read of the parameter is not a use + self.record_generated_name(param.range, attr_id.clone(), GeneratedName::AuthorName); + self.record_generated_name(name_range, name_id.clone(), GeneratedName::AuthorName); let self_expr = Expr::Name(ast::ExprName { id: Name::new_static("self"), ctx: ExprContext::Load, @@ -5979,6 +6008,7 @@ impl<'src> Parser<'src> { let rewriter = FieldRewriter { backing: backing.clone(), seen: std::cell::Cell::new(false), + rewritten: std::cell::RefCell::new(Vec::new()), }; { use ruff_python_ast::visitor::transformer::Transformer; @@ -5993,6 +6023,9 @@ impl<'src> Parser<'src> { } } } + for range in rewriter.rewritten.take() { + self.record_generated_name(range, backing.clone(), GeneratedName::ParserName); + } let references_field = rewriter.seen.get(); if is_let && setter.is_some() { @@ -6168,6 +6201,11 @@ impl<'src> Parser<'src> { range: TextRange::empty(field_range.start()), node_index: AtomicNodeIndex::NONE, }); + self.record_generated_name( + TextRange::empty(field_range.start()), + backing.clone(), + GeneratedName::ParserName, + ); match (backing_type, backing_init) { (Some(annotation), value) => { backing_stmt = Some(Stmt::AnnAssign(ast::StmtAnnAssign { @@ -6243,6 +6281,13 @@ impl<'src> Parser<'src> { range: construct_range, node_index: AtomicNodeIndex::NONE, }; + if getter.is_none() { + self.record_generated_name( + TextRange::empty(start), + backing.clone(), + GeneratedName::ParserName, + ); + } let (getter_body, getter_range) = match getter { Some((body, range)) => (body, range), // `var` with only a setter gets a pass-through getter @@ -6295,6 +6340,11 @@ impl<'src> Parser<'src> { None => { let target = synth_backing_attr(&backing, ExprContext::Store, construct_range.end()); + self.record_generated_name( + TextRange::empty(construct_range.end()), + backing, + GeneratedName::ParserName, + ); ( vec![Stmt::Assign(ast::StmtAssign { targets: vec![target], @@ -7714,7 +7764,9 @@ impl<'src> Parser<'src> { let mut body = self.parse_body_inner(parent_clause); let properties = std::mem::replace(&mut self.pending_narrow_props, saved); if !properties.is_empty() { - narrow_property_reads(&mut body, &properties); + for (range, name) in narrow_property_reads(&mut body, &properties) { + self.record_generated_name(range, name, GeneratedName::ParserName); + } } body } else { diff --git a/crates/ruff_server/src/edit.rs b/crates/ruff_server/src/edit.rs index 619c03af2c..3ae138df2b 100644 --- a/crates/ruff_server/src/edit.rs +++ b/crates/ruff_server/src/edit.rs @@ -113,10 +113,13 @@ impl WorkspaceEditTracker { } /// Sets a series of [`Fixes`] for a text or notebook document. + /// + /// `version` is the version the fixes were computed against — see + /// [`DocumentQuery::edit_version`](crate::session::DocumentQuery::edit_version). pub(crate) fn set_fixes_for_document( &mut self, fixes: Fixes, - version: DocumentVersion, + version: Option, ) -> crate::Result<()> { #[expect( clippy::iter_over_hash_type, @@ -134,7 +137,7 @@ impl WorkspaceEditTracker { pub(crate) fn set_edits_for_document( &mut self, uri: Uri, - _version: DocumentVersion, + version: Option, edits: Vec, ) -> crate::Result<()> { match self { @@ -150,8 +153,9 @@ impl WorkspaceEditTracker { document_edits.push(lsp_types::TextDocumentEdit { text_document: lsp_types::OptionalVersionedTextDocumentIdentifier { text_document_identifier: TextDocumentIdentifier { uri }, - // TODO(jane): Re-enable versioned edits after investigating whether it could work with notebook cells - version: None, + // a client applying an edit to a document that has moved on since would + // land every range in the wrong place; the version is what lets it refuse + version, }, edits: edits.into_iter().map(lsp_types::Edit::TextEdit).collect(), }); diff --git a/crates/ruff_server/src/server/api/requests/code_action.rs b/crates/ruff_server/src/server/api/requests/code_action.rs index 8ff0aceab8..09c34eb53a 100644 --- a/crates/ruff_server/src/server/api/requests/code_action.rs +++ b/crates/ruff_server/src/server/api/requests/code_action.rs @@ -179,7 +179,7 @@ fn quick_fix( tracker.set_edits_for_document( document_uri.clone(), - document.version(), + document.edit_version(), fix.edits.clone(), )?; @@ -209,7 +209,7 @@ fn noqa_comments(snapshot: &DocumentSnapshot, fixes: &[DiagnosticFix]) -> Vec crate::Result { let mut tracker = WorkspaceEditTracker::new(client_capabilities); - tracker.set_fixes_for_document(fix_all_edit(query, encoding)?, query.version())?; + tracker.set_fixes_for_document(fix_all_edit(query, encoding)?, query.edit_version())?; Ok(tracker.into_workspace_edit()) } @@ -153,7 +153,10 @@ pub(super) fn resolve_edit_for_organize_imports( encoding: PositionEncoding, ) -> crate::Result { let mut tracker = WorkspaceEditTracker::new(client_capabilities); - tracker.set_fixes_for_document(organize_imports_edit(query, encoding)?, query.version())?; + tracker.set_fixes_for_document( + organize_imports_edit(query, encoding)?, + query.edit_version(), + )?; Ok(tracker.into_workspace_edit()) } @@ -214,7 +217,10 @@ pub(super) fn resolve_edit_for_optimize_imports( encoding: PositionEncoding, ) -> crate::Result { let mut tracker = WorkspaceEditTracker::new(client_capabilities); - tracker.set_fixes_for_document(optimize_imports_edit(query, encoding)?, query.version())?; + tracker.set_fixes_for_document( + optimize_imports_edit(query, encoding)?, + query.edit_version(), + )?; Ok(tracker.into_workspace_edit()) } @@ -223,7 +229,10 @@ pub(super) fn resolve_edit_for_format_and_optimize_imports( ) -> crate::Result { let query = snapshot.query(); let mut tracker = WorkspaceEditTracker::new(snapshot.resolved_client_capabilities()); - tracker.set_fixes_for_document(format_and_optimize_imports_edit(snapshot)?, query.version())?; + tracker.set_fixes_for_document( + format_and_optimize_imports_edit(snapshot)?, + query.edit_version(), + )?; Ok(tracker.into_workspace_edit()) } @@ -232,7 +241,10 @@ pub(super) fn resolve_edit_for_format_and_organize_imports( ) -> crate::Result { let query = snapshot.query(); let mut tracker = WorkspaceEditTracker::new(snapshot.resolved_client_capabilities()); - tracker.set_fixes_for_document(format_and_organize_imports_edit(snapshot)?, query.version())?; + tracker.set_fixes_for_document( + format_and_organize_imports_edit(snapshot)?, + query.edit_version(), + )?; Ok(tracker.into_workspace_edit()) } diff --git a/crates/ruff_server/src/server/api/requests/execute_command.rs b/crates/ruff_server/src/server/api/requests/execute_command.rs index 360671d8d1..ab59b70d99 100644 --- a/crates/ruff_server/src/server/api/requests/execute_command.rs +++ b/crates/ruff_server/src/server/api/requests/execute_command.rs @@ -100,13 +100,16 @@ impl super::SyncRequestHandler for ExecuteCommand { ) .with_failure_code(ErrorCode::InternalError)?; edit_tracker - .set_fixes_for_document(fixes, snapshot.query().version()) + .set_fixes_for_document(fixes, snapshot.query().edit_version()) .with_failure_code(ErrorCode::InternalError)?; } SupportedCommand::Format => { let fixes = super::format::format_full_document(&snapshot)?; edit_tracker - .set_fixes_for_document(fixes, version) + .set_fixes_for_document( + fixes, + snapshot.query().edit_version().map(|_| version), + ) .with_failure_code(ErrorCode::InternalError)?; } SupportedCommand::OrganizeImports => { @@ -116,7 +119,7 @@ impl super::SyncRequestHandler for ExecuteCommand { ) .with_failure_code(ErrorCode::InternalError)?; edit_tracker - .set_fixes_for_document(fixes, snapshot.query().version()) + .set_fixes_for_document(fixes, snapshot.query().edit_version()) .with_failure_code(ErrorCode::InternalError)?; } SupportedCommand::OptimizeImports => { @@ -126,7 +129,7 @@ impl super::SyncRequestHandler for ExecuteCommand { ) .with_failure_code(ErrorCode::InternalError)?; edit_tracker - .set_fixes_for_document(fixes, snapshot.query().version()) + .set_fixes_for_document(fixes, snapshot.query().edit_version()) .with_failure_code(ErrorCode::InternalError)?; } SupportedCommand::FormatAndOptimizeImports => { @@ -134,7 +137,7 @@ impl super::SyncRequestHandler for ExecuteCommand { super::code_action_resolve::format_and_optimize_imports_edit(&snapshot) .with_failure_code(ErrorCode::InternalError)?; edit_tracker - .set_fixes_for_document(fixes, snapshot.query().version()) + .set_fixes_for_document(fixes, snapshot.query().edit_version()) .with_failure_code(ErrorCode::InternalError)?; } SupportedCommand::Debug => { diff --git a/crates/ruff_server/src/session/index.rs b/crates/ruff_server/src/session/index.rs index a5055ecb07..846770e869 100644 --- a/crates/ruff_server/src/session/index.rs +++ b/crates/ruff_server/src/session/index.rs @@ -620,6 +620,18 @@ impl DocumentQuery { } } + /// The version to stamp on an edit computed from this query, so a client can refuse to apply + /// it to a document that has changed since. + /// + /// Only a text document has one. The edits for a notebook are addressed to its cells, and a + /// cell has no version of its own to compare against — the notebook's version is not it. + pub(crate) fn edit_version(&self) -> Option { + match self { + Self::Text { document, .. } => Some(document.version()), + Self::Notebook { .. } => None, + } + } + /// Get the URI for the document selected by this query. fn file_uri(&self) -> &Uri { match self { diff --git a/crates/ruff_server/tests/e2e/code_action.rs b/crates/ruff_server/tests/e2e/code_action.rs index 7a0d4333f6..1e0c0fc52c 100644 --- a/crates/ruff_server/tests/e2e/code_action.rs +++ b/crates/ruff_server/tests/e2e/code_action.rs @@ -428,3 +428,55 @@ fn format_and_optimize_imports_resolves_deferred() -> Result<()> { Ok(()) } + +/// A source action's edit names the version of the document it was computed against, so a client +/// that has moved on since — the user typed while the fix was being worked out — can refuse to +/// apply ranges that no longer point where they did. +#[test] +fn source_action_edit_carries_the_document_version() -> Result<()> { + let mut server = TestServerBuilder::new()? + .with_workspace(".")? + .enable_document_changes(true) + .build(); + + server.open_text_document("test.py", "x = 1\n", 1); + server.change_text_document( + "test.py", + vec![ + lsp_types::TextDocumentContentChangeEvent::TextDocumentContentChangeWholeDocument( + lsp_types::TextDocumentContentChangeWholeDocument { + text: NEEDS_EVERYTHING.to_string(), + }, + ), + ], + 7, + ); + + let actions = server + .code_action_request_only( + "test.py", + vec![CodeActionKind::new("source.optimizeImports.ruff")], + ) + .expect("Expected Some response"); + + let [CodeActionResponse::CodeAction(action)] = actions.as_slice() else { + panic!("Expected exactly one code action, got {actions:?}"); + }; + let Some(changes) = action + .edit + .as_ref() + .and_then(|edit| edit.document_changes.as_ref()) + else { + panic!("Expected document changes, got {:?}", action.edit); + }; + let versions: Vec<_> = changes + .iter() + .map(|change| match change { + lsp_types::DocumentChange::TextDocumentEdit(edit) => edit.text_document.version, + other => panic!("Expected a text edit, got {other:?}"), + }) + .collect(); + assert_eq!(versions, vec![Some(7)]); + + Ok(()) +} diff --git a/crates/ruff_server/tests/e2e/main.rs b/crates/ruff_server/tests/e2e/main.rs index 5b4121d1a5..0ae2887ef9 100644 --- a/crates/ruff_server/tests/e2e/main.rs +++ b/crates/ruff_server/tests/e2e/main.rs @@ -711,7 +711,6 @@ impl TestServer { } /// Send a `textDocument/didChange` notification with the given content changes - #[expect(dead_code)] pub(crate) fn change_text_document( &mut self, path: impl AsRef, @@ -1131,6 +1130,18 @@ impl TestServerBuilder { self } + /// Claims the client reads a workspace edit's `documentChanges`, the shape that can say which + /// version of a document its edits were computed against. + pub(crate) fn enable_document_changes(mut self, enabled: bool) -> Self { + self.client_capabilities + .workspace + .get_or_insert_default() + .workspace_edit + .get_or_insert_default() + .document_changes = Some(enabled); + self + } + /// Lets the server ask the client to apply a workspace edit, which is how the /// `workspace/executeCommand` handlers deliver their result. pub(crate) fn enable_apply_edit(mut self, enabled: bool) -> Self { diff --git a/crates/ty/docs/cli.md b/crates/ty/docs/cli.md index 5c8dc6475b..4d1ca9f79d 100644 --- a/crates/ty/docs/cli.md +++ b/crates/ty/docs/cli.md @@ -21,7 +21,7 @@ by
by run

Transpile and run a module with python -m <module>

by init

Start a new project

by build

Build the project as python

-
by restage

Recompute one file's slot in a build tree that already exists

+
by restage

Recompute the slots of a set of edited files in a build tree that already exists

by compile

Compile .by and .py files to native CPython extension modules

by generate-api-file

Generate an api lockfile (api.lock) summarising the public type-level surface of the project

by transpile

Transpile a file to stdout, or a whole directory in place (reads stdin if no path given)

@@ -256,6 +256,10 @@ by run [OPTIONS] [MODULE] [ARGS]...

A function the compiler declines still runs — from the interpreted source embedded in the extension — so this changes speed, not behaviour. Needs a C toolchain and python development headers.

The entry module itself stays interpreted: running something as __main__ needs a code object, and an extension module has none.

--help, -h

Print help (see a summary with '-h')

+
--in-build

Run in the tree this staged instead of in the current directory.

+

For a program whose arguments are the project's own files — a test runner, a coverage run, a type checker over the output. Those files are python only in the staged tree, so a path naming one resolves only from inside it. Everything else wants the default: a program that reads or writes beside the project has to see the directory it was started in.

+
--launcher path

A program to start the interpreter through, such as a debugger that has to be the process the program runs in.

+

The interpreter is chosen exactly as it is without this, and the program is started as LAUNCHER <interpreter> <runner> <module> <args>: the launcher is handed the interpreter by run chose rather than having to name one, and is run once, for the program — never for the version probe, which is made against the interpreter itself.

--min-version version

minimum Python version the output must run on [default: the version of the interpreter that will run it]

--no-unique-loop-bindings

leave a closure made inside a loop sharing the loop's one binding, as python does, instead of binding the values of the iteration it was made in

--python, --venv path

The interpreter to run on, or the environment holding it.

@@ -308,7 +312,7 @@ by build [OPTIONS]
--help, -h

Print help (see a summary with '-h')

--min-version version

minimum Python version the output must run on [default: the project's configured python version]

--no-unique-loop-bindings

leave a closure made inside a loop sharing the loop's one binding, as python does, instead of binding the values of the iteration it was made in

-
--out, -o dir

Where to write the output [default: build, or dist with --wheels]

+
--out, -o dir

Where to write the output [default: build in the project root, or dist with --wheels]

--print-manifest

Report what the build read and produced, as <kind> <value> lines.

input <path> for every file the project is made of — what a source distribution has to carry to rebuild into the same thing — and package <name> for every top-level package that came out.

--runtime-raises-checks

wrap every function with a raises clause in a runtime guard that fails when it raises something the clause does not include

@@ -320,9 +324,9 @@ by build [OPTIONS] ## by restage -Recompute one file's slot in a build tree that already exists. +Recompute the slots of a set of edited files in a build tree that already exists. -What a debugger needs to give a running program an edit. `by run` transpiles the project into a directory and runs the program out of there, so nothing the user edits is the file the interpreter compiled: a `.by` because it was transpiled, a hand-written `.py` because it was copied. This produces what that file's slot in the tree should now hold. +What a debugger needs to give a running program an edit. `by run` transpiles the project into a directory and runs the program out of there, so nothing the user edits is the file the interpreter compiled: a `.by` because it was transpiled, a hand-written `.py` because it was copied. This produces what each file's slot in the tree should now hold, and the one `_by_sourcemap.py` that describes all of them together. It **writes nothing** and prints JSON. The caller writes the bytes, because the caller is the only one that can take the write back when the replacement it was for is refused. @@ -331,13 +335,13 @@ Editors should send `by/transpileForBuild` to the language server instead, which

Usage

``` -by restage +by restage ... ```

Arguments

BUILD_DIRECTORY

The build tree the program is running out of

-
FILE

The file in the project that was edited

+
FILES

The files in the project that were edited. Name every file of one edit together: they share a sourcemap, and re-staging them one at a time answers with a map per file that each drop the others' entries

Options

@@ -375,9 +379,9 @@ by compile [OPTIONS] [FILE]...
--no-unique-loop-bindings

leave a closure made inside a loop sharing the loop's one binding, as python does, instead of binding the values of the iteration it was made in

--no-verify-install

Leave out the import-time check that every class reported as compiled is the class standing under its own name.

The check runs once per module at import and raises ImportError naming the class when what was installed is not what was emitted for it. It is on by default: a class that quietly leaves its interpreted definition standing answers exactly as that definition does, so nothing else detects one.

-
--out, --output, -o dir

Where to write the generated C and the extension modules.

+
--out, --output, -o dir

Where to write the generated C and the extension modules [default: build in the project root].

The same directory by build writes, and the same flag names it — --output is kept because it was the only spelling this command took.

-

[default: build]

--require-native

Fail the build if any function is left to its interpreted definition, whatever the reason.

+
--require-native

Fail the build if any function is left to its interpreted definition, whatever the reason.

Stricter than --no-any, and a different question: --no-any asks whether the module is fully typed, this asks whether it compiles entirely.

--runtime-raises-checks

wrap every function with a raises clause in a runtime guard that fails when it raises something the clause does not include

--soundness spec

which runtime type-soundness checks to insert: default, all (adds the opt-in parameters entry checks), none, or a comma-separated subset of generic-calls, projections, iterations, assignments, returns, arguments, parameters

diff --git a/crates/ty/docs/rules.md b/crates/ty/docs/rules.md index f51de6864e..84eb6ec21e 100644 --- a/crates/ty/docs/rules.md +++ b/crates/ty/docs/rules.md @@ -8,7 +8,7 @@ Default level: error · Added in 0.0.64 · Related issues · -View source +View source @@ -44,7 +44,7 @@ class Base(ABC): Default level: error · Added in 0.0.13 · Related issues · -View source +View source @@ -90,7 +90,7 @@ class Derived(Base): # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.61 · Related issues · -View source +View source @@ -123,7 +123,7 @@ f(1, b=s1) # ok — explicit Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.39 · Related issues · -View source +View source @@ -159,7 +159,7 @@ report(Celsius()) # error: two conversions apply Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.3 · Related issues · -View source +View source @@ -194,7 +194,7 @@ extension list: Default level: warn · Added in 0.0.1-alpha.20 · Related issues · -View source +View source @@ -258,7 +258,7 @@ class SubProto(BaseProto, Protocol): Default level: error · Added in 0.0.14 · Related issues · -View source +View source @@ -340,7 +340,7 @@ value = unknown # ty: ignore[unresolved-reference] Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.61 · Related issues · -View source +View source @@ -383,7 +383,7 @@ a4 = True + 1 # ok — a boolean used as a boolean Default level: error · Added in 0.0.16 · Related issues · -View source +View source @@ -435,7 +435,7 @@ Foo.method() # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -463,7 +463,7 @@ Calling a non-callable object will raise a `TypeError` at runtime. Default level: error · Added in 0.0.7 · Related issues · -View source +View source @@ -498,7 +498,7 @@ def f(x: object): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -546,7 +546,7 @@ def main(): Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -593,7 +593,7 @@ def Fixed(show: bool): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -626,7 +626,7 @@ a = 1 # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -660,7 +660,7 @@ class C(A, B): ... # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -706,7 +706,7 @@ def App(done: bool) -> int: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -740,7 +740,7 @@ class B(A): ... # error Default level: error · Added in 0.0.1-alpha.29 · Related issues · -View source +View source @@ -785,7 +785,7 @@ type Tree = int | list[Tree] # valid recursive alias Default level: error · Added in 0.0.15 · Related issues · -View source +View source @@ -821,7 +821,7 @@ class Example: Default level: warn · Added in 0.0.1-alpha.16 · Related issues · -View source +View source @@ -860,7 +860,7 @@ old_func() # error: [deprecated] Default level: ignore · Added in 0.0.78 · Related issues · -View source +View source @@ -1032,7 +1032,7 @@ soundness checks from their type checker, and it may have false positives in som Default level: error · Level under ty-compatible: ignore · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -1064,7 +1064,7 @@ This rule is currently disabled by default because of the number of false positi Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -1095,7 +1095,7 @@ class B(A, A): ... # error Default level: error · Added in 0.0.1-alpha.12 · Related issues · -View source +View source @@ -1135,7 +1135,7 @@ class A: # error Default level: ignore · Added in 0.0.73 · Related issues · -View source +View source @@ -1246,7 +1246,7 @@ Python code. Default level: error · Added in 0.0.14 · Related issues · -View source +View source @@ -1295,7 +1295,7 @@ def bar() -> str: # error: [empty-body] Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.61 · Related issues · -View source +View source @@ -1356,7 +1356,7 @@ def h(x: object): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.3 · Related issues · -View source +View source @@ -1458,7 +1458,7 @@ def foo() -> "intt\b": ... # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -1497,7 +1497,7 @@ def f(local fn: () -> None): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -1538,7 +1538,7 @@ for x in [1, 2, 3]: Default level: warn · Added in 0.0.50 · Related issues · -View source +View source @@ -1578,7 +1578,7 @@ def g(value: ~A) -> None: ... # error: [experimental-syntax] Default level: error · Added in 0.0.20 · Related issues · -View source +View source @@ -1612,7 +1612,7 @@ def my_function() -> int: Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.40 · Related issues · -View source +View source @@ -1647,7 +1647,7 @@ let a = 1 Default level: error · Added in 0.0.15 · Related issues · -View source +View source @@ -1764,7 +1764,7 @@ def test() -> "Literal[5]": Default level: ignore · basedpython only, so absent under ty-compatible · Added in 0.0.72 · Related issues · -View source +View source @@ -1817,7 +1817,7 @@ unpacking — is not a declaration, and is never reported. Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.68 · Related issues · -View source +View source @@ -1892,7 +1892,7 @@ print(Labelled) # warning: prints `` Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.80 · Related issues · -View source +View source @@ -1931,7 +1931,7 @@ def audit(account: Account) -> int: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -1967,7 +1967,7 @@ class C(A, B): ... # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -1996,7 +1996,7 @@ t[3] # error Default level: warn · Added in 0.0.1-alpha.33 · Related issues · -View source +View source @@ -2033,7 +2033,7 @@ class MyClass: ... Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.79 · Related issues · -View source +View source @@ -2069,7 +2069,7 @@ class Point: Default level: error · Added in 0.0.1-alpha.12 · Related issues · -View source +View source @@ -2164,7 +2164,7 @@ will produce instances with an atypical memory layout. Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2196,7 +2196,7 @@ func("foo") # error: [invalid-argument-type] Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2226,7 +2226,7 @@ a: int = "" # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2307,7 +2307,7 @@ box.value = 1 # okay Default level: error · Added in 0.0.33 · Related issues · -View source +View source @@ -2352,7 +2352,7 @@ class Sub(Base): Default level: error · Added in 0.0.1-alpha.19 · Related issues · -View source +View source @@ -2394,7 +2394,7 @@ asyncio.run(main()) Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2421,7 +2421,7 @@ class A(42): ... # error: [invalid-base] Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.79 · Related issues · -View source +View source @@ -2459,7 +2459,7 @@ build: # error: `build` is an experimental feature, and is off Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.5 · Related issues · -View source +View source @@ -2496,7 +2496,7 @@ extension str(A): # error: `str` does not answer every member of `A` Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2525,7 +2525,7 @@ with 1: # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.39 · Related issues · -View source +View source @@ -2558,7 +2558,7 @@ class Fahrenheit: Default level: error · Added in 0.0.12 · Related issues · -View source +View source @@ -2611,7 +2611,7 @@ See: Default level: error · Added in 0.0.13 · Related issues · -View source +View source @@ -2647,7 +2647,7 @@ class A: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2679,7 +2679,7 @@ a: str # error Default level: warn · Added in 0.0.20 · Related issues · -View source +View source @@ -2735,7 +2735,7 @@ class Pet(Enum): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -2800,7 +2800,7 @@ This rule corresponds to Ruff's Default level: error · Added in 0.0.1-alpha.28 · Related issues · -View source +View source @@ -2854,7 +2854,7 @@ class D(A): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.3 · Related issues · -View source +View source @@ -2887,7 +2887,7 @@ extension list[T: int]: # error: `list` declares no type parameter `T` Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.4 · Related issues · -View source +View source @@ -2916,7 +2916,7 @@ Author.objects.filter(name__startswith=1) # error: lookup wants `str` Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.36 · Related issues · -View source +View source @@ -2952,7 +2952,7 @@ def test_user(user: int) -> None: # error: fixture provides `str` Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.68 · Related issues · -View source +View source @@ -3000,7 +3000,7 @@ f"{'name':>10}" # ok Default level: error · Added in 0.0.1-alpha.35 · Related issues · -View source +View source @@ -3050,7 +3050,7 @@ class NonFrozenChild(FrozenBase): # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -3105,7 +3105,7 @@ class E(Generic[V]): Default level: error · Added in 0.0.12 · Related issues · -View source +View source @@ -3200,7 +3200,7 @@ a = 20 / 0 # type: ignore Default level: error · Added in 0.0.1-alpha.17 · Related issues · -View source +View source @@ -3247,7 +3247,7 @@ carol = Person(name="Carol", aeg=25) # typo! Default level: warn · Added in 0.0.15 · Related issues · -View source +View source @@ -3308,7 +3308,7 @@ def f(x, y, /): # Python 3.8+ syntax Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -3348,7 +3348,7 @@ def f(t: TypeVar("U")): ... # ty: ignore[invalid-type-form] Default level: error · Added in 0.0.18 · Related issues · -View source +View source @@ -3399,7 +3399,7 @@ match object(): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -3433,7 +3433,7 @@ class B(metaclass=42): ... # error Default level: error · Added in 0.0.1-alpha.20 · Related issues · -View source +View source @@ -3550,7 +3550,7 @@ Correct use of `@override` is enforced by ty's [`invalid-explicit-override`](#in Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.72 · Related issues · -View source +View source @@ -3593,7 +3593,7 @@ implements Backend # error: `Backend` is not a protocol Default level: error · Added in 0.0.72 · Related issues · -View source +View source @@ -3631,7 +3631,7 @@ from module import missing # error Default level: error · Added in 0.0.1-alpha.19 · Related issues · -View source +View source @@ -3696,7 +3696,7 @@ TypeError: typing.ClassVar[int] is not valid as type argument Default level: warn · Added in 0.0.31 · Related issues · -View source +View source @@ -3742,7 +3742,7 @@ admin[0] # "Alice" Default level: error · Added in 0.0.1-alpha.27 · Related issues · -View source +View source @@ -3780,7 +3780,7 @@ Baz = NewType("Baz", int | str) # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -3837,7 +3837,7 @@ def foo(x: int) -> int: ... Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.80 · Related issues · -View source +View source @@ -3875,7 +3875,7 @@ B().f() # 1, not 2 Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -3903,7 +3903,7 @@ def f(a: int = ""): ... # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.36 · Related issues · -View source +View source @@ -3936,7 +3936,7 @@ def test_add(a: int, b: int) -> None: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -3972,7 +3972,7 @@ P2 = ParamSpec() # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4024,7 +4024,7 @@ Declare the type variable with `TypeVar("T", covariant=True)` instead. Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4095,7 +4095,7 @@ def g(): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.37 · Related issues · -View source +View source @@ -4130,7 +4130,7 @@ def g[T](value: T) raises T: # error: `T@g` is not always an exception Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.36 · Related issues · -View source +View source @@ -4163,7 +4163,7 @@ if m := re.match("(a)(b)", "ab"): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -4195,7 +4195,7 @@ type Alias[reified T] = list[T] # error: an alias's parameters are erased Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4341,7 +4341,7 @@ def detail(request, pk: int): ... # ok Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.79 · Related issues · -View source +View source @@ -4380,7 +4380,7 @@ import "data/missing.json" as missing Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4488,7 +4488,7 @@ class C: ... Default level: error · Added in 0.0.10 · Related issues · -View source +View source @@ -4539,7 +4539,7 @@ class MyClass: Default level: error · Added in 0.0.1-alpha.6 · Related issues · -View source +View source @@ -4585,7 +4585,7 @@ InvalidAlias = TypeAliasType("InvalidAlias", list[T], type_params=(list[T],)) # Default level: error · Added in 0.0.1-alpha.29 · Related issues · -View source +View source @@ -4651,7 +4651,7 @@ Bar[int] # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4684,7 +4684,7 @@ TYPE_CHECKING = "" # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4719,7 +4719,7 @@ b: Annotated[int] # error Default level: error · Added in 0.0.1-alpha.11 · Related issues · -View source +View source @@ -4776,7 +4776,7 @@ class C: Default level: error · Added in 0.0.15 · Related issues · -View source +View source @@ -4842,7 +4842,7 @@ class Owner[U]: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -4899,7 +4899,7 @@ V = TypeVar("V", list[int], int) # valid constrained Type Default level: error · Added in 0.0.16 · Related issues · -View source +View source @@ -4941,7 +4941,7 @@ U = TypeVar("U", int, str, default=bytes) # error: [invalid-type-variable-defau Default level: error · Added in 0.0.28 · Related issues · -View source +View source @@ -4977,7 +4977,7 @@ class Child(Base): Default level: error · Added in 0.0.14 · Related issues · -View source +View source @@ -5018,7 +5018,7 @@ def f(options: dict[str, object]): Default level: error · Added in 0.0.9 · Related issues · -View source +View source @@ -5052,7 +5052,7 @@ class Foo(TypedDict): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -5093,7 +5093,7 @@ type Alias[out T] = list[T] # error: `list` is invariant Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.80 · Related issues · -View source +View source @@ -5128,7 +5128,7 @@ class Point: Default level: error · Added in 0.0.25 · Related issues · -View source +View source @@ -5162,7 +5162,7 @@ def gen() -> Iterator[int]: Default level: error · Added in 0.0.14 · Related issues · -View source +View source @@ -5228,7 +5228,7 @@ def h(arg2: type): Default level: error · Added in 0.0.15 · Related issues · -View source +View source @@ -5277,7 +5277,7 @@ def g(arg: object): Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.36 · Related issues · -View source +View source @@ -5308,7 +5308,7 @@ def f(s: str): Default level: warn · Added in 0.0.30 · Related issues · -View source +View source @@ -5350,7 +5350,7 @@ Movie = TypedDict("Film", {"title": str}) # error: [mismatched-type-name] Default level: warn · Added in 0.0.1-alpha.39 · Related issues · -View source +View source @@ -5418,7 +5418,7 @@ and nothing is reported. Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -5449,7 +5449,7 @@ func() # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.61 · Related issues · -View source +View source @@ -5480,7 +5480,7 @@ f(1) # ok — `s` is passed implicitly Default level: ignore · Preview (since 0.0.76) · Related issues · -View source +View source @@ -5569,7 +5569,7 @@ Add `urllib3` to `project.dependencies` if your code imports it directly. Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.4 · Related issues · -View source +View source @@ -5597,7 +5597,7 @@ from django.db import models # warning: install `django-stubs` for precise type Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.81 · Related issues · -View source +View source @@ -5649,7 +5649,7 @@ def ignore(event: str): ... Default level: error · Level under ty-compatible: ignore · Added in 0.0.41 · Related issues · -View source +View source @@ -5710,7 +5710,7 @@ class ExplicitChild(Parent): Default level: error · Added in 0.0.75 · Related issues · -View source +View source @@ -5797,7 +5797,7 @@ class Item: Default level: error · Level under ty-compatible: ignore · Added in 0.0.45 · Related issues · -View source +View source @@ -5835,7 +5835,7 @@ def handle(m: re.Match[str]) -> str: Default level: error · Added in 0.0.1-alpha.20 · Related issues · -View source +View source @@ -5874,7 +5874,7 @@ alice["age"] # KeyError Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -5921,7 +5921,7 @@ def App(): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -5941,8 +5941,7 @@ narrowing, and the test is always false. ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): if check(a): # error: the guard narrows as a statement, not as a test @@ -5955,7 +5954,7 @@ def f(a: int | None): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -5993,7 +5992,7 @@ func("string") # error: [no-matching-overload] Default level: error · Added in 0.0.30 · Related issues · -View source +View source @@ -6030,7 +6029,7 @@ class Sub(Super): ... # error: [non-callable-init-subclass] Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.39 · Related issues · -View source +View source @@ -6061,7 +6060,7 @@ def f(x: int | str) -> int: Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.61 · Related issues · -View source +View source @@ -6090,7 +6089,7 @@ def f(a: object): Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -6134,7 +6133,7 @@ def g(o: object, shape: Shape): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6163,7 +6162,7 @@ for i in 34: # error Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6191,7 +6190,7 @@ Subscripting an object that does not support it will raise a `TypeError` at runt Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6220,7 +6219,7 @@ def f(once done: () -> None): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6248,7 +6247,7 @@ def f(once done: () -> None): Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.61 · Related issues · -View source +View source @@ -6286,7 +6285,7 @@ def f(x: int?): Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -6341,7 +6340,7 @@ def g(name: str | None): Default level: error · Added in 0.0.1-alpha.29 · Related issues · -View source +View source @@ -6378,7 +6377,7 @@ class B(A): Default level: error · Added in 0.0.16 · Related issues · -View source +View source @@ -6415,7 +6414,7 @@ class B(A): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.38 · Related issues · -View source +View source @@ -6458,7 +6457,7 @@ def main(): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6489,7 +6488,7 @@ f(1, x=2) # error Default level: error · Added in 0.0.1-alpha.22 · Related issues · -View source +View source @@ -6520,7 +6519,7 @@ f(x=1) # error Default level: error · Level under ty-compatible: ignore · Added in 0.0.1-alpha.22 · Related issues · -View source +View source @@ -6558,7 +6557,7 @@ A.c # error Default level: warn · Added in 0.0.1-alpha.22 · Related issues · -View source +View source @@ -6596,7 +6595,7 @@ A()[0] # error Default level: error · Level under ty-compatible: ignore · Added in 0.0.1-alpha.22 · Related issues · -View source +View source @@ -6640,7 +6639,7 @@ from module import a # error Default level: warn · Added in 0.0.23 · Related issues · -View source +View source @@ -6672,7 +6671,7 @@ html.parser # error Default level: error · Level under ty-compatible: ignore · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6708,7 +6707,7 @@ print(x) # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.79 · Related issues · -View source +View source @@ -6747,7 +6746,7 @@ Id("x") # error: `Id`'s constructor is private Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.80 · Related issues · -View source +View source @@ -6778,7 +6777,7 @@ __all__ = ["helper"] # error: `helper` is private Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6810,7 +6809,7 @@ from helpers import Key # error: `Key` is private to `helpers` Default level: warn · Added in 0.0.60 · Related issues · -View source +View source @@ -6885,7 +6884,7 @@ def test() -> "int": Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -6927,7 +6926,7 @@ def g(a: bool | None): Default level: warn · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -6962,7 +6961,7 @@ cast(int, f()) # error Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -7016,7 +7015,7 @@ if sys.version_info >= (3, 12): # ok — artificially constant Default level: warn · Added in 0.0.18 · Related issues · -View source +View source @@ -7054,7 +7053,7 @@ class C: Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -7109,7 +7108,7 @@ class Sub(Base): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.62 · Related issues · -View source +View source @@ -7158,7 +7157,7 @@ def f(value: int | str) -> int: Default level: error · Added in 0.0.71 · Related issues · -View source +View source @@ -7222,7 +7221,7 @@ def g(values: tuple[int, ...]) -> None: Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.3 · Related issues · -View source +View source @@ -7255,7 +7254,7 @@ class C: Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.72 · Related issues · -View source +View source @@ -7291,7 +7290,7 @@ class C[T]: Default level: warn · Added in 0.0.71 · Related issues · -View source +View source @@ -7334,7 +7333,7 @@ def build(t: Tag) -> None: Default level: error · Added in 0.0.20 · Related issues · -View source +View source @@ -7378,7 +7377,7 @@ class Outer[T]: Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -7427,7 +7426,7 @@ def Observed(): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -7471,7 +7470,7 @@ def Counter(): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7505,7 +7504,7 @@ static_assert(int(2.0 * 3.0) == 6) # error Default level: warn · Added in 0.0.39 · Related issues · -View source +View source @@ -7557,7 +7556,7 @@ limitation. Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7591,7 +7590,7 @@ class B(A): ... # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7623,7 +7622,7 @@ class Circle(Shape): ... # error: `Shape` is sealed in another workspace Default level: error · Added in 0.0.1-alpha.30 · Related issues · -View source +View source @@ -7732,7 +7731,7 @@ class Book: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7762,7 +7761,7 @@ f("foo") # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7801,7 +7800,7 @@ def find(items: list[int]) -> int: Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7848,7 +7847,7 @@ g: Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7883,7 +7882,7 @@ f: # error: the block returns `None`, not `str` Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -7922,7 +7921,7 @@ def _(x: int): Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.4 · Related issues · -View source +View source @@ -7953,7 +7952,7 @@ class User(BaseModel): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8012,7 +8011,7 @@ class A: Default level: error · Added in 0.0.20 · Related issues · -View source +View source @@ -8085,7 +8084,7 @@ the project registers with `@register.simple_block_tag`. Default level: warn · Added in 0.0.1-alpha.39 · Related issues · -View source +View source @@ -8151,7 +8150,7 @@ what the projects depending on it read. Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.37 · Related issues · -View source +View source @@ -8180,7 +8179,7 @@ def f() raises TypeError: Default level: warn · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8203,13 +8202,51 @@ Using `reveal_type` without importing it will raise a `NameError` at runtime. reveal_type(1) # revealed: Literal[1] ``` +## `unestablished-assertion-guard` + + +Default level: error · basedpython only, so absent under ty-compatible · +Added in 0.0.1-alpha.40 · +Related issues · +View source + + + +**What it does** + +Checks that a function with a basedpython assertion guard establishes what it asserts +wherever it returns. + +**Why is this bad?** + +`-> asserts x` tells every caller that `x` is truthy once the call has returned, and each +call narrows its argument on the strength of that. A body that can return without having +established it — by falling off its end, or through a `return` — narrows the caller's +argument to something it may not be. + +**Example** + + +```by +def check(x: int | None) -> asserts x: # error: `x` can still be `0` here + if x is None: + raise ValueError +``` + +Use instead: + +```by +def check(x: int | None) -> asserts x: + assert x +``` + ## `unhandled-exception` Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.37 · Related issues · -View source +View source @@ -8239,7 +8276,7 @@ def main(): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8270,7 +8307,7 @@ f(x=1, y=2) # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.36 · Related issues · -View source +View source @@ -8481,7 +8518,7 @@ page does not render at all. Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.72 · Related issues · -View source +View source @@ -8515,7 +8552,7 @@ implements Backend # error: this module does not answer `Backend` Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -8574,7 +8611,7 @@ def Held(): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8607,7 +8644,7 @@ A().foo # error Default level: warn · Added in 0.0.1-alpha.15 · Related issues · -View source +View source @@ -8682,7 +8719,7 @@ def g(): Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8710,7 +8747,7 @@ import foo # error Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8730,8 +8767,7 @@ parameter that was later renamed — silently narrows nothing at every call site ```by def check(value: int | None) -> asserts values: # error: `values` is nothing - if value is None: - raise ValueError + assert value ``` ## `unresolved-reference` @@ -8740,7 +8776,7 @@ def check(value: int | None) -> asserts values: # error: `values` is nothing Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -8858,7 +8894,7 @@ is one whose template set cannot be established. Default level: ignore · Added in 0.0.73 · Related issues · -View source +View source @@ -8986,7 +9022,7 @@ Python code. Default level: error · Added in 0.0.71 · Related issues · -View source +View source @@ -9027,7 +9063,7 @@ def f(a: object, b: int, c: Any): Default level: ignore · Added in 0.0.70 · Related issues · -View source +View source @@ -9172,7 +9208,7 @@ Python code. Default level: ignore · Added in 0.0.70 · Related issues · -View source +View source @@ -9319,7 +9355,7 @@ generator boundaries. Default level: error · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.3 · Related issues · -View source +View source @@ -9369,7 +9405,7 @@ A() # error: nothing says which specialization this is Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.1-alpha.40 · Related issues · -View source +View source @@ -9416,7 +9452,7 @@ def Observed(items: StateList[int]): ... # ok: an observable handle Default level: warn · Added in 0.0.1-alpha.7 · Related issues · -View source +View source @@ -9462,7 +9498,7 @@ class D(C): ... # error: [unsupported-base] Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -9511,7 +9547,7 @@ b1 < b2 < b1 # error Default level: warn · Level under ty-compatible: ignore · Added in 0.0.12 · Related issues · -View source +View source @@ -9556,7 +9592,7 @@ def factory(base: type[Base]) -> type: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source @@ -9588,7 +9624,7 @@ A() + A() # error Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.79 · Related issues · -View source +View source @@ -9631,7 +9667,7 @@ reveal_type(project.root) # revealed: "." Default level: warn · Added in 0.0.21 · Related issues · -View source +View source @@ -9710,7 +9746,7 @@ to `false` to prevent this rule from reporting unused `type: ignore` comments. Default level: warn · basedpython only, so absent under ty-compatible · Added in 0.0.71 · Related issues · -View source +View source @@ -9790,13 +9826,58 @@ This rule is skipped if [`analysis.respect-type-ignore-comments`](https://docs.astral.sh/ty/reference/configuration/#respect-type-ignore-comments) to `false`. +## `used-underscore-name` + + +Default level: warn · basedpython only, so absent under ty-compatible · +Added in 0.0.81 · +Related issues · +View source + + + +**What it does** + +Checks for a use of a name that a `.by` file spelled with a leading +underscore: a variable, a parameter, a function, a class, an import, or a +member of a class declared in a `.by` file. + +**Why is this bad?** + +basedpython spells privacy with `private` and `protected`, so a leading +underscore says one thing only: the name is unused. A use contradicts it, +and a reader who trusts the underscore skips over code that matters. + +A name spelled by python or a stub is not reported — a library's +`_internal`, `_asdict`, an override of a python base class's `_hook` — and +neither is `_` or a dunder, which python gives meanings of their own. + +**Example** + + +```by +def _parse(text: str) -> int: + return int(text) + +_parse("1") # warning: `_parse` is used +``` + +Drop the underscore, or declare the name `private`: + +```by +private def parse(text: str) -> int: + return int(text) + +parse("1") +``` + ## `useless-overload-body` Default level: warn · Added in 0.0.1-alpha.22 · Related issues · -View source +View source @@ -9875,7 +9956,7 @@ def foo(x: int | str) -> int | str: Default level: error · Added in 0.0.1-alpha.1 · Related issues · -View source +View source diff --git a/crates/ty/src/args.rs b/crates/ty/src/args.rs index 4e8e9042ca..606ec53251 100644 --- a/crates/ty/src/args.rs +++ b/crates/ty/src/args.rs @@ -87,6 +87,16 @@ pub(crate) enum Command { /// resolves imports against — then `$PYTHON`, then `python3` on `PATH`. #[arg(long, value_name = "PATH", alias = "venv")] python: Option, + /// A program to start the interpreter through, such as a debugger that + /// has to be the process the program runs in. + /// + /// The interpreter is chosen exactly as it is without this, and the + /// program is started as `LAUNCHER `: + /// the launcher is handed the interpreter `by run` chose rather than + /// having to name one, and is run once, for the program — never for the + /// version probe, which is made against the interpreter itself. + #[arg(long, value_name = "PATH")] + launcher: Option, #[command(flatten)] lowering: LoweringArgs, /// Compile every imported module to a native extension first. @@ -99,6 +109,16 @@ pub(crate) enum Command { /// `__main__` needs a code object, and an extension module has none. #[arg(long)] compiled: bool, + /// Run in the tree this staged instead of in the current directory. + /// + /// For a program whose arguments are the project's own files — a test + /// runner, a coverage run, a type checker over the output. Those files + /// are python only in the staged tree, so a path naming one resolves + /// only from inside it. Everything else wants the default: a program + /// that reads or writes beside the project has to see the directory it + /// was started in. + #[arg(long)] + in_build: bool, }, /// Start a new project. @@ -146,7 +166,7 @@ pub(crate) enum Command { /// `uv`, which does the packaging. #[arg(long, conflicts_with_all = ["min_version", "print_manifest"])] wheels: bool, - /// Where to write the output [default: `build`, or `dist` with `--wheels`] + /// Where to write the output [default: `build` in the project root, or `dist` with `--wheels`] #[arg(short = 'o', long, value_name = "DIR")] out: Option, /// Report what the build read and produced, as ` ` lines. @@ -160,13 +180,15 @@ pub(crate) enum Command { lowering: LoweringArgs, }, - /// Recompute one file's slot in a build tree that already exists. + /// Recompute the slots of a set of edited files in a build tree that + /// already exists. /// /// What a debugger needs to give a running program an edit. `by run` /// transpiles the project into a directory and runs the program out of /// there, so nothing the user edits is the file the interpreter compiled: a /// `.by` because it was transpiled, a hand-written `.py` because it was - /// copied. This produces what that file's slot in the tree should now hold. + /// copied. This produces what each file's slot in the tree should now hold, + /// and the one `_by_sourcemap.py` that describes all of them together. /// /// It **writes nothing** and prints JSON. The caller writes the bytes, /// because the caller is the only one that can take the write back when the @@ -180,9 +202,11 @@ pub(crate) enum Command { /// The build tree the program is running out of. #[arg(value_name = "BUILD_DIR")] build_directory: PathBuf, - /// The file in the project that was edited. - #[arg(value_name = "FILE")] - file: PathBuf, + /// The files in the project that were edited. Name every file of one + /// edit together: they share a sourcemap, and re-staging them one at a + /// time answers with a map per file that each drop the others' entries. + #[arg(value_name = "FILE", required = true)] + files: Vec, }, /// Compile .by and .py files to native CPython extension modules. @@ -195,7 +219,8 @@ pub(crate) enum Command { /// project root. #[arg(value_name = "FILE")] files: Vec, - /// Where to write the generated C and the extension modules. + /// Where to write the generated C and the extension modules + /// [default: `build` in the project root]. /// /// The same directory `by build` writes, and the same flag names it — /// `--output` is kept because it was the only spelling this command took. @@ -203,10 +228,9 @@ pub(crate) enum Command { short = 'o', long = "out", visible_alias = "output", - value_name = "DIR", - default_value = "build" + value_name = "DIR" )] - output: PathBuf, + output: Option, /// Report every function that was not lowered natively, with the reason. #[arg(long)] verbose: bool, diff --git a/crates/ty/src/by_commands.rs b/crates/ty/src/by_commands.rs index 8d9eb0aa55..10677d83e0 100644 --- a/crates/ty/src/by_commands.rs +++ b/crates/ty/src/by_commands.rs @@ -123,15 +123,38 @@ impl LoweringArgs { // ── run ────────────────────────────────────────────────────────────────────── +/// How `by run` was invoked, beyond what it is running. +/// +/// The four choices a caller makes about the *process*: which interpreter, what +/// stands in front of it, whether its modules are compiled first, and which +/// directory it runs in. [`CompileFlags`] groups `by compile`'s for the same +/// reason. +#[derive(Debug, Clone, Copy, Default)] +pub(crate) struct RunFlags<'a> { + /// Compile every imported module to a native extension first. + pub(crate) compiled: bool, + /// Run the program in the tree the run staged rather than where it was typed. + pub(crate) in_build: bool, + /// `--python`: the interpreter, or the environment holding it. + pub(crate) python: Option<&'a Path>, + /// `--launcher`: a program to start the interpreter through. + pub(crate) launcher: Option<&'a Path>, +} + #[allow(clippy::exit, clippy::print_stderr)] pub(crate) fn cmd_run( module: Option<&str>, args: &[String], min_version: Option<&str>, lowering: &LoweringArgs, - compiled: bool, - python_flag: Option<&Path>, + flags: RunFlags<'_>, ) -> anyhow::Result { + let RunFlags { + compiled, + in_build, + python: python_flag, + launcher, + } = flags; let cwd = std::env::current_dir().context("failed to get current directory")?; // one resolution of the project, for the environment and the target version // both: they are two readings of the same configuration and must not be able @@ -199,7 +222,7 @@ pub(crate) fn cmd_run( // project with neither fails immediately rather than after transpiling let module = match module { Some(module) => module.to_owned(), - None => match configured_main(&db) { + None => match by_stage::run_module::configured_main(&db) { Some(main) => main, None => anyhow::bail!( "no module given and no entry point configured — \ @@ -318,18 +341,43 @@ pub(crate) fn cmd_run( // relative path on its command line, and anything it reads or writes beside // the project, resolve against the directory they were written for. python // puts the runner's own directory — the generated tree — at the head of - // `sys.path`, so the module is still found there - let status = Command::new(&python) + // `sys.path`, so the module is still found there. + // + // a launcher goes in front of the interpreter rather than in place of it. a + // debugger that has to *be* the process the program runs in used to get + // there as `--python`, which switched this discovery off and left it to name + // an interpreter it could only guess at — and to tell the version probe apart + // from the program, since both were sent to it + let mut command = match launcher { + Some(launcher) => { + let mut command = Command::new(launcher); + command.arg(&python); + command + } + None => Command::new(&python), + }; + // `--in-build` runs it in that tree instead, for the programs whose + // arguments are the project's own files: the project is python only there, + // so `pytest tests/test_x.py` finds a file at all only from inside it — and + // the whole project is inside it, configuration and data included, so what + // the program makes of the tree is what it would have made of the project + let workdir = if in_build { tmp.path() } else { cwd.as_path() }; + let status = command .arg(tmp.path().join(BY_RUNNER_FILENAME)) .arg(&module) .args(args) - .current_dir(&cwd) + .current_dir(workdir) .status() - .with_context(|| { - format!( + .with_context(|| match launcher { + Some(launcher) => format!( + "could not run the launcher `{}` for `{python}`, the interpreter from {}", + launcher.display(), + interpreter.origin + ), + None => format!( "could not run `{python}`, the interpreter from {}", interpreter.origin - ) + ), })?; let code = status.code().unwrap_or(1); @@ -544,13 +592,6 @@ fn compiled_module_name( }) } -/// The project's `run.main` entry point, if one is configured. -fn configured_main(db: &ProjectDatabase) -> Option { - let options = db.project().metadata(db).options(); - let main = options.run.as_ref()?.main.as_ref()?; - Some((**main).clone()) -} - /// The python version a brand new project should target. /// /// The environment it will be developed in is the right answer when there is @@ -822,7 +863,8 @@ fn detect_python_version(python: &str) -> Option { // ── build ──────────────────────────────────────────────────────────────────── #[allow(clippy::print_stderr)] -/// Recompute one file's slot in a build tree that already exists, and print it. +/// Recompute the slots of a set of edited files in a build tree that already +/// exists, and print them. /// /// The command-line half of `by/transpileForBuild`, over the same implementation: /// the language server answers this out of a database that is already warm, @@ -835,16 +877,21 @@ fn detect_python_version(python: &str) -> Option { /// non-zero: a caller in a script should be able to read `$?` rather than parse /// to find out whether it got bytes. #[allow(clippy::print_stdout)] -pub(crate) fn cmd_restage(build_directory: &Path, file: &Path) -> anyhow::Result { +pub(crate) fn cmd_restage(build_directory: &Path, files: &[PathBuf]) -> anyhow::Result { let cwd = std::env::current_dir().context("failed to get current directory")?; - let file = if file.is_absolute() { - file.to_path_buf() - } else { - cwd.join(file) - }; + let files: Vec = files + .iter() + .map(|file| { + if file.is_absolute() { + file.clone() + } else { + cwd.join(file) + } + }) + .collect(); let (db, _, _, _) = build_project_db(&cwd, BY_SOURCES, Some(build_directory))?; - let restaged = by_stage::restage::restage_one(&db, build_directory, &file)?; + let restaged = by_stage::restage::restage(&db, build_directory, &files)?; println!( "{}", serde_json::to_string_pretty(&restaged) @@ -860,7 +907,7 @@ pub(crate) fn cmd_restage(build_directory: &Path, file: &Path) -> anyhow::Result pub(crate) fn cmd_build( min_version: Option<&str>, lowering: &LoweringArgs, - out: &Path, + out: Option<&Path>, print_manifest: bool, ) -> anyhow::Result { let cwd = std::env::current_dir().context("failed to get current directory")?; @@ -869,7 +916,7 @@ pub(crate) fn cmd_build( let target = config.min_version.to_string(); crate::by_stamps::fill_discovered(&mut config.stamps, &cwd, Some(&target)); - let out = settled_output_dir(&cwd, out); + let out = output_dir(&cwd, out)?; let (db, handles, rebuilder, root) = build_project_db(&cwd, BY_SOURCES, Some(&out))?; if handles.is_empty() { @@ -969,6 +1016,28 @@ fn print_build_manifest( Ok(()) } +/// Where a command that writes the build tree writes it: `out` when it was given, against the +/// working directory it was typed in; otherwise the project's own build directory, wherever in the +/// project the command runs. +/// +/// The default is the project's for the reason the sources are: `by build` in `tests/` builds the +/// whole project, and writing that into `tests/build` put a second tree where nothing looks for +/// it — not the language server's `by/buildOutput`, which names one build directory per project, +/// and not the next `by build` run from the root. [`by_stage::layout::default_build_directory`] is +/// the one answer both of them read. +fn output_dir(cwd: &Path, out: Option<&Path>) -> anyhow::Result { + Ok(match out { + Some(out) => settled_output_dir(cwd, out), + None => { + let project = ResolvedProject::discover(cwd)?; + settled_output_dir( + cwd, + &by_stage::layout::default_build_directory(project.root()), + ) + } + }) +} + /// Where a build's output goes, settled before the project is read. /// /// It is the one directory the project must not be read *from*: it holds a copy @@ -1016,7 +1085,7 @@ pub(crate) struct CompileFlags { /// actually runs natively, so it is never hidden. pub(crate) fn cmd_compile( files: &[PathBuf], - output: &Path, + output: Option<&Path>, flags: CompileFlags, ) -> anyhow::Result { let CompileFlags { @@ -1073,7 +1142,7 @@ pub(crate) fn cmd_compile( // context that used to sit here misreported a version refusal as a missing header let toolchain = by_build::Toolchain::probe(&python)?; - let out_dir = settled_output_dir(&cwd, output); + let out_dir = output_dir(&cwd, output)?; let mut compiled = 0usize; let mut declined_total = 0usize; // the output tree. `by_build` lays the artefacts out itself, so they are @@ -1157,7 +1226,7 @@ pub(crate) fn cmd_compile( // authored the whole tree. while `compile` wrote artefacts alone, it deleted // the sourcemap and build record a `by build` into the same directory had // left — and `by restage` then refused that tree, which took the language - // server's single-file re-stage down with it + // server's re-stage down with it let roots = module_roots(&db, &root); let transpilable: Vec<(PathBuf, ruff_db::files::File)> = project .iter() diff --git a/crates/ty/src/cli-reference.md b/crates/ty/src/cli-reference.md index a3ec9abc58..b0db245e93 100644 --- a/crates/ty/src/cli-reference.md +++ b/crates/ty/src/cli-reference.md @@ -15,13 +15,29 @@ by run main ``` resolves `main.by` in the project root, transpiles it (and every other `.by` -file in the project) to a temporary directory, then executes -`python -m main` from there +file in the project) to a temporary directory, and runs `main` out of that tree +— in the directory you invoked `by` from, the way `python -m` does, so a +relative path the program is given and anything it reads or writes beside the +project mean what they say ```sh by run main --min-version 3.12 ``` +### `--in-build` + +run in the staged tree instead of in the current directory: + +```sh +by run --in-build pytest -v tests/test_calc.py +``` + +for a program whose arguments are the project's own files. the project is +python only in the staged tree — `tests/test_calc.by` is `tests/test_calc.py` +there, beside every file the build carries over unchanged, `pyproject.toml` +included — so a path naming one of its modules resolves, and a tool reports +paths relative to a tree laid out like the project. + ## `by build` transpile every `.by` file in the project to `build/`, mirroring the module diff --git a/crates/ty/src/lib.rs b/crates/ty/src/lib.rs index beba858c0e..d223fe0cf9 100644 --- a/crates/ty/src/lib.rs +++ b/crates/ty/src/lib.rs @@ -15,7 +15,6 @@ mod version; use std::fmt::Display; use std::io::{BufWriter, Write}; -use std::path::Path; use std::process::{ExitCode, Termination}; use std::sync::{Arc, Mutex}; @@ -120,15 +119,21 @@ fn run_command(command: Command) -> anyhow::Result { args, min_version, python, + launcher, lowering, compiled, + in_build, } => by_commands::cmd_run( module.as_deref(), &args, min_version.as_deref(), &lowering, - compiled, - python.as_deref(), + by_commands::RunFlags { + compiled, + in_build, + python: python.as_deref(), + launcher: launcher.as_deref(), + }, ), Command::Init { path, @@ -148,8 +153,8 @@ fn run_command(command: Command) -> anyhow::Result { } Command::Restage { build_directory, - file, - } => by_commands::cmd_restage(&build_directory, &file), + files, + } => by_commands::cmd_restage(&build_directory, &files), Command::Build { min_version, wheels, @@ -163,7 +168,7 @@ fn run_command(command: Command) -> anyhow::Result { by_commands::cmd_build( min_version.as_deref(), &lowering, - out.as_deref().unwrap_or(Path::new("build")), + out.as_deref(), print_manifest, ) } @@ -181,7 +186,7 @@ fn run_command(command: Command) -> anyhow::Result { lowering, } => by_commands::cmd_compile( &files, - &output, + output.as_deref(), by_commands::CompileFlags { verbose, emit_c_only, diff --git a/crates/ty/tests/by_e2e.rs b/crates/ty/tests/by_e2e.rs index 8e99004895..bae179f899 100644 --- a/crates/ty/tests/by_e2e.rs +++ b/crates/ty/tests/by_e2e.rs @@ -218,7 +218,7 @@ fn compiling_one_module_leaves_the_others_importable() { fn a_compile_leaves_a_build_tree_readable() { // `compile` and `build` write to the same directory by design. while // `compile` wrote artefacts alone it took the sourcemap and the build record - // with it, and `by restage` — the language server's single-file re-stage — + // with it, and `by restage` — the language server's re-stage — // then refused the tree for having no `_by_build.json`, so a compile silently // disabled the editor plugin against it let dir = resource_project("by_cli_compile_then_restage"); @@ -798,6 +798,110 @@ fn run_names_the_by_source_for_file_and_argv() { ); } +/// A project whose entry module reports the directory it runs in and whether it +/// can see the project's own files from there, at `app/calc.py` (python only in +/// the staged tree) and `pyproject.toml` (carried over into it unchanged). +fn project_reporting_where_it_runs(dir: &Path) { + fs::write( + dir.join("pyproject.toml"), + "[project]\nname = \"demo\"\nversion = \"0.1.0\"\n", + ) + .unwrap(); + let package = dir.join("app"); + fs::create_dir_all(&package).unwrap(); + fs::write(package.join("__init__.by"), "").unwrap(); + fs::write( + package.join("calc.by"), + "def add(a: int, b: int) -> int:\n return a + b\n", + ) + .unwrap(); + fs::write( + dir.join("main.by"), + "import os\n\nprint(os.getcwd())\nprint(os.path.exists('app/calc.py'))\nprint(os.path.exists('pyproject.toml'))\n", + ) + .unwrap(); + fs::create_dir_all(dir.join("tools")).unwrap(); +} + +/// the directory the program runs in is the one `by` was invoked from, not the +/// project root and not the tree it staged: a relative path the program was +/// given, and anything it reads or writes beside the project, mean what they +/// meant when they were written +#[test] +fn run_runs_in_the_directory_it_was_started_in() { + let dir = tempfile::tempdir().expect("tempdir"); + project_reporting_where_it_runs(dir.path()); + let elsewhere = dir.path().join("tools"); + + let output = Command::new(env!("CARGO_BIN_EXE_by")) + .env(EnvVars::BY_NO_PROJECT_SERVER, "1") + .args(["run", "main"]) + .current_dir(&elsewhere) + .output() + .expect("failed to spawn by"); + + let stdout = String::from_utf8_lossy(&output.stdout); + assert!( + output.status.success(), + "by run failed:\n{}", + String::from_utf8_lossy(&output.stderr) + ); + let lines: Vec<&str> = stdout.lines().collect(); + assert_eq!( + Path::new(lines[0]).canonicalize().ok(), + elsewhere.canonicalize().ok(), + "ran in {} rather than where it was started:\n{stdout}", + lines[0] + ); + assert_eq!( + &lines[1..], + ["False", "False"], + "the caller's directory holds neither, so neither is visible:\n{stdout}" + ); +} + +/// `--in-build` runs the program in the tree `by run` staged, which is where the +/// project is python: a test runner handed `tests/test_x.py` finds a file at all +/// only from inside it, and reports what it collects against a tree laid out +/// like the project — configuration and carried-over files included +#[test] +fn run_in_build_runs_in_the_tree_it_staged() { + let dir = tempfile::tempdir().expect("tempdir"); + project_reporting_where_it_runs(dir.path()); + let elsewhere = dir.path().join("tools"); + + let output = Command::new(env!("CARGO_BIN_EXE_by")) + .env(EnvVars::BY_NO_PROJECT_SERVER, "1") + .args(["run", "--in-build", "main"]) + .current_dir(&elsewhere) + .output() + .expect("failed to spawn by"); + + let stdout = String::from_utf8_lossy(&output.stdout); + assert!( + output.status.success(), + "by run --in-build failed:\n{}", + String::from_utf8_lossy(&output.stderr) + ); + let lines: Vec<&str> = stdout.lines().collect(); + assert_ne!( + Path::new(lines[0]).canonicalize().ok(), + elsewhere.canonicalize().ok(), + "ran where it was started rather than in the staged tree:\n{stdout}" + ); + assert_ne!( + Path::new(lines[0]).canonicalize().ok(), + dir.path().canonicalize().ok(), + "ran in the project rather than in the staged tree:\n{stdout}" + ); + assert_eq!( + &lines[1..], + ["True", "True"], + "the staged tree holds the transpiled module and the project's \ + configuration beside it:\n{stdout}" + ); +} + /// `multiprocessing`'s spawn start method — the default on macos and windows — /// reads `__main__.__spec__.name` to tell the child what to re-import, and falls /// back to running `__file__` as a *path* when there is none. `__file__` is a @@ -5652,6 +5756,87 @@ fn run_from_a_subdirectory_is_still_the_project() { ); } +/// a launcher is handed the interpreter the project's discovery chose, and is run once — for the +/// program, not for the version probe +#[cfg(unix)] +#[test] +fn run_starts_the_program_through_a_launcher_with_the_interpreter_it_discovered() { + use std::os::unix::fs::PermissionsExt as _; + + let dir = tempfile::tempdir().expect("tempdir"); + let environment = python_environment(&dir.path().join(".venv")); + fs::write( + dir.path().join("pyproject.toml"), + format!( + "[project]\nname = \"demo\"\nversion = \"0.1.0\"\n{}", + environment.requires_python() + ), + ) + .unwrap(); + fs::write(dir.path().join("main.by"), REPORTS_ITS_INTERPRETER).unwrap(); + let seen = dir.path().join("seen"); + let launcher = dir.path().join("launcher"); + fs::write( + &launcher, + format!( + "#!/bin/sh\n\ + printf 'invoked\\n' >> '{seen}'\n\ + for arg in \"$@\"; do printf 'arg %s\\n' \"$arg\" >> '{seen}'; done\n\ + exec \"$@\"\n", + seen = seen.display() + ), + ) + .unwrap(); + fs::set_permissions(&launcher, fs::Permissions::from_mode(0o755)).unwrap(); + + let output = Command::new(env!("CARGO_BIN_EXE_by")) + .env(EnvVars::BY_NO_PROJECT_SERVER, "1") + .arg("run") + .arg("--launcher") + .arg(&launcher) + .args(["main", "extra"]) + .current_dir(dir.path()) + .env_remove("PYTHON") + .env_remove("VIRTUAL_ENV") + .output() + .expect("failed to spawn by"); + + let stdout = String::from_utf8_lossy(&output.stdout); + let stderr = String::from_utf8_lossy(&output.stderr); + assert!(output.status.success(), "by run failed:\n{stderr}"); + assert!( + environment.ran_it(&stdout), + "the program ran on the project's environment, launcher or not:\n{stdout}\n{stderr}" + ); + let seen = fs::read_to_string(&seen).expect("the launcher ran"); + assert_eq!( + seen.matches("invoked").count(), + 1, + "the launcher is run for the program alone:\n{seen}" + ); + let arguments: Vec<&str> = seen + .lines() + .filter_map(|line| line.strip_prefix("arg ")) + .collect(); + assert!( + arguments + .first() + .is_some_and(|python| environment.ran_it(python)), + "the launcher's first argument is the interpreter discovery chose:\n{seen}" + ); + assert!( + arguments + .get(1) + .is_some_and(|runner| runner.ends_with("_by_runner.py")), + "then the runner:\n{seen}" + ); + assert_eq!( + arguments.get(2..), + Some(&["main", "extra"][..]), + "then the program:\n{seen}" + ); +} + #[test] fn build_from_a_subdirectory_builds_the_project() { let dir = tempfile::tempdir().expect("tempdir"); @@ -5675,13 +5860,52 @@ fn build_from_a_subdirectory_builds_the_project() { let stderr = String::from_utf8_lossy(&output.stderr); assert!(output.status.success(), "by build failed:\n{stderr}"); + // the tree the language server's `by/buildOutput` names for this project, which is the + // project's `build/` wherever the build was run from assert!( - elsewhere + dir.path() .join("build") .join("app") .join("__init__.py") .exists(), - "the module tree is the project's, not the caller's:\n{stderr}" + "the module tree is the project's, and so is where it is written:\n{stderr}" + ); + assert!( + !elsewhere.join("build").exists(), + "a build run from a subdirectory wrote a second tree there:\n{stderr}" + ); +} + +/// `--out` is a path the caller typed, so it is the caller's directory it is relative to — only the +/// default belongs to the project +#[test] +fn an_explicit_output_directory_is_relative_to_where_the_build_runs() { + let dir = tempfile::tempdir().expect("tempdir"); + fs::write( + dir.path().join("pyproject.toml"), + "[project]\nname = \"demo\"\nversion = \"0.1.0\"\n", + ) + .unwrap(); + fs::write(dir.path().join("main.by"), "x = 1\n").unwrap(); + let elsewhere = dir.path().join("tools"); + fs::create_dir_all(&elsewhere).unwrap(); + + let output = Command::new(env!("CARGO_BIN_EXE_by")) + .env(EnvVars::BY_NO_PROJECT_SERVER, "1") + .args(["build", "--out", "here"]) + .current_dir(&elsewhere) + .output() + .expect("failed to spawn by"); + + let stderr = String::from_utf8_lossy(&output.stderr); + assert!(output.status.success(), "by build failed:\n{stderr}"); + assert!( + elsewhere.join("here").join("main.py").exists(), + "`--out` names a directory relative to where it was typed:\n{stderr}" + ); + assert!( + !dir.path().join("build").exists(), + "an explicit `--out` still wrote the default tree:\n{stderr}" ); } diff --git a/crates/ty/tests/by_restage.rs b/crates/ty/tests/by_restage.rs index 954d9f613e..5468ed94f3 100644 --- a/crates/ty/tests/by_restage.rs +++ b/crates/ty/tests/by_restage.rs @@ -1,4 +1,4 @@ -//! `by restage` — one file's slot in a build tree that already exists. +//! `by restage` — the slots of an edit's files in a build tree that already exists. //! //! Driven through the real binary rather than the library, because the property that matters is //! about two commands agreeing: what `by build` wrote into the tree, and what `by restage` says @@ -31,21 +31,54 @@ fn build(dir: &Path) { assert!(status.success(), "`by build` failed"); } -fn restage(dir: &Path, file: &str) -> (bool, serde_json::Value) { +fn restage_all(dir: &Path, files: &[&str]) -> (bool, serde_json::Value) { let out = Command::new(env!("CARGO_BIN_EXE_by")) - .args(["restage", "build", file]) + .args(["restage", "build"]) + .args(files) .current_dir(dir) .output() .expect("`by restage` should run"); let json = serde_json::from_slice(&out.stdout).unwrap_or_else(|e| { panic!( - "`by restage {file}` printed something that is not json: {e}\n{}", + "`by restage {files:?}` printed something that is not json: {e}\n{}", String::from_utf8_lossy(&out.stdout) ) }); (out.status.success(), json) } +/// A set of one: the file's own slot, and the set's map beside it. +fn restage(dir: &Path, file: &str) -> (bool, Slot) { + let (ok, answer) = restage_all(dir, &[file]); + (ok, Slot(answer)) +} + +/// One file's answer, read through the set it came back in. +struct Slot(serde_json::Value); + +impl Slot { + /// the file's own field, or the set's `sourcemap` + fn get(&self, field: &str) -> &serde_json::Value { + match field { + "sourcemap" => &self.0["sourcemap"], + _ => &self.0["files"][0][field], + } + } + + /// the first reason the set was refused + fn refused(&self) -> &str { + self.0["refusals"][0]["refused"] + .as_str() + .unwrap_or_else(|| panic!("not a refusal: {}", self.0)) + } +} + +impl std::fmt::Display for Slot { + fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { + self.0.fmt(f) + } +} + /// A re-stage is handed no stamps, so it can only reproduce the build's if the /// build wrote them down. /// @@ -92,8 +125,8 @@ build-stamps = true let (ok, answer) = restage(dir.path(), "main.by"); assert!(ok, "an unedited file should re-stage: {answer}"); - assert_eq!(answer["content"].as_str().unwrap(), on_disk); - assert_eq!(answer["changed"].as_bool(), Some(false)); + assert_eq!(answer.get("content").as_str().unwrap(), on_disk); + assert_eq!(answer.get("changed").as_bool(), Some(false)); } /// **The property the whole design rests on.** @@ -115,8 +148,8 @@ fn restaging_a_file_nobody_edited_reproduces_the_build_exactly() { let (ok, answer) = restage(dir.path(), "main.by"); assert!(ok, "an unedited file should re-stage: {answer}"); - assert_eq!(answer["content"].as_str().unwrap(), on_disk); - assert_eq!(answer["changed"].as_bool(), Some(false)); + assert_eq!(answer.get("content").as_str().unwrap(), on_disk); + assert_eq!(answer.get("changed").as_bool(), Some(false)); } /// The path a caller writes to, and the key `_by_sourcemap.py` uses, have to be the same path — a @@ -129,7 +162,7 @@ fn the_generated_path_is_absolute_even_for_a_relative_build_directory() { build(dir.path()); let (_, answer) = restage(dir.path(), "main.by"); - let generated = Path::new(answer["generated"].as_str().unwrap()); + let generated = Path::new(answer.get("generated").as_str().unwrap()); assert!( generated.is_absolute(), @@ -160,10 +193,17 @@ fn an_edited_source_comes_back_changed_with_a_rewritten_map() { let (ok, answer) = restage(dir.path(), "main.by"); assert!(ok, "an edited file that checks should re-stage: {answer}"); - assert_eq!(answer["changed"].as_bool(), Some(true)); - assert!(answer["content"].as_str().unwrap().contains("return 42")); + assert_eq!(answer.get("changed").as_bool(), Some(true)); + assert!( + answer + .get("content") + .as_str() + .unwrap() + .contains("return 42") + ); - let map = answer["sourcemap"] + let map = answer + .get("sourcemap") .as_str() .expect("a transpiled file's re-stage rewrites the map"); assert!(map.contains("SOURCEMAP"), "{map}"); @@ -188,11 +228,13 @@ fn a_source_saved_without_a_trailing_newline_re_stages_a_whole_line_table() { std::fs::write(dir.path().join("main.by"), source).unwrap(); let (ok, answer) = restage(dir.path(), "main.by"); assert!(ok, "an edited file that checks should re-stage: {answer}"); - let map = answer["sourcemap"] + let map = answer + .get("sourcemap") .as_str() .expect("a transpiled file's re-stage rewrites the map") .to_owned(); - let content = answer["content"] + let content = answer + .get("content") .as_str() .expect("bytes to write") .to_owned(); @@ -237,11 +279,11 @@ fn a_hand_written_python_is_its_own_bytes_and_has_no_map_entry() { assert!(ok, "a copied python file should re-stage: {answer}"); assert_eq!( - answer["content"].as_str().unwrap(), + answer.get("content").as_str().unwrap(), "def h() -> int:\n return 3\n" ); - assert_eq!(answer["changed"].as_bool(), Some(true)); - assert!(answer["sourcemap"].is_null(), "{answer}"); + assert_eq!(answer.get("changed").as_bool(), Some(true)); + assert!(answer.get("sourcemap").is_null(), "{answer}"); } /// A file that does not check must not reach a running program: the transpiler would emit for a @@ -262,14 +304,8 @@ fn a_source_that_does_not_check_is_refused_with_the_reasons() { let (ok, answer) = restage(dir.path(), "main.by"); assert!(!ok, "a refusal exits non-zero so a script can read it"); - assert!( - answer["refused"] - .as_str() - .unwrap() - .contains("does not check"), - "{answer}" - ); - let diagnostics = answer["diagnostics"].as_array().unwrap(); + assert!(answer.refused().contains("does not check"), "{answer}"); + let diagnostics = answer.0["refusals"][0]["diagnostics"].as_array().unwrap(); assert!( !diagnostics.is_empty(), "a refusal for the checker carries what it said" @@ -289,13 +325,7 @@ fn a_directory_that_is_not_a_build_is_refused() { let (ok, answer) = restage(dir.path(), "main.by"); assert!(!ok); - assert!( - answer["refused"] - .as_str() - .unwrap() - .contains("_by_build.json"), - "{answer}" - ); + assert!(answer.refused().contains("_by_build.json"), "{answer}"); } /// The tree records which `by` wrote it because only that `by` can promise the same bytes. A tree @@ -315,8 +345,191 @@ fn a_tree_built_by_another_by_is_refused() { let (ok, answer) = restage(dir.path(), "main.by"); assert!(!ok); + assert!(answer.refused().contains("rebuild"), "{answer}"); +} + +/// A project with two `.by` modules, so one edit can touch both. +fn write_two_module_project(dir: &Path) { + write_project(dir); + std::fs::write(dir.join("other.by"), "def other() -> int:\n return 5\n").unwrap(); +} + +/// Put an answer's bytes and its map into the tree, the way a client does. +fn write_answer(dir: &Path, answer: &serde_json::Value) { + for file in answer["files"].as_array().unwrap() { + std::fs::write( + file["generated"].as_str().unwrap(), + file["content"].as_str().unwrap(), + ) + .unwrap(); + } + if let Some(map) = answer["sourcemap"].as_str() { + std::fs::write(dir.join("build/_by_sourcemap.py"), map).unwrap(); + } +} + +/// The keys of both tables of a map, in the order the map holds them. +fn map_keys(map: &str) -> Vec { + map.lines() + .filter_map(|line| line.strip_prefix(" \"")) + .map(|line| line.split('"').next().unwrap().to_owned()) + .collect() +} + +/// **Why the set is one request.** Two files edited together share one `_by_sourcemap.py`, and +/// the map that comes back has to carry both of their entries moved. Answered one file at a time, +/// each answer's map held the tree's map plus that file alone, so writing them in turn kept only +/// the last file's line table — and every other breakpoint was then re-armed against a table +/// describing code the tree no longer held. +#[test] +fn an_edit_to_two_modules_comes_back_with_one_map_describing_both() { + let dir = tempfile::tempdir().unwrap(); + write_two_module_project(dir.path()); + build(dir.path()); + let before = std::fs::read_to_string(dir.path().join("build/_by_sourcemap.py")).unwrap(); + + std::fs::write( + dir.path().join("main.by"), + "def go() -> int:\n return 42\nprint(go())\n", + ) + .unwrap(); + std::fs::write( + dir.path().join("other.by"), + "\n\ndef other() -> int:\n return 6\n", + ) + .unwrap(); + let (ok, answer) = restage_all(dir.path(), &["main.by", "other.by"]); + assert!(ok, "two edited files that check should re-stage: {answer}"); + + let files = answer["files"].as_array().unwrap(); + assert_eq!(files.len(), 2, "{answer}"); + let map = answer["sourcemap"].as_str().expect("both entries moved"); + + for file in files { + assert_eq!(file["changed"].as_bool(), Some(true), "{file}"); + let py = file["pyDigest"].as_str().unwrap(); + let by = file["byDigest"].as_str().unwrap(); + assert!( + !before.contains(py) && map.contains(py) && map.contains(by), + "the one map carries this file's new digests:\n{map}\n{file}" + ); + } + // and nothing else about the map moved: both tables hold the same keys, in the same order, + // as the map the build wrote + assert_eq!(map_keys(&before), map_keys(map)); +} + +/// Writing what came back makes the tree what the edit describes: asked again, every file is +/// already there and the map already is the one on disk. +#[test] +fn writing_a_sets_answer_leaves_nothing_left_to_restage() { + let dir = tempfile::tempdir().unwrap(); + write_two_module_project(dir.path()); + build(dir.path()); + + std::fs::write( + dir.path().join("main.by"), + "def go() -> int:\n return 42\nprint(go())\n", + ) + .unwrap(); + std::fs::write( + dir.path().join("other.by"), + "def other() -> int:\n return 6\n", + ) + .unwrap(); + let (ok, answer) = restage_all(dir.path(), &["main.by", "other.by"]); + assert!(ok, "{answer}"); + write_answer(dir.path(), &answer); + + let (ok, again) = restage_all(dir.path(), &["main.by", "other.by"]); + assert!(ok, "{again}"); + for file in again["files"].as_array().unwrap() { + assert_eq!(file["changed"].as_bool(), Some(false), "{file}"); + } + assert!(again["sourcemap"].is_null(), "{again}"); +} + +/// One file of the set that does not check refuses the set, and names that file — the other +/// file's bytes are not handed back to be written on their own. +#[test] +fn one_file_that_does_not_check_refuses_the_whole_set_by_name() { + let dir = tempfile::tempdir().unwrap(); + write_two_module_project(dir.path()); + build(dir.path()); + + std::fs::write( + dir.path().join("main.by"), + "def go() -> int:\n return 42\nprint(go())\n", + ) + .unwrap(); + std::fs::write( + dir.path().join("other.by"), + "def other() -> int:\n return \"not an int\"\n", + ) + .unwrap(); + let (ok, answer) = restage_all(dir.path(), &["main.by", "other.by"]); + + assert!(!ok, "{answer}"); + assert!(answer.get("files").is_none(), "{answer}"); + let refusals = answer["refusals"].as_array().unwrap(); + assert_eq!( + refusals.len(), + 1, + "only the file that does not check: {answer}" + ); assert!( - answer["refused"].as_str().unwrap().contains("rebuild"), + refusals[0]["file"].as_str().unwrap().ends_with("other.by"), "{answer}" ); + assert!( + !refusals[0]["diagnostics"].as_array().unwrap().is_empty(), + "{answer}" + ); +} + +/// A `.by` and a hand-written `.py` edited together: the copied file comes back as its own bytes, +/// and the map moves only for the file it describes. +#[test] +fn a_set_holding_a_copied_file_moves_the_map_only_for_the_transpiled_one() { + let dir = tempfile::tempdir().unwrap(); + write_project(dir.path()); + build(dir.path()); + + std::fs::write( + dir.path().join("main.by"), + "def go() -> int:\n return 42\nprint(go())\n", + ) + .unwrap(); + std::fs::write( + dir.path().join("helper.py"), + "def h() -> int:\n return 3\n", + ) + .unwrap(); + let (ok, answer) = restage_all(dir.path(), &["helper.py", "main.by"]); + + assert!(ok, "{answer}"); + let files = answer["files"].as_array().unwrap(); + assert!( + files[0]["source"].as_str().unwrap().ends_with("helper.py"), + "in the order asked" + ); + assert_eq!(files[0]["content"], "def h() -> int:\n return 3\n"); + assert!( + answer["sourcemap"] + .as_str() + .unwrap() + .contains(files[1]["pyDigest"].as_str().unwrap()) + ); +} + +/// The same file named twice is one slot: two answers for it would be two writes to one file. +#[test] +fn a_file_named_twice_is_answered_once() { + let dir = tempfile::tempdir().unwrap(); + write_project(dir.path()); + build(dir.path()); + + let (ok, answer) = restage_all(dir.path(), &["main.by", "./main.by"]); + assert!(ok, "{answer}"); + assert_eq!(answer["files"].as_array().unwrap().len(), 1, "{answer}"); } diff --git a/crates/ty/tests/file_watching.rs b/crates/ty/tests/file_watching.rs index 7db0ead8d5..3cf0b1e711 100644 --- a/crates/ty/tests/file_watching.rs +++ b/crates/ty/tests/file_watching.rs @@ -2040,7 +2040,29 @@ mod unix { bar_baz_text = bar_baz_text.as_str() ); - case.assert_indexed_project_files([patched_bar_baz_file]); + if cfg!(target_os = "linux") { + // Known bug: the index depends on which path notify reports. Discovery skips symlinked + // directories, so initially only `project/patched/bar/baz.py` is indexed. Resolving + // `bar.baz` creates a separate `File` for `project/bar/baz.py`, outside the index. + // + // notify uses different watcher backends across operating systems. On Linux, it follows + // the symlink and registers both directory paths. Inotify returns the same watch + // descriptor for both, and notify retains the last registered path. The recursive walk + // doesn't sort directory entries, so filesystem iteration order determines which path + // wins. That order can differ between filesystems and runs, even on the same OS. + // + // An event for the original path updates its `File` and leaves the index unchanged. + // An event for the symlinked path updates that `File` and adds it to the index, leaving + // both paths indexed but the original `File`'s revision stale. Accept either path (or + // both) until indexing agrees with discovery regardless of the reported path. + let files = case.db().project().files(case.db()); + assert!( + files.contains(patched_bar_baz_file) || files.contains(baz_file), + "Expected the project to contain the original or symlinked file" + ); + } else { + case.assert_indexed_project_files([patched_bar_baz_file]); + } Ok(()) } diff --git a/crates/ty_ide/Cargo.toml b/crates/ty_ide/Cargo.toml index 619e585be4..d09a291452 100644 --- a/crates/ty_ide/Cargo.toml +++ b/crates/ty_ide/Cargo.toml @@ -48,6 +48,7 @@ strum = { workspace = true } strum_macros = { workspace = true } toml_parser = { workspace = true } tracing = { workspace = true } +unicode-width = { workspace = true } [dev-dependencies] ruff_python_parser = { workspace = true } diff --git a/crates/ty_ide/src/alignment.rs b/crates/ty_ide/src/alignment.rs index 1a5661455f..81e6270151 100644 --- a/crates/ty_ide/src/alignment.rs +++ b/crates/ty_ide/src/alignment.rs @@ -20,6 +20,12 @@ //! draws a hint only while a key is held — so a width computed here would be wrong the moment the //! key came up. this module reports the grouping and the room the author left; the client turns //! that into pixels +//! +//! a column is counted the way a fixed-width editor lays the line out: a wide character takes two +//! columns, a combining mark none, and a tab reaches the next multiple of the tab size — which is +//! the client's setting, so the client says what it is + +use std::num::NonZeroU32; use ruff_db::PythonFile; use ruff_db::parsed::parsed_module; @@ -28,8 +34,10 @@ use ruff_python_ast::visitor::source_order::{ SourceOrderVisitor, TraversalSignal, walk_body, walk_node, }; use ruff_python_ast::{AnyNodeRef, Stmt}; +use ruff_python_trivia::tab_offset_u32; use ruff_source_file::LineRanges; use ruff_text_size::{Ranged, TextRange, TextSize}; +use unicode_width::UnicodeWidthChar; use crate::Db; use crate::inlay_hints::untyped_declaration_value; @@ -55,6 +63,19 @@ pub struct AlignmentMember { /// and since the column no longer has to be padded to be a column, it is not this module's /// either pub gap_end: TextSize, + + /// the display column [`Self::gap_start`] is at — how far along its line a fixed-width editor + /// with the tab size given to [`alignment_groups`] draws it + /// + /// reported alongside the offset because a client lays hints out in columns, and a column is + /// not something it can read back off the offset without repeating this measurement + pub gap_start_column: u32, + + /// the display column of the `=`, which every member of a group shares + /// + /// the gap is spaces only, so this less [`Self::gap_start_column`] is also its length in + /// characters + pub gap_end_column: u32, } /// assignments the author put in one column, reported together because they have to move together @@ -96,10 +117,13 @@ pub struct AlignmentGroup { /// /// a group is reported whole even when only one of its lines is in `range`: the column is a /// property of every member at once, so half a group would be sized against the wrong maximum +/// +/// `tab_size` is the number of columns between the tab stops of the editor the lines are shown in pub fn alignment_groups( db: &dyn Db, file: PythonFile<'_>, range: TextRange, + tab_size: NonZeroU32, ) -> Vec { let parsed = parsed_module(db, file).load(db); let source = source_text(db, file.file(db)); @@ -108,6 +132,7 @@ pub fn alignment_groups( let mut visitor = AlignmentVisitor { source, range, + tab_size, groups: Vec::new(), }; walk_node(&mut visitor, AnyNodeRef::from(parsed.syntax())); @@ -152,6 +177,9 @@ struct AlignmentVisitor<'a> { /// the span the caller asked about, used to skip nodes it does not reach range: TextRange, + /// the columns between tab stops, see [`display_column`] + tab_size: NonZeroU32, + groups: Vec, } @@ -204,7 +232,7 @@ impl AlignmentVisitor<'_> { let joins = match (run.first(), previous_end) { (Some(first), Some(previous_end)) => { - self.column_of(first.gap_end) == self.column_of(member.gap_end) + first.gap_end_column == member.gap_end_column && !self.blank_line_between(previous_end, stmt.start()) } _ => false, @@ -266,16 +294,23 @@ impl AlignmentVisitor<'_> { _ => return Alignment::Breaks, }; match self.equals_after(gap_start) { - Some(gap_end) => Alignment::Member(AlignmentMember { gap_start, gap_end }), + Some(gap_end) => Alignment::Member(AlignmentMember { + gap_start, + gap_end, + gap_start_column: display_column(self.source, gap_start, self.tab_size), + gap_end_column: display_column(self.source, gap_end, self.tab_size), + }), None => Alignment::Breaks, } } /// the `=` that follows `from` with nothing but spaces in between, if that is what follows /// - /// spaces only, and deliberately: a tab is not a column anyone can agree on, and a newline or a - /// `\` means the `=` is on another line, where it is aligned with nothing. each of those makes - /// the statement unalignable rather than merely unpadded + /// spaces only, and deliberately. the gap is room a hint spends column for column, and a tab + /// is not that: how far it reaches depends on where it starts, so a hint drawn ahead of it + /// changes how much room it leaves. a newline or a `\` means the `=` is on another line, where + /// it is aligned with nothing. each of those makes the statement unalignable rather than merely + /// unpadded fn equals_after(&self, from: TextSize) -> Option { let rest = self.source.get(from.to_usize()..)?; let spaces = rest.len() - rest.trim_start_matches(' ').len(); @@ -285,25 +320,6 @@ impl AlignmentVisitor<'_> { Some(from + TextSize::try_from(spaces).ok()?) } - /// how far into its line an offset is, in characters - /// - /// characters rather than bytes, because bytes do not answer the question being asked. `é = 1` - /// and `ab = 1` spend the same number of bytes reaching their `=` and put it in different - /// columns, so counting bytes would call those two lines aligned — and would miss two that - /// really are - /// - /// characters rather than rendered width, because width is the client's question — an editor - /// draws its own glyphs, and in a proportional font even two ASCII letters are not the same - /// width. all that is decided here is whether the author put two `=` in the same place - fn column_of(&self, offset: TextSize) -> usize { - let line_start = self.source.line_start(offset); - self.source - .get(line_start.to_usize()..offset.to_usize()) - .unwrap_or_default() - .chars() - .count() - } - /// whether the author left an empty line between two statements /// /// the first newline is the one that ends the earlier statement. any *complete* line after it @@ -327,6 +343,30 @@ impl AlignmentVisitor<'_> { } } +/// how far along its line a fixed-width editor draws `offset` +/// +/// neither bytes nor characters answer that. `é = 1` and `ab = 1` spend the same number of bytes +/// reaching their `=` and put it in different columns; `名前 = 1` and `abcd = 1` spend different +/// numbers of characters and put it in the same one. so each character counts for its unicode +/// width — two for a wide character, none for a combining mark — and a tab advances to the next +/// multiple of `tab_size`, the same measure `ruff_linter`'s `LineWidthBuilder` gives a line +/// +/// still columns rather than pixels: in a proportional font even two ASCII letters differ, and +/// that is the client's to draw. what is decided here is whether the author put two `=` in the +/// same place on a fixed grid +fn display_column(source: &str, offset: TextSize, tab_size: NonZeroU32) -> u32 { + let line_start = source.line_start(offset); + source + .get(line_start.to_usize()..offset.to_usize()) + .unwrap_or_default() + .chars() + .fold(0, |column, character| match character { + '\t' => column + tab_offset_u32(column, tab_size.get()), + #[expect(clippy::cast_possible_truncation)] + character => column + character.width().unwrap_or(0) as u32, + }) +} + #[cfg(test)] mod tests { use insta::assert_snapshot; @@ -341,20 +381,35 @@ mod tests { /// rendered rather than asserted as offsets because what matters about this analysis is /// which lines ended up together and how much room each has, and a list of byte offsets /// hides both + /// + /// with tab stops every four columns fn alignment_groups(&self) -> String { + self.alignment_groups_with_tab_size(4) + } + + /// the same, with tab stops every `tab_size` columns + fn alignment_groups_with_tab_size(&self, tab_size: u32) -> String { let source = self.cursor.source.as_str(); - self.alignment_groups_in(TextRange::new(TextSize::new(0), TextSize::of(source))) + self.alignment_groups_in( + TextRange::new(TextSize::new(0), TextSize::of(source)), + tab_size, + ) } /// the same, for a caller asking about only part of the file - fn alignment_groups_in(&self, range: TextRange) -> String { + /// + /// each line is drawn with its tabs expanded, and the gap under it at the columns the + /// analysis reported, so a column it got wrong shows up as a gap drawn in the wrong place + fn alignment_groups_in(&self, range: TextRange, tab_size: u32) -> String { use std::fmt::Write; let source = self.cursor.source.as_str(); + let tab_size = NonZeroU32::new(tab_size).unwrap(); let groups = alignment_groups( &self.db, self.program_file(self.cursor.file).python_file(&self.db), range, + tab_size, ); if groups.is_empty() { return "no groups".to_string(); @@ -370,9 +425,23 @@ mod tests { .next() .unwrap_or_default() .trim_end_matches('\r'); - let lead = (member.gap_start - start).to_usize(); - let gap = (member.gap_end - member.gap_start).to_usize(); - writeln!(out, " {line}").unwrap(); + // the same walk `display_column` makes, character by character: an oracle + // that measured the line another way could agree with a wrong answer + let mut expanded = String::new(); + let mut width = 0u32; + for character in line.chars() { + if character == '\t' { + let stop = tab_offset_u32(width, tab_size.get()); + expanded.extend(std::iter::repeat_n(' ', stop as usize)); + width += stop; + } else { + expanded.push(character); + width += u32::try_from(character.width().unwrap_or(0)).unwrap(); + } + } + let lead = member.gap_start_column as usize; + let gap = (member.gap_end_column - member.gap_start_column) as usize; + writeln!(out, " {expanded}").unwrap(); writeln!( out, " {}{} gap {gap}", @@ -698,7 +767,7 @@ basdf = 1 "); } - /// a column is where a reader sees the `=`, so it is counted in characters. these two spend the + /// a column is where a reader sees the `=`, so it is not counted in bytes. these two spend the /// same number of bytes reaching their `=` and put it in different columns #[test] fn a_column_is_not_a_byte_count() { @@ -724,12 +793,94 @@ abcde = 2 assert_snapshot!(test.alignment_groups(), @r" group 1 é = 1 - ----- gap 5 + ----- gap 5 abcde = 2 - gap 1 "); } + /// a wide character takes two columns of the line, so these two put their `=` in one column + /// while spending different numbers of characters to get there + #[test] + fn a_wide_character_takes_two_columns() { + let test = cursor_test( + "\ +名前 = 1 +abcd = 2 +", + ); + assert_snapshot!(test.alignment_groups(), @r" + group 1 + 名前 = 1 + - gap 1 + abcd = 2 + - gap 1 + "); + } + + /// and these spend the same number of characters and put their `=` in different columns + #[test] + fn a_column_is_not_a_character_count() { + let test = cursor_test( + "\ +名前 = 1 +abcd = 2 +", + ); + assert_snapshot!(test.alignment_groups(), @"no groups"); + } + + /// a tab before the gap reaches the next tab stop, so where the `=` lands depends on it + #[test] + fn a_tab_in_the_target_reaches_the_next_tab_stop() { + let test = cursor_test( + "\ +x:\tint = 1 +abcdefg = 2 +", + ); + assert_snapshot!(test.alignment_groups(), @r" + group 1 + x: int = 1 + - gap 1 + abcdefg = 2 + - gap 1 + "); + } + + /// and the tab stop is the editor's, so the same lines with stops every eight columns put the + /// first `=` four columns further out + #[test] + fn the_tab_stop_is_the_editors() { + let test = cursor_test( + "\ +x:\tint = 1 +abcdefg = 2 +", + ); + assert_snapshot!(test.alignment_groups_with_tab_size(8), @"no groups"); + } + + /// indentation is measured with the rest of the line, so a suite indented with tabs lines up + /// the same as one indented with spaces + #[test] + fn a_suite_indented_with_tabs() { + let test = cursor_test( + "\ +def f(): +\ta = 1 +\tbasdf = 2 +", + ); + assert_snapshot!(test.alignment_groups(), @r" + group 1 + a = 1 + ----- gap 5 + basdf = 2 + - gap 1 + "); + } + /// a declaration with no value writes nothing in the column, so the block reads through it #[test] fn a_declaration_without_a_value_does_not_end_the_block() { @@ -790,7 +941,8 @@ dddddd = 3 assert_snapshot!(test.alignment_groups(), @"no groups"); } - /// a tab is not a column anyone can agree on + /// a tab in the gap reaches further or less far depending on where the hint ahead of it ends, so + /// it is not room a hint can spend #[test] fn a_tab_before_the_equals_ends_the_block() { let test = cursor_test( @@ -825,7 +977,7 @@ a = 1 basdf = 1 ", ); - assert_snapshot!(test.alignment_groups_in(test.line(1)), @r" + assert_snapshot!(test.alignment_groups_in(test.line(1), 4), @r" group 1 a = 1 ----- gap 5 @@ -845,7 +997,7 @@ def f(): basdf = 1 ", ); - assert_snapshot!(test.alignment_groups_in(test.line(1)), @r" + assert_snapshot!(test.alignment_groups_in(test.line(1), 4), @r" group 1 a = 1 ----- gap 5 @@ -866,7 +1018,7 @@ cc = 2 dddde = 3 ", ); - assert_snapshot!(test.alignment_groups_in(test.line(3)), @r" + assert_snapshot!(test.alignment_groups_in(test.line(3), 4), @r" group 1 cc = 2 ---- gap 4 diff --git a/crates/ty_ide/src/doc_highlights.rs b/crates/ty_ide/src/doc_highlights.rs index 5f3116ecc4..1db6b55d59 100644 --- a/crates/ty_ide/src/doc_highlights.rs +++ b/crates/ty_ide/src/doc_highlights.rs @@ -1,17 +1,32 @@ use crate::goto::find_goto_target; use crate::references::{ReferencesMode, references}; -use crate::{Db, ReferenceTarget}; +use crate::syntax_outline::keyword_family; +use crate::{Db, ReferenceKind, ReferenceTarget}; use ruff_text_size::TextSize; use ty_python_core::ProgramFile; use ty_python_semantic::SemanticModel; /// Find all document highlights for a symbol at the given position. /// Document highlights are limited to the current file only. +/// +/// On a keyword, the highlights are the keywords that belong with it — see `keyword_family`. pub fn document_highlights( db: &dyn Db, file: ProgramFile<'_>, offset: TextSize, ) -> Option> { + // A keyword is not a symbol, but it has occurrences that belong together — the `elif`s and + // `else` of an `if`, the `return`s of a `def` — and those are what an editor lights up for it. + if let Some(family) = keyword_family(db, file.python_file(db), offset) { + let target_file = file.file(db); + return Some( + family + .into_iter() + .map(|range| ReferenceTarget::new(target_file, range, ReferenceKind::Other)) + .collect(), + ); + } + let parsed = ruff_db::parsed::parsed_module(db, file.python_file(db)); let module = parsed.load(db); let model = SemanticModel::new(db, file); diff --git a/crates/ty_ide/src/inlay_hints.rs b/crates/ty_ide/src/inlay_hints.rs index ad42d65f7b..8693f69e83 100644 --- a/crates/ty_ide/src/inlay_hints.rs +++ b/crates/ty_ide/src/inlay_hints.rs @@ -32,7 +32,7 @@ use ty_python_semantic::types::ide_support::{ is_composable_function, is_reveal_type_function, is_union_special_form, numeric_promotion, parameter_stability, trailing_lambda_implicit_parameters, type_parameter_names, }; -use ty_python_semantic::types::{DisplaySettings, Type, TypeDetail}; +use ty_python_semantic::types::{DisplaySettings, Type, TypeDetail, TypeDisplayDetails}; use ty_python_semantic::{HasType, SemanticModel, with_display_for_file}; #[derive(Debug, Clone)] @@ -58,151 +58,33 @@ impl InlayHint { expr: &Expr, rhs: &Expr, ty: Type<'db>, - mut allow_edits: bool, + allow_edits: bool, named_type_arguments: bool, ) -> Option { - let InlayHintImportContext { - db, - file, - importer, - dynamic_imports, - } = context; - let position = expr.range().end(); - let env = ProgramEnvironment::from_file(file); - // Render the type to a string, and get subspans for all the types that make it up - let settings = DisplaySettings::from_possibly_ambiguous_types(db, &env, [ty]); - let settings = if named_type_arguments { - settings.with_named_type_arguments() - } else { - settings - }; - let details = ty.display_with(db, &env, settings).to_string_parts(); + let details = type_display_details(context.db, context.file, ty, named_type_arguments); // Filter out repetitive hints like `x: T = T()` if call_matches_name(rhs, &details.label) { return None; } - let mut dynamic_importer = DynamicImporter::new(importer, expr, dynamic_imports); - - // Ok so the idea here is that we potentially have a random soup of spans here, - // and each byte of the string can have at most one target associate with it. - // Thankfully, they were generally pushed in print order, with the inner smaller types - // appearing before the outer bigger ones. - // - // So we record where we are in the string, and every time we find a type, we - // check if it's further along in the string. If it is, great, we give it the - // span for its range, and then advance where we are. - let mut offset = 0; - - // This edit label could be different from the original label if we need to - // qualify certain imported symbols. `A` could turn into `foo.A`. - let mut edit_label = details.label.clone(); - let mut edit_offset: isize = 0; - - let mut label_parts = vec![": ".into()]; - for (target, detail) in details.targets.iter().zip(&details.details) { - match detail { - TypeDetail::Type(ty) => { - let start = target.start().to_usize(); - let end = target.end().to_usize(); - // If we skipped over some bytes, push them with no target - if start > offset { - label_parts.push(details.label[offset..start].into()); - } - - // Possibly import the current type and return the qualified name - let mut qualified_name = |dynamic_importer: &mut DynamicImporter<'_, 'db>| { - let type_definition = ty.definition(db, &env)?; - let definition = type_definition.definition()?; - - // Only module-level names can be imported with `from import `. - // If the definition lives in a class or function body we can't produce a safe edit. - if !definition.file_scope(db).is_global() { - allow_edits = false; - return None; - } - - // Don't try to import symbols in scope - let definition_file = definition.file(db); - if definition_file == file.file(db) { - return None; - } - - let definition_name = definition.name(db); - - // Fallback to the label if we cannot find the name - let definition_name = definition_name - .as_deref() - .unwrap_or(&details.label[start..end]); - - let file = definition.program_file(db); - let module = file_to_module(db, file.resolver_file(db))?; - - if should_skip_import(db, module, *ty) { - return None; - } - - let module_name = module.name(db).as_str(); - - dynamic_importer.import_symbol( - db, - &env, - ty, - module_name, - definition_name, - &details.label[start..end], - ) - }; - - // Ok, this is the first type that claimed these bytes, give it the target - if start >= offset { - // Try to import the symbol and update the edit label if required - if let Some(qualified_name) = qualified_name(&mut dynamic_importer) { - let edit_start = (start.cast_signed() + edit_offset).cast_unsigned(); - let edit_end = (end.cast_signed() + edit_offset).cast_unsigned(); - - edit_label.replace_range(edit_start..edit_end, &qualified_name); - edit_offset += - qualified_name.len().cast_signed() - (end - start).cast_signed(); - } - - let target = ty.navigation_targets(db, &env).into_iter().next(); - - // Always use original text for the label part - label_parts.push( - InlayHintLabelPart::new(&details.label[start..end]).with_target(target), - ); - offset = end; - } - } - TypeDetail::SignatureStart - | TypeDetail::SignatureEnd - | TypeDetail::Parameter(_) => { - // Don't care about these - } - } - } - - // "flush" the rest of the label without any target - if offset < details.label.len() { - label_parts.push(details.label[offset..details.label.len()].into()); - } + let spelled = spell_type(context, expr.into(), expr.range().start(), &details); - let text_edits = if details.is_valid_syntax && allow_edits { + let text_edits = if spelled.editable && allow_edits { let mut text_edits = vec![InlayHintTextEdit { range: TextRange::new(position, position), - new_text: format!(": {edit_label}"), + new_text: format!(": {}", spelled.edit_label), }]; - - text_edits.extend(dynamic_importer.text_edits()); - + text_edits.extend(spelled.import_edits); text_edits } else { vec![] }; + let mut label_parts = vec![": ".into()]; + label_parts.extend(spelled.label_parts); + Some(Self { position, kind: InlayHintKind::Type, @@ -1175,6 +1057,209 @@ impl Default for InlayHintSettings { } } +/// `ty` rendered to a string, with the spans of the types that make it up. +fn type_display_details<'db>( + db: &'db dyn Db, + file: ProgramFile<'db>, + ty: Type<'db>, + named_type_arguments: bool, +) -> TypeDisplayDetails<'db> { + let env = ProgramEnvironment::from_file(file); + let settings = DisplaySettings::from_possibly_ambiguous_types(db, &env, [ty]); + let settings = if named_type_arguments { + settings.with_named_type_arguments() + } else { + settings + }; + // basedpython: a symbolic operation such as a repeated tuple, `(1, "a") * int`, has no + // python spelling, so a hint in a python file shows the type it reduces to — which that + // file can also hold as an annotation + let settings = if file.file(db).source_type(db).is_basedpython() { + settings + } else { + settings.with_reduced_symbolic_operations() + }; + ty.display_with(db, &env, settings).to_string_parts() +} + +/// A type as a hint shows it and as an annotation would write it. +struct SpelledType { + /// The rendering, each type in it linked to its definition. + label_parts: Vec, + /// The annotation to write, which qualifies a name where importing it + /// would clash with one in scope. + edit_label: String, + /// The imports the annotation needs. + import_edits: Vec, + /// Whether the annotation can be written at all: it is valid syntax, and + /// every type it names can be reached from the file. + editable: bool, +} + +/// Spell `details` for the scope around `scope_node`, importing what it names. +fn spell_type<'db>( + context: InlayHintImportContext<'_, 'db>, + scope_node: AnyNodeRef<'_>, + scope_offset: TextSize, + details: &TypeDisplayDetails<'db>, +) -> SpelledType { + let InlayHintImportContext { + db, + file, + importer, + dynamic_imports, + } = context; + let env = ProgramEnvironment::from_file(file); + let mut editable = details.is_valid_syntax; + + let mut dynamic_importer = + DynamicImporter::new(importer, scope_node, scope_offset, dynamic_imports); + + // Ok so the idea here is that we potentially have a random soup of spans here, + // and each byte of the string can have at most one target associate with it. + // Thankfully, they were generally pushed in print order, with the inner smaller types + // appearing before the outer bigger ones. + // + // So we record where we are in the string, and every time we find a type, we + // check if it's further along in the string. If it is, great, we give it the + // span for its range, and then advance where we are. + let mut offset = 0; + + // This edit label could be different from the original label if we need to + // qualify certain imported symbols. `A` could turn into `foo.A`. + let mut edit_label = details.label.clone(); + let mut edit_offset: isize = 0; + + let mut label_parts = Vec::new(); + for (target, detail) in details.targets.iter().zip(&details.details) { + match detail { + TypeDetail::Type(ty) => { + let start = target.start().to_usize(); + let end = target.end().to_usize(); + // If we skipped over some bytes, push them with no target + if start > offset { + label_parts.push(details.label[offset..start].into()); + } + + // Possibly import the current type and return the qualified name + let mut qualified_name = |dynamic_importer: &mut DynamicImporter<'_, 'db>| { + let type_definition = ty.definition(db, &env)?; + let definition = type_definition.definition()?; + + // Only module-level names can be imported with `from import `. + // If the definition lives in a class or function body we can't produce a safe edit. + if !definition.file_scope(db).is_global() { + editable = false; + return None; + } + + // Don't try to import symbols in scope + let definition_file = definition.file(db); + if definition_file == file.file(db) { + return None; + } + + let definition_name = definition.name(db); + + // Fallback to the label if we cannot find the name + let definition_name = definition_name + .as_deref() + .unwrap_or(&details.label[start..end]); + + let file = definition.program_file(db); + let module = file_to_module(db, file.resolver_file(db))?; + + if should_skip_import(db, module, *ty) { + return None; + } + + let module_name = module.name(db).as_str(); + + dynamic_importer.import_symbol( + db, + &env, + ty, + module_name, + definition_name, + &details.label[start..end], + ) + }; + + // Ok, this is the first type that claimed these bytes, give it the target + if start >= offset { + // Try to import the symbol and update the edit label if required + if let Some(qualified_name) = qualified_name(&mut dynamic_importer) { + let edit_start = (start.cast_signed() + edit_offset).cast_unsigned(); + let edit_end = (end.cast_signed() + edit_offset).cast_unsigned(); + + edit_label.replace_range(edit_start..edit_end, &qualified_name); + edit_offset += + qualified_name.len().cast_signed() - (end - start).cast_signed(); + } + + let target = ty.navigation_targets(db, &env).into_iter().next(); + + // Always use original text for the label part + label_parts.push( + InlayHintLabelPart::new(&details.label[start..end]).with_target(target), + ); + offset = end; + } + } + TypeDetail::SignatureStart | TypeDetail::SignatureEnd | TypeDetail::Parameter(_) => { + // Don't care about these + } + } + } + + // "flush" the rest of the label without any target + if offset < details.label.len() { + label_parts.push(details.label[offset..details.label.len()].into()); + } + + SpelledType { + label_parts, + edit_label, + import_edits: dynamic_importer.text_edits(), + editable, + } +} + +/// `ty` written as an annotation in `file`, for a position in the scope around +/// `scope_node`, with the imports it needs; `None` when no annotation the file +/// could hold says it. +pub(crate) fn annotation_for_type<'db>( + db: &'db dyn Db, + file: ProgramFile<'db>, + scope_node: AnyNodeRef<'_>, + scope_offset: TextSize, + ty: Type<'db>, +) -> Option<(String, Vec)> { + let ast = parsed_module(db, file.python_file(db)).load(db); + let source = source_text(db, file.file(db)); + let stylist = Stylist::from_tokens(ast.tokens(), source.as_str()); + let importer = Importer::new(db, &stylist, file, source.as_str(), &ast); + let mut dynamic_imports = FxHashMap::default(); + // a basedpython file writes types in basedpython's own spelling + with_display_for_file(db, file.file(db), || { + let details = type_display_details(db, file, ty, false); + let spelled = spell_type( + InlayHintImportContext { + db, + file, + importer: &importer, + dynamic_imports: &mut dynamic_imports, + }, + scope_node, + scope_offset, + &details, + ); + spelled + .editable + .then_some((spelled.edit_label, spelled.import_edits)) + }) +} + struct InlayHintImportContext<'a, 'db> { db: &'db dyn Db, file: ProgramFile<'db>, @@ -2518,13 +2603,14 @@ struct DynamicImporter<'a, 'db> { impl<'a, 'db> DynamicImporter<'a, 'db> { fn new( importer: &'a Importer<'db>, - expr: &'a Expr, + scope_node: AnyNodeRef<'a>, + scope_offset: TextSize, dynamic_imports: &'a mut FxHashMap, ) -> Self { Self { importer, - scope_node: expr.into(), - scope_offset: expr.range().start(), + scope_node, + scope_offset, members: None, dynamic_imports, imported_members: Vec::new(), @@ -3594,6 +3680,150 @@ Source with applied edits: "); } + /// python has no spelling for a repeated tuple, so a hint in a python file shows the type it + /// reduces to, which that file can hold as an annotation + #[test] + fn test_repeated_tuple_hint_is_reduced_in_python() { + let mut test = inlay_hint_test( + " + def f(n: int): + pairs = (1, 'a') * n + ", + ); + + assert_snapshot!(test.inlay_hints(), @r#" + + def f(n: int): + pairs[: tuple[Literal[1, "a"], ...]] = (1, 'a') * n + + --------------------------------------------- + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class tuple[out Element](Sequence[Element]): + | ^^^^^ + info: Source + --> main2.py:LL:13 + | + LL | pairs[: tuple[Literal[1, "a"], ...]] = (1, 'a') * n + | ^^^^^ + + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/typing.byi:LL:1 + | + LL | Literal: _SpecialForm + | ^^^^^^^ + info: Source + --> main2.py:LL:19 + | + LL | pairs[: tuple[Literal[1, "a"], ...]] = (1, 'a') * n + | ^^^^^^^ + + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class int: + | ^^^ + info: Source + --> main2.py:LL:27 + | + LL | pairs[: tuple[Literal[1, "a"], ...]] = (1, 'a') * n + | ^ + + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class str(Sequence[str]): + | ^^^ + info: Source + --> main2.py:LL:30 + | + LL | pairs[: tuple[Literal[1, "a"], ...]] = (1, 'a') * n + | ^^^ + + --------------------------------------------- + info[inlay-hint-edit]: Inlay hint edits + --> main.py:1:1 + | + 1 + from typing import Literal + 2 | + 3 | def f(n: int): + - pairs = (1, 'a') * n + 4 + pairs: tuple[Literal[1, "a"], ...] = (1, 'a') * n + | + "#); + } + + #[test] + fn test_repeated_tuple_hint_is_insertable_in_basedpython() { + let mut test = basedpython_inlay_hint_test( + " + def f(n: int): + pairs = (1, 'a') * n + ", + ); + + assert_snapshot!(test.inlay_hints(), @r#" + + def f(n: int): + pairs[: (1, "a") * int] = (1, 'a') * n + + --------------------------------------------- + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class tuple[out Element](Sequence[Element]): + | ^^^^^ + info: Source + --> main2.py:LL:13 + | + LL | pairs[: (1, "a") * int] = (1, 'a') * n + | ^ + + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class int: + | ^^^ + info: Source + --> main2.py:LL:14 + | + LL | pairs[: (1, "a") * int] = (1, 'a') * n + | ^ + + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class str(Sequence[str]): + | ^^^ + info: Source + --> main2.py:LL:17 + | + LL | pairs[: (1, "a") * int] = (1, 'a') * n + | ^^^ + + info[inlay-hint-location]: Inlay Hint Target + --> stdlib/builtins.byi:LL:7 + | + LL | class int: + | ^^^ + info: Source + --> main2.py:LL:24 + | + LL | pairs[: (1, "a") * int] = (1, 'a') * n + | ^^^ + + --------------------------------------------- + info[inlay-hint-edit]: Inlay hint edits + --> main.by:1:1 + | + 2 | def f(n: int): + - pairs = (1, 'a') * n + 3 + pairs: (1, "a") * int = (1, 'a') * n + | + "#); + } + #[test] fn test_leading_underscore_variable_assignment_has_no_type_inlay_hint() { let mut test = inlay_hint_test( diff --git a/crates/ty_ide/src/lib.rs b/crates/ty_ide/src/lib.rs index 624c6abd12..27b2adc4be 100644 --- a/crates/ty_ide/src/lib.rs +++ b/crates/ty_ide/src/lib.rs @@ -28,6 +28,7 @@ mod injection; mod inlay_hints; mod markup; mod module_rename; +mod refactor; mod references; mod rename; mod selection_range; @@ -35,6 +36,7 @@ mod semantic_tokens; mod signature_help; mod stub_mapping; mod symbols; +mod syntax_outline; mod type_hierarchy; mod workspace_symbols; @@ -76,6 +78,7 @@ pub use markup::MarkupKind; pub use module_rename::{ FileMove, ModuleRenameEdits, SkipReason, SkippedImport, module_rename_edits, }; +pub use refactor::{Refactor, RefactorKind, RefactorOffer, refactor, refactors}; pub use references::ReferencesMode; pub use rename::{can_rename, rename}; pub use selection_range::selection_range; @@ -85,6 +88,10 @@ pub use semantic_tokens::{ }; pub use signature_help::{ParameterDetails, SignatureDetails, SignatureHelpInfo, signature_help}; pub use symbols::{FlatSymbols, HierarchicalSymbols, SymbolId, SymbolInfo, SymbolKind}; +pub use syntax_outline::{ + OutlineCall, OutlineClause, OutlineModifier, OutlineStatement, OutlineString, SyntaxOutline, + syntax_outline, +}; pub use type_hierarchy::{ TypeHierarchyItem, prepare_type_hierarchy, type_hierarchy_subtypes, type_hierarchy_supertypes, }; diff --git a/crates/ty_ide/src/refactor.rs b/crates/ty_ide/src/refactor.rs new file mode 100644 index 0000000000..03090e621c --- /dev/null +++ b/crates/ty_ide/src/refactor.rs @@ -0,0 +1,378 @@ +//! Refactorings offered as code actions: rewrites the user asks for at a +//! position or selection, as opposed to the quick fixes a diagnostic carries. +//! +//! Every refactoring answers from the syntax tree and the semantic index rather +//! than from the text, and refuses with a reason whenever it cannot show that +//! the rewrite leaves the program meaning what it meant. A refusal is part of +//! the answer: a client that asked for a refactoring explicitly shows why it is +//! unavailable. +//! +//! Each of them answers both questions at once — whether it applies here, and +//! what it would rewrite — because the second *is* the first: a refactoring +//! applies exactly when a rewrite that preserves meaning can be spelled, and +//! there is no cheaper test that does not amount to a second implementation of +//! the same reasoning, which could then disagree with it. So [`refactors`] +//! hands its edits back rather than throwing them away, and the caller tells it +//! which refactorings to consider rather than being given all of them. + +mod data_class; +mod evaluation; +mod extract_function; +mod extract_variable; +mod flow; +mod hazards; +mod inline_variable; +mod names; +mod return_annotation; +mod text; + +use ruff_db::files::File; +use ruff_db::parsed::{ParsedModuleRef, parsed_module}; +use ruff_db::source::{SourceText, source_text}; +use ruff_diagnostics::Edit; +use ruff_python_codegen::Stylist; +use ruff_text_size::TextRange; +use ty_project::Db; +use ty_python_core::ProgramFile; +use ty_python_semantic::SemanticModel; + +use crate::FileEdit; + +/// The refactorings the server knows how to perform. +#[derive(Debug, Clone, Copy, PartialEq, Eq, Hash)] +pub enum RefactorKind { + InlineVariable, + ExtractVariable, + IntroduceConstant, + ExtractFunction, + AddReturnAnnotation, + ConvertToDataClass, + ConvertFromDataClass, +} + +impl RefactorKind { + pub const ALL: &'static [RefactorKind] = &[ + RefactorKind::InlineVariable, + RefactorKind::ExtractVariable, + RefactorKind::IntroduceConstant, + RefactorKind::ExtractFunction, + RefactorKind::AddReturnAnnotation, + RefactorKind::ConvertToDataClass, + RefactorKind::ConvertFromDataClass, + ]; + + /// The LSP code action kind the refactoring is offered as. + pub const fn code_action_kind(self) -> &'static str { + match self { + RefactorKind::InlineVariable => "refactor.inline.variable", + RefactorKind::ExtractVariable => "refactor.extract.variable", + RefactorKind::IntroduceConstant => "refactor.extract.constant", + RefactorKind::ExtractFunction => "refactor.extract.function", + RefactorKind::AddReturnAnnotation => "refactor.rewrite.returnAnnotation", + RefactorKind::ConvertToDataClass => "refactor.rewrite.toDataClass", + RefactorKind::ConvertFromDataClass => "refactor.rewrite.fromDataClass", + } + } + + /// A stable name for the refactoring, which round-trips through a code + /// action's `data` so the edits can be computed when the action is resolved. + pub const fn id(self) -> &'static str { + match self { + RefactorKind::InlineVariable => "inline-variable", + RefactorKind::ExtractVariable => "extract-variable", + RefactorKind::IntroduceConstant => "introduce-constant", + RefactorKind::ExtractFunction => "extract-function", + RefactorKind::AddReturnAnnotation => "add-return-annotation", + RefactorKind::ConvertToDataClass => "convert-to-data-class", + RefactorKind::ConvertFromDataClass => "convert-from-data-class", + } + } + + pub fn from_id(id: &str) -> Option { + Self::ALL.iter().copied().find(|kind| kind.id() == id) + } +} + +/// A refactoring available at a range, or the reason it is not. +#[derive(Debug, Clone)] +pub struct RefactorOffer { + pub kind: RefactorKind, + pub title: String, + /// `Ok` holds the rewrite and `Err` why there is none. + /// + /// The edits come with the offer because working them out is how the question was answered: + /// a refactoring applies exactly when its rewrite can be spelled, so there is no cheaper + /// test to run first. A caller that only needs to know *whether* to offer it may drop them. + pub availability: Result, String>, +} + +/// A refactoring worked out in full. +pub struct Refactor { + pub kind: RefactorKind, + pub title: String, + pub edits: Vec, +} + +/// Why a refactoring does not apply: either it is not about what is at the +/// range at all, or it is but would change what the program means. +pub(crate) enum Refusal { + /// Nothing at the range is the kind of thing the refactoring rewrites. + NotApplicable, + /// The refactoring is about what is at the range, but cannot be applied. + Refused { title: String, reason: String }, +} + +impl Refusal { + fn refused(title: impl Into, reason: impl Into) -> Self { + Refusal::Refused { + title: title.into(), + reason: reason.into(), + } + } +} + +/// A planned rewrite of one file. +pub(crate) struct Plan { + title: String, + edits: Vec, +} + +/// Everything a refactoring reads about the file it rewrites. +pub(crate) struct RefactorContext<'db> { + db: &'db dyn Db, + file: ProgramFile<'db>, + model: SemanticModel<'db>, + parsed: ParsedModuleRef, + source: SourceText, + stylist: Stylist<'static>, +} + +impl<'db> RefactorContext<'db> { + fn new(db: &'db dyn Db, file: ProgramFile<'db>) -> Self { + let parsed = parsed_module(db, file.python_file(db)).load(db); + let source = source_text(db, file.file(db)); + let stylist = Stylist::from_tokens(parsed.tokens(), source.as_str()).into_owned(); + Self { + db, + file, + model: SemanticModel::new(db, file), + parsed, + source, + stylist, + } + } + + fn source(&self) -> &str { + self.source.as_str() + } + + fn file(&self) -> File { + self.file.file(self.db) + } + + fn is_basedpython(&self) -> bool { + self.file().source_type(self.db).is_basedpython() + } + + /// A plan's edits, each carrying the file it applies to. + fn file_edits(&self, edits: Vec) -> Vec { + let file = self.file(); + edits + .into_iter() + .map(|edit| FileEdit { file, edit }) + .collect() + } + + fn plan(&self, kind: RefactorKind, range: TextRange) -> Result { + match kind { + RefactorKind::InlineVariable => inline_variable::plan(self, range), + RefactorKind::ExtractVariable => { + extract_variable::plan(self, range, extract_variable::Target::Variable) + } + RefactorKind::IntroduceConstant => { + extract_variable::plan(self, range, extract_variable::Target::Constant) + } + RefactorKind::ExtractFunction => extract_function::plan(self, range), + RefactorKind::AddReturnAnnotation => return_annotation::plan(self, range), + RefactorKind::ConvertToDataClass => { + data_class::plan(self, range, data_class::Direction::ToDataClass) + } + RefactorKind::ConvertFromDataClass => { + data_class::plan(self, range, data_class::Direction::FromDataClass) + } + } + } +} + +/// Those of `kinds` that are about what is at `range` in `file`, each with its rewrite or the +/// reason there is none. +/// +/// `kinds` is asked for rather than assumed because answering for one costs working its rewrite +/// out, so a caller that will not offer a refactoring should not name it — a client narrowing a +/// `textDocument/codeAction` with `only` then pays for nothing it asked no question about. +pub fn refactors( + db: &dyn Db, + file: ProgramFile<'_>, + range: TextRange, + kinds: &[RefactorKind], +) -> Vec { + if kinds.is_empty() || !is_refactorable(db, file) { + return Vec::new(); + } + let context = RefactorContext::new(db, file); + if context.parsed.has_invalid_syntax() { + return Vec::new(); + } + + kinds + .iter() + .copied() + .filter_map(|kind| match context.plan(kind, range) { + Ok(plan) => Some(RefactorOffer { + kind, + title: plan.title, + availability: Ok(context.file_edits(plan.edits)), + }), + Err(Refusal::NotApplicable) => None, + Err(Refusal::Refused { title, reason }) => Some(RefactorOffer { + kind, + title, + availability: Err(reason), + }), + }) + .collect() +} + +/// The edits of the refactoring `kind` at `range`, or why it cannot be applied. +pub fn refactor( + db: &dyn Db, + file: ProgramFile<'_>, + kind: RefactorKind, + range: TextRange, +) -> Result { + const NOT_HERE: &str = "the refactoring does not apply here"; + if !is_refactorable(db, file) { + return Err(NOT_HERE.to_string()); + } + let context = RefactorContext::new(db, file); + if context.parsed.has_invalid_syntax() { + return Err("the file has syntax errors".to_string()); + } + match context.plan(kind, range) { + Ok(plan) => Ok(Refactor { + kind, + title: plan.title, + edits: context.file_edits(plan.edits), + }), + Err(Refusal::NotApplicable) => Err(NOT_HERE.to_string()), + Err(Refusal::Refused { reason, .. }) => Err(reason), + } +} + +/// Only python and basedpython source is rewritten: a notebook's cells and a +/// stub's declarations are not code these refactorings reason about. +fn is_refactorable(db: &dyn Db, file: ProgramFile<'_>) -> bool { + file.file(db).source_type(db).is_py_file() +} + +#[cfg(test)] +pub(crate) mod test_support { + use ruff_db::files::{File, system_path_to_file}; + use ruff_db::system::{DbWithWritableSystem, SystemPathBuf}; + use ruff_python_trivia::textwrap::dedent; + use ruff_text_size::{Ranged, TextRange, TextSize}; + use ty_project::{ProjectMetadata, SemanticDb as _}; + + use super::{RefactorKind, refactor, refactors}; + + /// A file with a ``, or a ``…`` selection, to refactor. + pub(crate) struct RefactorTest { + db: ty_project::TestDb, + file: File, + range: TextRange, + } + + impl RefactorTest { + pub(crate) fn python(source: &str) -> Self { + Self::with_files("main.py", source, &[]) + } + + pub(crate) fn basedpython(source: &str) -> Self { + Self::with_files("main.by", source, &[]) + } + + pub(crate) fn with_files(path: &str, source: &str, others: &[(&str, &str)]) -> Self { + let mut db = + ty_project::TestDb::new(ProjectMetadata::new("test", SystemPathBuf::from("/"))); + let mut text = dedent(source).into_owned(); + let range = if let Some(cursor) = text.find("") { + text.replace_range(cursor..cursor + "".len(), ""); + TextRange::empty(TextSize::try_from(cursor).unwrap()) + } else { + let start = text + .find("") + .expect("a `` or `` marker"); + text.replace_range(start..start + "".len(), ""); + let end = text.find("").expect("an `` marker"); + text.replace_range(end..end + "".len(), ""); + TextRange::new( + TextSize::try_from(start).unwrap(), + TextSize::try_from(end).unwrap(), + ) + }; + for (other, contents) in others { + db.write_file(other, dedent(contents)) + .expect("write to memory file system to be successful"); + } + db.write_file(path, text) + .expect("write to memory file system to be successful"); + let file = system_path_to_file(&db, path).expect("newly written file to exist"); + Self { db, file, range } + } + + /// The file after applying `kind`, or why it was not offered or refused. + pub(crate) fn apply(&self, kind: RefactorKind) -> String { + let program_file = self.db.program_file(self.file); + let offers = refactors(&self.db, program_file, self.range, RefactorKind::ALL); + let Some(offer) = offers.iter().find(|offer| offer.kind == kind) else { + return "not offered".to_string(); + }; + match refactor(&self.db, program_file, kind, self.range) { + Ok(result) => { + let offered = offer + .availability + .as_ref() + .expect("a refactoring that applies must be offered as available"); + assert_eq!(offer.title, result.title); + // the offer and the resolve are two computations of one rewrite, and a + // client applies whichever it was handed + assert_eq!( + offered.iter().map(|edit| &edit.edit).collect::>(), + result + .edits + .iter() + .map(|edit| &edit.edit) + .collect::>(), + "the offered edits and the resolved edits must be the same rewrite" + ); + let source = ruff_db::source::source_text(&self.db, self.file); + let mut text = source.as_str().to_string(); + let mut edits: Vec<_> = + result.edits.into_iter().map(|edit| edit.edit).collect(); + edits.sort_by_key(|edit| std::cmp::Reverse(edit.start())); + for edit in edits { + text.replace_range( + edit.start().to_usize()..edit.end().to_usize(), + edit.content().unwrap_or_default(), + ); + } + format!("{}\n---\n{text}", offer.title) + } + Err(reason) => { + assert_eq!(offer.availability.as_ref().err(), Some(&reason)); + format!("refused: {} ({reason})", offer.title) + } + } + } + } +} diff --git a/crates/ty_ide/src/refactor/data_class.rs b/crates/ty_ide/src/refactor/data_class.rs new file mode 100644 index 0000000000..519dade0f8 --- /dev/null +++ b/crates/ty_ide/src/refactor/data_class.rs @@ -0,0 +1,561 @@ +//! basedpython's `data class` keyword, added to a class or taken off one. +//! +//! `data class Foo` lowers to `@dataclass(slots=True)`, so writing the keyword +//! is a change of meaning the user asks for, not a rewrite that preserves it: +//! the class gains an `__init__`, equality and a `__repr__`. What is refused is +//! a class the keyword cannot apply to, and a class whose instances would stop +//! working once they have slots — one that assigns an attribute the class never +//! declares. + +use ruff_diagnostics::Edit; +use ruff_python_ast::find_node::covering_node; +use ruff_python_ast::token::TokenKind; +use ruff_python_ast::visitor::source_order::{SourceOrderVisitor, TraversalSignal, walk_node}; +use ruff_python_ast::{self as ast, AnyNodeRef, Expr, ExprContext, Stmt}; +use ruff_text_size::{Ranged, TextRange}; +use rustc_hash::FxHashSet; +use ty_python_semantic::HasType; +use ty_python_semantic::types::ide_support::{ + data_class_conversion_obstacle, is_dataclass_field_function, +}; + +use super::{Plan, RefactorContext, Refusal}; + +#[derive(Clone, Copy, PartialEq, Eq)] +pub(super) enum Direction { + ToDataClass, + FromDataClass, +} + +/// The markers the parser records a `data class` or `frozen data class` with. +const DATA_CLASS_MARKERS: [&str; 2] = ["data_class", "frozen_data_class"]; + +pub(super) fn plan( + context: &RefactorContext<'_>, + range: TextRange, + direction: Direction, +) -> Result { + if !context.is_basedpython() { + return Err(Refusal::NotApplicable); + } + let module = context.parsed.syntax(); + if !module.range().contains_range(range) { + return Err(Refusal::NotApplicable); + } + let covering = covering_node(module.into(), range); + let Some(class) = covering.ancestors().find_map(|node| match node { + AnyNodeRef::StmtClassDef(class) if header(class).contains_range(range) => Some(class), + _ => None, + }) else { + return Err(Refusal::NotApplicable); + }; + + let marker = class.decorator_list.iter().find(|decorator| { + matches!( + &decorator.expression, + Expr::Name(name) + if name.ctx == ExprContext::Invalid && DATA_CLASS_MARKERS.contains(&name.id.as_str()) + ) + }); + + match (direction, marker) { + (Direction::FromDataClass, Some(marker)) => { + let title = "Convert to a plain class"; + // taking the keyword off takes the generated `__init__` with it, and that is the + // change of meaning being asked for: a field then has no way to be filled, which + // the checker reports at every call that relied on it. a `field(...)` default is + // different — nothing reports it. the dataclass machinery reads that descriptor and + // replaces it; without it the `Field` object simply *is* the attribute's value, on + // every instance at once + if let Some(field) = dataclass_only_default(context, class) { + return Err(Refusal::refused( + title, + format!( + "`{field}` has a `field(...)` default, which only the dataclass \ + machinery reads — a plain class would hold the descriptor itself" + ), + )); + } + Ok(Plan { + title: title.to_string(), + edits: vec![Edit::range_deletion(marker.range())], + }) + } + (Direction::ToDataClass, None) => { + let title = "Convert to a data class"; + if let Some(reason) = data_class_conversion_obstacle(&context.model, class) { + return Err(Refusal::refused(title, reason)); + } + if let Some(reason) = slots_obstacle(class) { + return Err(Refusal::refused(title, reason)); + } + let Some(keyword) = context + .parsed + .tokens() + .iter() + .filter(|token| { + token.kind() == TokenKind::Class + && TextRange::new(class.start(), class.name.start()) + .contains_range(token.range()) + }) + .last() + else { + return Err(Refusal::NotApplicable); + }; + Ok(Plan { + title: title.to_string(), + edits: vec![Edit::insertion("data ".to_string(), keyword.start())], + }) + } + _ => Err(Refusal::NotApplicable), + } +} + +/// The part of a class before its body. +fn header(class: &ast::StmtClassDef) -> TextRange { + let end = class + .arguments + .as_deref() + .map(Ranged::end) + .or_else(|| class.type_params.as_deref().map(Ranged::end)) + .unwrap_or(class.name.end()); + TextRange::new(class.start(), end) +} + +/// Why `class` would break once the dataclass machinery ran over it: the class writes its own +/// `__slots__`, a method assigns an attribute of the instance the class body does not declare, +/// or a method calls `super()` with no arguments. +/// +/// The last of those is about slots rather than about `super`: building a slotted class means +/// building a *new* class object, and the `__class__` cell the methods closed over still points +/// at the original. `super()` reads that cell, so it would raise `TypeError` at runtime — which +/// is why `dataclasses` documents zero-argument `super()` as not working under `slots=True`. +fn slots_obstacle(class: &ast::StmtClassDef) -> Option { + let mut declared = FxHashSet::default(); + for statement in &class.body { + let target = match statement { + Stmt::AnnAssign(assign) => &*assign.target, + Stmt::Assign(assign) => match assign.targets.as_slice() { + [target] => target, + _ => continue, + }, + _ => continue, + }; + if let Expr::Name(name) = target { + if name.id == "__slots__" { + return Some( + "the class writes its own `__slots__`, and a data class makes its own" + .to_string(), + ); + } + if statement.is_ann_assign_stmt() { + declared.insert(name.id.to_string()); + } + } + } + + for statement in &class.body { + let Stmt::FunctionDef(method) = statement else { + continue; + }; + if bare_super_call(&method.body) { + return Some(format!( + "`{}` calls `super()` with no arguments, and a slotted data class is a new class \ + its methods do not close over — the call would raise at runtime", + method.name + )); + } + // a method with no receiver assigns no attribute of one. a static method's first + // parameter is not a receiver however it is named, so it is not read as one + if is_static_method(method) { + continue; + } + let Some(receiver) = method + .parameters + .posonlyargs + .iter() + .chain(&method.parameters.args) + .next() + else { + continue; + }; + let mut finder = AttributeWrites { + receiver: receiver.parameter.name.id.as_str(), + declared: &declared, + undeclared: None, + }; + for body_statement in &method.body { + walk_node(&mut finder, AnyNodeRef::from(body_statement)); + } + if let Some(attribute) = finder.undeclared { + return Some(format!( + "`{}` assigns `{}.{attribute}`, which the class does not declare, and a slotted data class has no room for it", + method.name, receiver.parameter.name + )); + } + } + None +} + +/// The first field of `class` whose default is a `dataclasses.field(...)` call, which means +/// something only while the dataclass machinery is there to read it. +/// +/// Which function is called is asked of the checker rather than read off the name, so a +/// `field` the project defines itself is not mistaken for this one, and +/// `dataclasses.field` is still recognised however it was imported or aliased. +fn dataclass_only_default<'a>( + context: &RefactorContext<'_>, + class: &'a ast::StmtClassDef, +) -> Option<&'a str> { + class.body.iter().find_map(|statement| { + let Stmt::AnnAssign(assign) = statement else { + return None; + }; + let Expr::Name(name) = &*assign.target else { + return None; + }; + let Expr::Call(call) = assign.value.as_deref()? else { + return None; + }; + let callee = call.func.inferred_type(&context.model)?; + is_dataclass_field_function(context.db, callee).then(|| name.id.as_str()) + }) +} + +/// Whether `method` is declared without a receiver, by decorator or by basedpython modifier. +fn is_static_method(method: &ast::StmtFunctionDef) -> bool { + method.decorator_list.iter().any(|decorator| { + matches!( + &decorator.expression, + Expr::Name(name) if matches!(name.id.as_str(), "staticmethod" | "static") + ) + }) +} + +/// Whether anything in `body` calls `super` with no arguments, outside a nested definition — +/// which has a `__class__` cell of its own only when it is written in another class. +fn bare_super_call(body: &[Stmt]) -> bool { + struct Finder { + found: bool, + } + impl<'a> SourceOrderVisitor<'a> for Finder { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if self.found { + return TraversalSignal::Skip; + } + // a class written inside the method binds its own `__class__`, so a `super()` in it + // is not this class's + if node.is_stmt_class_def() { + return TraversalSignal::Skip; + } + if let AnyNodeRef::ExprCall(call) = node + && call.arguments.is_empty() + && matches!(&*call.func, Expr::Name(name) if name.id == "super") + { + self.found = true; + return TraversalSignal::Skip; + } + TraversalSignal::Traverse + } + } + let mut finder = Finder { found: false }; + for statement in body { + walk_node(&mut finder, AnyNodeRef::from(statement)); + } + finder.found +} + +struct AttributeWrites<'a> { + receiver: &'a str, + declared: &'a FxHashSet, + undeclared: Option, +} + +impl<'a> SourceOrderVisitor<'a> for AttributeWrites<'_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if self.undeclared.is_some() { + return TraversalSignal::Skip; + } + // a nested function or class has a receiver of its own + if matches!( + node, + AnyNodeRef::StmtFunctionDef(_) | AnyNodeRef::StmtClassDef(_) + ) { + return TraversalSignal::Skip; + } + if let AnyNodeRef::ExprAttribute(attribute) = node + && attribute.ctx.is_store() + && matches!(&*attribute.value, Expr::Name(name) if name.id == self.receiver) + && !self.declared.contains(attribute.attr.as_str()) + { + self.undeclared = Some(attribute.attr.to_string()); + } + TraversalSignal::Traverse + } +} + +#[cfg(test)] +mod tests { + use insta::assert_snapshot; + + use crate::refactor::RefactorKind; + use crate::refactor::test_support::RefactorTest; + + fn to_data(source: &str) -> String { + RefactorTest::basedpython(source).apply(RefactorKind::ConvertToDataClass) + } + + fn from_data(source: &str) -> String { + RefactorTest::basedpython(source).apply(RefactorKind::ConvertFromDataClass) + } + + #[test] + fn adds_the_keyword() { + assert_snapshot!(to_data( + " + class Point: + x: int + y: int + ", + ), @" + Convert to a data class + --- + + data class Point: + x: int + y: int + "); + } + + #[test] + fn keyword_goes_after_other_modifiers() { + assert_snapshot!(to_data( + " + final class Point: + x: int + ", + ), @" + Convert to a data class + --- + + final data class Point: + x: int + "); + } + + #[test] + fn data_class_is_not_offered_to_become_one() { + assert_snapshot!(to_data( + " + data class Point: + x: int + ", + ), @"not offered"); + } + + #[test] + fn removes_the_keyword() { + assert_snapshot!(from_data( + " + data class Point: + x: int + ", + ), @" + Convert to a plain class + --- + + class Point: + x: int + "); + } + + /// `@dataclass(slots=True)` builds a new class object, and the methods closed over the old + /// one, so the `__class__` cell `super()` reads no longer matches the instance. + #[test] + fn a_class_calling_bare_super_is_refused() { + assert_snapshot!(to_data( + " + class Base: + def setup(self) -> None: ... + + class Point(Base): + x: int + + def setup(self) -> None: + super().setup() + ", + ), @"refused: Convert to a data class (`setup` calls `super()` with no arguments, and a slotted data class is a new class its methods do not close over — the call would raise at runtime)"); + } + + /// `super(Point, self)` reads no cell, so it survives the new class object. + #[test] + fn a_class_calling_super_with_arguments_is_converted() { + assert_snapshot!(to_data( + " + class Base: + def setup(self) -> None: ... + + class Point(Base): + x: int + + def setup(self) -> None: + super(Point, self).setup() + ", + ), @" + Convert to a data class + --- + + class Base: + def setup(self) -> None: ... + + data class Point(Base): + x: int + + def setup(self) -> None: + super(Point, self).setup() + "); + } + + /// A static method's first parameter is not a receiver, so what it assigns is not an + /// attribute of an instance of this class. + #[test] + fn a_static_method_is_not_read_as_having_a_receiver() { + assert_snapshot!(to_data( + " + class Point: + x: int + + @staticmethod + def reset(other) -> None: + other.anything = 1 + ", + ), @" + Convert to a data class + --- + + data class Point: + x: int + + @staticmethod + def reset(other) -> None: + other.anything = 1 + "); + } + + /// Nothing reports the loss of a `field(...)` default: the plain class would simply hold the + /// descriptor, shared by every instance. + #[test] + fn a_field_default_is_refused_going_back_to_a_plain_class() { + assert_snapshot!(from_data( + " + from dataclasses import field + + data class Bag: + items: list[int] = field(default_factory=list) + ", + ), @"refused: Convert to a plain class (`items` has a `field(...)` default, which only the dataclass machinery reads — a plain class would hold the descriptor itself)"); + } + + /// A `field` the project defines itself is an ordinary call, and its value survives losing + /// the keyword. Which function is called is asked of the checker, so the name alone does not + /// decide it. + #[test] + fn a_projects_own_field_function_is_not_the_dataclass_one() { + assert_snapshot!(from_data( + " + def field(default: int) -> int: + return default + + data class Bag: + size: int = field(3) + ", + ), @" + Convert to a plain class + --- + + def field(default: int) -> int: + return default + + class Bag: + size: int = field(3) + "); + } + + #[test] + fn removes_frozen_with_it() { + assert_snapshot!(from_data( + " + frozen data class Point: + x: int + ", + ), @" + Convert to a plain class + --- + + class Point: + x: int + "); + } + + #[test] + fn plain_class_is_not_offered_to_become_plain() { + assert_snapshot!(from_data( + " + class Point: + x: int + ", + ), @"not offered"); + } + + #[test] + fn decorated_dataclass_is_refused() { + assert_snapshot!(to_data( + " + from dataclasses import dataclass + + @dataclass + class Point: + x: int + ", + ), @"refused: Convert to a data class (the class is already a data class)"); + } + + #[test] + fn enum_is_refused() { + assert_snapshot!(to_data( + " + from enum import Enum + + class Color(Enum): + RED = 1 + ", + ), @"refused: Convert to a data class (an enum is not a data class)"); + } + + #[test] + fn undeclared_attribute_write_is_refused() { + assert_snapshot!(to_data( + " + class Point: + x: int + + def move(self): + self.moved = True + ", + ), @"refused: Convert to a data class (`move` assigns `self.moved`, which the class does not declare, and a slotted data class has no room for it)"); + } + + #[test] + fn python_file_is_not_offered() { + assert_snapshot!( + RefactorTest::python( + " + class Point: + x: int + ", + ) + .apply(RefactorKind::ConvertToDataClass), + @"not offered" + ); + } +} diff --git a/crates/ty_ide/src/refactor/evaluation.rs b/crates/ty_ide/src/refactor/evaluation.rs new file mode 100644 index 0000000000..ea2375826b --- /dev/null +++ b/crates/ty_ide/src/refactor/evaluation.rs @@ -0,0 +1,545 @@ +//! When an expression is evaluated, relative to the statement it is part of. +//! +//! Moving an expression — hoisting it into a variable above its statement, or +//! inlining a variable's value into the place that reads it — keeps the program +//! meaning the same only when the expression is evaluated exactly once each time +//! its statement runs, and when nothing evaluated before it could observe the +//! move. This module answers both, following python's evaluation order. + +use ruff_python_ast::{self as ast, AnyNodeRef, Expr, Stmt, UnaryOp}; +use ruff_text_size::Ranged; + +/// Where a target expression sits in the evaluation of its statement. +#[derive(Debug, Clone, Copy, PartialEq, Eq)] +pub(crate) enum Placement { + /// The target is evaluated exactly once whenever the statement runs. + /// `effects_before` says whether something evaluated before it may have an + /// effect: call a function, run a dunder, bind a name. + Once { effects_before: bool }, + /// The target is not evaluated exactly once per run of the statement. + NotOnce(NotOnce), +} + +/// Why an expression is not evaluated exactly once per run of its statement. +#[derive(Debug, Clone, Copy, PartialEq, Eq)] +pub(crate) enum NotOnce { + Conditional, + Loop, + Deferred, + Comprehension, + Body, + Annotation, + Assertion, + OptionalChain, + Opaque, +} + +impl NotOnce { + pub(crate) fn describe(self) -> &'static str { + match self { + NotOnce::Conditional => "it is only evaluated when a condition holds", + NotOnce::Loop => "it is evaluated again on every iteration of the loop", + NotOnce::Deferred => "it is evaluated later, when the enclosing function is called", + NotOnce::Comprehension => "it is evaluated once per element of a comprehension", + NotOnce::Body => "it is inside the body of a compound statement", + NotOnce::Annotation => "it is part of an annotation", + NotOnce::Assertion => "an `assert` is not evaluated when python runs with `-O`", + NotOnce::OptionalChain => { + "it is a link of an optional chain, which is evaluated as a whole" + } + NotOnce::Opaque => "it is part of a construct whose evaluation order is not modelled", + } + } +} + +/// Whether evaluating `expr` is free of effects and gives the same value no +/// matter where it is evaluated, as long as the names it reads are not rebound. +/// +/// This is deliberately narrow: a name, an immutable literal, a negated number +/// and a tuple of those. An attribute can be a property, an operator can be a +/// dunder, and a list display makes a new list each time it is evaluated. +pub(crate) fn is_pure(expr: &Expr) -> bool { + match expr { + Expr::Name(name) => name.ctx.is_load(), + Expr::StringLiteral(_) + | Expr::BytesLiteral(_) + | Expr::NumberLiteral(_) + | Expr::BooleanLiteral(_) + | Expr::NoneLiteral(_) + | Expr::EllipsisLiteral(_) => true, + Expr::UnaryOp(unary) => { + matches!(unary.op, UnaryOp::USub | UnaryOp::UAdd | UnaryOp::Invert) + && unary.operand.is_number_literal_expr() + } + Expr::Tuple(tuple) => { + tuple.ctx.is_load() + && !tuple.is_anon_named_tuple + && !tuple.is_anon_named_tuple_value + && tuple.callable_shape.is_none() + && !tuple.is_parameter_shape + && tuple.elts.iter().all(is_pure) + } + _ => false, + } +} + +/// Where the expression `target` sits in the evaluation of `statement`. `target` +/// must be a node of `statement`'s tree, since it is found by identity. +pub(crate) fn placement_in_statement(statement: &Stmt, target: AnyNodeRef<'_>) -> Placement { + let mut walk = Walk { + target, + effects: false, + }; + walk.statement(statement) + .unwrap_or(Placement::NotOnce(NotOnce::Opaque)) +} + +struct Walk<'a> { + target: AnyNodeRef<'a>, + effects: bool, +} + +type Found = Option; + +impl Walk<'_> { + fn contains(&self, node: impl Ranged) -> bool { + node.range().contains_range(self.target.range()) + } + + /// Something not modelled was evaluated: the target inside it is refused, + /// and a target after it has an effect before it. + fn opaque(&mut self, node: impl Ranged, reason: NotOnce) -> Found { + if self.contains(node) { + return Some(Placement::NotOnce(reason)); + } + self.effects = true; + None + } + + /// An expression evaluated at most once, or not at all, after what has + /// been walked so far. + fn not_once(&mut self, expr: &Expr, reason: NotOnce) -> Found { + if self.contains(expr) { + return Some(Placement::NotOnce(reason)); + } + if !is_pure(expr) { + self.effects = true; + } + None + } + + fn not_once_all<'e>( + &mut self, + exprs: impl IntoIterator, + reason: NotOnce, + ) -> Found { + for expr in exprs { + if let Some(found) = self.not_once(expr, reason) { + return Some(found); + } + } + None + } + + fn exprs<'e>(&mut self, exprs: impl IntoIterator) -> Found { + for expr in exprs { + if let Some(found) = self.expr(expr) { + return Some(found); + } + } + None + } + + fn effect(&mut self) { + self.effects = true; + } + + fn statement(&mut self, statement: &Stmt) -> Found { + match statement { + Stmt::Expr(stmt) => self.expr(&stmt.value), + Stmt::Return(stmt) => stmt.value.as_deref().and_then(|value| self.expr(value)), + Stmt::Assign(stmt) => { + if !stmt.decorator_list.is_empty() { + return self.opaque(stmt, NotOnce::Opaque); + } + if let Some(found) = self.expr(&stmt.value) { + return Some(found); + } + for target in &stmt.targets { + if let Some(found) = self.target(target) { + return Some(found); + } + } + None + } + Stmt::AugAssign(stmt) => { + // the target is read, the value evaluated, the operator run and + // the result stored. reading a name has no effect; reading an + // attribute or an item does + if !stmt.target.is_name_expr() { + if let Some(found) = self.target(&stmt.target) { + return Some(found); + } + self.effect(); + } + let found = self.expr(&stmt.value); + self.effect(); + found + } + Stmt::AnnAssign(stmt) => { + if !stmt.decorator_list.is_empty() || stmt.is_context { + return self.opaque(stmt, NotOnce::Opaque); + } + if self.contains(&*stmt.annotation) { + return Some(Placement::NotOnce(NotOnce::Annotation)); + } + if let Some(value) = &stmt.value + && let Some(found) = self.expr(value) + { + return Some(found); + } + self.target(&stmt.target) + } + Stmt::If(stmt) => { + if stmt.pattern.is_some() { + return self.opaque(stmt, NotOnce::Opaque); + } + if let Some(found) = self.expr(&stmt.test) { + return Some(found); + } + for clause in &stmt.elif_else_clauses { + if let Some(test) = &clause.test + && self.contains(test) + { + return Some(Placement::NotOnce(NotOnce::Conditional)); + } + } + self.contains(stmt) + .then_some(Placement::NotOnce(NotOnce::Body)) + } + Stmt::While(stmt) => { + self.contains(stmt) + .then_some(Placement::NotOnce(if self.contains(&*stmt.test) { + NotOnce::Loop + } else { + NotOnce::Body + })) + } + Stmt::For(stmt) => { + if let Some(found) = self.expr(&stmt.iter) { + return Some(found); + } + self.contains(stmt) + .then_some(Placement::NotOnce(NotOnce::Body)) + } + Stmt::With(stmt) => { + for item in &stmt.items { + if let Some(found) = self.expr(&item.context_expr) { + return Some(found); + } + // `__enter__` runs before the next item is evaluated + self.effect(); + if let Some(vars) = &item.optional_vars + && self.contains(&**vars) + { + return Some(Placement::NotOnce(NotOnce::Opaque)); + } + } + self.contains(stmt) + .then_some(Placement::NotOnce(NotOnce::Body)) + } + Stmt::Match(stmt) => { + if let Some(found) = self.expr(&stmt.subject) { + return Some(found); + } + self.contains(stmt) + .then_some(Placement::NotOnce(NotOnce::Body)) + } + Stmt::Raise(stmt) => { + if let Some(exc) = &stmt.exc + && let Some(found) = self.expr(exc) + { + return Some(found); + } + stmt.cause.as_deref().and_then(|cause| self.expr(cause)) + } + Stmt::Assert(stmt) => self + .contains(stmt) + .then_some(Placement::NotOnce(NotOnce::Assertion)), + Stmt::Delete(stmt) => { + for target in &stmt.targets { + if let Some(found) = self.target(target) { + return Some(found); + } + } + None + } + Stmt::FunctionDef(_) + | Stmt::ClassDef(_) + | Stmt::TypeAlias(_) + | Stmt::Let(_) + | Stmt::Try(_) + | Stmt::Import(_) + | Stmt::ImportFrom(_) + | Stmt::Global(_) + | Stmt::Nonlocal(_) + | Stmt::Pass(_) + | Stmt::Break(_) + | Stmt::Continue(_) + | Stmt::IpyEscapeCommand(_) => self.opaque(statement, NotOnce::Opaque), + } + } + + /// The parts of an assignment target that are evaluated before the store. + fn target(&mut self, target: &Expr) -> Found { + match target { + Expr::Name(_) => { + // the store binds the name before any later target is evaluated + self.effect(); + None + } + Expr::Attribute(attribute) if !attribute.optional => { + let found = self.expr(&attribute.value); + self.effect(); + found + } + Expr::Subscript(subscript) if !subscript.is_typeof && !subscript.is_type_decoration => { + if let Some(found) = self.expr(&subscript.value) { + return Some(found); + } + let found = self.expr(&subscript.slice); + self.effect(); + found + } + Expr::Tuple(tuple) => { + self.effect(); + for element in &tuple.elts { + if let Some(found) = self.target(element) { + return Some(found); + } + } + None + } + Expr::List(list) => { + self.effect(); + for element in &list.elts { + if let Some(found) = self.target(element) { + return Some(found); + } + } + None + } + Expr::Starred(starred) => self.target(&starred.value), + _ => self.opaque(target, NotOnce::Opaque), + } + } + + fn expr(&mut self, expr: &Expr) -> Found { + if AnyNodeRef::from(expr).ptr_eq(self.target) { + return Some(Placement::Once { + effects_before: self.effects, + }); + } + if !self.contains(expr) { + if !is_pure(expr) { + self.effect(); + } + return None; + } + + match expr { + Expr::BoolOp(bool_op) => { + let (first, rest) = bool_op.values.split_first()?; + if let Some(found) = self.expr(first) { + return Some(found); + } + self.not_once_all(rest, NotOnce::Conditional) + } + Expr::Named(named) => { + let found = self.expr(&named.value); + self.effect(); + found + } + Expr::BinOp(bin_op) => match bin_op.op { + ast::Operator::Coalesce => { + if let Some(found) = self.expr(&bin_op.left) { + return Some(found); + } + self.not_once(&bin_op.right, NotOnce::Conditional) + } + ast::Operator::Result => self.opaque(expr, NotOnce::Opaque), + _ => { + if let Some(found) = self.exprs([&*bin_op.left, &*bin_op.right]) { + return Some(found); + } + self.effect(); + None + } + }, + Expr::UnaryOp(unary) => match unary.op { + UnaryOp::Optional | UnaryOp::Propagate | UnaryOp::Force => { + self.opaque(expr, NotOnce::Opaque) + } + UnaryOp::Not | UnaryOp::Invert | UnaryOp::UAdd | UnaryOp::USub => { + let found = self.expr(&unary.operand); + self.effect(); + found + } + }, + Expr::Lambda(_) => Some(Placement::NotOnce(NotOnce::Deferred)), + Expr::If(if_expr) => { + if let Some(found) = self.expr(&if_expr.test) { + return Some(found); + } + self.not_once_all([&*if_expr.body, &*if_expr.orelse], NotOnce::Conditional) + } + Expr::Dict(dict) => { + for item in &dict.items { + if let Some(key) = &item.key + && let Some(found) = self.expr(key) + { + return Some(found); + } + if let Some(found) = self.expr(&item.value) { + return Some(found); + } + } + None + } + Expr::Set(set) => self.exprs(&set.elts), + Expr::List(list) => self.exprs(&list.elts), + Expr::Tuple(tuple) => { + if tuple.is_anon_named_tuple + || tuple.is_anon_named_tuple_value + || tuple.callable_shape.is_some() + || tuple.is_parameter_shape + { + return self.opaque(expr, NotOnce::Opaque); + } + self.exprs(&tuple.elts) + } + Expr::ListComp(comp) => self.comprehension(&comp.generators), + Expr::SetComp(comp) => self.comprehension(&comp.generators), + Expr::DictComp(comp) => self.comprehension(&comp.generators), + Expr::Generator(comp) => self.comprehension(&comp.generators), + Expr::Await(await_expr) => { + let found = self.expr(&await_expr.value); + self.effect(); + found + } + Expr::Yield(yield_expr) => { + let found = yield_expr + .value + .as_deref() + .and_then(|value| self.expr(value)); + self.effect(); + found + } + Expr::YieldFrom(yield_from) => { + let found = self.expr(&yield_from.value); + self.effect(); + found + } + Expr::Compare(compare) => { + if let Some(found) = self.expr(&compare.left) { + return Some(found); + } + let (first, rest) = compare.comparators.split_first()?; + if let Some(found) = self.expr(first) { + return Some(found); + } + self.effect(); + // a chained comparison stops at the first comparison that fails + self.not_once_all(rest, NotOnce::Conditional) + } + Expr::Call(call) => { + if call.cast_kind.is_some() || call.is_string_tag { + return self.opaque(expr, NotOnce::Opaque); + } + if is_optional_chain(expr) { + return self.opaque(expr, NotOnce::OptionalChain); + } + if let Some(found) = self.expr(&call.func) { + return Some(found); + } + for argument in call.arguments.iter_source_order() { + if let Some(found) = self.expr(argument.value()) { + return Some(found); + } + } + self.effect(); + None + } + Expr::Attribute(attribute) => { + if is_optional_chain(expr) { + return self.opaque(expr, NotOnce::OptionalChain); + } + let found = self.expr(&attribute.value); + self.effect(); + found + } + Expr::Subscript(subscript) => { + if subscript.is_typeof || subscript.is_type_decoration { + return self.opaque(expr, NotOnce::Opaque); + } + if is_optional_chain(expr) { + return self.opaque(expr, NotOnce::OptionalChain); + } + if let Some(found) = self.exprs([&*subscript.value, &*subscript.slice]) { + return Some(found); + } + self.effect(); + None + } + Expr::Starred(starred) => { + let found = self.expr(&starred.value); + self.effect(); + found + } + Expr::Slice(slice) => self.exprs( + [&slice.lower, &slice.upper, &slice.step] + .into_iter() + .filter_map(|part| part.as_deref()), + ), + // a leaf that contains the target is the target, which was handled above + Expr::Name(_) + | Expr::StringLiteral(_) + | Expr::BytesLiteral(_) + | Expr::NumberLiteral(_) + | Expr::BooleanLiteral(_) + | Expr::NoneLiteral(_) + | Expr::EllipsisLiteral(_) => None, + // an f-string's interpolations are formatted as they are reached, but + // the target inside one is left where it is + Expr::FString(_) + | Expr::TString(_) + | Expr::IpyEscapeCommand(_) + | Expr::CallableType(_) + | Expr::ProtocolType(_) + | Expr::ProtocolMethod(_) + | Expr::Statement(_) => self.opaque(expr, NotOnce::Opaque), + } + } + + /// Only the first iterable of a comprehension is evaluated in the enclosing + /// scope, once; everything else is evaluated per element. + fn comprehension(&mut self, generators: &[ast::Comprehension]) -> Found { + let (first, _) = generators.split_first()?; + if let Some(found) = self.expr(&first.iter) { + return Some(found); + } + Some(Placement::NotOnce(NotOnce::Comprehension)) + } +} + +/// Whether `expr` is part of a basedpython optional chain: a `?.` access, or a +/// trailer applied to one. A chain is evaluated as a whole — an absent receiver +/// skips every trailer after it — so no link of it is evaluated on its own. +fn is_optional_chain(expr: &Expr) -> bool { + match expr { + Expr::Attribute(attribute) => attribute.optional || is_optional_chain(&attribute.value), + Expr::Call(call) => is_optional_chain(&call.func), + Expr::Subscript(subscript) => is_optional_chain(&subscript.value), + _ => false, + } +} diff --git a/crates/ty_ide/src/refactor/extract_function.rs b/crates/ty_ide/src/refactor/extract_function.rs new file mode 100644 index 0000000000..466188594f --- /dev/null +++ b/crates/ty_ide/src/refactor/extract_function.rs @@ -0,0 +1,1062 @@ +//! Extract Function / Extract Method: move selected statements into a new +//! function and call it where they were. +//! +//! What the statements read and bind is taken from the semantic index. A +//! variable of the enclosing function the statements read, and that was bound +//! before them, becomes a parameter; a variable they bind that is read after +//! them is returned and assigned at the call. Statements selected in a method +//! become a method of the same class, called through the method's receiver. +//! +//! The rewrite is refused for statements whose meaning depends on being written +//! inline: a `return`, `yield`, `break` or `continue` that leaves the selection, +//! `global` and `nonlocal`, a variable that may be unbound when the new function +//! would be called, or one assigned only on some paths and read afterwards. + +use std::fmt::Write as _; + +use ruff_diagnostics::Edit; +use ruff_python_ast::name::Name; +use ruff_python_ast::visitor::source_order::{SourceOrderVisitor, TraversalSignal, walk_node}; +use ruff_python_ast::{self as ast, AnyNodeRef, Expr, Stmt}; +use ruff_python_trivia::{PythonWhitespace, leading_indentation}; +use ruff_source_file::LineRanges; +use ruff_text_size::{Ranged, TextRange, TextSize}; +use rustc_hash::FxHashSet; +use ty_python_core::definition::{Definition, DefinitionKind}; +use ty_python_core::place::ScopedPlaceId; +use ty_python_core::scope::{FileScopeId, NodeWithScopeRef}; +use ty_python_core::{SemanticIndex, semantic_index}; +use ty_python_semantic::HasType; +use ty_python_semantic::types::list_members::all_members; + +use super::flow::{reaching_definitions, resolving_scope}; +use super::hazards::context_dependent_construct; +use super::names::{fresh_name, names_in_file}; +use super::text::{leading_comments_start, nested_suites, statement_ancestors}; +use super::{Plan, RefactorContext, Refusal}; + +pub(super) fn plan(context: &RefactorContext<'_>, range: TextRange) -> Result { + let Some(selection) = select_statements(context, range) else { + return Err(Refusal::NotApplicable); + }; + let db = context.db; + let index = semantic_index(db, context.file); + let source = context.source(); + let module = context.parsed.suite(); + let first = selection.statements[0]; + let last = *selection + .statements + .last() + .expect("a selection has statements"); + let selected = TextRange::new(first.start(), last.end()); + + // the definition the statements are written in + let ancestors = statement_ancestors(module, first.range()); + let owner = ancestors + .iter() + .rev() + .skip(1) + .find(|stmt| matches!(stmt, Stmt::FunctionDef(_) | Stmt::ClassDef(_))) + .copied(); + + let enclosing = match owner { + Some(Stmt::ClassDef(_)) => { + return Err(Refusal::refused( + "Extract function", + "statements in a class body define the class's attributes", + )); + } + Some(Stmt::FunctionDef(function)) => Some(function), + _ => None, + }; + let scope = match enclosing { + Some(function) => { + if function.is_trailing_lambda { + return Err(Refusal::refused( + "Extract function", + "the statements are in a trailing lambda block", + )); + } + index + .try_node_scope(NodeWithScopeRef::Function(function)) + .ok_or(Refusal::NotApplicable)? + } + None => FileScopeId::global(), + }; + + let method = match enclosing { + Some(function) if index.class_definition_of_method(scope).is_some() => { + Some(Method::of(context, function)?) + } + _ => None, + }; + let class = method.as_ref().and_then(|_| { + ancestors + .iter() + .rev() + .skip(1) + .find_map(|stmt| stmt.as_class_def_stmt()) + }); + + let mut taken = names_in_file(context); + if let Some(class) = class + && let Some(class_type) = class.inferred_type(&context.model) + { + let env = context.model.program_environment(); + taken.extend( + all_members(db, &env, class_type) + .into_iter() + .map(|member| member.name.to_string()), + ); + } + let name = fresh_name("extracted", &taken); + let title = if method.is_some() { + format!("Extract method `{name}`") + } else { + format!("Extract function `{name}`") + }; + let refuse = |reason: String| Refusal::refused(title.clone(), reason); + + // control flow that leaves the statements, and constructs that don't move + let mut scan = ControlFlowScan::default(); + for statement in &selection.statements { + scan.visit_stmt(statement); + } + if let Some(reason) = scan.refusal { + return Err(refuse(reason)); + } + if scan.awaits && !enclosing.is_some_and(|function| function.is_async) { + return Err(refuse( + "the statements await outside an `async def`".to_string(), + )); + } + for statement in &selection.statements { + if let Some(reason) = context_dependent_construct(context, AnyNodeRef::from(*statement)) { + return Err(refuse(format!("the statements can't be moved: {reason}"))); + } + } + + let in_selection = |range: TextRange| selected.contains_range(range); + let table = index.place_table(scope); + + // what the statements bind in the enclosing scope + let use_def = index.use_def_map(scope); + let mut bound: Vec<(Name, Definition<'_>)> = Vec::new(); + for (_, definition, _) in use_def.definitions_with_usage() { + let ScopedPlaceId::Symbol(symbol) = definition.place(db) else { + continue; + }; + let kind = definition.kind(db); + if matches!( + kind, + DefinitionKind::LoopHeader(_) | DefinitionKind::NestedBindings(_) + ) { + continue; + } + if !in_selection(kind.target_range(&context.parsed)) { + continue; + } + let symbol = table.symbol(symbol); + if symbol.is_global() || symbol.is_nonlocal() { + return Err(refuse(format!( + "`{}` is declared `global` or `nonlocal`, so assigning it inside a new function would need the same declaration", + symbol.name() + ))); + } + bound.push((symbol.name().clone(), definition)); + } + let bound_names: FxHashSet<&Name> = bound.iter().map(|(name, _)| name).collect(); + + // what the statements read from the enclosing scope, in the order they read it + let reads = collect_reads( + index, + scope, + selection.statements.iter().copied(), + TextRange::empty(TextSize::default()), + ); + let receiver = method.as_ref().map(|method| &method.receiver); + let mut parameters: Vec = Vec::new(); + for read in &reads.names { + if receiver.is_some_and(|receiver| *receiver == read.name.id) { + if bound_names.contains(&read.name.id) { + return Err(refuse(format!( + "the statements assign the receiver `{}`", + read.name.id + ))); + } + continue; + } + if read.nested { + if scope.is_global() { + if bound_names.contains(&read.name.id) { + return Err(refuse(format!( + "a function defined in the statements reads `{}`, which would become a variable of the new function", + read.name.id + ))); + } + continue; + } + let bound_outside = bindings_outside(context, index, scope, &read.name.id, selected); + if bound_outside && bound_names.contains(&read.name.id) { + return Err(refuse(format!( + "a function defined in the statements reads `{}`, which is assigned both inside and outside them", + read.name.id + ))); + } + if bound_outside && !parameters.contains(&read.name.id) { + parameters.push(read.name.id.clone()); + } + continue; + } + let reaching = reaching_definitions(db, index, scope, read.name); + let from_outside = reaching + .definitions + .iter() + .any(|definition| !in_selection(definition.kind(db).target_range(&context.parsed))); + if !from_outside { + continue; + } + // a module's variable is read where it is when nothing in the statements + // makes it local to the new function + if scope.is_global() && !bound_names.contains(&read.name.id) { + continue; + } + if reaching.maybe_unbound { + return Err(refuse(format!( + "`{}` may be unbound where the new function would be called", + read.name.id + ))); + } + if !parameters.contains(&read.name.id) { + parameters.push(read.name.id.clone()); + } + } + + // what the statements bind that is read after them + let mut returned: Vec = Vec::new(); + let later_reads = match enclosing { + Some(function) => collect_reads(index, scope, function.body.iter(), selected), + None => Reads::default(), + }; + for (name, definition) in &bound { + if returned.contains(name) { + continue; + } + let read_after = if scope.is_global() { + // a module's variables are its attributes, read by whoever imports it + true + } else { + later_reads.names.iter().any(|read| { + read.name.id == *name + && (read.nested + || reaching_definitions(db, index, scope, read.name) + .definitions + .iter() + .any(|reached| reached == definition)) + }) + }; + if !read_after { + continue; + } + let symbol = table.symbol_id(name).map(|id| table.symbol(id)); + if symbol.is_some_and(ty_python_core::symbol::Symbol::is_declared) { + return Err(refuse(format!( + "`{name}` is declared in the statements and read after them, and a declaration can't be returned" + ))); + } + if !parameters.contains(name) && !always_binds(&selection.statements, name) { + return Err(refuse(format!( + "`{name}` is read after the statements but not assigned on every path through them" + ))); + } + returned.push(name.clone()); + } + + // the new definition + let line_ending = context.line_ending(); + let indent_unit = context.indent_unit(); + let (definition_indent, insert_at, blank_lines) = match enclosing { + Some(function) => ( + context.indentation(function).to_string(), + leading_comments_start(source, function.start()), + if method.is_some() || !scope_is_top_level(index, scope) { + 1 + } else { + 2 + }, + ), + None => ( + String::new(), + leading_comments_start(source, ancestors[0].start()), + 2, + ), + }; + let body_indent = format!("{definition_indent}{indent_unit}"); + let selection_indent = context.indentation(first).to_string(); + let lines = TextRange::new( + source.line_start(first.start()), + source.line_end(last.end()), + ); + let body = reindent(context, lines, &selection_indent, &body_indent); + + let mut signature = Vec::new(); + if let Some(method) = &method { + signature.push(method.receiver.to_string()); + } + signature.extend(parameters.iter().map(ToString::to_string)); + let mut definition = String::new(); + if matches!( + method, + Some(Method { + kind: MethodKind::Class, + .. + }) + ) { + let _ = write!(definition, "{definition_indent}@classmethod{line_ending}"); + } + let _ = write!( + definition, + "{definition_indent}{async_}def {name}({signature}):{line_ending}{body}{line_ending}", + async_ = if scan.awaits { "async " } else { "" }, + signature = signature.join(", "), + ); + if !returned.is_empty() { + let _ = write!( + definition, + "{body_indent}return {}{line_ending}", + join_names(&returned) + ); + } + for _ in 0..blank_lines { + definition.push_str(line_ending); + } + + // the call + let callee = match &method { + Some(method) => format!("{}.{name}", method.receiver), + None => name, + }; + let call = format!( + "{await_}{callee}({arguments})", + await_ = if scan.awaits { "await " } else { "" }, + arguments = parameters + .iter() + .map(ToString::to_string) + .collect::>() + .join(", "), + ); + let call_statement = if returned.is_empty() { + format!("{selection_indent}{call}") + } else { + format!("{selection_indent}{} = {call}", join_names(&returned)) + }; + + // a definition written directly above the statements it replaces is one edit, + // since two edits starting at one offset have no order a client must keep + let edits = if insert_at == lines.start() { + vec![Edit::range_replacement( + format!("{definition}{call_statement}"), + lines, + )] + } else { + vec![ + Edit::insertion(definition, insert_at), + Edit::range_replacement(call_statement, lines), + ] + }; + Ok(Plan { title, edits }) +} + +/// Whole statements, siblings in one suite, that the selection covers. +struct Selection<'a> { + statements: Vec<&'a Stmt>, +} + +fn select_statements<'a>( + context: &'a RefactorContext<'_>, + range: TextRange, +) -> Option> { + let source = context.source(); + let text = source.get(range.to_std_range())?; + let trimmed = text.trim_whitespace(); + if trimmed.is_empty() { + return None; + } + let start = + range.start() + TextSize::try_from(text.len() - text.trim_whitespace_start().len()).ok()?; + let range = TextRange::at(start, TextSize::try_from(trimmed.len()).ok()?); + + let mut suite: &[Stmt] = context.parsed.suite(); + loop { + let overlapping: Vec<&Stmt> = suite + .iter() + .filter(|stmt| { + stmt.range() + .intersect(range) + .is_some_and(|overlap| !overlap.is_empty()) + || range.contains_range(stmt.range()) + }) + .collect(); + match overlapping.as_slice() { + [] => return None, + [only] if !covers(source, range, only, only) => { + // the selection is inside one statement: look in its suites + let nested = nested_suites(only).into_iter().find(|nested| { + nested + .iter() + .any(|stmt| stmt.range().intersect(range).is_some()) + })?; + suite = nested; + } + statements => { + let (first, last) = (statements[0], statements[statements.len() - 1]); + if !covers(source, range, first, last) { + return None; + } + if !overlapping.iter().all(|stmt| context.owns_its_lines(stmt)) { + return None; + } + return Some(Selection { + statements: overlapping, + }); + } + } + } +} + +/// Whether `range` starts at `first` and ends at `last`, allowing the rest of +/// `last`'s line (a trailing comment) to be selected too. +fn covers(source: &str, range: TextRange, first: &Stmt, last: &Stmt) -> bool { + range.start() <= first.start() + && source.line_start(range.start()) == source.line_start(first.start()) + && range.end() >= last.end() + && range.end() <= source.line_end(last.end()) +} + +#[derive(Clone, Copy, PartialEq, Eq)] +enum MethodKind { + Instance, + Class, +} + +struct Method { + receiver: Name, + kind: MethodKind, +} + +impl Method { + fn of(context: &RefactorContext<'_>, function: &ast::StmtFunctionDef) -> Result { + let mut kind = MethodKind::Instance; + for decorator in &function.decorator_list { + let Expr::Name(name) = &decorator.expression else { + continue; + }; + match name.id.as_str() { + "staticmethod" | "static" => { + return Err(Refusal::refused( + "Extract method", + "a static method has no receiver to call a new method through", + )); + } + "classmethod" => kind = MethodKind::Class, + _ => {} + } + } + let _ = context; + let receiver = function + .parameters + .posonlyargs + .iter() + .chain(&function.parameters.args) + .next() + .map(|parameter| parameter.parameter.name.id.clone()) + .ok_or_else(|| { + Refusal::refused("Extract method", "the method has no receiver parameter") + })?; + Ok(Method { receiver, kind }) + } +} + +/// `return`, `yield`, `break` and `continue` that leave the statements, and +/// statements that only mean something where they are. +#[derive(Default)] +struct ControlFlowScan { + loop_depth: usize, + awaits: bool, + refusal: Option, +} + +impl<'a> SourceOrderVisitor<'a> for ControlFlowScan { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if self.refusal.is_some() { + return TraversalSignal::Skip; + } + let refusal = match node { + // a nested scope's control flow is its own + AnyNodeRef::StmtFunctionDef(_) + | AnyNodeRef::StmtClassDef(_) + | AnyNodeRef::ExprLambda(_) => return TraversalSignal::Skip, + AnyNodeRef::StmtReturn(_) => Some("the statements `return`"), + AnyNodeRef::ExprYield(_) | AnyNodeRef::ExprYieldFrom(_) => { + Some("the statements `yield`") + } + AnyNodeRef::StmtGlobal(_) | AnyNodeRef::StmtNonlocal(_) => { + Some("the statements declare `global` or `nonlocal`") + } + AnyNodeRef::StmtBreak(stmt) if self.loop_depth == 0 || stmt.value.is_some() => { + Some("the statements `break` out of a loop around them") + } + AnyNodeRef::StmtContinue(_) if self.loop_depth == 0 => { + Some("the statements `continue` a loop around them") + } + AnyNodeRef::StmtLet(_) => { + Some("a `let` pattern statement leaves its suite when it does not match") + } + AnyNodeRef::StmtDelete(_) => Some("the statements delete a variable"), + AnyNodeRef::ExprAwait(_) => { + self.awaits = true; + None + } + AnyNodeRef::StmtWith(stmt) => { + self.awaits |= stmt.is_async; + None + } + AnyNodeRef::Comprehension(comprehension) => { + self.awaits |= comprehension.is_async; + None + } + // a loop's `break` and `continue` are its body's; the ones in its `else` + // belong to the loop around it + AnyNodeRef::StmtFor(stmt) => { + self.awaits |= stmt.is_async; + self.visit_expr(&stmt.target); + self.visit_expr(&stmt.iter); + self.in_loop(&stmt.body); + self.visit_body(&stmt.orelse); + return TraversalSignal::Skip; + } + AnyNodeRef::StmtWhile(stmt) => { + self.visit_expr(&stmt.test); + self.in_loop(&stmt.body); + self.visit_body(&stmt.orelse); + return TraversalSignal::Skip; + } + _ => None, + }; + if let Some(refusal) = refusal { + self.refusal = Some(refusal.to_string()); + return TraversalSignal::Skip; + } + TraversalSignal::Traverse + } +} + +impl ControlFlowScan { + fn in_loop(&mut self, body: &[Stmt]) { + self.loop_depth += 1; + self.visit_body(body); + self.loop_depth -= 1; + } +} + +struct Read<'a> { + name: &'a ast::ExprName, + /// The load is in a scope nested in the enclosing one, so it runs whenever + /// that scope runs rather than where it is written. + nested: bool, +} + +#[derive(Default)] +struct Reads<'a> { + names: Vec>, +} + +/// The loads, in `statements` but not in `excluded`, of names that resolve to `scope`. +fn collect_reads<'a>( + index: &SemanticIndex<'_>, + scope: FileScopeId, + statements: impl Iterator, + excluded: TextRange, +) -> Reads<'a> { + struct Collector<'a, 'i, 'db> { + index: &'i SemanticIndex<'db>, + scope: FileScopeId, + excluded: TextRange, + reads: Vec>, + } + impl<'a> SourceOrderVisitor<'a> for Collector<'a, '_, '_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if !self.excluded.is_empty() && self.excluded.contains_range(node.range()) { + return TraversalSignal::Skip; + } + if let AnyNodeRef::ExprName(name) = node + && name.ctx.is_load() + && let Some(use_scope) = self + .index + .try_expression_scope_id(&ast::ExprRef::Name(name)) + && resolving_scope(self.index, use_scope, &name.id) == Some(self.scope) + { + self.reads.push(Read { + name, + nested: use_scope != self.scope, + }); + } + TraversalSignal::Traverse + } + } + let mut collector = Collector { + index, + scope, + excluded, + reads: Vec::new(), + }; + for statement in statements { + walk_node(&mut collector, AnyNodeRef::from(statement)); + } + Reads { + names: collector.reads, + } +} + +/// Whether `name` has a binding in `scope` outside `selected`. +fn bindings_outside( + context: &RefactorContext<'_>, + index: &SemanticIndex<'_>, + scope: FileScopeId, + name: &str, + selected: TextRange, +) -> bool { + let db = context.db; + let Some(symbol) = index.place_table(scope).symbol_id(name) else { + return false; + }; + index + .use_def_map(scope) + .definitions_with_usage() + .any(|(_, definition, _)| { + definition.place(db) == ScopedPlaceId::Symbol(symbol) + && !matches!(definition.kind(db), DefinitionKind::LoopHeader(_)) + && !selected.contains_range(definition.kind(db).target_range(&context.parsed)) + }) +} + +/// Whether one of `statements` unconditionally binds `name` to a value. +fn always_binds(statements: &[&Stmt], name: &Name) -> bool { + statements.iter().any(|statement| match statement { + Stmt::Assign(assign) => assign + .targets + .iter() + .any(|target| target_binds(target, name)), + Stmt::AugAssign(assign) => target_binds(&assign.target, name), + Stmt::AnnAssign(assign) => assign.value.is_some() && target_binds(&assign.target, name), + Stmt::FunctionDef(function) => function.name.id == *name, + Stmt::ClassDef(class) => class.name.id == *name, + Stmt::Import(import) => import.names.iter().any(|alias| { + alias.asname.as_ref().map_or_else( + || alias.name.id.split('.').next() == Some(name.as_str()), + |asname| asname.id == *name, + ) + }), + Stmt::ImportFrom(import) => import + .names + .iter() + .any(|alias| alias.asname.as_ref().unwrap_or(&alias.name).id == *name), + _ => false, + }) +} + +fn target_binds(target: &Expr, name: &Name) -> bool { + match target { + Expr::Name(target) => target.id == *name, + Expr::Tuple(tuple) => tuple.elts.iter().any(|element| target_binds(element, name)), + Expr::List(list) => list.elts.iter().any(|element| target_binds(element, name)), + Expr::Starred(starred) => target_binds(&starred.value, name), + _ => false, + } +} + +fn join_names(names: &[Name]) -> String { + names + .iter() + .map(ToString::to_string) + .collect::>() + .join(", ") +} + +/// Whether `scope` is a function defined directly in the module. +fn scope_is_top_level(index: &SemanticIndex<'_>, scope: FileScopeId) -> bool { + index.scope(scope).parent() == Some(FileScopeId::global()) +} + +/// The lines of `lines`, moved from `from` indentation to `to`. A line that +/// starts inside a multi-line string is part of the string and is left alone. +fn reindent(context: &RefactorContext<'_>, lines: TextRange, from: &str, to: &str) -> String { + let source = context.source(); + let tokens = context.parsed.tokens(); + let mut result = String::new(); + let mut offset = lines.start(); + let mut first = true; + while offset <= lines.end() { + let line_end = source.line_end(offset); + let full_end = source.full_line_end(offset).min(lines.end()); + let line = &source[TextRange::new(offset, line_end.min(lines.end()))]; + // tokens are in source order, so the one that could span `offset` is the + // first that ends after it + let inside_token = !first + && tokens + .get(tokens.partition_point(|token| token.end() <= offset)) + .is_some_and(|token| token.start() < offset); + if !first { + result.push_str(context.line_ending()); + } + first = false; + if inside_token { + result.push_str(line); + } else if line.trim_whitespace().is_empty() { + // blank lines carry no indentation + } else { + let indentation = leading_indentation(line); + let kept = if indentation.starts_with(from) { + &line[from.len()..] + } else { + &line[indentation.len()..] + }; + result.push_str(to); + result.push_str(kept); + } + if full_end >= lines.end() { + break; + } + offset = full_end; + } + result +} + +#[cfg(test)] +mod tests { + use insta::assert_snapshot; + + use crate::refactor::RefactorKind; + use crate::refactor::test_support::RefactorTest; + + fn extract(source: &str) -> String { + RefactorTest::python(source).apply(RefactorKind::ExtractFunction) + } + + #[test] + fn passes_locals_and_returns_what_is_read_after() { + assert_snapshot!(extract( + " + def report(orders, tax): + total = 0 + for order in orders: + total += order.price * tax + print(total) + ", + ), @" + Extract function `extracted` + --- + + def extracted(orders, tax): + total = 0 + for order in orders: + total += order.price * tax + return total + + + def report(orders, tax): + total = extracted(orders, tax) + print(total) + "); + } + + #[test] + fn method_becomes_a_method_called_through_self() { + assert_snapshot!(extract( + " + class Cart: + def checkout(self, discount): + price = self.total() - discount + self.charge(price) + + def total(self) -> int: ... + def charge(self, amount): ... + ", + ), @" + Extract method `extracted` + --- + + class Cart: + def extracted(self, discount): + price = self.total() - discount + self.charge(price) + + def checkout(self, discount): + self.extracted(discount) + + def total(self) -> int: ... + def charge(self, amount): ... + "); + } + + #[test] + fn classmethod_stays_a_classmethod() { + assert_snapshot!(extract( + " + class Config: + @classmethod + def load(cls, path): + text = open(path).read() + return cls(text) + ", + ), @" + Extract method `extracted` + --- + + class Config: + @classmethod + def extracted(cls, path): + text = open(path).read() + return text + + @classmethod + def load(cls, path): + text = cls.extracted(path) + return cls(text) + "); + } + + #[test] + fn static_method_is_refused() { + assert_snapshot!(extract( + " + class A: + @staticmethod + def f(x): + print(x) + ", + ), @"refused: Extract method (a static method has no receiver to call a new method through)"); + } + + #[test] + fn return_is_refused() { + assert_snapshot!(extract( + " + def f(x): + if x: + return 1 + return 2 + ", + ), @"refused: Extract function `extracted` (the statements `return`)"); + } + + #[test] + fn break_out_of_an_enclosing_loop_is_refused() { + assert_snapshot!(extract( + " + def f(items): + for item in items: + if item: + break + ", + ), @"refused: Extract function `extracted` (the statements `break` out of a loop around them)"); + } + + #[test] + fn break_inside_the_selection_is_allowed() { + assert_snapshot!(extract( + " + def f(items): + for item in items: + if item: + break + ", + ), @" + Extract function `extracted` + --- + + def extracted(items): + for item in items: + if item: + break + + + def f(items): + extracted(items) + "); + } + + #[test] + fn break_in_a_loop_else_leaves_the_loop_around_it() { + assert_snapshot!(extract( + " + def f(items, groups): + for group in groups: + for item in items: + pass + else: + break + ", + ), @"refused: Extract function `extracted` (the statements `break` out of a loop around them)"); + } + + #[test] + fn variable_assigned_on_some_paths_and_read_after_is_refused() { + assert_snapshot!(extract( + " + def f(flag): + if flag: + x = 1 + print(x) + ", + ), @"refused: Extract function `extracted` (`x` is read after the statements but not assigned on every path through them)"); + } + + #[test] + fn rebound_variable_is_passed_and_returned() { + assert_snapshot!(extract( + " + def f(count): + count = count + 1 + return count + ", + ), @" + Extract function `extracted` + --- + + def extracted(count): + count = count + 1 + return count + + + def f(count): + count = extracted(count) + return count + "); + } + + #[test] + fn module_level_statements_return_what_they_bind() { + assert_snapshot!(extract( + " + import sys + + name = sys.argv[0] + print(name) + ", + ), @" + Extract function `extracted` + --- + + import sys + + def extracted(): + name = sys.argv[0] + print(name) + return name + + + name = extracted() + "); + } + + #[test] + fn nested_function_goes_inside_the_outer_function() { + assert_snapshot!(extract( + " + def outer(a): + def inner(b): + print(a, b) + return inner + ", + ), @" + Extract function `extracted` + --- + + def outer(a): + def extracted(b): + print(a, b) + + def inner(b): + extracted(b) + return inner + "); + } + + #[test] + fn awaits_make_an_async_function() { + assert_snapshot!(extract( + " + async def f(client): + response = await client.get() + return response + ", + ), @" + Extract function `extracted` + --- + + async def extracted(client): + response = await client.get() + return response + + + async def f(client): + response = await extracted(client) + return response + "); + } + + #[test] + fn multiline_string_is_not_reindented() { + assert_snapshot!(extract( + r#" + def f(): + if True: + text = """ + first + second + """ + print(text) + "#, + ), @r#" + Extract function `extracted` + --- + + def extracted(): + text = """ + first + second + """ + return text + + + def f(): + if True: + text = extracted() + print(text) + "#); + } + + #[test] + fn part_of_a_statement_is_not_offered() { + assert_snapshot!(extract( + " + def f(a): + print(a) + ", + ), @"not offered"); + } + + #[test] + fn global_declaration_is_refused() { + assert_snapshot!(extract( + " + counter = 0 + + def f(): + global counter + counter = counter + 1 + ", + ), @"refused: Extract function `extracted` (`counter` is declared `global` or `nonlocal`, so assigning it inside a new function would need the same declaration)"); + } +} diff --git a/crates/ty_ide/src/refactor/extract_variable.rs b/crates/ty_ide/src/refactor/extract_variable.rs new file mode 100644 index 0000000000..361597f002 --- /dev/null +++ b/crates/ty_ide/src/refactor/extract_variable.rs @@ -0,0 +1,720 @@ +//! Extract Variable and Introduce Constant: bind a selected expression to a +//! new name, and read the name where the expression was. +//! +//! A variable is bound directly above the statement the expression is part of, +//! so the expression is now evaluated before the rest of that statement. That is +//! only the same program when the expression was evaluated exactly once whenever +//! the statement ran, and nothing with an effect was evaluated before it — an +//! expression in a loop's condition, a conditional branch, a lambda, or after a +//! call is refused. +//! +//! A constant is bound at the top level of the module, before the definition +//! that uses it, so it is evaluated once at import — whether or not the +//! expression it was made from would have been evaluated at all. That is only +//! the same program for an expression that is made of literals, does not build +//! anything mutable, and cannot raise; see [`is_constant`]. + +use ruff_diagnostics::Edit; +use ruff_python_ast::visitor::source_order::{SourceOrderVisitor, TraversalSignal, walk_node}; +use ruff_python_ast::{self as ast, AnyNodeRef, Expr, Stmt, UnaryOp}; +use ruff_python_trivia::PythonWhitespace; +use ruff_source_file::LineRanges; +use ruff_text_size::{Ranged, TextRange, TextSize}; +use ty_python_semantic::types::ide_support::folds_to_a_literal; + +use super::evaluation::{NotOnce, Placement, placement_in_statement}; +use super::hazards::{contains_named_expression, context_dependent_construct}; +use super::names::{fresh_name, names_in_file, suggest_for_expression}; +use super::text::{leading_comments_start, statement_ancestors, suite_of}; +use super::{Plan, RefactorContext, Refusal}; + +#[derive(Clone, Copy, PartialEq, Eq)] +pub(super) enum Target { + Variable, + Constant, +} + +pub(super) fn plan( + context: &RefactorContext<'_>, + range: TextRange, + target: Target, +) -> Result { + let Some(selection) = selected_expression(context, range) else { + return Err(Refusal::NotApplicable); + }; + let expr = selection.expr; + if target == Target::Constant && !is_constant(context, expr) { + return Err(Refusal::NotApplicable); + } + let module = context.parsed.suite(); + let ancestors = statement_ancestors(module, expr.range()); + let Some(&statement) = ancestors.last() else { + return Err(Refusal::NotApplicable); + }; + // the statement already is the expression on its own + if matches!(statement, Stmt::Expr(stmt) if stmt.value.range() == expr.range()) { + return Err(Refusal::NotApplicable); + } + + let names = names_in_file(context); + let version = context.file.python_version(context.db); + let base = suggest_for_expression(expr, version.minor); + let (name, title) = match target { + Target::Variable => { + let name = fresh_name(&base, &names); + let title = format!("Extract variable `{name}`"); + (name, title) + } + Target::Constant => { + let name = fresh_name(&base.to_uppercase(), &names); + let title = format!("Introduce constant `{name}`"); + (name, title) + } + }; + let refuse = |reason: String| Refusal::refused(title.clone(), reason); + + if let Some(reason) = context_dependent_construct(context, AnyNodeRef::from(expr)) { + return Err(refuse(format!("the expression can't be moved: {reason}"))); + } + if contains_named_expression(expr) { + return Err(refuse("the expression binds a name with `:=`".to_string())); + } + + let placement = placement_in_statement(statement, AnyNodeRef::from(expr)); + let expression_text = expression_source(context, expr); + let line_ending = context.line_ending(); + + let insertion = match target { + Target::Variable => { + match placement { + Placement::Once { + effects_before: false, + } => {} + Placement::Once { + effects_before: true, + } => { + return Err(refuse( + "something with effects is evaluated before the expression, which would now run after it" + .to_string(), + )); + } + Placement::NotOnce(reason) => { + return Err(refuse(format!( + "the expression can't be evaluated before its statement: {}", + reason.describe() + ))); + } + } + if ancestors + .iter() + .rev() + .skip(1) + .find(|stmt| matches!(stmt, Stmt::FunctionDef(_) | Stmt::ClassDef(_))) + .is_some_and(|stmt| stmt.is_class_def_stmt()) + { + return Err(refuse( + "a variable bound in a class body would become an attribute of the class" + .to_string(), + )); + } + if suite_of(module, statement).is_none() + || ruff_python_trivia::indentation_at_offset(statement.start(), context.source()) + .is_none() + { + return Err(refuse( + "the statement shares its line with the one it belongs to".to_string(), + )); + } + let indentation = context.indentation(statement); + Edit::insertion( + format!("{indentation}{name} = {expression_text}{line_ending}"), + context.source().line_start(statement.start()), + ) + } + Target::Constant => { + if let Placement::NotOnce(reason @ (NotOnce::Annotation | NotOnce::Opaque)) = placement + { + return Err(refuse(format!( + "the expression can't be moved to the module: {}", + reason.describe() + ))); + } + let top_level = ancestors[0]; + let at = leading_comments_start(context.source(), top_level.start()); + let separation = if matches!(top_level, Stmt::FunctionDef(_) | Stmt::ClassDef(_)) { + format!("{line_ending}{line_ending}") + } else { + String::new() + }; + Edit::insertion( + format!("{name} = {expression_text}{line_ending}{separation}"), + at, + ) + } + }; + + Ok(Plan { + title, + edits: vec![insertion, Edit::range_replacement(name, selection.replaced)], + }) +} + +struct Selection<'a> { + expr: &'a Expr, + /// The range the name replaces: the expression, with the parentheses the + /// selection included. + replaced: TextRange, +} + +/// The expression the selection covers exactly, ignoring surrounding +/// whitespace and allowing parentheses around it. +fn selected_expression<'a>( + context: &'a RefactorContext<'_>, + range: TextRange, +) -> Option> { + struct Finder<'a, 'c, 'db> { + context: &'c RefactorContext<'db>, + range: TextRange, + parents: Vec>, + found: Option>, + } + impl<'a> SourceOrderVisitor<'a> for Finder<'a, '_, '_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + // `leave_node` runs for skipped nodes too, so every node is pushed + self.parents.push(node); + // a node that is not around the selection can still be the expression + // it selects, when the selection includes the expression's parentheses + if self.found.is_some() + || !(node.range().contains_range(self.range) + || self.range.contains_range(node.range())) + { + return TraversalSignal::Skip; + } + TraversalSignal::Traverse + } + + fn leave_node(&mut self, _node: AnyNodeRef<'a>) { + self.parents.pop(); + } + + fn visit_expr(&mut self, expr: &'a Expr) { + if self.found.is_some() { + return; + } + if let Some(parent) = self.parents.last().copied() + && (expr.range() == self.range + || self.context.parenthesized_range(expr, parent) == self.range) + { + self.found = Some(Selection { + expr, + replaced: self.range, + }); + return; + } + ruff_python_ast::visitor::source_order::walk_expr(self, expr); + } + } + + let source = context.source(); + let selected = source.get(range.to_std_range())?; + let leading = selected.len() - selected.trim_whitespace_start().len(); + let trimmed = selected.trim_whitespace(); + if trimmed.is_empty() { + return None; + } + let start = range.start() + TextSize::try_from(leading).ok()?; + let trimmed = TextRange::at(start, TextSize::try_from(trimmed.len()).ok()?); + + let mut finder = Finder { + context, + range: trimmed, + parents: Vec::new(), + found: None, + }; + walk_node(&mut finder, context.parsed.syntax().into()); + let selection = finder.found?; + is_extractable(selection.expr).then_some(selection) +} + +/// Whether `expr` is a value that can be bound to a name: it is read rather +/// than assigned, and it means something outside its position. +fn is_extractable(expr: &Expr) -> bool { + match expr { + Expr::Name(ast::ExprName { ctx, .. }) + | Expr::Attribute(ast::ExprAttribute { ctx, .. }) + | Expr::Subscript(ast::ExprSubscript { ctx, .. }) + | Expr::List(ast::ExprList { ctx, .. }) + | Expr::Tuple(ast::ExprTuple { ctx, .. }) => ctx.is_load(), + Expr::Starred(_) + | Expr::Slice(_) + | Expr::IpyEscapeCommand(_) + | Expr::CallableType(_) + | Expr::ProtocolType(_) + | Expr::ProtocolMethod(_) + | Expr::Statement(_) => false, + _ => true, + } +} + +/// The source of `expr` as the value of an assignment, parenthesized where its +/// text would not parse there on its own. +fn expression_source(context: &RefactorContext<'_>, expr: &Expr) -> String { + let text = context.expression_text(expr); + let bracketed = matches!( + expr, + Expr::List(_) + | Expr::ListComp(_) + | Expr::Dict(_) + | Expr::DictComp(_) + | Expr::Set(_) + | Expr::SetComp(_) + ) || matches!(expr, Expr::Tuple(tuple) if tuple.parenthesized); + let unparenthesized_generator = + matches!(expr, Expr::Generator(generator) if !generator.parenthesized); + if unparenthesized_generator || (!bracketed && context.is_multiline(expr.range())) { + format!("({text})") + } else { + text.to_string() + } +} + +/// Whether `expr` is made only of literals and evaluates to an immutable value without raising. +/// +/// Made only of literals so that the constant, read at the top of the module, reads nothing that +/// might not be bound there yet. +/// +/// Without raising because a constant is evaluated as the module loads, and the expression it is +/// made from need not have been evaluated at all where it was written — `1 / 0` in a branch that +/// never runs, or an expression under an `assert` that python skips with `-O`. Hoisting one of +/// those would turn a program that runs into one that fails to import. +/// +/// Whether an operation over literals raises is not something to read off its spelling, so each +/// one is asked of the checker instead: ty folds it to the literal it produces exactly when it +/// has carried it out, which makes a folded type the proof that evaluating it yields a value. +/// `60 * 60 * 24` folds and is hoisted; `1 / 0`, `1 % 0`, `-"a"` and `1 + "a"` do not and are not. +fn is_constant(context: &RefactorContext<'_>, expr: &Expr) -> bool { + match expr { + Expr::StringLiteral(_) + | Expr::BytesLiteral(_) + | Expr::NumberLiteral(_) + | Expr::BooleanLiteral(_) + | Expr::NoneLiteral(_) + | Expr::EllipsisLiteral(_) => true, + Expr::UnaryOp(unary) => { + matches!( + unary.op, + UnaryOp::USub | UnaryOp::UAdd | UnaryOp::Invert | UnaryOp::Not + ) && is_constant(context, &unary.operand) + && folds_to_a_literal(&context.model, expr) + } + Expr::BinOp(bin_op) => { + !matches!(bin_op.op, ast::Operator::Coalesce | ast::Operator::Result) + && is_constant(context, &bin_op.left) + && is_constant(context, &bin_op.right) + && folds_to_a_literal(&context.model, expr) + } + // a tuple display of constants builds a tuple, which cannot fail + Expr::Tuple(tuple) => { + tuple.ctx.is_load() + && !tuple.is_anon_named_tuple + && !tuple.is_anon_named_tuple_value + && tuple.callable_shape.is_none() + && !tuple.is_parameter_shape + && tuple + .elts + .iter() + .all(|element| is_constant(context, element)) + } + _ => false, + } +} + +#[cfg(test)] +mod tests { + use insta::assert_snapshot; + + use crate::refactor::RefactorKind; + use crate::refactor::test_support::RefactorTest; + + fn extract(source: &str) -> String { + RefactorTest::python(source).apply(RefactorKind::ExtractVariable) + } + + fn constant(source: &str) -> String { + RefactorTest::python(source).apply(RefactorKind::IntroduceConstant) + } + + #[test] + fn extracts_above_the_statement() { + assert_snapshot!(extract( + " + def f(items): + print(len(items) + 1) + ", + ), @" + Extract variable `value` + --- + + def f(items): + value = len(items) + 1 + print(value) + "); + } + + #[test] + fn name_comes_from_the_call() { + assert_snapshot!(extract( + " + def f(user): + return user.get_name().upper() + ", + ), @" + Extract variable `name` + --- + + def f(user): + name = user.get_name() + return name.upper() + "); + } + + #[test] + fn name_avoids_every_name_in_the_file() { + assert_snapshot!(extract( + " + value = 1 + + def f(a, b): + return a * b + value + ", + ), @" + Extract variable `value_1` + --- + + value = 1 + + def f(a, b): + value_1 = a * b + return value_1 + value + "); + } + + #[test] + fn selection_may_include_parentheses() { + assert_snapshot!(extract( + " + def f(a, b): + return (a + b) * 2 + ", + ), @" + Extract variable `value` + --- + + def f(a, b): + value = a + b + return value * 2 + "); + } + + #[test] + fn loop_condition_is_refused() { + assert_snapshot!(extract( + " + def f(queue): + while queue.pending(): + queue.pop() + ", + ), @"refused: Extract variable `pending` (the expression can't be evaluated before its statement: it is evaluated again on every iteration of the loop)"); + } + + #[test] + fn conditional_branch_is_refused() { + assert_snapshot!(extract( + " + def f(a, b): + return b.value if a else None + ", + ), @"refused: Extract variable `value` (the expression can't be evaluated before its statement: it is only evaluated when a condition holds)"); + } + + #[test] + fn lambda_body_is_refused() { + assert_snapshot!(extract( + " + def f(items): + return sorted(items, key=lambda item: item.name) + ", + ), @"refused: Extract variable `name` (the expression can't be evaluated before its statement: it is evaluated later, when the enclosing function is called)"); + } + + #[test] + fn after_an_effect_is_refused() { + assert_snapshot!(extract( + " + def f(a): + print(log(), a.value) + + def log(): ... + ", + ), @"refused: Extract variable `value` (something with effects is evaluated before the expression, which would now run after it)"); + } + + #[test] + fn after_a_name_is_allowed() { + assert_snapshot!(extract( + " + def f(a, b): + print(a, b.value) + ", + ), @" + Extract variable `value` + --- + + def f(a, b): + value = b.value + print(a, value) + "); + } + + #[test] + fn elif_condition_is_refused() { + assert_snapshot!(extract( + " + def f(a): + if a.x: + pass + elif a.y: + pass + ", + ), @"refused: Extract variable `y` (the expression can't be evaluated before its statement: it is only evaluated when a condition holds)"); + } + + #[test] + fn class_body_is_refused() { + assert_snapshot!(extract( + " + class A: + x = compute() + + def compute(): ... + ", + ), @"refused: Extract variable `compute_1` (a variable bound in a class body would become an attribute of the class)"); + } + + #[test] + fn partial_expression_is_not_offered() { + assert_snapshot!(extract( + " + def f(a, b, c): + return a + b + c + ", + ), @"not offered"); + } + + #[test] + fn assignment_target_is_not_offered() { + assert_snapshot!(extract( + " + def f(a): + a.x = 1 + ", + ), @"not offered"); + } + + #[test] + fn multiline_expression_is_parenthesized() { + assert_snapshot!(extract( + " + def f(a, b): + return g(a + + b) + + def g(x): ... + ", + ), @" + Extract variable `value` + --- + + def f(a, b): + value = (a + + b) + return g(value) + + def g(x): ... + "); + } + + #[test] + fn constant_goes_above_the_definition() { + assert_snapshot!(constant( + " + import os + + # waits a while + def wait(): + sleep(60 * 60) + + def sleep(seconds): ... + ", + ), @" + Introduce constant `VALUE` + --- + + import os + + VALUE = 60 * 60 + + + # waits a while + def wait(): + sleep(VALUE) + + def sleep(seconds): ... + "); + } + + #[test] + fn constant_is_not_offered_for_a_name() { + assert_snapshot!(constant( + " + def f(a): + return a + 1 + ", + ), @"not offered"); + } + + #[test] + fn constant_is_not_offered_for_a_mutable_display() { + assert_snapshot!(constant( + " + def f(): + return [1, 2] + ", + ), @"not offered"); + } + + /// A constant is evaluated as the module loads. This expression is evaluated only when the + /// branch it is in is taken, so hoisting it would turn a program that runs into one that + /// raises `ZeroDivisionError` on import. + #[test] + fn constant_is_not_offered_for_an_expression_that_raises() { + assert_snapshot!(constant( + " + def f(c): + return c if c else 1 / 0 + ", + ), @"not offered"); + } + + /// The same, for an expression python does not evaluate at all under `-O`. + #[test] + fn constant_is_not_offered_from_an_assert_when_it_raises() { + assert_snapshot!(constant( + " + def f(c): + assert c == 1 % 0 + ", + ), @"not offered"); + } + + /// An operation over literals that does not type-check raises `TypeError` where it is + /// written, so it is no more hoistable than one that divides by zero. + #[test] + fn constant_is_not_offered_for_an_operation_between_literals_of_different_types() { + assert_snapshot!(constant( + " + def f(c): + return c if c else 1 + \"a\" + ", + ), @"not offered"); + } + + /// Nor is a unary operator the operand does not support. + #[test] + fn constant_is_not_offered_for_an_unsupported_unary_operator() { + assert_snapshot!(constant( + " + def f(c): + return c if c else -\"a\" + ", + ), @"not offered"); + } + + /// ty folds through a `Final` name — `K + 1` is `Literal[4]` here — so the folded type alone + /// would say this is hoistable. It is not: the constant would be written above `K`, reading a + /// name that is not bound yet. The structural half of the rule is what refuses it. + #[test] + fn constant_is_not_offered_for_arithmetic_over_a_final_name() { + assert_snapshot!(constant( + " + from typing import Final + + K: Final = 3 + + def f(c): + return c if c else K + 1 + ", + ), @"not offered"); + } + + /// An arithmetic expression the checker has carried out is still hoisted: having folded it + /// to the value it produces, ty has shown that evaluating it does not raise. + #[test] + fn constant_is_offered_for_arithmetic_the_checker_folds() { + assert_snapshot!(constant( + " + def f(c): + return c if c else 60 * 60 * 24 + ", + ), @" + Introduce constant `VALUE` + --- + + VALUE = 60 * 60 * 24 + + + def f(c): + return c if c else VALUE + "); + } + + #[test] + fn augmented_assignment_value() { + assert_snapshot!(extract( + " + def f(items, tax): + total = 0 + for item in items: + total += item * tax + return total + ", + ), @" + Extract variable `value` + --- + + def f(items, tax): + total = 0 + for item in items: + value = item * tax + total += value + return total + "); + } + + #[test] + fn optional_chain_link_is_refused() { + assert_snapshot!( + RefactorTest::basedpython( + " + class User: + name: str + + def f(user: User | None): + return user?.name.upper() + ", + ) + .apply(RefactorKind::ExtractVariable), + @"refused: Extract variable `name_1` (the expression can't be evaluated before its statement: it is a link of an optional chain, which is evaluated as a whole)" + ); + } +} diff --git a/crates/ty_ide/src/refactor/flow.rs b/crates/ty_ide/src/refactor/flow.rs new file mode 100644 index 0000000000..6e75b55ad8 --- /dev/null +++ b/crates/ty_ide/src/refactor/flow.rs @@ -0,0 +1,168 @@ +//! Which bindings a name reads, from the semantic index's use-def map. + +use ruff_db::parsed::ParsedModuleRef; +use ruff_python_ast as ast; +use rustc_hash::FxHashSet; +use ty_project::Db; +use ty_python_core::definition::{Definition, DefinitionKind}; +use ty_python_core::place::ScopedPlaceId; +use ty_python_core::scope::FileScopeId; +use ty_python_core::symbol::ScopedSymbolId; +use ty_python_core::{DefinitionState, SemanticIndex}; + +/// The bindings a load of a name may read. +/// +/// Reachability is ignored, so this over-approximates: a binding that can never +/// reach the load at runtime is still listed. Every caller asks "is this load +/// guaranteed to read only these bindings?", where listing too much only makes +/// the answer more cautious. +#[derive(Debug, Default)] +pub(crate) struct Reaching<'db> { + pub(crate) definitions: Vec>, + /// Whether the load may find the name unbound or deleted. + pub(crate) maybe_unbound: bool, +} + +impl<'db> Reaching<'db> { + /// Whether the load reads `definition` and nothing else. + pub(crate) fn is_exactly(&self, definition: Definition<'db>) -> bool { + !self.maybe_unbound + && self + .definitions + .iter() + .all(|reached| *reached == definition) + && !self.definitions.is_empty() + } +} + +/// The bindings the load `name`, in `scope`, may read from that scope. +/// +/// A name that is not local to `scope` reads nothing from it, which is reported +/// as possibly unbound: the caller has to look in the scope the name resolves to. +pub(crate) fn reaching_definitions<'db>( + db: &'db dyn Db, + index: &SemanticIndex<'db>, + scope: FileScopeId, + name: &ast::ExprName, +) -> Reaching<'db> { + let Some(use_id) = index.try_use_id(ast::ExprRef::Name(name)) else { + return Reaching { + definitions: Vec::new(), + maybe_unbound: true, + }; + }; + let use_def = index.use_def_map(scope); + let mut reaching = Reaching::default(); + let mut seen = FxHashSet::default(); + let mut pending: Vec> = use_def + .bindings_at_use(use_id) + .map(|binding| binding.binding) + .collect(); + + while let Some(state) = pending.pop() { + match state { + DefinitionState::Undefined | DefinitionState::Deleted => reaching.maybe_unbound = true, + DefinitionState::Defined(definition) => { + if !seen.insert(definition) { + continue; + } + // a loop header stands for the bindings that flow back around the + // loop into its start + if let DefinitionKind::LoopHeader(header) = definition.kind(db) { + pending.extend( + use_def + .loop_header(header.loop_header_id()) + .bindings_for_place(header.place()) + .map(|live| use_def.definition(live.binding())), + ); + } else { + reaching.definitions.push(definition); + } + } + } + } + reaching +} + +/// Every definition of `symbol` in `scope` that binds a value, including the +/// synthetic ones that stand for a nested scope's `global` or `nonlocal` write. +pub(crate) fn bindings_of_symbol<'db>( + db: &'db dyn Db, + index: &SemanticIndex<'db>, + parsed: &ParsedModuleRef, + scope: FileScopeId, + symbol: ScopedSymbolId, + in_stub: bool, +) -> Vec> { + index + .use_def_map(scope) + .definitions_with_usage() + .map(|(_, definition, _)| definition) + .filter(|definition| definition.place(db) == ScopedPlaceId::Symbol(symbol)) + .filter(|definition| { + let kind = definition.kind(db); + !matches!(kind, DefinitionKind::LoopHeader(_)) + && kind.category(in_stub, parsed).is_binding() + }) + .collect() +} + +/// The scope a load of `name` in `scope` resolves to, following python's rules: +/// a class body is invisible to the scopes nested in it, `global` goes to the +/// module and `nonlocal` to an enclosing function. `None` for a name no scope in +/// the file binds, such as a builtin. +pub(crate) fn resolving_scope( + index: &SemanticIndex<'_>, + scope: FileScopeId, + name: &str, +) -> Option { + for (scope_id, _) in index.visible_ancestor_scopes(scope) { + let table = index.place_table(scope_id); + let Some(symbol_id) = table.symbol_id(name) else { + continue; + }; + let symbol = table.symbol(symbol_id); + if symbol.is_global() { + return Some(FileScopeId::global()); + } + if symbol.is_nonlocal() { + continue; + } + if symbol.is_local() { + return Some(scope_id); + } + } + None +} + +/// Whether any scope nested in `scope` declares `name` `global` or `nonlocal` +/// and so may rebind the `name` that `scope` owns. +/// +/// A `nonlocal` is counted even when it names an intermediate function's binding +/// rather than `scope`'s, which only makes callers more cautious. +pub(crate) fn rebound_from_nested_scope( + index: &SemanticIndex<'_>, + scope: FileScopeId, + name: &str, +) -> bool { + descendants(index, scope).any(|nested| { + let table = index.place_table(nested); + table.symbol_id(name).is_some_and(|symbol_id| { + let symbol = table.symbol(symbol_id); + symbol.is_bound() && ((symbol.is_global() && scope.is_global()) || symbol.is_nonlocal()) + }) + }) +} + +/// The scopes nested, at any depth, inside `scope`. +fn descendants<'a>( + index: &'a SemanticIndex<'_>, + scope: FileScopeId, +) -> impl Iterator + 'a { + let mut stack: Vec = index.child_scopes(scope).map(|(id, _)| id).collect(); + std::iter::from_fn(move || { + let next = stack.pop()?; + stack.extend(index.child_scopes(next).map(|(id, _)| id)); + Some(next) + }) +} diff --git a/crates/ty_ide/src/refactor/hazards.rs b/crates/ty_ide/src/refactor/hazards.rs new file mode 100644 index 0000000000..e134830bda --- /dev/null +++ b/crates/ty_ide/src/refactor/hazards.rs @@ -0,0 +1,125 @@ +//! basedpython constructs whose meaning depends on where they are written. +//! +//! Most of basedpython reads the same wherever it is moved to, but a few forms +//! are resolved against their surroundings rather than against what they spell: +//! a bare enum member reads its enum off the type expected where it is written, +//! a call fills `context` parameters from the declarations in scope, a name or +//! an attribute can resolve through an implicit receiver, and a trailing lambda +//! block binds names of its own. Moving code that contains one of those can +//! silently change what it means, so the refactorings that move code refuse it. + +use ruff_python_ast::visitor::source_order::{SourceOrderVisitor, TraversalSignal, walk_node}; +use ruff_python_ast::{self as ast, AnyNodeRef}; +use ty_python_semantic::types::context_params::implicit_context_arguments; +use ty_python_semantic::{HasType, SemanticModel}; + +use super::RefactorContext; + +/// The first construct in `node` whose meaning depends on where it is written, +/// described for a refusal. Always `None` outside basedpython source. +pub(crate) fn context_dependent_construct( + context: &RefactorContext<'_>, + node: AnyNodeRef<'_>, +) -> Option { + if !context.is_basedpython() { + return None; + } + let mut visitor = HazardVisitor { + model: &context.model, + found: None, + }; + walk_node(&mut visitor, node); + visitor.found +} + +struct HazardVisitor<'m, 'db> { + model: &'m SemanticModel<'db>, + found: Option, +} + +impl<'a> SourceOrderVisitor<'a> for HazardVisitor<'_, '_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if self.found.is_some() { + return TraversalSignal::Skip; + } + self.found = self.hazard(node); + if self.found.is_some() { + TraversalSignal::Skip + } else { + TraversalSignal::Traverse + } + } +} + +impl HazardVisitor<'_, '_> { + fn hazard(&self, node: AnyNodeRef<'_>) -> Option { + match node { + AnyNodeRef::ExprName(name) if name.ctx.is_load() => { + if self.model.implicit_receiver_name(name).is_some() { + return Some(format!( + "`{}` resolves through the receiver of an enclosing block", + name.id + )); + } + if self.model.context_sensitive_qualifier(name).is_some() { + return Some(format!( + "`{}` is resolved from the type expected where it is written", + name.id + )); + } + None + } + AnyNodeRef::ExprAttribute(attribute) => { + self.model.implicit_receiver_attribute(attribute).then(|| { + format!( + "`.{}` resolves through an implicit receiver in scope", + attribute.attr + ) + }) + } + AnyNodeRef::ExprCall(call) => { + let callee = call.func.inferred_type(self.model)?; + let env = self.model.program_environment(); + let arguments = implicit_context_arguments( + self.model.db(), + &env, + self.model.file(), + callee, + call, + ); + (!arguments.is_empty()).then(|| { + "a call fills `context` parameters from the declarations in scope".to_string() + }) + } + AnyNodeRef::ExprStatement(_) => { + Some("it contains a statement written as an expression".to_string()) + } + AnyNodeRef::StmtFunctionDef(function) if function.is_trailing_lambda => { + Some("it contains a trailing lambda block".to_string()) + } + _ => None, + } + } +} + +/// Whether `expr` contains a walrus, which binds a name wherever it is evaluated. +pub(crate) fn contains_named_expression(expr: &ast::Expr) -> bool { + struct Finder { + found: bool, + } + impl<'a> SourceOrderVisitor<'a> for Finder { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if node.is_expr_named() { + self.found = true; + } + if self.found { + TraversalSignal::Skip + } else { + TraversalSignal::Traverse + } + } + } + let mut finder = Finder { found: false }; + walk_node(&mut finder, AnyNodeRef::from(expr)); + finder.found +} diff --git a/crates/ty_ide/src/refactor/inline_variable.rs b/crates/ty_ide/src/refactor/inline_variable.rs new file mode 100644 index 0000000000..3cb8a6aea7 --- /dev/null +++ b/crates/ty_ide/src/refactor/inline_variable.rs @@ -0,0 +1,1121 @@ +//! Inline Variable: replace every read of a variable with the value it is +//! assigned, and remove the assignment. +//! +//! The reads are the ones the semantic index resolves to the assignment, so a +//! same-named parameter of another function, an attribute, a keyword argument, +//! a string or a comment is never touched. The rewrite is refused unless every +//! read is guaranteed to see that assignment and nothing else, and unless moving +//! the value to each read cannot change when — or how often — it is evaluated. + +use ruff_diagnostics::Edit; +use ruff_python_ast::find_node::covering_node; +use ruff_python_ast::name::Name; +use ruff_python_ast::visitor::source_order::{ + SourceOrderVisitor, TraversalSignal, walk_annotation, walk_node, +}; +use ruff_python_ast::{self as ast, AnyNodeRef, Expr, OperatorPrecedence, Stmt}; +use ruff_text_size::{Ranged, TextRange}; +use ty_python_core::definition::{Definition, DefinitionKind}; +use ty_python_core::scope::{FileScopeId, NodeWithScopeKind, ScopeKind}; +use ty_python_core::{SemanticIndex, semantic_index}; + +use super::evaluation::{NotOnce, Placement, is_pure, placement_in_statement}; +use super::flow::{ + bindings_of_symbol, reaching_definitions, rebound_from_nested_scope, resolving_scope, +}; +use super::hazards::{contains_named_expression, context_dependent_construct}; +use super::text::{statement_ancestors, suite_of}; +use super::{Plan, RefactorContext, Refusal}; +use crate::goto::find_goto_target; +use crate::references::{ReferencesMode, references}; + +pub(super) fn plan(context: &RefactorContext<'_>, range: TextRange) -> Result { + let db = context.db; + let module = context.parsed.syntax(); + if !module.range().contains_range(range) { + return Err(Refusal::NotApplicable); + } + let covering = covering_node(module.into(), range); + let AnyNodeRef::ExprName(selected) = covering.node() else { + return Err(Refusal::NotApplicable); + }; + let index = semantic_index(db, context.file); + let name = selected.id.clone(); + let title = format!("Inline variable `{name}`"); + let refuse = |reason: &str| Refusal::refused(title.clone(), reason.to_string()); + + let Some(use_scope) = index.try_expression_scope_id(&ast::ExprRef::Name(selected)) else { + return Err(Refusal::NotApplicable); + }; + let Some(scope) = resolving_scope(index, use_scope, &name) else { + return Err(Refusal::NotApplicable); + }; + let Some(symbol) = index.place_table(scope).symbol_id(&name) else { + return Err(Refusal::NotApplicable); + }; + + let in_stub = context.file().is_stub(db); + let bindings = bindings_of_symbol(db, index, &context.parsed, scope, symbol, in_stub); + let [definition] = bindings.as_slice() else { + return Err( + if bindings + .iter() + .any(|binding| is_inlinable_kind(*binding, context)) + { + refuse(&format!("`{name}` is assigned more than once")) + } else { + Refusal::NotApplicable + }, + ); + }; + let definition = *definition; + let Some(assignment) = Assignment::of(definition, context) else { + return Err(Refusal::NotApplicable); + }; + + match index.scope(scope).kind() { + ScopeKind::Function | ScopeKind::Module => {} + ScopeKind::Class => { + return Err(refuse(&format!( + "`{name}` is a class attribute, which can be read through the class and its instances" + ))); + } + _ => return Err(Refusal::NotApplicable), + } + let table = index.place_table(scope); + let symbol_flags = table.symbol(symbol); + if symbol_flags.is_global() || symbol_flags.is_nonlocal() { + return Err(Refusal::NotApplicable); + } + if rebound_from_nested_scope(index, scope, &name) { + return Err(refuse(&format!( + "`{name}` is rebound by a nested function's `global` or `nonlocal`" + ))); + } + + let statement = assignment.statement; + let Some(in_suite) = suite_of(context.parsed.suite(), statement) else { + return Err(Refusal::NotApplicable); + }; + if !context.owns_its_lines(statement) { + return Err(refuse( + "the assignment shares its line with another statement", + )); + } + + let value = assignment.value; + if let Some(reason) = context_dependent_construct(context, AnyNodeRef::from(value)) { + return Err(refuse(&format!("its value can't be moved: {reason}"))); + } + if contains_named_expression(value) { + return Err(refuse("its value binds a name with `:=`")); + } + + let reads = collect_reads(context, index, scope, &name)?; + let reads = match reads { + Ok(reads) => reads, + Err(reason) => return Err(refuse(&reason)), + }; + if reads.is_empty() { + return Err(refuse(&format!("`{name}` is never read"))); + } + + // a module's variable is also an attribute other modules can import + if scope.is_global() { + let offset = assignment.target.start(); + let Some(target) = find_goto_target(&context.model, &context.parsed, offset) else { + return Err(Refusal::NotApplicable); + }; + let found = + references(db, context.file, &target, ReferencesMode::References).unwrap_or_default(); + if found + .iter() + .any(|reference| reference.file() != context.file()) + { + return Err(refuse(&format!("`{name}` is imported by another module"))); + } + } + + for read in &reads { + if read.in_annotation { + return Err(refuse(&format!( + "`{name}` is read in an annotation, where its value would be read as a type" + ))); + } + if read.scope == scope + && !reaching_definitions(db, index, scope, read.name).is_exactly(definition) + { + return Err(refuse(&format!( + "a read of `{name}` may see another value, or none" + ))); + } + } + + let pure = is_pure(value); + if pure { + check_pure_value_is_stable(context, index, scope, &assignment, &reads, &in_suite) + .map_err(|reason| refuse(&reason))?; + } else { + check_single_immediate_read(&reads, scope, &in_suite).map_err(|reason| refuse(&reason))?; + } + + let value_text = context.expression_text(value); + let mut edits = Vec::with_capacity(reads.len() + 1); + for read in &reads { + if read.in_interpolation && value_text.contains(['"', '\'', '\\', '\n', '\r']) { + return Err(refuse( + "its value would be written inside an f-string, where its quotes or line breaks may not be allowed", + )); + } + let parenthesize = + read.in_interpolation || needs_parentheses(value, read.parent, read.name, context); + let replacement = if parenthesize { + format!("({value_text})") + } else { + value_text.to_string() + }; + edits.push(Edit::range_replacement(replacement, read.name.range())); + } + edits.push(context.delete_statement(in_suite)); + + Ok(Plan { title, edits }) +} + +/// Whether `definition` is a binding this refactoring could inline, to tell a +/// variable that is also assigned elsewhere from a name bound some other way. +fn is_inlinable_kind(definition: Definition<'_>, context: &RefactorContext<'_>) -> bool { + Assignment::of(definition, context).is_some() +} + +/// A `name = value` the refactoring can remove. +struct Assignment<'a> { + statement: &'a Stmt, + target: &'a ast::ExprName, + value: &'a Expr, +} + +impl<'a> Assignment<'a> { + fn of(definition: Definition<'_>, context: &'a RefactorContext<'_>) -> Option { + let db = context.db; + let parsed = &context.parsed; + let target_range = match definition.kind(db) { + DefinitionKind::Assignment(assignment) => { + if !assignment.is_sole_target() || assignment.unpack().is_some() { + return None; + } + assignment.target(parsed).range() + } + DefinitionKind::AnnotatedAssignment(assignment) => assignment.target(parsed).range(), + _ => return None, + }; + let statement = *statement_ancestors(parsed.suite(), target_range).last()?; + let (target, value) = match statement { + Stmt::Assign(assign) + if assign.targets.len() == 1 && assign.decorator_list.is_empty() => + { + (&assign.targets[0], &*assign.value) + } + Stmt::AnnAssign(ann_assign) + if !ann_assign.is_context && ann_assign.decorator_list.is_empty() => + { + (&*ann_assign.target, ann_assign.value.as_deref()?) + } + _ => return None, + }; + let target = target.as_name_expr()?; + (target.range() == target_range).then_some(Assignment { + statement, + target, + value, + }) + } +} + +/// A load of the variable being inlined. +struct Read<'a> { + name: &'a ast::ExprName, + parent: AnyNodeRef<'a>, + scope: FileScopeId, + in_annotation: bool, + in_interpolation: bool, +} + +/// Every load of `name` that resolves to `scope`'s variable. `Err(Ok(reason))` +/// refuses; the outer `Err` is reserved for not applying at all. +fn collect_reads<'a>( + context: &'a RefactorContext<'_>, + index: &SemanticIndex<'_>, + scope: FileScopeId, + name: &Name, +) -> Result>, String>, Refusal> { + let root: AnyNodeRef<'a> = match index.scope(scope).node() { + NodeWithScopeKind::Module => context.parsed.syntax().into(), + NodeWithScopeKind::Function(function) => function.node(&context.parsed).into(), + _ => return Err(Refusal::NotApplicable), + }; + + let mut collector = ReadCollector { + index, + scope, + name, + ancestors: Vec::new(), + annotation_depth: 0, + interpolation_depth: 0, + reads: Vec::new(), + refusal: None, + root, + }; + walk_node(&mut collector, root); + Ok(match collector.refusal { + Some(reason) => Err(reason), + None => Ok(collector.reads), + }) +} + +struct ReadCollector<'a, 'i, 'db> { + index: &'i SemanticIndex<'db>, + scope: FileScopeId, + name: &'i Name, + ancestors: Vec>, + annotation_depth: usize, + interpolation_depth: usize, + reads: Vec>, + refusal: Option, + root: AnyNodeRef<'a>, +} + +impl<'a> SourceOrderVisitor<'a> for ReadCollector<'a, '_, '_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + // `leave_node` runs for every node `enter_node` saw, skipped or not, so the + // bookkeeping is done for all of them and undone there + let skip = matches!(self.root, AnyNodeRef::StmtFunctionDef(_)) + && self.ancestors.len() == 1 + && !self.is_body_statement(node); + if is_interpolated_string(node) { + self.interpolation_depth += 1; + } + if is_type_definition(node) { + self.annotation_depth += 1; + } + if !skip + && let AnyNodeRef::ExprName(name) = node + && name.id == *self.name + { + self.name_occurrence(name); + } + self.ancestors.push(node); + // a function's decorators, defaults and annotations are evaluated in the + // scope around it, so for a function's own variable only its body counts + if skip { + TraversalSignal::Skip + } else { + TraversalSignal::Traverse + } + } + + fn leave_node(&mut self, node: AnyNodeRef<'a>) { + self.ancestors.pop(); + if is_interpolated_string(node) { + self.interpolation_depth -= 1; + } + if is_type_definition(node) { + self.annotation_depth -= 1; + } + } + + fn visit_annotation(&mut self, expr: &'a Expr) { + self.annotation_depth += 1; + walk_annotation(self, expr); + self.annotation_depth -= 1; + } +} + +fn is_interpolated_string(node: AnyNodeRef<'_>) -> bool { + matches!( + node, + AnyNodeRef::ExprFString(_) | AnyNodeRef::ExprTString(_) + ) +} + +fn is_type_definition(node: AnyNodeRef<'_>) -> bool { + matches!( + node, + AnyNodeRef::TypeParams(_) | AnyNodeRef::StmtTypeAlias(_) + ) +} + +impl<'a> ReadCollector<'a, '_, '_> { + fn is_body_statement(&self, node: AnyNodeRef<'_>) -> bool { + let AnyNodeRef::StmtFunctionDef(function) = self.root else { + return false; + }; + function + .body + .iter() + .any(|stmt| AnyNodeRef::from(stmt).ptr_eq(node)) + } + + fn name_occurrence(&mut self, name: &'a ast::ExprName) { + let Some(use_scope) = self + .index + .try_expression_scope_id(&ast::ExprRef::Name(name)) + else { + return; + }; + if resolving_scope(self.index, use_scope, &name.id) != Some(self.scope) { + return; + } + match name.ctx { + ast::ExprContext::Load => { + let Some(parent) = self.ancestors.last().copied() else { + return; + }; + self.reads.push(Read { + name, + parent, + scope: use_scope, + in_annotation: self.annotation_depth > 0, + in_interpolation: self.interpolation_depth > 0, + }); + } + ast::ExprContext::Del => { + self.refusal + .get_or_insert_with(|| format!("`{}` is deleted with `del`", name.id)); + } + ast::ExprContext::Store | ast::ExprContext::Invalid => {} + } + } +} + +/// A pure value reads names, and each read must still see what it saw at the +/// assignment. Every binding of those names in the variable's scope has to come +/// before the assignment and not be revisited by a loop around it; a read in a +/// nested function can run at any later time, so it is only allowed when the +/// assignment runs unconditionally, directly in the variable's scope. +fn check_pure_value_is_stable( + context: &RefactorContext<'_>, + index: &SemanticIndex<'_>, + scope: FileScopeId, + assignment: &Assignment<'_>, + reads: &[Read<'_>], + in_suite: &super::text::InSuite<'_>, +) -> Result<(), String> { + let db = context.db; + let statement_range = assignment.statement.range(); + let enclosing = statement_ancestors(context.parsed.suite(), statement_range); + let loops: Vec = enclosing + .iter() + .filter(|stmt| matches!(stmt, Stmt::For(_) | Stmt::While(_))) + .map(Ranged::range) + .collect(); + + let has_nested_read = reads.iter().any(|read| read.scope != scope); + if has_nested_read { + let top_level = match index.scope(scope).node() { + NodeWithScopeKind::Module => context.parsed.suite().as_slice(), + NodeWithScopeKind::Function(function) => function.node(&context.parsed).body.as_slice(), + _ => return Err("the variable's scope is not a function or a module".to_string()), + }; + if !std::ptr::eq(in_suite.suite, top_level) { + return Err(format!( + "`{}` is read by a nested function, and its assignment does not always run", + assignment.target.id + )); + } + } + + let mut names = Vec::new(); + collect_names(assignment.value, &mut names); + let in_stub = context.file().is_stub(db); + for read_name in names { + let Some(read_scope) = index + .try_expression_scope_id(&ast::ExprRef::Name(read_name)) + .and_then(|use_scope| resolving_scope(index, use_scope, &read_name.id)) + else { + // a builtin, or a name nothing binds: nothing in the file rebinds it + continue; + }; + let Some(symbol) = index.place_table(read_scope).symbol_id(&read_name.id) else { + continue; + }; + if rebound_from_nested_scope(index, read_scope, &read_name.id) { + return Err(format!( + "`{}` is rebound by a nested function's `global` or `nonlocal`", + read_name.id + )); + } + if is_deleted_in_scope(context, index, read_scope, &read_name.id) { + return Err(format!( + "`{}` is deleted with `del`, so a read moved past that would find nothing", + read_name.id + )); + } + let bindings = bindings_of_symbol(db, index, &context.parsed, read_scope, symbol, in_stub); + if read_scope != scope { + // the variable's scope reads it from an enclosing one, which may + // rebind it at any point relative to this code running + if bindings.len() > 1 { + return Err(format!( + "`{}` is assigned more than once in an enclosing scope", + read_name.id + )); + } + continue; + } + for binding in bindings { + let binding_range = binding.full_range(db, &context.parsed).range(); + let after = binding_range.start() >= statement_range.start(); + let in_loop = loops + .iter() + .any(|loop_range| loop_range.contains_range(binding_range)); + if after || (in_loop && has_nested_read) { + return Err(format!( + "`{}` may be rebound before `{}` is read", + read_name.id, assignment.target.id + )); + } + } + } + Ok(()) +} + +/// Whether anything in `scope` removes `name` with `del`. +/// +/// A `del` is not a binding, so it is not among a symbol's definitions — but it takes the name +/// away just as surely as a rebinding replaces it, and a read moved past one finds nothing: +/// +/// ```python +/// y = 1 +/// x = y +/// del y +/// return x # inlining `x` here would write `return y`, which raises +/// ``` +/// +/// Any `del` refuses, wherever it is written. One before the assignment would already have made +/// the assignment itself fail, so there is no position worth telling apart. +fn is_deleted_in_scope( + context: &RefactorContext<'_>, + index: &SemanticIndex<'_>, + scope: FileScopeId, + name: &Name, +) -> bool { + struct Deletes<'i, 'db, 'n> { + index: &'i SemanticIndex<'db>, + scope: FileScopeId, + name: &'n Name, + found: bool, + } + impl<'a> SourceOrderVisitor<'a> for Deletes<'_, '_, '_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if self.found { + return TraversalSignal::Skip; + } + if let AnyNodeRef::ExprName(name) = node + && name.ctx.is_del() + && name.id == *self.name + && self + .index + .try_expression_scope_id(&ast::ExprRef::Name(name)) + .and_then(|use_scope| resolving_scope(self.index, use_scope, &name.id)) + == Some(self.scope) + { + self.found = true; + return TraversalSignal::Skip; + } + TraversalSignal::Traverse + } + } + + let body = match index.scope(scope).node() { + NodeWithScopeKind::Module => context.parsed.suite().as_slice(), + NodeWithScopeKind::Function(function) => function.node(&context.parsed).body.as_slice(), + // a scope this refactoring does not reach: nothing to say about it + _ => return false, + }; + let mut deletes = Deletes { + index, + scope, + name, + found: false, + }; + for statement in body { + walk_node(&mut deletes, AnyNodeRef::from(statement)); + } + deletes.found +} + +fn collect_names<'a>(expr: &'a Expr, names: &mut Vec<&'a ast::ExprName>) { + struct Names<'a, 'n> { + names: &'n mut Vec<&'a ast::ExprName>, + } + impl<'a> SourceOrderVisitor<'a> for Names<'a, '_> { + fn enter_node(&mut self, node: AnyNodeRef<'a>) -> TraversalSignal { + if let AnyNodeRef::ExprName(name) = node { + self.names.push(name); + } + TraversalSignal::Traverse + } + } + walk_node(&mut Names { names }, AnyNodeRef::from(expr)); +} + +/// A value with effects is evaluated where it is written. It may move only to a +/// single read, in the statement right after the assignment, with nothing that +/// could observe the difference evaluated before the read. +fn check_single_immediate_read( + reads: &[Read<'_>], + scope: FileScopeId, + in_suite: &super::text::InSuite<'_>, +) -> Result<(), String> { + let [read] = reads else { + return Err( + "its value would be evaluated once for each read, and evaluating it may have effects" + .to_string(), + ); + }; + if read.scope != scope { + return Err( + "it is read by a nested function, which would evaluate the value when it runs" + .to_string(), + ); + } + let Some(next) = in_suite.next() else { + return Err("it is not read by the statement right after the assignment".to_string()); + }; + if !next.range().contains_range(read.name.range()) { + return Err( + "code runs between the assignment and the read, which would now run before the value is evaluated" + .to_string(), + ); + } + match placement_in_statement(next, AnyNodeRef::from(read.name)) { + Placement::Once { + effects_before: false, + } => Ok(()), + Placement::Once { + effects_before: true, + } => Err( + "something with effects is evaluated before the read, and would now run before the value" + .to_string(), + ), + Placement::NotOnce(reason) => Err(format!( + "the read can't take the value's evaluation: {}", + match reason { + NotOnce::Body => "it is inside the body of the next statement", + other => other.describe(), + } + )), + } +} + +/// Whether `value`, written in place of `read`, needs parentheses to keep +/// meaning what it means as the assignment's value. +fn needs_parentheses( + value: &Expr, + parent: AnyNodeRef<'_>, + read: &ast::ExprName, + context: &RefactorContext<'_>, +) -> bool { + let bracketed = matches!( + value, + Expr::List(_) + | Expr::ListComp(_) + | Expr::Dict(_) + | Expr::DictComp(_) + | Expr::Set(_) + | Expr::SetComp(_) + ) || matches!(value, Expr::Tuple(tuple) if tuple.parenthesized) + || matches!(value, Expr::Generator(generator) if generator.parenthesized); + if !bracketed && context.is_multiline(value.range()) { + return true; + } + if bracketed { + return false; + } + let atomic = match value { + Expr::Name(_) + | Expr::BooleanLiteral(_) + | Expr::NoneLiteral(_) + | Expr::EllipsisLiteral(_) => true, + Expr::Call(call) => call.cast_kind.is_none() && !call.is_string_tag, + Expr::Attribute(attribute) => !attribute.optional, + Expr::Subscript(subscript) => !subscript.is_typeof && !subscript.is_type_decoration, + Expr::StringLiteral(string) => !string.value.is_implicit_concatenated(), + Expr::BytesLiteral(bytes) => !bytes.value.is_implicit_concatenated(), + Expr::FString(fstring) => !fstring.value.is_implicit_concatenated(), + _ => false, + }; + if atomic { + return false; + } + if !is_free_position(parent, read) { + return true; + } + match value { + Expr::Tuple(_) => !matches!( + parent, + AnyNodeRef::StmtExpr(_) | AnyNodeRef::StmtReturn(_) | AnyNodeRef::StmtAssign(_) + ), + Expr::Generator(_) => true, + _ => OperatorPrecedence::from_expr(value) <= OperatorPrecedence::Starred, + } +} + +/// Whether a read is a whole expression on its own — a statement's value, an +/// argument, an element — rather than an operand of something that binds. +fn is_free_position(parent: AnyNodeRef<'_>, read: &ast::ExprName) -> bool { + let range = read.range(); + match parent { + AnyNodeRef::StmtExpr(_) + | AnyNodeRef::StmtReturn(_) + | AnyNodeRef::StmtAssign(_) + | AnyNodeRef::StmtAnnAssign(_) + | AnyNodeRef::StmtAugAssign(_) + | AnyNodeRef::StmtIf(_) + | AnyNodeRef::ElifElseClause(_) + | AnyNodeRef::StmtWhile(_) + | AnyNodeRef::StmtFor(_) + | AnyNodeRef::StmtMatch(_) + | AnyNodeRef::StmtRaise(_) + | AnyNodeRef::WithItem(_) + | AnyNodeRef::Keyword(_) + | AnyNodeRef::Arguments(_) + | AnyNodeRef::ExprList(_) + | AnyNodeRef::ExprSet(_) + | AnyNodeRef::ExprDict(_) => true, + AnyNodeRef::ExprTuple(tuple) => tuple.parenthesized, + AnyNodeRef::ExprSubscript(subscript) => subscript.slice.range() == range, + _ => false, + } +} + +#[cfg(test)] +mod tests { + use insta::assert_snapshot; + + use crate::refactor::RefactorKind; + use crate::refactor::test_support::RefactorTest; + + fn inline(source: &str) -> String { + RefactorTest::python(source).apply(RefactorKind::InlineVariable) + } + + #[test] + fn replaces_only_reads_the_assignment_reaches() { + assert_snapshot!(inline( + r#" + class Point: + x = 0 + + def other(x=1): + return x + + def f(obj): + x = compute() + print(x, obj.x, other(x=2), "x") # x + return obj + + def compute(): ... + "#, + ), @r#" + Inline variable `x` + --- + + class Point: + x = 0 + + def other(x=1): + return x + + def f(obj): + print(compute(), obj.x, other(x=2), "x") # x + return obj + + def compute(): ... + "#); + } + + #[test] + fn value_stops_before_trailing_comment() { + assert_snapshot!(inline( + " + def f(): + x = 1 # note + print(x) + ", + ), @" + Inline variable `x` + --- + + def f(): + print(1) + "); + } + + #[test] + fn pure_value_inlines_into_every_read() { + assert_snapshot!(inline( + " + def f(a): + x = a + print(x) + return x + x + ", + ), @" + Inline variable `x` + --- + + def f(a): + print(a) + return a + a + "); + } + + #[test] + fn operator_value_is_parenthesized_under_a_tighter_operator() { + assert_snapshot!(inline( + " + def f(a, b): + x = a + b + return x * 2 + ", + ), @" + Inline variable `x` + --- + + def f(a, b): + return (a + b) * 2 + "); + } + + #[test] + fn value_with_effects_is_refused_for_two_reads() { + assert_snapshot!(inline( + " + def f(): + x = compute() + print(x) + print(x) + + def compute(): ... + ", + ), @"refused: Inline variable `x` (its value would be evaluated once for each read, and evaluating it may have effects)"); + } + + #[test] + fn value_with_effects_is_refused_when_code_runs_in_between() { + assert_snapshot!(inline( + " + def f(): + x = compute() + log() + return x + + def compute(): ... + def log(): ... + ", + ), @"refused: Inline variable `x` (code runs between the assignment and the read, which would now run before the value is evaluated)"); + } + + #[test] + fn value_with_effects_is_refused_after_an_earlier_call_in_the_statement() { + assert_snapshot!(inline( + " + def f(): + x = compute() + print(log(), x) + + def compute(): ... + def log(): ... + ", + ), @"refused: Inline variable `x` (something with effects is evaluated before the read, and would now run before the value)"); + } + + #[test] + fn value_with_effects_is_refused_into_a_loop_condition() { + assert_snapshot!(inline( + " + def f(): + x = compute() + while x: + pass + + def compute(): ... + ", + ), @"refused: Inline variable `x` (the read can't take the value's evaluation: it is evaluated again on every iteration of the loop)"); + } + + #[test] + fn reassigned_variable_is_refused() { + assert_snapshot!(inline( + " + def f(): + x = 1 + x = 2 + return x + ", + ), @"refused: Inline variable `x` (`x` is assigned more than once)"); + } + + #[test] + fn augmented_variable_is_refused() { + assert_snapshot!(inline( + " + def f(items): + total = 0 + for item in items: + total += item + return total + ", + ), @"refused: Inline variable `total` (`total` is assigned more than once)"); + } + + #[test] + fn single_assignment_is_per_scope() { + assert_snapshot!(inline( + " + def f(): + x = 1 + return x + + def g(): + x = 2 + return x + ", + ), @" + Inline variable `x` + --- + + def f(): + return 1 + + def g(): + x = 2 + return x + "); + } + + #[test] + fn read_that_may_see_no_value_is_refused() { + assert_snapshot!(inline( + " + def f(flag): + if flag: + x = 1 + return x + ", + ), @"refused: Inline variable `x` (a read of `x` may see another value, or none)"); + } + + #[test] + fn rebound_operand_is_refused() { + assert_snapshot!(inline( + " + def f(a): + x = a + a = 2 + return x + ", + ), @"refused: Inline variable `x` (`a` may be rebound before `x` is read)"); + } + + #[test] + fn sole_statement_becomes_pass() { + assert_snapshot!(inline( + " + def f(a, lock): + with lock: + x = a + return x + ", + ), @" + Inline variable `x` + --- + + def f(a, lock): + with lock: + pass + return a + "); + } + + #[test] + fn number_is_parenthesized_as_a_receiver() { + assert_snapshot!(inline( + " + def f(): + x = 1 + return x.real + ", + ), @" + Inline variable `x` + --- + + def f(): + return (1).real + "); + } + + #[test] + fn module_variable_imported_elsewhere_is_refused() { + let test = RefactorTest::with_files( + "main.py", + " + X = 1 + print(X) + ", + &[("other.py", "from main import X\n")], + ); + assert_snapshot!(test.apply(RefactorKind::InlineVariable), @"refused: Inline variable `X` (`X` is imported by another module)"); + } + + #[test] + fn module_variable_read_by_a_function() { + assert_snapshot!(inline( + " + X = 1 + + def f(): + return X + ", + ), @" + Inline variable `X` + --- + + + def f(): + return 1 + "); + } + + #[test] + fn class_attribute_is_refused() { + assert_snapshot!(inline( + " + class A: + x = 1 + y = x + ", + ), @"refused: Inline variable `x` (`x` is a class attribute, which can be read through the class and its instances)"); + } + + #[test] + fn parameter_is_not_offered() { + assert_snapshot!(inline( + " + def f(x): + return x + ", + ), @"not offered"); + } + + #[test] + fn nested_function_read_of_conditional_assignment_is_refused() { + assert_snapshot!(inline( + " + def f(a, flag): + if flag: + x = a + return lambda: x + ", + ), @"refused: Inline variable `x` (`x` is read by a nested function, and its assignment does not always run)"); + } + + #[test] + fn tuple_value_keeps_its_parentheses_as_an_argument() { + assert_snapshot!(inline( + " + def f(a, b): + x = a, b + print(x) + ", + ), @" + Inline variable `x` + --- + + def f(a, b): + print((a, b)) + "); + } + + #[test] + fn loop_variable_read_in_the_same_iteration() { + assert_snapshot!(inline( + " + def f(items): + for item in items: + x = item + print(x) + ", + ), @" + Inline variable `x` + --- + + def f(items): + for item in items: + print(item) + "); + } + + #[test] + fn deleted_variable_is_refused() { + assert_snapshot!(inline( + " + def f(a): + x = a + print(x) + del x + ", + ), @"refused: Inline variable `x` (`x` is deleted with `del`)"); + } + + /// The name the value reads is deleted too, and a `del` is not a rebinding — nothing in the + /// symbol's definitions records it. Inlining here would write `return y` below `del y`, which + /// raises where the original returned `1`. + #[test] + fn deleted_name_in_the_value_is_refused() { + assert_snapshot!(inline( + " + def f(): + y = 1 + x = y + del y + return x + ", + ), @"refused: Inline variable `x` (`y` is deleted with `del`, so a read moved past that would find nothing)"); + } + + /// The same when the read is in a nested function, which would call back to a name the + /// enclosing scope has since given up. + #[test] + fn deleted_name_in_the_value_is_refused_for_a_nested_read() { + assert_snapshot!(inline( + " + def f(): + y = 1 + x = y + def g(): + return x + del y + return g + ", + ), @"refused: Inline variable `x` (`y` is deleted with `del`, so a read moved past that would find nothing)"); + } + + #[test] + fn read_in_fstring_is_parenthesized() { + assert_snapshot!(inline( + r#" + def f(a, b): + x = a + return f"{x}" + "#, + ), @r#" + Inline variable `x` + --- + + def f(a, b): + return f"{(a)}" + "#); + } +} diff --git a/crates/ty_ide/src/refactor/names.rs b/crates/ty_ide/src/refactor/names.rs new file mode 100644 index 0000000000..18a95e9d40 --- /dev/null +++ b/crates/ty_ide/src/refactor/names.rs @@ -0,0 +1,142 @@ +//! Names for what a refactoring introduces. +//! +//! A code action cannot ask for a name, so a refactoring that introduces a +//! binding picks one the file does not already use anywhere — not in any scope, +//! not as a builtin it reads — which is what makes it impossible for the new +//! binding to capture or shadow a name some other code resolves. + +use ruff_python_ast::{self as ast, Expr}; +use ruff_python_stdlib::builtins::is_python_builtin; +use ruff_python_stdlib::identifiers::is_identifier; +use ruff_python_stdlib::keyword::is_keyword; +use rustc_hash::FxHashSet; +use ty_python_core::semantic_index; + +use super::RefactorContext; + +/// The words basedpython reads as keywords in some position, which a name +/// introduced by a refactoring stays clear of. +const BASEDPYTHON_WORDS: &[&str] = &[ + "let", + "var", + "it", + "init", + "data", + "frozen", + "extension", + "sealed", + "open", + "override", + "static", + "export", + "public", + "private", + "protected", + "late", + "context", + "protocol", + "enum", + "some", + "dynamic", + "typeof", + "literal", + "final", + "abstract", +]; + +/// Every name some scope of the file binds, declares or reads. +pub(crate) fn names_in_file(context: &RefactorContext<'_>) -> FxHashSet { + let index = semantic_index(context.db, context.file); + let mut names = FxHashSet::default(); + for scope in index.scope_ids() { + let table = index.place_table(scope.file_scope_id(context.db)); + names.extend(table.symbols().map(|symbol| symbol.name().to_string())); + } + names +} + +/// `base`, or `base` with the smallest numeric suffix, that `taken` lacks. +pub(crate) fn fresh_name(base: &str, taken: &FxHashSet) -> String { + let usable = |name: &str| { + is_identifier(name) + && !is_keyword(name) + && !BASEDPYTHON_WORDS.contains(&name) + && !name.starts_with("__") + && !taken.contains(name) + }; + if usable(base) { + return base.to_string(); + } + let mut suffix = 1; + loop { + let candidate = format!("{base}_{suffix}"); + if usable(&candidate) { + return candidate; + } + suffix += 1; + } +} + +/// A name that says what `expr` evaluates to, in snake case. +pub(crate) fn suggest_for_expression(expr: &Expr, python_version_minor: u8) -> String { + let named = match expr { + Expr::Call(call) => callee_name(&call.func).map(|name| { + name.strip_prefix("get_") + .filter(|rest| !rest.is_empty()) + .unwrap_or(name) + .to_string() + }), + Expr::Attribute(attribute) => Some(attribute.attr.id.to_string()), + Expr::Subscript(subscript) => match &*subscript.value { + Expr::Name(name) => Some(format!("{}_item", name.id)), + Expr::Attribute(attribute) => Some(format!("{}_item", attribute.attr.id)), + _ => None, + }, + Expr::Await(await_expr) => { + return suggest_for_expression(&await_expr.value, python_version_minor); + } + _ => None, + }; + let fallback = match expr { + Expr::StringLiteral(_) | Expr::FString(_) => "text", + Expr::NumberLiteral(_) => "number", + Expr::BooleanLiteral(_) | Expr::Compare(_) | Expr::BoolOp(_) => "condition", + Expr::List(_) | Expr::ListComp(_) => "items", + Expr::Set(_) | Expr::SetComp(_) => "elements", + Expr::Dict(_) | Expr::DictComp(_) => "mapping", + Expr::Tuple(_) => "values", + Expr::Lambda(_) => "function", + Expr::Generator(_) => "generator", + _ => "value", + }; + named + .map(|name| to_snake_case(&name)) + .filter(|name| is_identifier(name) && !is_python_builtin(name, python_version_minor, false)) + .unwrap_or_else(|| fallback.to_string()) +} + +fn callee_name(func: &Expr) -> Option<&str> { + match func { + Expr::Name(ast::ExprName { id, .. }) => Some(id.as_str()), + Expr::Attribute(attribute) => Some(attribute.attr.id.as_str()), + _ => None, + } +} + +fn to_snake_case(name: &str) -> String { + let mut snake = String::with_capacity(name.len() + 4); + let mut previous_lower = false; + for character in name.chars() { + if character.is_uppercase() { + if previous_lower { + snake.push('_'); + } + snake.extend(character.to_lowercase()); + previous_lower = false; + } else { + snake.push(character); + previous_lower = character.is_lowercase() || character.is_ascii_digit(); + } + } + snake +} diff --git a/crates/ty_ide/src/refactor/return_annotation.rs b/crates/ty_ide/src/refactor/return_annotation.rs new file mode 100644 index 0000000000..37f044e144 --- /dev/null +++ b/crates/ty_ide/src/refactor/return_annotation.rs @@ -0,0 +1,243 @@ +//! Add Return Annotation: write the return type ty infers for a `def` that +//! leaves it out, as the file would spell it, importing what it names. + +use ruff_diagnostics::Edit; +use ruff_python_ast::find_node::covering_node; +use ruff_python_ast::{AnyNodeRef, StmtFunctionDef}; +use ruff_text_size::{Ranged, TextRange}; +use ty_python_semantic::types::ide_support::inferred_return_type; + +use super::{Plan, RefactorContext, Refusal}; +use crate::inlay_hints::annotation_for_type; + +pub(super) fn plan(context: &RefactorContext<'_>, range: TextRange) -> Result { + let module = context.parsed.syntax(); + if !module.range().contains_range(range) { + return Err(Refusal::NotApplicable); + } + let covering = covering_node(module.into(), range); + let Some(function) = covering.ancestors().find_map(|node| match node { + AnyNodeRef::StmtFunctionDef(function) if header(function).contains_range(range) => { + Some(function) + } + _ => None, + }) else { + return Err(Refusal::NotApplicable); + }; + if function.returns.is_some() + || function.is_asserts_return + || function.is_trailing_lambda + // a property declaration names its type after the name, not after `->` + || function.property_construct_range().is_some() + // a definition the parser recovered has no header to write into + || function.name.range().is_empty() + { + return Err(Refusal::NotApplicable); + } + + let title = "Add return annotation"; + let Some(returned) = inferred_return_type(&context.model, function) else { + return Err(Refusal::refused( + title, + "ty could not infer what the function returns", + )); + }; + // the annotation is evaluated in the scope around the definition + let Some((annotation, imports)) = annotation_for_type( + context.db, + context.file, + AnyNodeRef::from(function), + function.start(), + returned, + ) else { + return Err(Refusal::refused( + title, + "the inferred return type has no spelling this file can write", + )); + }; + + let mut edits = vec![Edit::insertion( + format!(" -> {annotation}"), + function.parameters.end(), + )]; + edits.extend( + imports + .into_iter() + .map(|import| Edit::range_replacement(import.new_text, import.range)), + ); + Ok(Plan { + title: format!("Add return annotation `-> {annotation}`"), + edits, + }) +} + +/// The part of a `def` before its body: the modifiers, name, type parameters, +/// parameters and anything written after them. +fn header(function: &StmtFunctionDef) -> TextRange { + let end = function + .raises + .as_deref() + .map_or(function.parameters.end(), Ranged::end); + TextRange::new(function.start(), end) +} + +#[cfg(test)] +mod tests { + use insta::assert_snapshot; + + use crate::refactor::RefactorKind; + use crate::refactor::test_support::RefactorTest; + + fn annotate(source: &str) -> String { + RefactorTest::python(source).apply(RefactorKind::AddReturnAnnotation) + } + + #[test] + fn writes_the_inferred_type() { + assert_snapshot!(annotate( + " + def f(x: int): + return x + 1 + ", + ), @" + Add return annotation `-> int` + --- + + def f(x: int) -> int: + return x + 1 + "); + } + + /// basedpython writes `-> T` before a `raises` clause, so the annotation goes after the + /// parameters rather than at the end of the header. + #[test] + fn the_annotation_goes_before_a_raises_clause() { + assert_snapshot!( + RefactorTest::basedpython( + " + def f(x: int) raises ValueError: + if x < 0: + raise ValueError + return x + ", + ) + .apply(RefactorKind::AddReturnAnnotation), + @" + Add return annotation `-> int` + --- + + def f(x: int) -> int raises ValueError: + if x < 0: + raise ValueError + return x + " + ); + } + + #[test] + fn writes_none_for_a_function_returning_nothing() { + assert_snapshot!(annotate( + " + def f(x: int): + print(x) + ", + ), @" + Add return annotation `-> None` + --- + + def f(x: int) -> None: + print(x) + "); + } + + #[test] + fn imports_a_type_from_another_module() { + let test = RefactorTest::with_files( + "main.py", + " + from shapes import make + + def f(): + return make() + ", + &[( + "shapes.py", + " + class Circle: ... + + def make() -> Circle: ... + ", + )], + ); + assert_snapshot!(test.apply(RefactorKind::AddReturnAnnotation), @" + Add return annotation `-> Circle` + --- + + from shapes import make, Circle + + def f() -> Circle: + return make() + "); + } + + #[test] + fn async_function_is_annotated_with_what_it_returns() { + assert_snapshot!(annotate( + " + async def f(): + return 1 + ", + ), @" + Add return annotation `-> Literal[1]` + --- + from typing import Literal + + async def f() -> Literal[1]: + return 1 + "); + } + + #[test] + fn annotated_function_is_not_offered() { + assert_snapshot!(annotate( + " + def f() -> int: + return 1 + ", + ), @"not offered"); + } + + #[test] + fn body_is_not_the_header() { + assert_snapshot!(annotate( + " + def f(): + return 1 + ", + ), @"not offered"); + } + + #[test] + fn basedpython_writes_the_type_in_its_own_spelling() { + assert_snapshot!( + RefactorTest::basedpython( + " + def f(flag: bool): + if flag: + return 1 + return None + ", + ) + .apply(RefactorKind::AddReturnAnnotation), + @" + Add return annotation `-> 1 | None` + --- + + def f(flag: bool) -> 1 | None: + if flag: + return 1 + return None + " + ); + } +} diff --git a/crates/ty_ide/src/refactor/text.rs b/crates/ty_ide/src/refactor/text.rs new file mode 100644 index 0000000000..77db923036 --- /dev/null +++ b/crates/ty_ide/src/refactor/text.rs @@ -0,0 +1,166 @@ +//! Locating statements in their suites and spelling the edits that move them. + +use ruff_diagnostics::Edit; +use ruff_python_ast::token::parenthesized_range; +use ruff_python_ast::{self as ast, AnyNodeRef, Expr, ExprRef, Stmt}; +use ruff_python_trivia::{PythonWhitespace, indentation_at_offset}; +use ruff_source_file::LineRanges; +use ruff_text_size::{Ranged, TextRange, TextSize}; + +use super::RefactorContext; + +/// A statement together with the suite it is written in. +#[derive(Clone, Copy)] +pub(crate) struct InSuite<'a> { + pub(crate) suite: &'a [Stmt], + pub(crate) index: usize, +} + +impl<'a> InSuite<'a> { + fn statement(&self) -> &'a Stmt { + &self.suite[self.index] + } + + pub(crate) fn next(&self) -> Option<&'a Stmt> { + self.suite.get(self.index + 1) + } +} + +/// The suite `statement` is written in, found by identity. +pub(crate) fn suite_of<'a>(body: &'a [Stmt], statement: &Stmt) -> Option> { + for (index, candidate) in body.iter().enumerate() { + if std::ptr::eq(candidate, statement) { + return Some(InSuite { suite: body, index }); + } + if !candidate.range().contains_range(statement.range()) { + continue; + } + for nested in nested_suites(candidate) { + if let Some(found) = suite_of(nested, statement) { + return Some(found); + } + } + } + None +} + +/// The suites written directly inside `statement`. +pub(crate) fn nested_suites(statement: &Stmt) -> Vec<&[Stmt]> { + match statement { + Stmt::FunctionDef(stmt) => vec![&stmt.body], + Stmt::ClassDef(stmt) => vec![&stmt.body], + Stmt::For(stmt) => vec![&stmt.body, &stmt.orelse], + Stmt::While(stmt) => vec![&stmt.body, &stmt.orelse], + Stmt::If(stmt) => std::iter::once(&*stmt.body) + .chain(stmt.elif_else_clauses.iter().map(|clause| &*clause.body)) + .collect(), + Stmt::With(stmt) => vec![&stmt.body], + Stmt::Match(stmt) => stmt.cases.iter().map(|case| &*case.body).collect(), + Stmt::Try(stmt) => std::iter::once(&*stmt.body) + .chain(stmt.handlers.iter().map(|handler| { + let ast::ExceptHandler::ExceptHandler(handler) = handler; + &*handler.body + })) + .chain([&*stmt.orelse, &*stmt.finalbody]) + .collect(), + Stmt::Let(stmt) => vec![&stmt.orelse], + _ => Vec::new(), + } +} + +/// The innermost statement containing `range`, with its ancestors, outermost first. +pub(crate) fn statement_ancestors(body: &[Stmt], range: TextRange) -> Vec<&Stmt> { + let mut ancestors = Vec::new(); + let mut suite = body; + 'descend: loop { + for statement in suite { + if statement.range().contains_range(range) { + ancestors.push(statement); + for nested in nested_suites(statement) { + if nested.iter().any(|stmt| stmt.range().contains_range(range)) { + suite = nested; + continue 'descend; + } + } + break 'descend; + } + } + break; + } + ancestors +} + +impl RefactorContext<'_> { + /// Whether `statement` is alone on its lines: nothing but indentation before + /// it and nothing but a comment after it. + pub(crate) fn owns_its_lines(&self, node: impl Ranged) -> bool { + let source = self.source(); + let range = node.range(); + indentation_at_offset(range.start(), source).is_some() + && source[TextRange::new(range.end(), source.line_end(range.end()))] + .trim_whitespace_start() + .chars() + .next() + .is_none_or(|first| first == '#') + } + + /// The indentation `node` is written at. + pub(crate) fn indentation(&self, node: impl Ranged) -> &str { + let source = self.source(); + let start = node.range().start(); + &source[TextRange::new(source.line_start(start), start)] + } + + /// An edit that removes `statement` from `in_suite`, lines and trailing comment + /// included, or replaces it with `pass` when it is all the suite holds. + pub(crate) fn delete_statement(&self, in_suite: InSuite<'_>) -> Edit { + let statement = in_suite.statement(); + if in_suite.suite.len() == 1 { + let source = self.source(); + let end = source.line_end(statement.end()); + return Edit::replacement("pass".to_string(), statement.start(), end); + } + Edit::range_deletion(self.source().full_lines_range(statement.range())) + } + + /// The source of `expr`, without any parentheses around it. + pub(crate) fn expression_text(&self, expr: &Expr) -> &str { + &self.source()[expr.range()] + } + + /// The range of `expr` including any parentheses written around it. + pub(crate) fn parenthesized_range(&self, expr: &Expr, parent: AnyNodeRef<'_>) -> TextRange { + parenthesized_range(ExprRef::from(expr), parent, self.parsed.tokens()) + .unwrap_or_else(|| expr.range()) + } + + pub(crate) fn line_ending(&self) -> &'static str { + self.stylist.line_ending().as_str() + } + + /// One level of indentation, as the file writes it. + pub(crate) fn indent_unit(&self) -> &str { + self.stylist.indentation().as_str() + } + + /// Whether the text at `range` spans more than one line. + pub(crate) fn is_multiline(&self, range: TextRange) -> bool { + self.source().contains_line_break(range) + } +} + +/// Where the comment lines directly above `offset`'s line begin, so a new +/// statement does not separate a definition from its comment. +pub(crate) fn leading_comments_start(source: &str, offset: TextSize) -> TextSize { + let mut start = source.line_start(offset); + while start > TextSize::default() { + let previous = source.line_start(start - TextSize::from(1)); + let line = &source[TextRange::new(previous, start)]; + if line.trim_whitespace().starts_with('#') { + start = previous; + } else { + break; + } + } + start +} diff --git a/crates/ty_ide/src/syntax_outline.rs b/crates/ty_ide/src/syntax_outline.rs new file mode 100644 index 0000000000..018579c44c --- /dev/null +++ b/crates/ty_ide/src/syntax_outline.rs @@ -0,0 +1,1269 @@ +//! The block structure and string literals of a file, as the parser sees them. +//! +//! An editor needs a handful of lexical facts to type in an indentation-delimited language: which +//! line opens a suite, where a compound statement ends, which clause keywords belong together, +//! what a string literal's escapes and interpolations are, and how much of a triple-quoted +//! string's indentation basedpython strips. Every one of those is decided by the parser, and an +//! editor that works them out again from the text gets them subtly different — a `match = 1` +//! read as a `match` statement, a `:` inside a string read as the end of a header, a margin drawn +//! where nothing is stripped. So they are read off the parse tree and its tokens here. + +use ruff_db::PythonFile; +use ruff_db::parsed::parsed_module; +use ruff_db::source::source_text; +use ruff_python_ast::token::{TokenKind, Tokens, parenthesized_range}; +use ruff_python_ast::visitor::source_order::{ + SourceOrderVisitor, walk_expr, walk_f_string, walk_t_string, +}; +use ruff_python_ast::{ + self as ast, AnyNodeRef, AnyStringFlags, Expr, InterpolatedStringElement, + InterpolatedStringElements, Stmt, StringFlags, +}; +use ruff_python_trivia::basedpython::{TripleQuotedDedent, dedent_triple_quoted_body}; +use ruff_text_size::{Ranged, TextRange, TextSize}; + +use crate::Db; + +/// The block structure and string literals of one file. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct SyntaxOutline { + /// The module's statements, in source order, each carrying the suites nested under it. + pub statements: Vec, + /// Every string literal part in the file, in source order. + pub strings: Vec, +} + +/// One statement. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct OutlineStatement { + /// The whole statement: from its first token (a decorator, for a decorated definition) to + /// the end of its last clause's body. + pub range: TextRange, + /// The clauses of a compound statement, in source order. Empty for a simple statement. + pub clauses: Vec, + /// The basedpython modifiers the definition was declared with (`data`, `frozen data`, + /// `enum class`, `class` in `class def`, ...), in source order. + pub modifiers: Vec, + /// For an expression statement that is a call, the call. + pub call: Option, +} + +/// One clause of a compound statement: `if`, `elif`, `else`, `case`, the `def` of a function. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct OutlineClause { + /// The clause keyword. `None` for a clause that has none, which is a basedpython trailing + /// lambda (`items.each:`). + pub keyword: Option, + /// The `:` that ends the header and opens the suite. `None` when there is none to find, which + /// is a header the parser recovered from, or the `let` clause of a `let ... := ... else:`. + pub colon: Option, + /// From the start of the header to the end of the body — or of the header, when the body is + /// empty. + pub range: TextRange, + /// The statements of the suite. + pub body: Vec, +} + +/// A basedpython modifier keyword, as the parser read it. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct OutlineModifier { + /// The keyword or keywords, without the whitespace that follows them. + pub range: TextRange, + /// What the parser recorded it as, e.g. `data_class`, `frozen_data_class`, `enum_def`, + /// `classmethod`, `protocol_class`, `final`. + pub name: String, +} + +/// A call made as a statement of its own. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct OutlineCall { + /// The expression being called. + pub callee: TextRange, + /// From the start of the first argument to the end of the last, parentheses around either + /// included. `None` for a call with no arguments. + pub arguments: Option, + /// Whether every argument is positional and none is unpacked with `*` or `**`. + pub positional_only: bool, +} + +/// One string literal part: one pair of quotes and what is between them. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct OutlineString { + /// The part, prefix and quotes included. + pub range: TextRange, + /// How many leading characters basedpython strips from each line of this literal, when it + /// strips any. + /// + /// The rule is [`dedent_triple_quoted_body`]'s, the one the transpiler applies, so this is + /// set exactly when the program's string differs from the literal as written: a lone + /// triple-quoted string in a basedpython file whose content starts on the line after the + /// opening quotes and whose closing quotes sit on a line of their own. + pub stripped_indent: Option, + /// The `{...}` interpolations of an f-string or t-string, braces included. + pub interpolations: Vec, + /// The escape sequences in the literal text. A backslash Python does not recognise is still + /// reported, as two characters: Python keeps it verbatim, and that is worth seeing. + pub escapes: Vec, +} + +/// The outline of `file`. +pub fn syntax_outline(db: &dyn Db, file: PythonFile<'_>) -> SyntaxOutline { + let parsed = parsed_module(db, file).load(db); + let source = source_text(db, file.file(db)); + let builder = OutlineBuilder { + source: source.as_str(), + tokens: parsed.tokens(), + }; + + let statements = builder.statements(parsed.suite()); + + let mut strings = StringCollector { + source: source.as_str(), + dedents: file.file(db).source_type(db).is_basedpython(), + dedentable: None, + strings: Vec::new(), + }; + strings.visit_body(parsed.suite()); + + SyntaxOutline { + statements, + strings: strings.strings, + } +} + +/// The keywords that light up together with the keyword at `offset`, in source order. +/// +/// That is a compound statement's clause keywords (`if`/`elif`/`else`, `try`/`except`/`finally`, +/// `match`/`case`, a loop and its `else`), plus the statements that leave a block from inside +/// its body: a `def`'s `return`s and `raise`s, a loop's `break`s and `continue`s. Each of those +/// binds to the nearest enclosing block of its kind, so a nested `def` keeps its own `return`s and +/// a nested loop its own `break`s; a `break` in a loop's `else` belongs to the loop outside it, +/// since that clause is not the loop's body. +/// +/// `None` when `offset` is not on such a keyword, or the keyword has nothing to pair with. +pub(crate) fn keyword_family( + db: &dyn Db, + file: PythonFile<'_>, + offset: TextSize, +) -> Option> { + let parsed = parsed_module(db, file).load(db); + let source = source_text(db, file.file(db)); + let tokens = parsed.tokens(); + + let keyword = keyword_at(tokens, offset)?; + let builder = OutlineBuilder { + source: source.as_str(), + tokens, + }; + let mut path = Vec::new(); + let mut family = builder.family(parsed.suite(), keyword, &mut path)?; + if family.len() < 2 { + return None; + } + family.sort_by_key(ruff_text_size::Ranged::start); + Some(family) +} + +/// The keyword token touching `offset`, if there is one a family can start from. +fn keyword_at(tokens: &Tokens, offset: TextSize) -> Option { + let is_family_keyword = |kind: TokenKind| { + matches!( + kind, + TokenKind::If + | TokenKind::Elif + | TokenKind::Else + | TokenKind::For + | TokenKind::While + | TokenKind::Try + | TokenKind::Except + | TokenKind::Finally + | TokenKind::Match + | TokenKind::Case + | TokenKind::Def + | TokenKind::Return + | TokenKind::Raise + | TokenKind::Break + | TokenKind::Continue + ) + }; + let index = tokens.partition_point(|token| token.end() < offset); + tokens[index..] + .iter() + .take_while(|token| token.start() <= offset) + .find(|token| is_family_keyword(token.kind())) + .map(Ranged::range) +} + +struct OutlineBuilder<'a> { + source: &'a str, + tokens: &'a Tokens, +} + +impl OutlineBuilder<'_> { + fn statements(&self, suite: &[Stmt]) -> Vec { + suite.iter().map(|stmt| self.statement(stmt)).collect() + } + + fn statement(&self, stmt: &Stmt) -> OutlineStatement { + OutlineStatement { + range: stmt.range(), + clauses: self.clauses(stmt), + modifiers: self.modifiers(stmt), + call: self.call(stmt), + } + } + + /// The clauses of `stmt`, each with its body. + fn clauses(&self, stmt: &Stmt) -> Vec { + self.clause_heads(stmt) + .into_iter() + .map(|head| { + let body = self.statements(head.body); + OutlineClause { + keyword: head.keyword, + colon: head.colon, + range: head.range, + body, + } + }) + .collect() + } + + /// The clauses of `stmt` without their bodies' outlines, which is all a family needs. + fn clause_heads<'s>(&self, stmt: &'s Stmt) -> Vec> { + let mut heads = Vec::new(); + match stmt { + Stmt::If(if_stmt) => { + let keyword = self.token_at(if_stmt.start()); + heads.push(self.head(keyword, if_stmt.start(), if_stmt.test.end(), &if_stmt.body)); + for clause in &if_stmt.elif_else_clauses { + let keyword = self.token_at(clause.start()); + let hint = clause.test.as_ref().map_or_else( + || keyword.map_or(clause.start(), ruff_text_size::TextRange::end), + ruff_text_size::Ranged::end, + ); + heads.push(self.head(keyword, clause.start(), hint, &clause.body)); + } + } + Stmt::For(for_stmt) => { + let keyword = self.first_token(for_stmt.start(), TokenKind::For); + heads.push(self.head( + keyword, + for_stmt.start(), + for_stmt.iter.end(), + &for_stmt.body, + )); + self.else_head(&mut heads, &for_stmt.orelse, TokenKind::Else); + } + Stmt::While(while_stmt) => { + let keyword = self.token_at(while_stmt.start()); + heads.push(self.head( + keyword, + while_stmt.start(), + while_stmt.test.end(), + &while_stmt.body, + )); + self.else_head(&mut heads, &while_stmt.orelse, TokenKind::Else); + } + Stmt::Try(try_stmt) => { + let keyword = self.token_at(try_stmt.start()); + let hint = keyword.map_or(try_stmt.start(), ruff_text_size::TextRange::end); + heads.push(self.head(keyword, try_stmt.start(), hint, &try_stmt.body)); + for handler in &try_stmt.handlers { + let ast::ExceptHandler::ExceptHandler(handler) = handler; + let keyword = self.token_at(handler.start()); + let hint = handler + .name + .as_ref() + .map(ruff_text_size::Ranged::end) + .or_else(|| handler.type_.as_ref().map(|type_| type_.end())) + .unwrap_or_else(|| { + keyword.map_or(handler.start(), ruff_text_size::TextRange::end) + }); + heads.push(self.head(keyword, handler.start(), hint, &handler.body)); + } + self.else_head(&mut heads, &try_stmt.orelse, TokenKind::Else); + self.else_head(&mut heads, &try_stmt.finalbody, TokenKind::Finally); + } + Stmt::With(with_stmt) => { + let keyword = self.first_token(with_stmt.start(), TokenKind::With); + let hint = with_stmt.items.last().map_or_else( + || keyword.map_or(with_stmt.start(), ruff_text_size::TextRange::end), + ruff_text_size::Ranged::end, + ); + heads.push(self.head(keyword, with_stmt.start(), hint, &with_stmt.body)); + } + Stmt::Match(match_stmt) => { + // `match` is a soft keyword, and the clause keyword is simply the statement's + // first token: the parser only makes a match statement out of one that is. + let keyword = self.first_token_any(match_stmt.start()); + heads.push(self.head(keyword, match_stmt.start(), match_stmt.subject.end(), &[])); + for case in &match_stmt.cases { + let keyword = self.first_token_any(case.start()); + let hint = case + .guard + .as_ref() + .map_or_else(|| case.pattern.end(), |guard| guard.end()); + heads.push(self.head(keyword, case.start(), hint, &case.body)); + } + } + Stmt::FunctionDef(function) if function.is_trailing_lambda => { + // A statement-level `:` whose suite is the lambda's body. There is no + // keyword; the header is the call. + let hint = function + .decorator_list + .first() + .map_or(function.start(), |decorator| decorator.expression.end()); + heads.push(self.head(None, function.start(), hint, &function.body)); + } + Stmt::FunctionDef(function) => { + let keyword = self.token_before(function.name.start()); + let hint = [ + Some(function.parameters.end()), + function.returns.as_ref().map(|returns| returns.end()), + function.raises.as_ref().map(|raises| raises.end()), + ] + .into_iter() + .flatten() + .max() + .unwrap_or(function.name.end()); + let start = keyword.map_or(function.start(), ruff_text_size::TextRange::start); + heads.push(self.head(keyword, start, hint, &function.body)); + } + Stmt::ClassDef(class) => { + let keyword = self.token_before(class.name.start()); + let hint = [ + Some(class.name.end()), + class.type_params.as_ref().map(|params| params.end()), + class.arguments.as_ref().map(|arguments| arguments.end()), + ] + .into_iter() + .flatten() + .max() + .unwrap_or(class.name.end()); + let start = keyword.map_or(class.start(), ruff_text_size::TextRange::start); + heads.push(self.head(keyword, start, hint, &class.body)); + } + Stmt::Let(let_stmt) if !let_stmt.orelse.is_empty() => { + // `let := else:` — the `let` half opens no suite, and the + // `else` is a clause of the statement like a loop's. + let keyword = self.token_at(let_stmt.start()); + heads.push(ClauseHead { + keyword, + colon: None, + range: TextRange::new(let_stmt.start(), let_stmt.value.end()), + body: &[], + }); + self.else_head(&mut heads, &let_stmt.orelse, TokenKind::Else); + } + _ => {} + } + heads + } + + /// A clause that starts at `start`, whose header's last component ends at `hint`. + fn head<'s>( + &self, + keyword: Option, + start: TextSize, + hint: TextSize, + body: &'s [Stmt], + ) -> ClauseHead<'s> { + let colon = self.colon_after(hint); + let header_end = colon.map_or(hint, ruff_text_size::TextRange::end); + let end = body + .last() + .map_or(header_end, ruff_text_size::Ranged::end) + .max(header_end); + ClauseHead { + keyword, + colon, + range: TextRange::new(start, end), + body, + } + } + + /// The `else` or `finally` clause heading `body`, which has no node of its own: its keyword is + /// the last one of `kind` before the body's first statement. + fn else_head<'s>(&self, heads: &mut Vec>, body: &'s [Stmt], kind: TokenKind) { + let Some(first) = body.first() else { + return; + }; + let before = &self.tokens[..self + .tokens + .partition_point(|token| token.start() < first.start())]; + let Some(keyword) = before + .iter() + .rev() + .find(|token| { + !matches!( + token.kind(), + TokenKind::Colon + | TokenKind::Newline + | TokenKind::NonLogicalNewline + | TokenKind::Indent + | TokenKind::Dedent + | TokenKind::Comment + ) + }) + .filter(|token| token.kind() == kind) + else { + return; + }; + heads.push(self.head(Some(keyword.range()), keyword.start(), keyword.end(), body)); + } + + /// The header's `:` — the first one after `hint` outside brackets, before the logical line + /// ends. Searching from the header's last component rather than from its keyword is what keeps + /// a lambda's `:` in the header out of it. + fn colon_after(&self, hint: TextSize) -> Option { + let start = self.tokens.partition_point(|token| token.start() < hint); + let mut depth = 0i32; + for token in &self.tokens[start..] { + match token.kind() { + TokenKind::Lpar | TokenKind::Lsqb | TokenKind::Lbrace => depth += 1, + TokenKind::Rpar | TokenKind::Rsqb | TokenKind::Rbrace => depth -= 1, + TokenKind::Colon if depth <= 0 => return Some(token.range()), + TokenKind::Newline => return None, + _ => {} + } + } + None + } + + /// The token starting exactly at `offset`. + fn token_at(&self, offset: TextSize) -> Option { + self.first_token_any(offset) + .filter(|range| range.start() == offset) + } + + /// The first token starting at or after `offset`, passing over the zero-width `Dedent`s + /// that start where a dedented clause keyword does. + fn first_token_any(&self, offset: TextSize) -> Option { + let index = self.tokens.partition_point(|token| token.start() < offset); + self.tokens[index..] + .iter() + .find(|token| !token.range().is_empty()) + .map(Ranged::range) + } + + /// The first token of `kind` at or after `offset`. + fn first_token(&self, offset: TextSize, kind: TokenKind) -> Option { + let index = self.tokens.partition_point(|token| token.start() < offset); + self.tokens[index..] + .iter() + .find(|token| token.kind() == kind) + .map(Ranged::range) + } + + /// The last significant token ending at or before `offset`. + fn token_before(&self, offset: TextSize) -> Option { + let index = self.tokens.partition_point(|token| token.end() <= offset); + self.tokens[..index] + .iter() + .rev() + .find(|token| !token.kind().is_trivia()) + .map(Ranged::range) + } + + /// The modifiers a definition was declared with: the decorators the parser synthesised from + /// basedpython keywords, which unlike a written decorator do not start with `@`. + fn modifiers(&self, stmt: &Stmt) -> Vec { + let decorators = match stmt { + Stmt::FunctionDef(function) if !function.is_trailing_lambda => &function.decorator_list, + Stmt::ClassDef(class) => &class.decorator_list, + _ => return Vec::new(), + }; + decorators + .iter() + .filter_map(|decorator| { + let text = self.source.get(decorator.range().to_std_range())?; + if text.starts_with('@') { + return None; + } + let Expr::Name(name) = &decorator.expression else { + return None; + }; + let trimmed = TextSize::of(text.trim_end()); + if trimmed == TextSize::ZERO { + return None; + } + Some(OutlineModifier { + range: TextRange::at(decorator.start(), trimmed), + name: name.id.to_string(), + }) + }) + .collect() + } + + fn call(&self, stmt: &Stmt) -> Option { + let Stmt::Expr(ast::StmtExpr { value, .. }) = stmt else { + return None; + }; + let Expr::Call(call) = value.as_ref() else { + return None; + }; + let parent = AnyNodeRef::from(&call.arguments); + let full = |expr: &Expr| { + parenthesized_range(expr.into(), parent, self.tokens).unwrap_or(expr.range()) + }; + let arguments = call + .arguments + .iter_source_order() + .map(|argument| match argument { + ast::ArgOrKeyword::Arg(expr) => full(expr), + ast::ArgOrKeyword::Keyword(keyword) => keyword.range(), + }) + .reduce(ruff_text_size::TextRange::cover); + let positional_only = call.arguments.keywords.is_empty() + && call + .arguments + .args + .iter() + .all(|argument| !argument.is_starred_expr()); + Some(OutlineCall { + callee: call.func.range(), + arguments, + positional_only, + }) + } +} + +struct ClauseHead<'s> { + keyword: Option, + colon: Option, + range: TextRange, + body: &'s [Stmt], +} + +/// A block enclosing the statement being looked at, as a `return` or a `break` sees it. +#[derive(Clone, Copy)] +struct Enclosing<'s> { + stmt: &'s Stmt, + /// Whether the path runs through the block's first suite — a loop's body rather than its + /// `else`, which a `break` does not belong to. + in_body: bool, +} + +impl OutlineBuilder<'_> { + /// The family of `keyword` among `suite` and everything nested in it. `path` holds the blocks + /// enclosing `suite`, innermost last. + fn family<'s>( + &self, + suite: &'s [Stmt], + keyword: TextRange, + path: &mut Vec>, + ) -> Option> { + for stmt in suite { + if !stmt.range().contains_range(keyword) { + continue; + } + match stmt { + Stmt::Return(_) | Stmt::Raise(_) if stmt.start() == keyword.start() => { + return path.iter().rev().find_map(|block| match block.stmt { + Stmt::FunctionDef(_) => Some(Some(self.own_family(block.stmt))), + Stmt::ClassDef(_) => Some(None), + _ => None, + })?; + } + Stmt::Break(_) | Stmt::Continue(_) if stmt.start() == keyword.start() => { + return path.iter().rev().find_map(|block| match block.stmt { + Stmt::For(_) | Stmt::While(_) if block.in_body => { + Some(Some(self.own_family(block.stmt))) + } + Stmt::FunctionDef(_) | Stmt::ClassDef(_) => Some(None), + _ => None, + })?; + } + _ => {} + } + + let heads = self.clause_heads(stmt); + if heads.iter().any(|head| head.keyword == Some(keyword)) { + return Some(self.own_family(stmt)); + } + for (index, head) in heads.iter().enumerate() { + path.push(Enclosing { + stmt, + in_body: index == 0, + }); + let found = self.family(head.body, keyword, path); + path.pop(); + if found.is_some() { + return found; + } + } + return None; + } + None + } + + /// What lights up with one of `stmt`'s own clause keywords. + fn own_family(&self, stmt: &Stmt) -> Vec { + let keywords = self + .clause_heads(stmt) + .into_iter() + .filter_map(|head| head.keyword); + match stmt { + Stmt::FunctionDef(function) => { + let mut family: Vec<_> = keywords.collect(); + self.exits_in(&function.body, JumpKind::Exit, &mut family); + family + } + Stmt::For(ast::StmtFor { body, .. }) | Stmt::While(ast::StmtWhile { body, .. }) => { + let mut family: Vec<_> = keywords.collect(); + self.exits_in(body, JumpKind::Jump, &mut family); + family + } + _ => keywords.collect(), + } + } + + /// The exits of `kind` in `suite`, not counting those inside a nested block that owns them: a + /// nested function owns its exits, and a nested loop, function or class its jumps. A nested + /// loop's `else` is not its body, so a jump there still belongs out here. + fn exits_in(&self, suite: &[Stmt], kind: JumpKind, found: &mut Vec) { + for stmt in suite { + match (stmt, kind) { + (Stmt::Return(_) | Stmt::Raise(_), JumpKind::Exit) + | (Stmt::Break(_) | Stmt::Continue(_), JumpKind::Jump) => { + found.extend(self.token_at(stmt.start())); + } + (Stmt::FunctionDef(_) | Stmt::ClassDef(_), _) => {} + ( + Stmt::For(ast::StmtFor { orelse, .. }) + | Stmt::While(ast::StmtWhile { orelse, .. }), + JumpKind::Jump, + ) => self.exits_in(orelse, kind, found), + _ => { + for head in self.clause_heads(stmt) { + self.exits_in(head.body, kind, found); + } + } + } + } + } +} + +#[derive(Clone, Copy, PartialEq, Eq)] +enum JumpKind { + /// `return` and `raise`, which leave a function. + Exit, + /// `break` and `continue`, which leave or restart a loop. + Jump, +} + +/// Collects every string literal part, with what is inside it. +struct StringCollector<'a> { + source: &'a str, + /// Whether this file's triple-quoted strings are dedented, which is basedpython's rule and not + /// python's. + dedents: bool, + /// The part the expression being visited consists of, when it is the lone part of a string + /// expression — the only shape the transpiler dedents. + dedentable: Option, + strings: Vec, +} + +impl StringCollector<'_> { + fn push( + &mut self, + range: TextRange, + flags: AnyStringFlags, + interpolations: Vec, + literal_runs: &[TextRange], + ) { + let stripped_indent = if self.dedents + && self.dedentable == Some(range) + && flags.is_triple_quoted() + && !flags.is_unclosed() + && !flags.is_byte_string() + { + let body = TextRange::new( + range.start() + flags.opener_len(), + range.end() - flags.closer_len(), + ); + match self + .source + .get(body.to_std_range()) + .map(dedent_triple_quoted_body) + { + Some(TripleQuotedDedent::Dedents { indent, .. }) => Some(TextSize::of(indent)), + _ => None, + } + } else { + None + }; + + let mut escapes = Vec::new(); + if !flags.prefix().is_raw() { + for run in literal_runs { + escapes_in(self.source, *run, flags.is_byte_string(), &mut escapes); + } + } + + self.strings.push(OutlineString { + range, + stripped_indent, + interpolations, + escapes, + }); + } + + /// The literal text of `elements`, and the top-level interpolations among them. A format + /// spec's literal text is literal text too, and is where its escapes are. + fn elements( + elements: &InterpolatedStringElements, + interpolations: &mut Vec, + literal_runs: &mut Vec, + top_level: bool, + ) { + for element in elements { + match element { + InterpolatedStringElement::Literal(literal) => literal_runs.push(literal.range()), + InterpolatedStringElement::Interpolation(interpolation) => { + if top_level { + interpolations.push(interpolation.range()); + } + if let Some(spec) = &interpolation.format_spec { + Self::elements(&spec.elements, interpolations, literal_runs, false); + } + } + } + } + } +} + +impl<'a> SourceOrderVisitor<'a> for StringCollector<'_> { + fn visit_expr(&mut self, expr: &'a Expr) { + let outer = self.dedentable; + self.dedentable = match expr { + Expr::StringLiteral(string) => string.as_single_part_string().map(Ranged::range), + Expr::FString(string) => string.as_single_part_fstring().map(Ranged::range), + Expr::TString(string) => string.as_single_part_tstring().map(Ranged::range), + _ => None, + }; + walk_expr(self, expr); + self.dedentable = outer; + } + + fn visit_string_literal(&mut self, string: &'a ast::StringLiteral) { + let content = string.content_range(); + self.push(string.range(), string.flags.into(), Vec::new(), &[content]); + } + + fn visit_bytes_literal(&mut self, bytes: &'a ast::BytesLiteral) { + let content = bytes.content_range(); + self.push(bytes.range(), bytes.flags.into(), Vec::new(), &[content]); + } + + fn visit_f_string(&mut self, f_string: &'a ast::FString) { + let mut interpolations = Vec::new(); + let mut runs = Vec::new(); + Self::elements(&f_string.elements, &mut interpolations, &mut runs, true); + self.push( + f_string.range(), + f_string.flags.into(), + interpolations, + &runs, + ); + // Inside an interpolation is an expression, which may hold strings of its own. + let outer = self.dedentable.take(); + walk_f_string(self, f_string); + self.dedentable = outer; + } + + fn visit_t_string(&mut self, t_string: &'a ast::TString) { + let mut interpolations = Vec::new(); + let mut runs = Vec::new(); + Self::elements(&t_string.elements, &mut interpolations, &mut runs, true); + self.push( + t_string.range(), + t_string.flags.into(), + interpolations, + &runs, + ); + let outer = self.dedentable.take(); + walk_t_string(self, t_string); + self.dedentable = outer; + } +} + +/// The escape sequences in the literal text `run`, by Python's rules: `\N{...}`, `\u` and `\U` +/// are escapes in a `str` and not in `bytes`, `\x` takes two hex digits and an octal escape up to +/// three, and a line continuation is an escape of its line break. +fn escapes_in(source: &str, run: TextRange, bytes: bool, found: &mut Vec) { + let Some(text) = source.get(run.to_std_range()) else { + return; + }; + let chars = text.as_bytes(); + let mut index = 0; + while index < chars.len() { + if chars[index] != b'\\' || index + 1 >= chars.len() { + index += 1; + continue; + } + let rest = &chars[index + 1..]; + let hex_run = |count: usize| { + if rest.len() > count && rest[1..=count].iter().all(u8::is_ascii_hexdigit) { + count + 2 + } else { + 2 + } + }; + let len = match rest[0] { + b'x' => hex_run(2), + b'u' if !bytes => hex_run(4), + b'U' if !bytes => hex_run(8), + b'N' if !bytes && rest.get(1) == Some(&b'{') => rest + .iter() + .position(|&c| c == b'}') + .map_or(2, |close| close + 2), + b'0'..=b'7' => { + 1 + rest + .iter() + .take(3) + .take_while(|c| matches!(c, b'0'..=b'7')) + .count() + } + b'\r' if rest.get(1) == Some(&b'\n') => 3, + // Any other character, a multi-byte one included: the escape is the backslash and + // that whole character. + _ => 1 + text[index + 1..].chars().next().map_or(1, char::len_utf8), + }; + let start = run.start() + TextSize::try_from(index).unwrap_or_default(); + found.push(TextRange::at( + start, + TextSize::try_from(len).unwrap_or_default(), + )); + index += len; + } +} + +#[cfg(test)] +mod tests { + use std::fmt::Write as _; + + use ruff_text_size::TextRange; + + use super::{OutlineStatement, keyword_family, syntax_outline}; + use crate::tests::CursorTest; + + fn test(path: &str, source: &str) -> CursorTest { + let source = if source.contains("") { + source.to_string() + } else { + format!("{source}") + }; + CursorTest::builder().source(path, source).build() + } + + /// The statements of a basedpython file, one line per clause header or simple statement, + /// indented by nesting: a header is shown up to its `:`, marked when it has no keyword or no + /// colon, and a statement's modifiers and call follow it in brackets. + fn statements(source: &str) -> String { + let test = test("main.by", source); + let file = test.program_file(test.cursor.file).python_file(&test.db); + let outline = syntax_outline(&test.db, file); + let text = test.cursor.source.as_str(); + let mut out = String::new(); + render(&outline.statements, text, 0, &mut out); + out + } + + fn render(statements: &[OutlineStatement], text: &str, depth: usize, out: &mut String) { + let slice = |range: TextRange| &text[range.to_std_range()]; + for statement in statements { + let indent = " ".repeat(depth); + if statement.clauses.is_empty() { + let first_line = slice(statement.range).lines().next().unwrap_or_default(); + write!(out, "{indent}{first_line}").unwrap(); + } + for (index, clause) in statement.clauses.iter().enumerate() { + if index > 0 { + out.push('\n'); + } + let header_end = clause + .colon + .map_or(clause.range.end(), ruff_text_size::TextRange::end); + let header = slice(TextRange::new(clause.range.start(), header_end)); + write!(out, "{indent}{}", header.replace('\n', "⏎")).unwrap(); + if clause.keyword.is_none() { + out.push_str(" [no keyword]"); + } + if clause.colon.is_none() { + out.push_str(" [no colon]"); + } + if index == 0 { + for modifier in &statement.modifiers { + write!(out, " [{} `{}`]", modifier.name, slice(modifier.range)).unwrap(); + } + } + if !clause.body.is_empty() { + out.push('\n'); + render(&clause.body, text, depth + 1, out); + // `render` ends every statement with a newline, and so does this loop. + out.pop(); + } + } + if let Some(call) = &statement.call { + write!( + out, + " [call `{}` with `{}`{}]", + slice(call.callee), + call.arguments.map(slice).unwrap_or_default(), + if call.positional_only { + ", positional only" + } else { + "" + } + ) + .unwrap(); + } + out.push('\n'); + } + } + + /// Every string part: its text, what basedpython strips, and its interpolations and escapes. + fn strings(path: &str, source: &str) -> String { + let test = test(path, source); + let file = test.program_file(test.cursor.file).python_file(&test.db); + let outline = syntax_outline(&test.db, file); + let text = test.cursor.source.as_str(); + let slice = |range: TextRange| text[range.to_std_range()].replace('\n', "⏎"); + let mut out = String::new(); + for string in &outline.strings { + write!(out, "{}", slice(string.range)).unwrap(); + if let Some(indent) = string.stripped_indent { + write!(out, " strips {}", u32::from(indent)).unwrap(); + } + for interpolation in &string.interpolations { + write!(out, " interpolation `{}`", slice(*interpolation)).unwrap(); + } + for escape in &string.escapes { + write!(out, " escape `{}`", slice(*escape)).unwrap(); + } + out.push('\n'); + } + out + } + + /// The keywords that light up with the one under ``, or `none`. + fn family(source: &str) -> String { + let test = test("main.by", source); + let file = test.program_file(test.cursor.file).python_file(&test.db); + let text = test.cursor.source.as_str(); + match keyword_family(&test.db, file, test.cursor.offset) { + None => "none".to_string(), + Some(family) => family + .iter() + .map(|range| { + let line = text[..range.start().to_usize()].matches('\n').count() + 1; + format!("{}@{line}", &text[range.to_std_range()]) + }) + .collect::>() + .join(" "), + } + } + + #[test] + fn a_soft_keyword_used_as_a_name_opens_no_suite() { + assert_eq!( + statements("match: int = 1\ncase = match\n"), + "match: int = 1\ncase = match\n" + ); + } + + #[test] + fn colons_in_strings_brackets_and_lambdas_are_not_the_header_colon() { + assert_eq!( + statements( + "if d[\":\"] == {1: 2} and (lambda: 1)(): # a: comment\n pass\nelif x:\n y = \"a:\"\nelse: pass\n" + ), + "if d[\":\"] == {1: 2} and (lambda: 1)():\n pass\nelif x:\n y = \"a:\"\nelse:\n pass\n" + ); + } + + #[test] + fn a_header_wrapped_over_lines_ends_at_its_colon() { + assert_eq!( + statements("def f(\n a: int,\n) -> int:\n return a\n"), + "def f(⏎ a: int,⏎) -> int:\n return a\n" + ); + } + + #[test] + fn the_clauses_of_every_compound_statement() { + assert_eq!( + statements( + "\ +try: + pass +except (A, B) as e: + pass +except C: + pass +else: + pass +finally: + pass +for x in y: + break +else: + pass +while z: + continue +else: + pass +async def f(): + async for a in b: + pass + async with c as d, e: + pass +match p: + case [1, 2] if q: + pass + case _: + pass +" + ), + "\ +try: + pass +except (A, B) as e: + pass +except C: + pass +else: + pass +finally: + pass +for x in y: + break +else: + pass +while z: + continue +else: + pass +def f(): + async for a in b: + pass + async with c as d, e: + pass +match p: +case [1, 2] if q: + pass +case _: + pass +" + ); + } + + #[test] + fn a_header_being_typed_still_opens_its_suite() { + assert_eq!(statements("def f():\n if x:"), "def f():\n if x:\n"); + } + + #[test] + fn an_inline_suite_is_the_body_of_its_header() { + assert_eq!( + statements("if x: return 1\nwhile y: pass\n"), + "if x:\n return 1\nwhile y:\n pass\n" + ); + } + + #[test] + fn a_definition_keeps_its_decorators_and_modifiers_but_its_clause_starts_at_the_keyword() { + assert_eq!( + statements( + "\ +@dec +frozen data class P: + x: int +enum class Color: + RED +class C: + class def make(cls): ... + static def s(): ... +" + ), + "\ +class P: [frozen_data_class `frozen data`] + x: int +class Color: [enum_def `enum class`] + RED +class C: + def make(cls): [classmethod `class`] + ... + def s(): [static `static`] + ... +" + ); + } + + #[test] + fn a_let_with_an_else_is_a_compound_statement() { + assert_eq!( + statements("let A(foo) := value else:\n return None\nlet b := 1\n"), + "let A(foo) := value [no colon]\nelse:\n return None\nlet b := 1\n" + ); + } + + #[test] + fn a_call_statement_says_what_it_calls_and_how() { + assert_eq!( + statements("print(a, (b + c))\nprint(x, sep=\"\")\nprint(*xs)\nprint()\nf(x)(y)\n"), + "\ +print(a, (b + c)) [call `print` with `a, (b + c)`, positional only] +print(x, sep=\"\") [call `print` with `x, sep=\"\"`] +print(*xs) [call `print` with `*xs`] +print() [call `print` with ``, positional only] +f(x)(y) [call `f(x)` with `y`, positional only] +" + ); + } + + #[test] + fn basedpython_strips_what_the_transpiler_strips() { + assert_eq!( + strings( + "main.by", + "\ +def f(): + content_is_the_margin = \"\"\" + eight + six + \"\"\" + opening_line_has_text = \"\"\"Summary. + more + \"\"\" + closing_shares_a_line = \"\"\" + text\"\"\" + closing_past_the_content = \"\"\" + a + \"\"\" + concatenated = \"\"\" + a + \"\"\" \"b\" + bytes = b\"\"\" + a + \"\"\" + formatted = f\"\"\" + {x} + \"\"\" +" + ), + "\ +\"\"\"⏎ eight⏎ six⏎ \"\"\" strips 10 +\"\"\"Summary.⏎ more⏎ \"\"\" +\"\"\"⏎ text\"\"\" +\"\"\"⏎ a⏎ \"\"\" +\"\"\"⏎ a⏎ \"\"\" +\"b\" +b\"\"\"⏎ a⏎ \"\"\" +f\"\"\"⏎ {x}⏎ \"\"\" strips 8 interpolation `{x}` +" + ); + } + + #[test] + fn python_strips_nothing() { + assert_eq!( + strings("main.py", "x = \"\"\"\n a\n \"\"\"\n"), + "\"\"\"⏎ a⏎ \"\"\"\n" + ); + } + + #[test] + fn escapes_follow_pythons_rules() { + assert_eq!( + strings( + "main.by", + r#"a = "\n\x41\u00e9\N{EM DASH}\101\q\"" + b"\u00e9\x41" + r"\n" + f"\t{x!r:\n>{w}}{{\n}}" +"# + ), + r#""\n\x41\u00e9\N{EM DASH}\101\q\"" escape `\n` escape `\x41` escape `\u00e9` escape `\N{EM DASH}` escape `\101` escape `\q` escape `\"` +b"\u00e9\x41" escape `\u` escape `\x41` +r"\n" +f"\t{x!r:\n>{w}}{{\n}}" interpolation `{x!r:\n>{w}}` escape `\t` escape `\n` escape `\n` +"# + ); + } + + #[test] + fn an_if_pairs_with_its_own_elif_and_else() { + assert_eq!( + family( + "if a:\n x = b if c else d\nelif e:\n pass\nelse:\n pass\nif f:\n pass\n" + ), + "if@1 elif@3 else@5" + ); + assert_eq!(family("if a:\n x = b if c else d\n"), "none"); + assert_eq!(family("if a:\n pass\n"), "none"); + } + + #[test] + fn a_try_pairs_with_its_handlers() { + assert_eq!( + family("try:\n pass\nexcept A:\n pass\nfinally:\n pass\n"), + "try@1 except@3 finally@5" + ); + } + + #[test] + fn a_match_pairs_with_its_cases_and_a_name_called_match_with_nothing() { + assert_eq!( + family("match x:\n case 1:\n pass\n case _:\n pass\n"), + "match@1 case@2 case@4" + ); + assert_eq!(family("match: int = 1\n"), "none"); + } + + #[test] + fn a_def_pairs_with_its_own_exits() { + let source = "\ +def f(): + if a: + return 1 + def g(): + return 2 + raise E +"; + assert_eq!( + family(&source.replacen("def f", "def f", 1)), + "def@1 return@3 raise@6" + ); + assert_eq!( + family(&source.replacen("return 1", "return 1", 1)), + "def@1 return@3 raise@6" + ); + assert_eq!( + family(&source.replacen("return 2", "return 2", 1)), + "def@4 return@5" + ); + } + + #[test] + fn a_loop_pairs_with_its_own_jumps() { + let source = "\ +for a in b: + while c: + break + for d in e: + pass + else: + continue +else: + pass +"; + assert_eq!( + family(&source.replacen("for a", "for a", 1)), + "for@1 continue@7 else@8" + ); + assert_eq!( + family(&source.replacen("break", "break", 1)), + "while@2 break@3" + ); + } +} diff --git a/crates/ty_project/src/lib.rs b/crates/ty_project/src/lib.rs index b9f0907709..3665397971 100644 --- a/crates/ty_project/src/lib.rs +++ b/crates/ty_project/src/lib.rs @@ -928,6 +928,23 @@ impl ScriptFiles<'_> { } fn check_file(db: &dyn Db, file: File) -> Vec { + if !is_in_check_set(db, file) { + return Vec::new(); + } + + check_file_ignoring_check_mode(db, file) +} + +/// Everything wrong with `file`, whether or not the check mode reports it. +/// +/// For a caller that names the files it needs checked rather than asking what the project reports. +/// A re-stage into a running program has to refuse a file that does not check whether or not an +/// editor is holding it, and [`ProjectDatabase::check_file`] answers nothing for a file outside the +/// mode's set — which under [`CheckMode::OpenFiles`] is every file the editor has closed. +/// +/// The mode chooses which files a check reports; it does not decide whether a file *can* be +/// checked. Every file [`should_check_file`](ty_python_core::Db::should_check_file) accepts can. +pub fn check_file_ignoring_check_mode(db: &dyn Db, file: File) -> Vec { if !db.should_check_file(file) { return Vec::new(); } @@ -965,19 +982,30 @@ pub(crate) fn is_project_file(db: &dyn Db, file: File) -> bool { project.files(db).contains(file) || project.open_files(db).contains(&file) } -/// Returns `true` if the file should be checked. +/// Returns `true` if the type checker produces diagnostics for `file`: it is virtual, indexed in +/// the project, or in the open file set. /// -/// This depends on the project's check mode: -/// * For [`CheckMode::OpenFiles`], it checks if the file is explicitly in the open file set. -/// * For [`CheckMode::AllFiles`], it checks if the file is virtual, indexed in the project, or in -/// the open file set. +/// This does not depend on the project's check mode, and it must not. The checker asks it *inside* +/// inference — see `LintDiagnosticGuardBuilder::severity_and_source` — so its answer is baked into +/// every memoized result for the file. A gate that followed the mode therefore left a file the +/// editor had closed impossible to check at all on an unchanged database, because its diagnostics +/// were never collected in the first place; and the same gate, asked about the file some *other* +/// callable is defined in, made an open file's diagnostics depend on which files happened to be +/// open beside it. Which files a check *reports* is [`is_in_check_set`]. +/// +/// The cost of that is paid under [`CheckMode::OpenFiles`], where this now answers `true` for +/// every project file rather than only the open ones: the checker builds a closed file's +/// diagnostics while inferring it, and keeps them in the memoized inference result, instead of +/// dropping them at `report_lint`. That is the price of the mode not reaching inside inference, +/// and it buys an answer that does not depend on which editor tabs happen to be open. A mode +/// that wants the saving back has to keep files out of inference altogether, not out of the +/// diagnostics inference produces. /// /// This query provides a per-file backdating boundary around the project-wide file sets. Updating /// either set still revalidates this query, but unchanged results are backdated before invalidation /// reaches semantic-index and type-inference queries. #[salsa::tracked(returns(copy))] pub(crate) fn should_check_file(db: &dyn Db, file: File) -> bool { - let project = db.project(); let path = file.path(db); // NOTE: The tracing messages below were added because whether a file should be checked or not @@ -991,42 +1019,53 @@ pub(crate) fn should_check_file(db: &dyn Db, file: File) -> bool { return false; } + // Virtual files are always checked. + // + // We also check the open file set. In theory, we shouldn't need to do this since it is + // accounted for by the virtual file check (for the case when a file wants to be checked + // but isn't saved to disk yet). However, not all clients follow the LSP convention that + // URIs for documents not on disk yet use the `untitled://...` scheme. That is, we assume + // that a `file://...` scheme corresponds to a saved file on disk, and anything else is + // "virtual." For example, neovim uses `file://...` even for an open buffer that does not + // correspond to a file saved to disk yet. + if path.is_system_virtual_path() { + return true; + } + + let project = db.project(); + let should_check = project.files(db).contains(file) || project.open_files(db).contains(&file); + if !should_check { + tracing::trace!( + "Not checking {path} because it is not a virtual path, in the project files \ + or in the open file set" + ); + } + should_check +} + +/// Returns `true` if a check reports `file`'s diagnostics. +/// +/// This is where the project's check mode applies: +/// * For [`CheckMode::OpenFiles`], the file must be in the open file set. +/// * For [`CheckMode::AllFiles`], it is every file [`should_check_file`] accepts. +/// +/// Unlike [`should_check_file`] this is answered outside of any query, so a file moving in or out +/// of the set invalidates nothing the checker computed for it. +fn is_in_check_set(db: &dyn Db, file: File) -> bool { + let project = db.project(); match project.check_mode(db) { CheckMode::OpenFiles => { - let should_check = project.open_files(db).contains(&file); - if !should_check { - tracing::trace!( - "Not checking {path} because check mode is `OpenFiles` \ - and it is not in the open file set" - ); - } - should_check - } - CheckMode::AllFiles => { - // Virtual files are always checked. - // - // We also check the open file set. In theory, we shouldn't need to do this since it is - // accounted for by the virtual file check (for the case when a file wants to be checked - // but isn't saved to disk yet). However, not all clients follow the LSP convention that - // URIs for documents not on disk yet use the `untitled://...` scheme. That is, we assume - // that a `file://...` scheme corresponds to a saved file on disk, and anything else is - // "virtual." For example, neovim uses `file://...` even for an open buffer that does not - // correspond to a file saved to disk yet. - if path.is_system_virtual_path() { - return true; - } - - let should_check = - project.files(db).contains(file) || project.open_files(db).contains(&file); - if !should_check { + let reported = project.open_files(db).contains(&file); + if !reported { tracing::trace!( - "Not checking {path} because check mode is `AllFiles` \ - and it is not a virtual path, in the project files \ - or in the open file set" + "Not reporting {path} because check mode is `OpenFiles` \ + and it is not in the open file set", + path = file.path(db) ); } - should_check + reported && db.should_check_file(file) } + CheckMode::AllFiles => db.should_check_file(file), } } diff --git a/crates/ty_python_core/src/builder.rs b/crates/ty_python_core/src/builder.rs index 7cd4a39469..b37c6768c2 100644 --- a/crates/ty_python_core/src/builder.rs +++ b/crates/ty_python_core/src/builder.rs @@ -321,6 +321,11 @@ pub(super) struct SemanticIndexBuilder<'db, 'ast> { /// Whether the current statement is inside a `try` statement, including its `except`, `else`, /// and `finally` suites. Used for semantic syntax checks independently of handler activity. in_try_statement: bool, + /// basedpython: whether the current statement is inside a `try` statement that has a + /// `finally` suite, including the suite itself. See [`Self::record_return_exit`]. + in_finally_statement: bool, + /// basedpython: where the function scopes currently being built return, innermost last. + function_exits: Vec, // Semantic Index fields scopes: IndexVec, @@ -489,6 +494,8 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { source_text: OnceCell::new(), semantic_checker: SemanticSyntaxChecker::default(), in_try_statement: false, + in_finally_statement: false, + function_exits: Vec::new(), semantic_syntax_errors: RefCell::default(), narrowing_aliases: FxHashMap::default(), alias_predicates: FxHashMap::default(), @@ -649,6 +656,23 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { self.push_scope_with_parent(node, Some(self.current_scope())); } + /// basedpython: start collecting where this function returns, if it is one whose body is read + /// as an assertion about its parameters. See [`Self::record_merged_normal_exit`]. + fn push_function_exits(&mut self, node: NodeWithScopeRef) { + let NodeWithScopeRef::Function(function) = node else { + return; + }; + if function.returns.is_some() || function.is_asserts_return || function.is_async { + return; + } + self.function_exits.push(FunctionExits { + scope: self.current_scope(), + snapshots: Vec::new(), + returns_value: false, + through_finally: false, + }); + } + fn push_scope_with_parent(&mut self, node: NodeWithScopeRef, parent: Option) { let children_start = self.scopes.next_index() + 1; @@ -1611,6 +1635,68 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { self.use_def_maps[scope].record_places_at_use(members.into_iter(), use_id); } + /// basedpython: note where `stmt` returns, for the assertion its function makes. + /// + /// A call's arguments are narrowed by what the body established wherever it hands control + /// back, so every `return` is part of the answer alongside falling off the end of the body. + /// A `def` that wrote no return type has its snapshots merged into one state at + /// [`Self::record_merged_normal_exit`]; a written `-> asserts` keeps each `return` on its own, + /// so that the one that fails the assertion is the one reported. + /// See `ty_python_semantic::types::inferred_narrowing`. + fn record_return_exit(&mut self, stmt: &'ast ast::Stmt) { + let scope = self.current_scope(); + let NodeWithScopeKind::Function(function) = self.scopes[scope].node() else { + return; + }; + let function = function.node(self.module); + let is_asserts_return = function.is_asserts_return; + if function.returns.is_some() && !is_asserts_return { + return; + } + // `return None` hands back exactly what a bare `return` does + let returns_value = matches!( + stmt, + ast::Stmt::Return(ast::StmtReturn { + value: Some(value), .. + }) if !value.is_none_literal_expr() + ); + let in_finally_statement = self.in_finally_statement; + + // nothing is recovered from a body that hands back a value or returns through a + // `finally`, so once one of those is seen its states cost nothing + let collects_snapshots = self.function_exits.last().is_some_and(|exits| { + exits.scope == scope + && !exits.returns_value + && !exits.through_finally + && !returns_value + && !in_finally_statement + }); + let snapshot = collects_snapshots.then(|| self.flow_snapshot()); + if let Some(exits) = self.function_exits.last_mut() + && exits.scope == scope + { + exits.returns_value |= returns_value; + exits.through_finally |= in_finally_statement; + match snapshot { + Some(snapshot) => exits.snapshots.push(snapshot), + None => exits.snapshots = Vec::new(), + } + } + + if !is_asserts_return { + return; + } + let places = self.parameter_places(scope, function); + if places.is_empty() { + return; + } + self.use_def_maps[scope].record_return_exit( + stmt.range(), + in_finally_statement, + places.into_iter(), + ); + } + /// basedpython: records `expr` as a value of the statement expression whose /// place is `place`. /// @@ -2822,6 +2908,90 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { .record_narrowing_constraint_for_places(predicate, places); } + /// basedpython: record the state the places of `scope`'s parameters are in wherever the + /// function returns, merged over every way out of it. + /// + /// A `return` hands its state to the caller just as falling off the end of the body does, so + /// what a call has established about its arguments is the two together. Merging them here + /// costs one state per place, where reading each way out separately would cost one per place + /// and exit. See `ty_python_semantic::types::inferred_narrowing`. + fn record_merged_normal_exit(&mut self, scope: FileScopeId) { + // only a function whose body is read as an assertion collects them, so the innermost + // entry belongs to this scope or to one further out + if self + .function_exits + .last() + .is_none_or(|exits| exits.scope != scope) + { + return; + } + let Some(exits) = self.function_exits.pop() else { + return; + }; + // a body that hands back a value is not read as an assertion, and a `return` a `finally` + // suite can follow leaves a state this model does not have: what a caller sees is the + // state after that suite has run + if exits.returns_value || exits.through_finally { + return; + } + let NodeWithScopeKind::Function(function) = self.scopes[scope].node() else { + return; + }; + let function = function.node(self.module); + if function.returns.is_some() || function.is_asserts_return { + return; + } + let places = self.parameter_places(scope, function); + if places.is_empty() { + return; + } + + let after_body = self.flow_snapshot(); + for snapshot in exits.snapshots { + self.flow_merge(snapshot); + } + self.use_def_maps[scope].record_normal_exit(places.into_iter()); + self.flow_restore(after_body); + } + + /// basedpython: the places of `function`'s parameters, and the places below them. + fn parameter_places( + &self, + scope: FileScopeId, + function: &ast::StmtFunctionDef, + ) -> Vec { + let place_table = &self.place_tables[scope]; + // a written assertion can also name a place that is not a parameter, and checking it + // needs that place's state too + let guard_roots: Vec<&Name> = return_guards(function) + .into_iter() + .flatten() + .map(|guard| guard.place_parts().0) + .collect(); + let mut roots: Vec = function + .parameters + .iter_non_variadic_params() + .map(|parameter| ¶meter.parameter.name.id) + .chain(guard_roots) + .filter_map(|name| place_table.symbol_id(name)) + .collect(); + roots.sort_unstable(); + roots.dedup(); + roots + .into_iter() + .flat_map(|symbol| { + let place = ScopedPlaceId::Symbol(symbol); + std::iter::once(place).chain( + place_table + .associated_place_ids(place) + .iter() + .copied() + .map(ScopedPlaceId::from), + ) + }) + .collect() + } + /// basedpython: the places this file's narrowing return annotations name. /// /// `def f() -> a is int` narrows a place no call site mentions, and @@ -5057,6 +5227,7 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { } builder.push_scope(NodeWithScopeRef::Function(function_def)); + builder.push_function_exits(NodeWithScopeRef::Function(function_def)); let block_scope = builder.current_scope(); builder.declare_parameters(parameters); @@ -5071,6 +5242,7 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { ); builder.visit_body(body); + builder.record_merged_normal_exit(block_scope); builder.current_first_parameter_name = first_parameter_name; (builder.pop_scope(), block_scope) @@ -6312,6 +6484,8 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { node_index: _, }) => { let was_in_try_statement = std::mem::replace(&mut self.in_try_statement, true); + let was_in_finally_statement = self.in_finally_statement; + self.in_finally_statement |= !finalbody.is_empty(); self.record_ambiguous_reachability(); let exception_handlers = if handlers.is_empty() { @@ -6560,6 +6734,7 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { } } self.in_try_statement = was_in_try_statement; + self.in_finally_statement = was_in_finally_statement; } ast::Stmt::Raise(_) => { @@ -6594,6 +6769,7 @@ impl<'db, 'ast> SemanticIndexBuilder<'db, 'ast> { { self.record_returned_place_members(value); } + self.record_return_exit(stmt); self.record_terminal_finally_entry(); // Everything in the current block after a terminal statement is unreachable. self.mark_unreachable(); @@ -7922,15 +8098,29 @@ impl<'ast> Visitor<'ast> for GuardTargetCollector<'_> { } } else if function.returns.is_none() && !function.is_asserts_return { // a `def` that wrote no return type has its guards recovered from what it - // returns, so the chains those returns name below a parameter are targets too + // returns, so the chains those returns name below a parameter are targets too. + // one that returns nothing asserts what its whole body establishes, so there + // every chain the body names below a parameter is let mut chains = Vec::new(); - walk_body( - &mut ReturnedExpressionCollector { - parameters: &function.parameters, - chains: &mut chains, - }, - &function.body, - ); + let mut returns_value = ReturnsValue::default(); + walk_body(&mut returns_value, &function.body); + if returns_value.0 { + walk_body( + &mut ReturnedExpressionCollector { + parameters: &function.parameters, + chains: &mut chains, + }, + &function.body, + ); + } else { + walk_body( + &mut MemberChainCollector { + parameters: &function.parameters, + chains: &mut chains, + }, + &function.body, + ); + } if !chains.is_empty() { let recovered = self .targets @@ -7985,6 +8175,41 @@ impl<'ast> Visitor<'ast> for ReturnedExpressionCollector<'_, 'ast> { } } +/// basedpython: where a function scope being built returns. +/// +/// See [`SemanticIndexBuilder::record_merged_normal_exit`]. +struct FunctionExits { + scope: FileScopeId, + /// The state at each `return`, to be merged into one once the body has been visited. + snapshots: Vec, + /// Whether any `return` hands back a value, which is not read as an assertion. + returns_value: bool, + /// Whether any `return` can be followed by a `finally` suite, whose effect on what the caller + /// sees this model does not have. + through_finally: bool, +} + +/// basedpython: whether a function body hands back a value, rather than returning nothing. +/// +/// `return None` hands back exactly what a bare `return` does. The recovered guards read the same +/// thing — see `ty_python_semantic::types::inferred_narrowing`. +#[derive(Default)] +struct ReturnsValue(bool); + +impl<'ast> Visitor<'ast> for ReturnsValue { + fn visit_stmt(&mut self, stmt: &'ast ast::Stmt) { + match stmt { + ast::Stmt::FunctionDef(_) | ast::Stmt::ClassDef(_) => {} + ast::Stmt::Return(ast::StmtReturn { + value: Some(value), .. + }) if !value.is_none_literal_expr() => self.0 = true, + _ => walk_stmt(self, stmt), + } + } + + fn visit_expr(&mut self, _expr: &'ast ast::Expr) {} +} + /// basedpython: collects the attribute chains an expression names below a parameter. struct MemberChainCollector<'a, 'ast> { parameters: &'ast ast::Parameters, @@ -7992,6 +8217,13 @@ struct MemberChainCollector<'a, 'ast> { } impl<'ast> Visitor<'ast> for MemberChainCollector<'_, 'ast> { + fn visit_stmt(&mut self, stmt: &'ast ast::Stmt) { + // a nested `def` or `class` names its own places, not the function's around it + if !matches!(stmt, ast::Stmt::FunctionDef(_) | ast::Stmt::ClassDef(_)) { + walk_stmt(self, stmt); + } + } + fn visit_expr(&mut self, expr: &'ast ast::Expr) { if expr.is_attribute_expr() && let Some(path) = UnqualifiedName::from_expr(expr) diff --git a/crates/ty_python_core/src/member.rs b/crates/ty_python_core/src/member.rs index bd9cf4c3c5..622f17c981 100644 --- a/crates/ty_python_core/src/member.rs +++ b/crates/ty_python_core/src/member.rs @@ -191,7 +191,7 @@ impl MemberExpr { /// Returns the left most part of the member expression, e.g. `x` in `x.y.z`. /// /// This is the symbol on which the member access is performed. - fn symbol_name(&self) -> &str { + pub(crate) fn symbol_name(&self) -> &str { self.as_ref().symbol_name() } diff --git a/crates/ty_python_core/src/place.rs b/crates/ty_python_core/src/place.rs index 106ccd55bd..c6287ed4e1 100644 --- a/crates/ty_python_core/src/place.rs +++ b/crates/ty_python_core/src/place.rs @@ -316,6 +316,19 @@ impl PlaceTable { pub fn member_id_by_instance_attribute_name(&self, name: &str) -> Option { self.members.place_id_by_instance_attribute_name(name) } + + /// basedpython: the member places reached through the symbol `name`: `a.b` and `a.b.c` for + /// `a`. + pub fn members_of_symbol<'a>( + &'a self, + name: &'a str, + ) -> impl Iterator + 'a { + self.members + .iter() + .filter(move |member| member.expression().symbol_name() == name) + .filter_map(|member| self.members.member_id(member.expression())) + .map(ScopedPlaceId::from) + } } #[derive(Default)] diff --git a/crates/ty_python_core/src/use_def.rs b/crates/ty_python_core/src/use_def.rs index a1352c6c6c..ef7d4ed90c 100644 --- a/crates/ty_python_core/src/use_def.rs +++ b/crates/ty_python_core/src/use_def.rs @@ -666,6 +666,33 @@ struct UseDefMapExtra { /// Completed loop headers in this scope. loop_headers: FrozenIndexVec, + + /// basedpython: the state of a function's parameter places at each `return` of a written + /// `-> asserts` function. + return_exits: Box<[ReturnExit]>, + + /// basedpython: the state of a function's parameter places over every way out of its body, + /// merged. + normal_exit: Box<[PlaceBindings]>, +} + +/// basedpython: the state of a function's parameter places where a `return` leaves the body. +/// +/// Falling off the end of a body is the other way it can return, and that state is the +/// end-of-scope state every scope already has. Together they are what a call that returns has +/// established about its arguments — see `ty_python_semantic::types::inferred_narrowing`. +/// A body whose assertion is recovered rather than written uses the merged state instead. +#[derive(Debug, PartialEq, Eq, get_size2::GetSize)] +struct ReturnExit { + /// The range of the `return` statement. + range: TextRange, + /// Whether the `return` can be reached at all. + reachability: ScopedReachabilityConstraintId, + /// Whether a `finally` suite can run after this `return`, so that what the caller sees is + /// not the state recorded here. + through_finally: bool, + /// The bindings of each parameter place, and of each place below one, at the `return`. + places: Box<[PlaceBindings]>, } static EMPTY_CONSTRAINT_TABLES: LazyLock> = @@ -914,6 +941,10 @@ impl<'db> UseDefMap<'db> { &self.constraint_tables().reachability_constraints } + pub fn predicate_narrowing_targets(&self) -> &PredicateNarrowingTargets { + &self.constraint_tables().predicate_narrowing_targets + } + pub fn predicates(&self) -> &Predicates<'db> { &self.constraint_tables().predicates } @@ -979,6 +1010,73 @@ impl<'db> UseDefMap<'db> { .flatten() } + /// basedpython: each `return` recorded in this scope, with its range, whether it is reachable, + /// and whether a `finally` suite can run after it, in the order + /// [`Self::return_exit_bindings`] indexes them. + pub fn return_exits( + &self, + ) -> impl Iterator + '_ { + self.return_exit_records() + .iter() + .map(|exit| (exit.range, exit.reachability, exit.through_finally)) + } + + /// basedpython: whether this scope is a function body whose assertion is recovered from it. + /// + /// The index records the merged state only for a body that returns nothing and cannot return + /// through a `finally` suite — the bodies an assertion is read from. + pub fn records_normal_exit(&self) -> bool { + self.extra + .as_deref() + .is_some_and(|extra| !extra.normal_exit.is_empty()) + } + + /// basedpython: the bindings `place` has where the body returns, over every way out of it. + /// + /// `None` when this scope is not a function body whose assertion is recovered from it, or + /// when the place was not recorded. + pub fn normal_exit_bindings( + &self, + place: ScopedPlaceId, + ) -> Option> { + let (_, bindings) = self + .extra + .as_deref()? + .normal_exit + .iter() + .find(|(recorded, _)| *recorded == place)?; + Some(self.bindings_iterator( + bindings.as_slice(), + BoundnessAnalysis::BasedOnUnboundVisibility, + )) + } + + /// basedpython: the bindings `place` has at the `return` at `index`, or `None` when the place + /// was not recorded there. + pub fn return_exit_bindings( + &self, + index: usize, + place: ScopedPlaceId, + ) -> Option> { + let (_, bindings) = self + .return_exit_records() + .get(index)? + .places + .iter() + .find(|(recorded, _)| *recorded == place)?; + Some(self.bindings_iterator( + bindings.as_slice(), + BoundnessAnalysis::BasedOnUnboundVisibility, + )) + } + + fn return_exit_records(&self) -> &[ReturnExit] { + self.extra + .as_deref() + .map(|extra| extra.return_exits.as_ref()) + .unwrap_or_default() + } + pub fn applicable_constraints( &self, constraint_key: ConstraintKey, @@ -1850,6 +1948,12 @@ pub(super) struct UseDefMapBuilder<'db> { /// it hands back, beside that place's ordinary entry. multi_bindings_by_use: FxHashMap>, + /// basedpython: the state of the parameter places at each `return` recorded so far. + return_exits: Vec, + + /// basedpython: the state of the parameter places over every way out of the body, merged. + normal_exit: Vec, + /// Tracks whether or not the current point in control flow is reachable from the /// start of the scope. pub(super) reachability: ScopedReachabilityConstraintId, @@ -1910,6 +2014,8 @@ impl<'db> UseDefMapBuilder<'db> { narrowing_constraints: NarrowingConstraintsBuilder::default(), bindings_by_use: IndexVec::new(), multi_bindings_by_use: FxHashMap::default(), + return_exits: Vec::new(), + normal_exit: Vec::new(), reachability: ScopedReachabilityConstraintId::ALWAYS_TRUE, range_reachability: Vec::new(), checkpoint_flow: ScopedReachabilityConstraintId::ALWAYS_TRUE, @@ -2568,6 +2674,58 @@ impl<'db> UseDefMapBuilder<'db> { } } + /// basedpython: record the state of `places` where the `return` at `range` leaves the body. + /// + /// Unlike a use, this is the state a caller sees once the call has returned, so pending + /// narrowing gates are materialized along with reachability. + pub(super) fn record_return_exit( + &mut self, + range: TextRange, + through_finally: bool, + places: impl Iterator, + ) { + let places = self.current_place_bindings(places); + self.return_exits.push(ReturnExit { + range, + reachability: self.reachability, + through_finally, + places, + }); + } + + /// basedpython: record the state of `places` where the body returns, with every way out of it + /// already merged into the current state. + pub(super) fn record_normal_exit(&mut self, places: impl Iterator) { + self.normal_exit = self.current_place_bindings(places).into_vec(); + } + + fn current_place_bindings( + &mut self, + places: impl Iterator, + ) -> Box<[PlaceBindings]> { + let pending = self.pending_reachability.current; + places + .map(|place| { + let place_state = pending_place_state_mut( + place, + &mut self.symbol_states, + &mut self.member_states, + ); + let bindings = self + .pending_reachability + .materialize_ref( + place_state, + pending, + &mut self.narrowing_constraints, + &mut self.reachability_constraints, + ) + .bindings() + .clone(); + (place, bindings) + }) + .collect() + } + fn record_use_bindings(&mut self, bindings: Bindings, use_id: ScopedUseId) { let binding_definition_ids = bindings.iter().map(LiveBinding::binding); self.mark_definition_ids_used(binding_definition_ids); @@ -2956,6 +3114,21 @@ impl<'db> UseDefMapBuilder<'db> { &mut self.reachability_constraints, ); } + for exit in &mut self.return_exits { + self.reachability_constraints.mark_used(exit.reachability); + for (_, bindings) in &mut exit.places { + bindings.finish( + &mut self.narrowing_constraints, + &mut self.reachability_constraints, + ); + } + } + for (_, bindings) in &mut self.normal_exit { + bindings.finish( + &mut self.narrowing_constraints, + &mut self.reachability_constraints, + ); + } // Keep default entries while building so they remain barriers between non-contiguous // ranges with the same metadata. Once construction is complete, absence represents the // default of reachable code outside a `TYPE_CHECKING` block. @@ -2977,10 +3150,14 @@ impl<'db> UseDefMapBuilder<'db> { Self::zip_place_states(end_of_scope_members, reachable_definitions_by_member); let multi_bindings_by_use = MultiBindingsByUse::from_map(self.multi_bindings_by_use); let loop_headers = self.loop_headers; + let return_exits = self.return_exits.into_boxed_slice(); + let normal_exit = self.normal_exit.into_boxed_slice(); let extra = (!bindings_by_use.is_empty() || !member_states.is_empty() || !enclosing_snapshots.is_empty() - || !loop_headers.is_empty()) + || !loop_headers.is_empty() + || !return_exits.is_empty() + || !normal_exit.is_empty()) .then(|| { Box::new(UseDefMapExtra { bindings_by_use: bindings_by_use.into(), @@ -2988,6 +3165,8 @@ impl<'db> UseDefMapBuilder<'db> { member_states, enclosing_snapshots: enclosing_snapshots.into(), loop_headers: loop_headers.into(), + return_exits, + normal_exit, }) }); let predicates = self.predicates.build(); diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_escaping_local.md b/crates/ty_python_semantic/resources/mdtest/basedpython_escaping_local.md index 162812015c..2f56c6172d 100644 --- a/crates/ty_python_semantic/resources/mdtest/basedpython_escaping_local.md +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_escaping_local.md @@ -125,11 +125,11 @@ A store into an attribute of a `global` name outlives the call just as a bare st class Box: fn: object = None -_box: Box = Box() +box: Box = Box() def f(local fn: () -> None): - global _box - _box.fn = fn # error: [escaping-local] + global box + box.fn = fn # error: [escaping-local] ``` ## storing a local on `self` escapes @@ -360,14 +360,14 @@ def f(local xs: list[int]) -> None: Anything that could keep it still escapes, including a callee of the user's own. ```by -_registry: list[object] = [] +registry: list[object] = [] def keeps(x: object) -> None: - _registry.append(x) + registry.append(x) def g(local xs: list[int]) -> None: # error: [escaping-local] keeps(xs) # error: [escaping-local] - _registry.append(xs) + registry.append(xs) ``` diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_extensions.md b/crates/ty_python_semantic/resources/mdtest/basedpython_extensions.md index 68969df9c6..cc178f4183 100644 --- a/crates/ty_python_semantic/resources/mdtest/basedpython_extensions.md +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_extensions.md @@ -45,11 +45,11 @@ reveal_type(xs.pair("a")) # revealed: (int, "a") ```by class Stack[T]: def __init__(self, items: list[T]) -> None: - self._items = items + self.items = items extension Stack: def peek(self) -> T: - return self._items[-1] + return self.items[-1] s = Stack([1, 2, 3]) reveal_type(s.peek()) # revealed: int diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_inferred_narrowing.md b/crates/ty_python_semantic/resources/mdtest/basedpython_inferred_narrowing.md index 40ea39566f..15dc0ea4f7 100644 --- a/crates/ty_python_semantic/resources/mdtest/basedpython_inferred_narrowing.md +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_inferred_narrowing.md @@ -572,6 +572,206 @@ def f(x: A | None): reveal_type(checked) # revealed: def checked(a: A | None) -> A & protocol(b: int) ``` +## a body that returns nothing asserts what it establishes + +`def check(a) -> asserts a` tells every caller that `a` is truthy once the call has returned. A +`def` that leaves its return type out and returns nothing says the same thing by asserting it, and +the call narrows its argument for the rest of the flow. + +```by +def check(a: int | None): + assert a + +def f(x: int | None): + check(x) + reveal_type(x) # revealed: int & not AlwaysFalsy +``` + +What is recovered is only what the body established, so a call intersects it with the argument it +actually passed. + +```by +def require(a: int | None): + if a is None: + raise ValueError + +def f(x: int | None): + require(x) + reveal_type(x) # revealed: int +``` + +## every way out of the body has to agree + +A call returns through any `return` it reaches as well as by falling off the end of the body, so +what is asserted is what all of them establish. + +```by +def check(a: int | None): + if a: + return + raise ValueError + +def f(x: int | None): + check(x) + reveal_type(x) # revealed: int & not AlwaysFalsy +``` + +A `return` the body reaches before establishing anything leaves nothing asserted. + +```by +def check_unless(a: int | None, flag: bool): + if flag: + return + assert a + +def g(x: int | None): + check_unless(x, True) + reveal_type(x) # revealed: int | None +``` + +## a failure the body catches establishes nothing + +The body returns normally after an `AssertionError` it handles, whatever the argument was. + +```by +def check(a: int | None): + try: + assert a + except AssertionError: + pass + +def f(x: int | None): + check(x) + reveal_type(x) # revealed: int | None +``` + +## a member the body establishes narrows the argument's + +```by +class A: + b: int | None = None + +def check(a: A): + assert a.b is not None + +def f(x: A): + check(x) + reveal_type(x.b) # revealed: int +``` + +## a parameter the body puts something else in asserts nothing + +The body establishes something about what it assigned, not about the argument. + +```by +def check(a: int | None, b: int | None): + a = b + assert a + +def f(x: int | None, y: int | None): + check(x, y) + reveal_type(x) # revealed: int | None +``` + +## a body that returns a value asserts nothing + +The narrowing only reaches the code after a call written as a statement, and a call whose value is +used would lose it. So only a body with nothing to hand back is read as an assertion, the same as a +written `-> asserts`. + +```by +def check(a: int | None): + assert a + return a + +def f(x: int | None): + check(x) + reveal_type(x) # revealed: int | None +``` + +`return None` hands back nothing, the same as a bare `return`. + +```by +def check_nothing(a: int | None): + assert a + return None + +def g(x: int | None): + check_nothing(x) + reveal_type(x) # revealed: int & not AlwaysFalsy +``` + +## a coroutine asserts nothing until it is awaited + +Calling an `async def` without awaiting it never runs the body. + +```by +async def check(a: int | None): + assert a + +async def f(x: int | None): + check(x) # error: [unused-awaitable] + reveal_type(x) # revealed: int | None +``` + +## a `return` a `finally` suite can follow asserts nothing + +The suite runs before the `return` hands control back: it can swallow the exception that was on its +way out, as here, and it can change what the caller reads. What a caller sees is the state after +that suite, so nothing is recovered from a body that returns through one. + +```by +def check(a: int | None): + try: + assert a + finally: + return + +def f(x: int | None): + check(x) + reveal_type(x) # revealed: int | None +``` + +## a member the body asserts narrows the argument's member + +```by +class A: + b: int | None = None + +def check(a: A): + assert a.b is not None + +def f(x: A): + check(x) + reveal_type(x.b) # revealed: int +``` + +## an override is handed the assertion its base makes + +A call through the base narrows on the strength of what the base's body established, and what it is +called on may be an instance of the subclass. So the assertion carries to the override, whose own +body has to establish it — an override that does not is reported where it is written. + +```by +from typing import override + +class Base: + def ensure(self, x: int | None): + assert x + +class Silent(Base): + @override + # error: [unestablished-assertion-guard] "`x` is `int | None` where the body ends, but `Base.ensure`, which this overrides, asserts it is `not AlwaysFalsy`" + def ensure(self, x: int | None): + pass + +def f(base: Base, silent: Silent, a: int | None, b: int | None): + base.ensure(a) + reveal_type(a) # revealed: int & not AlwaysFalsy + silent.ensure(b) + reveal_type(b) # revealed: int & not AlwaysFalsy +``` + ## the same holds in a plain python file `sound-types` recovers a signature in a `.py` file too, and the narrowing it recovers is the same. diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_safe_variance.md b/crates/ty_python_semantic/resources/mdtest/basedpython_safe_variance.md index e35b659510..47c227931c 100644 --- a/crates/ty_python_semantic/resources/mdtest/basedpython_safe_variance.md +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_safe_variance.md @@ -217,6 +217,21 @@ def f(a: A[object]): reveal_type(a._t) # revealed: object ``` +## the underscore spelling is private in a `.by` file too + +A `.by` file spells privacy with `private`, so a leading underscore there says the name is unused +and a use of one is `used-underscore-name`. What the name means to variance is unchanged: `_t` is +private, and a private member constrains nothing. + +```by +class A[T]: + _t: T + +def f(a: A[object]): + # error: [used-underscore-name] + reveal_type(a._t) # revealed: object +``` + ## a dunder is not private A dunder is part of the public protocol surface, so it constrains variance in the usual way and diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_tuple_repetition.md b/crates/ty_python_semantic/resources/mdtest/basedpython_tuple_repetition.md new file mode 100644 index 0000000000..92e21bf69b --- /dev/null +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_tuple_repetition.md @@ -0,0 +1,402 @@ +# basedpython: repeated tuples + +A tuple repeated by an integer whose value is unknown has an unknown length, but its elements still +come in the order the tuple lists them. `(1, "a") * n` is `()`, `(1, "a")`, `(1, "a", 1, "a")` and +so on, so every even position holds `1` and every odd position holds `"a"`. The type `(A, B) * int` +describes exactly those tuples, spelled as the multiplication that produces them. + +```toml +[environment] +python-version = "3.12" +``` + +## multiplying a tuple by an integer + +Multiplying a tuple by an `int` produces a repeated tuple, whichever side the tuple is on. + +```by +def f(n: int): + reveal_type((1, "a") * n) # revealed: (1, "a") * int + reveal_type(n * (1, "a")) # revealed: (1, "a") * int +``` + +## spelling the type + +A repeated tuple type is written as a tuple type multiplied by `int`. + +```by +def f(pairs: (int, str) * int): + reveal_type(pairs) # revealed: (int, str) * int +``` + +Fixed elements before or after the repetitions are written around it, with the repeated tuple +unpacked into the outer tuple. + +```by +def f(framed: (bytes, *(int, str) * int, bytes)): + reveal_type(framed) # revealed: (bytes, *(int, str) * int, bytes) +``` + +A repeated tuple is a type like any other, so it can be aliased and used as a type argument. + +```by +type Pairs = (int, str) * int + +def f(pairs: Pairs, nested: list[(int, str) * int]): + reveal_type(pairs) # revealed: (int, str) * int + reveal_type(nested) # revealed: list[(int, str) * int] +``` + +## the length of the repeated run + +How many elements the run has is part of the type: repeating `(int, str, int, str)` produces lengths +0, 4, 8 and so on, while repeating `(int, str)` also produces 2 and 6. The two are different types, +and the longer run is the more specific one. + +```by +def f(quads: (int, str, int, str) * int, pairs: (int, str) * int): + reveal_type(quads) # revealed: (int, str, int, str) * int + shorter_run: (int, str) * int = quads + # error: [invalid-assignment] + longer_run: (int, str, int, str) * int = pairs +``` + +Repeating a run of one element is a homogeneous tuple, and repeating the empty tuple only ever +produces the empty tuple. + +```by +def f(ints: (int,) * int, empty: () * int): + reveal_type(ints) # revealed: (*: int) + reveal_type(empty) # revealed: () +``` + +A run of two identical types is not the homogeneous tuple of that type: it always has an even number +of elements. + +```by +def f(evens: (int, int) * int): + reveal_type(evens) # revealed: (int, int) * int + homogeneous: (*: int) = evens + # error: [invalid-assignment] + one: (int, int) * int = (1,) + two: (int, int) * int = (1, 2) +``` + +## indexing + +The element at an index is known from the repeated order, from either end. + +```by +def f(pairs: (int, str) * int): + reveal_type(pairs[0]) # revealed: int + reveal_type(pairs[1]) # revealed: str + reveal_type(pairs[2]) # revealed: int + reveal_type(pairs[-1]) # revealed: str + reveal_type(pairs[-2]) # revealed: int +``` + +When there are fixed elements before the repetitions, an index past them can land in the repetitions +or, when there are none, on an element after them. + +```by +def f(framed: (bytes, *(int, str) * int, bytes)): + reveal_type(framed[0]) # revealed: bytes + reveal_type(framed[1]) # revealed: int | bytes + reveal_type(framed[2]) # revealed: str + reveal_type(framed[3]) # revealed: int | bytes + reveal_type(framed[-2]) # revealed: bytes | str +``` + +## iterating + +Iterating a repeated tuple produces any of its elements. + +```by +def f(pairs: (int, str) * int): + for element in pairs: + reveal_type(element) # revealed: int | str +``` + +## unpacking + +Unpacking into fixed targets takes whole repetitions, so each target's element is known. + +```by +def f(pairs: (int, str) * int): + # error: [refutable-unpacking] + first, second = pairs + reveal_type(first) # revealed: int + reveal_type(second) # revealed: str +``` + +No number of repetitions has three elements, so unpacking into three targets always fails. + +```by +def f(pairs: (int, str) * int): + # error: [invalid-assignment] "Wrong number of values to unpack: Expected 3" + a, b, c = pairs +``` + +A starred target collects the elements between the fixed targets into a list. + +```by +def f(pairs: (int, str) * int): + # error: [refutable-unpacking] + first, *rest = pairs + reveal_type(first) # revealed: int + reveal_type(rest) # revealed: list[int | str] +``` + +A sequence pattern matches the same way, and a pattern with a length that no number of repetitions +has never matches. + +```by +def f(pairs: (int, str) * int): + match pairs: + case (first, second): + reveal_type(first) # revealed: int + reveal_type(second) # revealed: str + case (first, second, third): + reveal_type(third) # revealed: Never +``` + +## narrowing by length + +A length check narrows a repeated tuple to the fixed-length tuple with that many elements, or to +`Never` when no number of repetitions has that length. + +```by +def f(pairs: (int, str) * int): + if len(pairs) == 4: + reveal_type(pairs) # revealed: (int, str, int, str) + if len(pairs) == 3: + reveal_type(pairs) # revealed: Never +``` + +## concatenation + +Concatenating a fixed-length tuple keeps its elements in place around the repetitions. + +```by +def f(pairs: (int, str) * int, end: (bytes,)): + reveal_type(pairs + end) # revealed: (*(int, str) * int, bytes) + reveal_type(end + pairs) # revealed: (bytes, *(int, str) * int) +``` + +Concatenating a repeated tuple with itself repeats the same unit. + +```by +def f(pairs: (int, str) * int): + reveal_type(pairs + pairs) # revealed: (int, str) * int +``` + +Elements between two of the same repetitions join the run when they are a whole number of it, since +every length the two runs reach together is one run's own length plus those elements. + +```by +def f(pairs: (int, str) * int, one_run: (int, str), part: (int,)): + reveal_type(pairs + one_run + pairs) # revealed: (int, str, *(int, str) * int) + reveal_type(pairs + part + pairs) # revealed: (*: int | str) +``` + +Two different repetitions cannot share one repeated part, so their concatenation is a homogeneous +tuple of every element either one has. + +```by +def f(pairs: (int, str) * int, bytes_: (*: bytes)): + reveal_type(pairs + bytes_) # revealed: (*: int | str | bytes) +``` + +## assignability + +A fixed-length tuple is assignable to a repeated tuple when it is a whole number of repetitions of +compatible elements. + +```by +def f(): + empty: (int, str) * int = () + two: (int, str) * int = (1, "a", 2, "b") + # error: [invalid-assignment] + three: (int, str) * int = (1, "a", 2) + # error: [invalid-assignment] + swapped: (int, str) * int = ("a", 1) +``` + +A repeated tuple is assignable to a homogeneous tuple of its elements, but not to a fixed-length +tuple, since it can have any whole number of repetitions. + +```by +def f(pairs: (int, str) * int): + homogeneous: (*: int | str) = pairs + # error: [invalid-assignment] + fixed: (int, str) = pairs +``` + +A homogeneous tuple is not assignable to a repeated tuple, since its elements can come in any order +and number. + +```by +def f(elements: (*: int | str)): + # error: [invalid-assignment] + pairs: (int, str) * int = elements +``` + +That holds however wide the elements are: a tuple whose length is any number at all is not one whose +length is a multiple of two. + +```by +def f(elements: (*: int | str)): + # error: [invalid-assignment] + pairs: (int | str, int | str) * int = elements +``` + +A repeated tuple is assignable to another when its run is a whole number of the other's runs, with +compatible elements in the same positions. + +```by +def f(pairs: (int, str) * int, quads: (int, str, bool, str) * int): + wider: (int | bytes, str) * int = pairs + shorter_run: (int, str) * int = quads + # error: [invalid-assignment] + rotated: (str, int) * int = pairs + # error: [invalid-assignment] + longer_run: (int, str, bool, str) * int = pairs +``` + +Fixed elements around the repetitions line up with the target's, even when the two tuples split the +same elements differently between the fixed part and the repetitions. + +```by +def f(framed: (int, *(str, int) * int)): + same: (*(int, str) * int, int) = framed + # error: [invalid-assignment] + different: (*(str, int) * int, int) = framed +``` + +A tuple of unknown length and element type is assignable to a repeated tuple, as it is to any other +tuple. + +```by +from typing import Any + +def f(anything: (*: Any)): + pairs: (int, str) * int = anything +``` + +## slicing + +Reversing a repeated tuple reverses the order of its run, including any fixed elements around it. + +```by +def f(pairs: (int, str) * int, framed: (bytes, *(int, str) * int, bytes)): + reveal_type(pairs[::-1]) # revealed: (str, int) * int + reveal_type(framed[::-1]) # revealed: (bytes, *(str, int) * int, bytes) +``` + +Cutting whole fixed elements off either end keeps the repetitions. + +```by +def f(framed: (bytes, *(int, str) * int, bytes)): + reveal_type(framed[1:]) # revealed: (*(int, str) * int, bytes) +``` + +A slice that starts inside the repetitions has no repeated order left to describe: the elements it +keeps depend on how many repetitions there are. + +```by +def f(pairs: (int, str) * int): + reveal_type(pairs[2:]) # revealed: (*: int | str) +``` + +## variadic parameters + +A variadic parameter annotated with an unpacked repeated tuple accepts whole repetitions of +arguments. + +```by +def f(*args: *((int, str) * int)): + reveal_type(args) # revealed: (int, str) * int + +f() +f(1, "a") +f(1, "a", 2, "b") +``` + +Arguments that leave a repetition half filled are reported against the parameter as a whole, while +an argument of the wrong type is reported against that argument. + +```by +# error: [invalid-argument-type] "Arguments to `*args` of function `f` do not fill whole repetitions" +f(1, "a", 2) +# error: [invalid-argument-type] "Argument to function `f` is incorrect: Expected `int`, found `"a"`" +# error: [invalid-argument-type] "Argument to function `f` is incorrect: Expected `str`, found `1`" +f("a", 1) +``` + +A splatted argument is checked against the whole tuple too. Its elements have no known positions of +their own, so only a tuple that fills whole repetitions is accepted. + +```by +def splats(strings: (*: str), pairs: (int, str) * int, rotated: (str, int) * int): + f(*pairs) + f(*strings) # error: [invalid-argument-type] + f(*rotated) # error: [invalid-argument-type] + f(1, *strings) # error: [invalid-argument-type] +``` + +## callable and protocol parameters + +A function is only accepted where a repeated variadic is expected when it accepts every call that +parameter promises. + +```by +from typing import Protocol + +class Pairs(Protocol): + def __call__(self, *args: *((int, str) * int)) -> None: ... + +def anything(*args: object) -> None: ... +def elements(*args: int | str) -> None: ... +def same(*args: *((int, str) * int)) -> None: ... +def strings(*args: str) -> None: ... +def rotated(*args: *((str, int) * int)) -> None: ... +def two(a: int, b: str) -> None: ... +def tuples(*args: (*: int | str)) -> None: ... + +def f(): + a: Pairs = anything + b: Pairs = elements + c: Pairs = same + # error: [invalid-assignment] + d: Pairs = strings + # error: [invalid-assignment] + e: Pairs = rotated + # a call of two arguments is one repetition, but four is not two calls + # error: [invalid-assignment] + g: Pairs = two + # each argument is a tuple here, not an element of one + # error: [invalid-assignment] + h: Pairs = tuples +``` + +## generic functions + +A type parameter in a repeated run is solved from the elements at the same positions in the +argument, whether the argument repeats them or spells them out. + +```by +def pair_up[T, U](values: (T, U) * int) -> (U, T) * int: + return values[1], values[0] + +def f(n: int, quads: (int, str, bool, bytes) * int): + reveal_type(pair_up((1, "a") * n)) # revealed: ("a", 1) * int + reveal_type(pair_up(("a", 1))) # revealed: (1, "a") * int + reveal_type(pair_up(quads)) # revealed: (str | bytes, int) * int +``` + +An argument whose length is not a whole number of the run's repetitions does not match. + +```by +def g(): + pair_up(("a", 1, "b")) # error: [invalid-argument-type] +``` diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_type_guards.md b/crates/ty_python_semantic/resources/mdtest/basedpython_type_guards.md index f5ccef777d..d5210c923e 100644 --- a/crates/ty_python_semantic/resources/mdtest/basedpython_type_guards.md +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_type_guards.md @@ -113,8 +113,7 @@ def f() -> a is int: ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): reveal_type(a) # revealed: int | None @@ -128,8 +127,7 @@ It raises when the assertion doesn't hold, which is why using its value gets no ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): # error: [narrowing-guard-as-value] "an assertion guard narrows when it is called as a statement, and its value is only the `None` it returns" @@ -198,6 +196,277 @@ def check(x: int) -> asserts x is not str: return None ``` +## the body has to establish what it asserts + +Every call narrows its argument once it returns, so a body that can return without having +established the assertion narrows an argument to something it may not be. + +```by +# error: [unestablished-assertion-guard] "`x` is `int | None` where the body ends, but this function asserts it is truthy" +def check(x: int | None) -> asserts x: + pass +``` + +Ruling out `None` does not establish truthiness: `0` is still falsy. + +```by +# error: [unestablished-assertion-guard] "`x` is `int` where the body ends, but this function asserts it is truthy" +def check(x: int | None) -> asserts x: + if x is None: + raise ValueError +``` + +## each `return` has to establish it too + +A `return` is reported where it is. + +```by +def check(x: int | None) -> asserts x: + if x is None: + # error: [unestablished-assertion-guard] "`x` is `None` where this returns, but this function asserts it is truthy" + return + if not x: + raise ValueError +``` + +A `return` after the assertion holds is fine, and so is a body that never returns at all. + +```by +def check(x: int | None) -> asserts x: + if x: + return + raise ValueError + +def never(x: int | None) -> asserts x: + raise ValueError +``` + +## a failure the body catches establishes nothing + +```by +# error: [unestablished-assertion-guard] "`x` is `int | None` where the body ends, but this function asserts it is truthy" +def check(x: int | None) -> asserts x: + try: + assert x + except AssertionError: + pass +``` + +## the declared type is part of what the body establishes + +Ruling out `None` leaves only `1`, which is truthy, so the assertion holds — where the same body +under `int | None` would leave `0`. + +```by +from typing import Literal + +def check(x: Literal[1] | None) -> asserts x: + if x is None: + raise ValueError +``` + +## removing a type has to be established too + +```by +# error: [unestablished-assertion-guard] "`x` is `object` where the body ends, but this function asserts it is not `str`" +def require(x: object) -> asserts x is not str: + pass +``` + +## a body that rebinds the parameter asserts nothing about the argument + +The caller's argument is whatever it was; only the parameter holds what the body assigned. + +```by +# error: [unestablished-assertion-guard] "the body puts another value in `x`, so what it establishes is not about the argument this guard narrows" +def check(x: int | None, y: int | None) -> asserts x: + x = y + assert x +``` + +## a member the body assigns is established + +Unlike a parameter, a member is read back by the caller after the call, so an assignment is what it +reads. + +```by +class Holder: + data: int | None = None + + def load(self) -> asserts self.data is not None: + self.data = 1 + + # error: [unestablished-assertion-guard] "`self.data` is `int | None` where the body ends, but this function asserts it is not `None`" + def forget(self) -> asserts self.data is not None: + pass +``` + +## an assertion about a place is checked too + +```by +def src() -> int | None: + return 1 + +a = src() + +def check() -> asserts a is not None: + assert a is not None + +# error: [unestablished-assertion-guard] "`a` is `int | None` where the body ends, but this function asserts it is not `None`" +def forget() -> asserts a is not None: + pass +``` + +## a `def` that only declares one has no body to establish it + +A `...` body says the function is declared elsewhere — in a stub file, as an `@overload`, or as a +member of a `Protocol` — so there is nothing there to establish the assertion. A `pass` body is an +implementation, and an empty one establishes nothing. + +```by +from typing import Protocol + +class Reader(Protocol): + def ensure(self, x: int | None) -> asserts x: ... +``` + +## a `return` a `finally` suite can follow is left alone + +A `finally` suite runs before the `return` hands control back, and can swallow the exception that +was on its way out or change what the caller reads. What a caller sees is the state after that +suite, which is not the state at the `return`, so such a body is neither read as establishing the +assertion nor reported for failing to. + +```by +def check(x: int | None) -> asserts x: + try: + assert x + finally: + return +``` + +## an unannotated parameter is not an established one + +`Any` fits every assertion, which is the reason it says nothing about one. + +```by +from typing import Any + +# error: [unestablished-assertion-guard] "`x` is `Any` where the body ends, but this function asserts it is truthy" +def check(x: Any) -> asserts x: + pass +``` + +## ruling out every value of a type establishes the assertion + +`bool` is `True` and `False` and nothing else, so ruling both out rules out `bool` itself. + +```by +def check(x: object) -> asserts x is not bool: + if x is True or x is False: + raise ValueError +``` + +## a body that binds the place asserts nothing about the caller's + +A local of the place's name is a different place from the one a call narrows. + +```by +def src() -> int | None: + return 1 + +a = src() + +# error: [unestablished-assertion-guard] "the body puts another value in `a`, so what it establishes is not about the place this guard narrows" +def check() -> asserts a is not None: + a = 1 +``` + +Writing to the place itself is another matter: `global` names the place the caller reads. + +```by +def src() -> int | None: + return 1 + +b = src() + +def check() -> asserts b is not None: + global b + b = 1 +``` + +## rebinding what a member is read off ends what was established about it + +`a.c` is read off `a`, so replacing it leaves what the body established about `a.c.b` describing a +value the caller never sees. + +```by +class Inner: + b: int | None = None + +class Outer: + c: Inner = Inner() + +# error: [unestablished-assertion-guard] "`a.c.b` is `int | None` where the body ends, but this function asserts it is not `None`" +def check(a: Outer) -> asserts a.c.b is not None: + assert a.c.b is not None + a.c = Inner() +``` + +## an override has to establish what the method it overrides asserts + +A call through the base narrows on the strength of the base's assertion, and what it is called on +may be an instance of the subclass, so the override makes the same assertion — and has to establish +it. + +```by +from typing import override + +class Base: + def ensure(self, x: int | None) -> asserts x: + assert x + +class Silent(Base): + @override + # error: [unestablished-assertion-guard] "`x` is `int | None` where the body ends, but `Base.ensure`, which this overrides, asserts it is truthy" + def ensure(self, x: int | None): + pass + +class Loud(Base): + @override + def ensure(self, x: int | None): + assert x + +def f(base: Base, loud: Loud, a: int | None, b: int | None): + base.ensure(a) + reveal_type(a) # revealed: int & not AlwaysFalsy + # the override carries the assertion for its own callers too + loud.ensure(b) + reveal_type(b) # revealed: int & not AlwaysFalsy +``` + +## an override is free to rename a positional-only parameter + +The guard names a parameter of the base by name, and follows it by position into the override, which +is what lets a positional-only parameter be renamed. + +```by +from typing import override + +class Base: + def ensure(self, x: int | None, /) -> asserts x: + assert x + +class Renamed(Base): + @override + def ensure(self, value: int | None, /): + assert value + +def f(r: Renamed, a: int | None): + r.ensure(a) + reveal_type(a) # revealed: int & not AlwaysFalsy +``` + ## `asserts` can name a place with a type too ```by @@ -219,8 +488,7 @@ def m(): ```by def check(first: object, second: int | None) -> asserts second: - if second is None: - raise ValueError + assert second def f(a: object, b: int | None): check(a, b) @@ -232,21 +500,53 @@ def f(a: object, b: int | None): ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): check(x=a) reveal_type(a) # revealed: int & not AlwaysFalsy ``` +## a keyword of a positional-only parameter's name reaches a different parameter + +`check(x, a=y)` passes `x` for `a` and collects `a=y` into `**kw`, so `x` is the argument the +assertion is about. + +```by +def check(a: int | None = 1, /, **kw: str) -> asserts a: + assert a + +def f(x: int | None, y: str): + check(x, a=y) + reveal_type(x) # revealed: int & not AlwaysFalsy + reveal_type(y) # revealed: str +``` + +## a `classmethod` is called on the class, not on the receiver + +A bound method takes the value it was called on as its first parameter, so a guard on that +parameter's member narrows the receiver's. A `classmethod` takes the class instead, so `cls.value` +is not the place `c.value` names. + +```by +class C: + value: int | None = None + + @classmethod + def ensure(cls) -> asserts cls.value is not None: + assert cls.value is not None + +def f(c: C): + c.ensure() + reveal_type(c.value) # revealed: int | None +``` + ## a method asserts its own parameter ```by class C: def check(self, y: int | None) -> asserts y: - if y is None: - raise ValueError + assert y def f(c: C, a: int | None): c.check(a) @@ -262,8 +562,7 @@ def src() -> int | None: a = src() def check() -> asserts a: - if a is None: - raise ValueError + assert a def m(): check() @@ -274,8 +573,7 @@ def m(): ```by async def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x async def f(a: int | None): await check(a) @@ -289,8 +587,7 @@ class Holder: value: int | None = None def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(h: Holder): check(h.value) @@ -301,8 +598,7 @@ def f(h: Holder): ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None, flag: bool): if flag: @@ -315,8 +611,7 @@ def f(a: int | None, flag: bool): ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None, b: int | None): check(a) @@ -328,8 +623,7 @@ def f(a: int | None, b: int | None): ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(args: list[int | None]): check(*args) # error: [refutable-unpacking] @@ -461,8 +755,7 @@ def outer(): a = src() def check() -> asserts a: - if a is None: - raise ValueError + assert a check() reveal_type(a) # revealed: int & not AlwaysFalsy @@ -474,8 +767,7 @@ Testing its value gets no narrowing — the value is `None`, so the test is alwa ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): if check(a): # error: [narrowing-guard-as-value] @@ -486,8 +778,7 @@ def f(a: int | None): ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): ok = check(a) # error: [narrowing-guard-as-value] @@ -518,6 +809,5 @@ def check(x: int) -> asserts 1 + 1: # error: [invalid-type-form] "`asserts` mus ```py def check(x: int | None) -> asserts x: # error: [invalid-syntax] "`asserts` return annotations are not valid in .py files" - if x is None: - raise ValueError + assert x ``` diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_used_underscore_name.md b/crates/ty_python_semantic/resources/mdtest/basedpython_used_underscore_name.md new file mode 100644 index 0000000000..ce419e7863 --- /dev/null +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_used_underscore_name.md @@ -0,0 +1,467 @@ +# used underscore names + +basedpython spells privacy with `private` and `protected`, so in a `.by` file a leading underscore +says only that a name is unused. a use of one is `used-underscore-name` + +## a use of an underscore name + +a function, a class, a variable and a parameter are all reported where they are read + +```by +def _parse(text: str) -> int: + return int(text) + +class _Config: ... + +_limit = 3 + +def scale(_factor: int) -> int: + return _factor * 2 # error: [used-underscore-name] "`_factor` is used, but its leading underscore marks it unused" + +_parse("1") # error: [used-underscore-name] "`_parse` is used, but its leading underscore marks it unused" +_Config() # error: [used-underscore-name] +print(_limit) # error: [used-underscore-name] +``` + +## an unused underscore name + +declaring an underscore name, and never reading it, is what the underscore says + +```by +def handler(_event: str) -> None: ... + +for _index in range(3): + pass + +_ignored = handler("click") +``` + +## `_` and dunders + +`_` and a dunder have meanings python gives them, so neither is reported + +```by +for _ in range(3): + print(_) + +def __helper__() -> int: + return 1 + +__helper__() +``` + +## an augmented assignment reads its target + +`_count += 1` reads `_count` before it writes it + +```by +_count = 0 +_count += 1 # error: [used-underscore-name] +``` + +## a name imported from another `.by` module + +importing an underscore name reads it from the module that declared it, and so does every use + +`helpers.by`: + +```by +def _parse(text: str) -> int: + return int(text) +``` + +`main.by`: + +```by +import helpers +from helpers import _parse # error: [used-underscore-name] + +_parse("1") # error: [used-underscore-name] +helpers._parse("1") # error: [used-underscore-name] +``` + +## the report points at the declaration it resolved to + + + +a name declared in another file is the case where where it was spelled is most of the answer + +`shared.by`: + +```by +def _parse(text: str) -> int: + return int(text) +``` + +`main.by`: + +```by +from shared import _parse # error: [used-underscore-name] + +_parse("1") # error: [used-underscore-name] +``` + +## an alias spells a name of its own + +an import alias picks the spelling it binds. `as _local` is spelled here, so its uses are reported, +and `as parse` replaces the underscore name with one of its own — leaving only the import, which +reads `_parse` from the module that declared it + +`tools.by`: + +```by +def _parse(text: str) -> int: + return int(text) + +def parse(text: str) -> int: + return int(text) +``` + +`main.by`: + +```by +from tools import parse as _local +from tools import _parse as parse # error: [used-underscore-name] + +_local("1") # error: [used-underscore-name] +parse("1") +``` + +## python and stubs spell their own names + +a name python or a stub declares is not the `.by` author's to rename + +`library.py`: + +```py +def _helper() -> int: + return 1 + +class Base: + _state: int = 0 + + def _hook(self) -> None: ... +``` + +`main.by`: + +```by +import sys +from library import _helper, Base + +_helper() +sys._getframe() +print(Base()._state) +``` + +## an override keeps the name of the member it overrides + +a member declared on a python base class keeps its python name, even where a `.by` class overrides +it + +`framework.py`: + +```py +class Handler: + def _hook(self) -> None: ... +``` + +`main.by`: + +```by +from framework import Handler + +class Mine(Handler): + def _hook(self) -> None: ... + + def run(self) -> None: + self._hook() +``` + +## a member declared in a `.by` class + +a member of a `.by` class is read through `self`, through an instance, and through the class itself + +```by +class Account: + _rate: float = 0.05 + + def __init__(self) -> None: + self._balance = 0 + + def interest(self) -> float: + # error: [used-underscore-name] "`_balance` is used" + # error: [used-underscore-name] "`_rate` is used" + return self._balance * self._rate + +def audit(account: Account) -> int: + return account._balance # error: [used-underscore-name] + +print(Account._rate) # error: [used-underscore-name] +``` + +## a member of a stub class + +a `NamedTuple`'s `_asdict` is declared by typeshed + +```by +from typing import NamedTuple + +class Point(NamedTuple): + x: int + +Point(1)._asdict() +``` + +## a class pattern reads its keywords + +a keyword in a class pattern names a member of the subject, so it reads one exactly as `box._item` +does. the assignment that declares the member is not a use + +```by +class Box: + def __init__(self, _item: int) -> None: + self._item = _item # error: [used-underscore-name] "`_item` is used" + +def unbox(box: Box) -> int: + match box: + case Box(_item=item): # error: [used-underscore-name] + return item + return 0 +``` + +the `_item` reported above is the parameter being read, not the attribute being written: a write is +not a use, and neither is a declaration + +```by +class Crate: + _item: int = 0 + + def fill(self) -> None: + self._item = 1 +``` + +## an `extension` member + +a member an `extension` supplies is not declared by the class it extends, but it is still a name a +`.by` file spelled + +```by +extension list: + def _second(self) -> object: + return self[1] + +def pick(xs: list[int]) -> object: + return xs._second() # error: [used-underscore-name] +``` + +an extension body reads the members of the class it extends, and those are the extended class's own +names + +```by +class Stack[T]: + def __init__(self, items: list[T]) -> None: + self._items = items + +extension Stack: + def peek(self) -> T: + return self._items[-1] # error: [used-underscore-name] +``` + +## a receiver callable + +a callable with a receiver is read off the receiver like a member, and is still the name the +parameter declared + +```by +def apply(_render: int.() -> str) -> str: + return (1)._render() # error: [used-underscore-name] +``` + +## a member of an inline protocol + +an inline protocol declares its members in the annotation the receiver was written with, and that is +where the name was spelled + +```by +def read(p: protocol(_size: int)) -> int: + return p._size # error: [used-underscore-name] +``` + +## a member read unqualified in a trailing lambda block + +a trailing lambda block sees its receiver's members unqualified, so a bare name in one reads a +member + +```by +class Builder: + _size: int = 0 + +def build(block: Builder.() -> None) -> None: ... + +build(): + print(_size) # error: [used-underscore-name] +``` + +## a keyword argument names a parameter + +a caller writing `f(_p=1)` names the parameter, so the underscore contradicts the signature at the +call site. a dataclass field is the same: its name is the keyword its constructor takes + +```by +from dataclasses import dataclass + +def scale(_factor: int) -> int: + return _factor * 2 # error: [used-underscore-name] + +@dataclass +class Point: + _x: int + +scale(_factor=2) # error: [used-underscore-name] +Point(_x=1) # error: [used-underscore-name] +``` + +## `del` names the binding it deletes + +```by +_cache = {1: 2} +del _cache # error: [used-underscore-name] +``` + +## `super()` reads the member off the base it resolves to + +```by +class Base: + def _hook(self) -> int: + return 1 + +class Child(Base): + def run(self) -> int: + return super()._hook() # error: [used-underscore-name] +``` + +## an `init(...)` parameter declares an attribute + +`init(let _x: int)` stands for a `self._x = _x` the author never wrote. the attribute it declares is +spelled by the parameter, so reading it is reported — and the assignment standing behind the +parameter is not a read of anything + +```by +class Account: + init(self, let _balance: int) + +def audit(account: Account) -> int: + return account._balance # error: [used-underscore-name] +``` + +## a submodule of a `.by` package + +each segment of an import names a module, and a module is spelled by the name of its file + +`pkg/__init__.by`: + +```by +``` + +`pkg/_internal.by`: + +```by +def helper() -> int: + return 1 +``` + +`main.by`: + +```by +import pkg._internal # error: [used-underscore-name] + +pkg._internal.helper() # error: [used-underscore-name] +``` + +## a class that mixes `.by` and python declarations + +where the classes a receiver can be disagree about who spelled the name, the python spelling decides +it: renaming would break that half + +`library.py`: + +```py +class Vendor: + _state: int = 0 +``` + +`main.by`: + +```by +from library import Vendor + +class Mine: + _state: int = 0 + +def read(x: Mine | Vendor) -> int: + return x._state +``` + +## a member declared in a stub + +a `.byi` stub describes an interface someone else spelled + +`vendor.byi`: + +```byi +class Client: + _session: int +``` + +`main.by`: + +```by +from vendor import Client + +def read(c: Client) -> int: + return c._session +``` + +## a class with a base nothing can resolve + +an unknown base may declare any member at all, so nothing here can be said to be the author's + +```by +from unresolvable import Mystery # error: [unresolved-import] + +class Mine(Mystery): + _x: int = 0 + +def read(m: Mine) -> int: + return m._x +``` + +## names basedpython spells + +a property's `field` reads storage the parser names `__x`, and an enum variant's anonymous fields +are `_0`, `_1`, … — the author wrote neither name, so neither is reported + +```by +class Person: + var age: int = 0 + get() = field + set(value): + field = value + +enum class Shape: + case Square(int) + +print(Shape.Square(1)._0) +``` + +## a `.py` file keeps python's convention + +in python a leading underscore means private, so nothing is reported + +```py +def _parse(text: str) -> int: + return int(text) + +_parse("1") +``` diff --git a/crates/ty_python_semantic/resources/mdtest/basedpython_visibility.md b/crates/ty_python_semantic/resources/mdtest/basedpython_visibility.md index 300dd130cd..6c44356f21 100644 --- a/crates/ty_python_semantic/resources/mdtest/basedpython_visibility.md +++ b/crates/ty_python_semantic/resources/mdtest/basedpython_visibility.md @@ -419,17 +419,19 @@ def bump(b: Base) -> None: b.count = 1 # error: [inaccessible-member] ``` -## a plain underscore name is left to convention +## a plain underscore name is no `inaccessible-member` `_name` and `__name` written out are what python itself offers, and they mean whatever the author -meant by them. only a visibility keyword makes the boundary something to enforce. +meant by them. only a visibility keyword makes the boundary something to enforce, so reading one +from outside the class is not `inaccessible-member`. in a `.by` file the underscore says the name is +unused, so the read is `used-underscore-name` instead ```by class Base: _step: int = 2 def read(b: Base) -> int: - return b._step + return b._step # error: [used-underscore-name] ``` ## declaring a member less visible than the one it inherits diff --git a/crates/ty_python_semantic/resources/mdtest/binary/tuples.md b/crates/ty_python_semantic/resources/mdtest/binary/tuples.md index 038db460f5..7e3df20084 100644 --- a/crates/ty_python_semantic/resources/mdtest/binary/tuples.md +++ b/crates/ty_python_semantic/resources/mdtest/binary/tuples.md @@ -16,16 +16,32 @@ def _(x: tuple[int, str], y: tuple[None, tuple[int]]): reveal_type(y + x) # revealed: tuple[None, tuple[int], int, str] ``` -## Concatenation for homogeneous tuples +## Concatenation for variable-length tuples + +Concatenating onto a variable-length tuple keeps the elements whose positions are known from either +end, so the fixed elements before and after the variable-length part survive. + +```py +def _(x: tuple[int, ...], y: tuple[str, ...]): + reveal_type((1, 2) + x) # revealed: tuple[Literal[1], Literal[2], *tuple[int, ...]] + reveal_type(x + (3, 4)) # revealed: tuple[*tuple[int, ...], Literal[3], Literal[4]] + reveal_type((1, 2) + x + (3, 4)) # revealed: tuple[Literal[1], Literal[2], *tuple[int, ...], Literal[3], Literal[4]] +``` + +A tuple has only one variable-length part, so joining two of them folds both, along with the +elements between them, into a single homogeneous part. ```py def _(x: tuple[int, ...], y: tuple[str, ...]): - reveal_type(x + x) # revealed: tuple[int, ...] reveal_type(x + y) # revealed: tuple[int | str, ...] - reveal_type((1, 2) + x) # revealed: tuple[int, ...] - reveal_type(x + (3, 4)) # revealed: tuple[int, ...] - reveal_type((1, 2) + x + (3, 4)) # revealed: tuple[int, ...] - reveal_type((1, 2) + y + (3, 4) + x) # revealed: tuple[int | str, ...] + reveal_type((1, 2) + y + (3, 4) + x) # revealed: tuple[Literal[1], Literal[2], *tuple[int | str, ...]] +``` + +Joining a variable-length part to itself needs no widening: `x + x` has exactly the values of `x`. + +```py +def _(x: tuple[int, ...]): + reveal_type(x + x) # revealed: tuple[int, ...] ``` We get the same results even when we use a legacy type alias, even though this involves first @@ -44,10 +60,10 @@ StrTuple = tuple[str, ...] def _(one_two: OneTwo, x: IntTuple, y: StrTuple, three_four: ThreeFour): reveal_type(x + x) # revealed: tuple[int, ...] reveal_type(x + y) # revealed: tuple[int | str, ...] - reveal_type(one_two + x) # revealed: tuple[int, ...] - reveal_type(x + three_four) # revealed: tuple[int, ...] - reveal_type(one_two + x + three_four) # revealed: tuple[int, ...] - reveal_type(one_two + y + three_four + x) # revealed: tuple[int | str, ...] + reveal_type(one_two + x) # revealed: tuple[Literal[1], Literal[2], *tuple[int, ...]] + reveal_type(x + three_four) # revealed: tuple[*tuple[int, ...], Literal[3], Literal[4]] + reveal_type(one_two + x + three_four) # revealed: tuple[Literal[1], Literal[2], *tuple[int, ...], Literal[3], Literal[4]] + reveal_type(one_two + y + three_four + x) # revealed: tuple[Literal[1], Literal[2], *tuple[int | str, ...]] ``` ## Repetition for heterogeneous tuples @@ -69,18 +85,54 @@ reveal_type((1, "a") * 0) # revealed: tuple[()] reveal_type((1, "a") * -2) # revealed: tuple[()] ``` -A non-literal factor, or a factor that would produce a tuple longer than the folding limit, falls -back to typeshed's `tuple.__mul__` (which widens to `tuple[T, ...]`). +A non-literal factor repeats the tuple an unknown number of times. The number of elements is +unknown, but their order is not: `(1, "a") * n` always alternates `1` and `"a"`. Python has no +spelling for that type, so it is displayed as the multiplication that produces it. ```py def _(n: int): - reveal_type((1, "a") * n) # revealed: tuple[Literal[1, "a"], ...] - reveal_type((0,) * 1000) # revealed: tuple[Literal[0], ...] + reveal_type((1, "a") * n) # revealed: tuple[Literal[1], Literal["a"]] * int + reveal_type(n * (1, "a")) # revealed: tuple[Literal[1], Literal["a"]] * int ``` -Homogeneous (variable-length) tuples are also left to `tuple.__mul__`. +A repeated single element is a homogeneous tuple. ```py -def _(x: tuple[int, ...]): +def _(n: int): + reveal_type((0,) * n) # revealed: tuple[Literal[0], ...] +``` + +A factor that would produce a tuple longer than the folding limit keeps the repeated order rather +than spelling out every element. + +```py +reveal_type((0,) * 1000) # revealed: tuple[Literal[0], ...] +reveal_type((0, "a") * 1000) # revealed: tuple[Literal[0], Literal["a"]] * int +``` + +Repeating a tuple that is already a repetition, with no elements before or after it, has the same +values as the tuple itself. + +```py +def _(x: tuple[int, ...], n: int): reveal_type(x * 3) # revealed: tuple[int, ...] + reveal_type(x * n) # revealed: tuple[int, ...] + reveal_type((1, "a") * n * n) # revealed: tuple[Literal[1], Literal["a"]] * int +``` + +When the tuple has elements before or after its variable-length part, those elements would +interleave with the repetitions, so the result falls back to typeshed's `tuple.__mul__`. + +```py +def _(x: tuple[int, ...], n: int): + reveal_type((("a",) + x) * n) # revealed: tuple[Literal["a"] | int, ...] +``` + +The fold only applies when the multiplication reaches `tuple`'s own `__mul__` or `__rmul__`. A +factor that `tuple.__mul__` rejects is reported as usual. + +```py +def _(s: str): + # error: [unsupported-operator] + (1, "a") * s ``` diff --git a/crates/ty_python_semantic/resources/mdtest/generics/pep695/variance.md b/crates/ty_python_semantic/resources/mdtest/generics/pep695/variance.md index 52b56d605d..e825474603 100644 --- a/crates/ty_python_semantic/resources/mdtest/generics/pep695/variance.md +++ b/crates/ty_python_semantic/resources/mdtest/generics/pep695/variance.md @@ -2217,13 +2217,13 @@ it produces the instance rather than writing through an existing one: ```by class Frozen[out T]: - _value: T + let value: T init(self, value: T): - self._value = value + self.value = value def get(self) -> T: - return self._value + return self.value ``` #### a private member is off the observable surface diff --git a/crates/ty_python_semantic/resources/mdtest/narrow/conditionals/in.md b/crates/ty_python_semantic/resources/mdtest/narrow/conditionals/in.md index 5629093680..00b7a51d91 100644 --- a/crates/ty_python_semantic/resources/mdtest/narrow/conditionals/in.md +++ b/crates/ty_python_semantic/resources/mdtest/narrow/conditionals/in.md @@ -1434,6 +1434,30 @@ def test(x: Status | int): reveal_type(x) # revealed: Literal[Status.REJECTED] | int ``` +## Membership of an enum whose members have a known truthiness + +A member of an enum with a data type is falsy or truthy according to the value it was declared with, +so a value already known to be truthy cannot be the member declared `0`. Narrowing a truthy `int` by +membership of an `IntEnum` leaves the members it could still be, rather than each member paired with +an exclusion that only one of them needed. + +```py +from enum import IntEnum + +class Priority(IntEnum): + NONE = 0 + LOW = 1 + HIGH = 2 + +def _(x: int, priorities: tuple[Priority, ...]): + if x and x in priorities: + reveal_type(x) # revealed: Literal[Priority.LOW, Priority.HIGH] + +def _(x: int, priorities: tuple[Priority, ...]): + if x in priorities: + reveal_type(x) # revealed: Priority +``` + ## Union with tuple and `Literal` A built-in tuple cannot compare equal to a string literal, so the tuple alternative is excluded from diff --git "a/crates/ty_python_semantic/resources/mdtest/snapshots/basedpython_used_und\342\200\246_-_used_underscore_name\342\200\246_-_the_report_points_at\342\200\246_(820f89a26f35eb22).snap" "b/crates/ty_python_semantic/resources/mdtest/snapshots/basedpython_used_und\342\200\246_-_used_underscore_name\342\200\246_-_the_report_points_at\342\200\246_(820f89a26f35eb22).snap" new file mode 100644 index 0000000000..dbc7b7b5f1 --- /dev/null +++ "b/crates/ty_python_semantic/resources/mdtest/snapshots/basedpython_used_und\342\200\246_-_used_underscore_name\342\200\246_-_the_report_points_at\342\200\246_(820f89a26f35eb22).snap" @@ -0,0 +1,58 @@ +--- +source: crates/mdtest/src/lib.rs +expression: snapshot +--- + +--- +mdtest name: basedpython_used_underscore_name.md - used underscore names - the report points at the declaration it resolved to +mdtest path: crates/ty_python_semantic/resources/mdtest/basedpython_used_underscore_name.md +--- + +# Source files + +## shared.by + +``` +1 | def _parse(text: str) -> int: +2 | return int(text) +``` + +## main.by + +``` +1 | from shared import _parse # error: [used-underscore-name] +2 | +3 | _parse("1") # error: [used-underscore-name] +``` + +# Diagnostics + +``` +warning[used-underscore-name]: `_parse` is used, but its leading underscore marks it unused + --> src/main.by:1:20 + | +1 | from shared import _parse # error: [used-underscore-name] + | ^^^^^^ + | + ::: src/shared.by:1:5 + | +1 | def _parse(text: str) -> int: + | ------ `_parse` is declared here +info: drop the underscore, or declare it `private` if it is meant to be private + +``` + +``` +warning[used-underscore-name]: `_parse` is used, but its leading underscore marks it unused + --> src/main.by:3:1 + | +3 | _parse("1") # error: [used-underscore-name] + | ^^^^^^ + | + ::: src/shared.by:1:5 + | +1 | def _parse(text: str) -> int: + | ------ `_parse` is declared here +info: drop the underscore, or declare it `private` if it is meant to be private + +``` diff --git a/crates/ty_python_semantic/resources/mdtest/type_properties/truthiness.md b/crates/ty_python_semantic/resources/mdtest/type_properties/truthiness.md index 831649467b..588c31fa6c 100644 --- a/crates/ty_python_semantic/resources/mdtest/type_properties/truthiness.md +++ b/crates/ty_python_semantic/resources/mdtest/type_properties/truthiness.md @@ -231,6 +231,84 @@ reveal_type(bool(CustomLenEnum.NO)) # revealed: Literal[False] reveal_type(bool(CustomLenEnum.YES)) # revealed: Literal[False] ``` +## Enums with a data type + +An enum can be given a data type — `IntEnum`, `StrEnum`, or a built-in written out as a base. Its +members are instances of that data type as well, and the enum defines no `__bool__` of its own, so +the one `bool()` finds is the data type's: it reads the value the member was declared with, and a +member declared `0` or `""` is falsy for the same reason `0` and `""` are. + +```toml +[environment] +python-version = "3.11" +``` + +```py +from enum import Enum, IntEnum, StrEnum + +class Priority(IntEnum): + NONE = 0 + LOW = 1 + +class Name(StrEnum): + ANONYMOUS = "" + KNOWN = "ada" + +class Colour(int, Enum): + BLACK = 0 + WHITE = 0xFFFFFF + +reveal_type(bool(Priority.NONE)) # revealed: Literal[False] +reveal_type(bool(Priority.LOW)) # revealed: Literal[True] +reveal_type(bool(Name.ANONYMOUS)) # revealed: Literal[False] +reveal_type(bool(Name.KNOWN)) # revealed: Literal[True] +reveal_type(bool(Colour.BLACK)) # revealed: Literal[False] +reveal_type(bool(Colour.WHITE)) # revealed: Literal[True] +``` + +An enum that writes its own `__bool__` has taken the decision away from its data type, whatever its +members were declared with — and so has one that inherits that method from an enum class it extends. + +```py +from typing import Literal + +class Decides(int, Enum): + ZERO = 0 + ONE = 1 + + def __bool__(self) -> Literal[False]: + return False + +class DecidingBase(int, Enum): + def __bool__(self) -> Literal[False]: + return False + +class Inherits(DecidingBase): + ZERO = 0 + ONE = 1 + +reveal_type(bool(Decides.ZERO)) # revealed: Literal[False] +reveal_type(bool(Decides.ONE)) # revealed: Literal[False] +reveal_type(bool(Inherits.ZERO)) # revealed: Literal[False] +reveal_type(bool(Inherits.ONE)) # revealed: Literal[False] +``` + +A `__new__` that replaces the value means the member does not hold what its declaration says, so +there is nothing to read and `bool()` says what it says about any other instance. + +```py +class Doubled(int, Enum): + ZERO = 0 + ONE = 1 + + def __new__(cls, value: int) -> "Doubled": + member = int.__new__(cls, value + 1) + member._value_ = value + 1 + return member + +reveal_type(bool(Doubled.ZERO)) # revealed: bool +``` + ## TypedDict It may be feasible to infer `Literal[True]` for some `TypedDict` types, if `{}` can definitely be diff --git a/crates/ty_python_semantic/src/lib.rs b/crates/ty_python_semantic/src/lib.rs index 1151611262..fb9dba7387 100644 --- a/crates/ty_python_semantic/src/lib.rs +++ b/crates/ty_python_semantic/src/lib.rs @@ -68,9 +68,9 @@ pub use types::static_resource::{ResourceError, render_as, resolve_static_resour pub use types::template::finite_string_set; pub use types::visibility::private_symbols; pub use types::{ - DisplaySettings, FixtureBinding, FixtureExposure, FixtureNameSource, ProgramEnvironment, - TypeQualifiers, fixture_bindings_for_parameter, fixture_exposures_for_definition, - pytest_global_plugin_files, + CollectedTest, CollectedTestClass, DisplaySettings, FixtureBinding, FixtureExposure, + FixtureNameSource, ProgramEnvironment, TypeQualifiers, collected_pytest_tests, + fixture_bindings_for_parameter, fixture_exposures_for_definition, pytest_global_plugin_files, }; pub mod api_lockfile; diff --git a/crates/ty_python_semantic/src/types.rs b/crates/ty_python_semantic/src/types.rs index e918e6ca2d..c9fa0a1949 100644 --- a/crates/ty_python_semantic/src/types.rs +++ b/crates/ty_python_semantic/src/types.rs @@ -31,8 +31,9 @@ pub use self::cyclic::CycleDetector; pub(crate) use self::cyclic::TypeTransformer; use self::cyclic::{ActiveRecursionDetector, TypeIdentity}; pub use self::dedicated::pytest::{ - FixtureBinding, FixtureExposure, FixtureNameSource, fixture_bindings_for_parameter, - fixture_exposures_for_definition, pytest_global_plugin_files, + CollectedTest, CollectedTestClass, FixtureBinding, FixtureExposure, FixtureNameSource, + collected_pytest_tests, fixture_bindings_for_parameter, fixture_exposures_for_definition, + pytest_global_plugin_files, }; pub(crate) use self::diagnostic::TypeCheckDiagnostics; pub(crate) use self::diagnostic::register_lints; @@ -250,6 +251,7 @@ pub(crate) mod type_fn; mod type_form; mod typed_dict; mod typevar; +pub(crate) mod underscore_names; mod unpacker; mod unsafe_union; mod variance; diff --git a/crates/ty_python_semantic/src/types/bool.rs b/crates/ty_python_semantic/src/types/bool.rs index 84e29b561a..5950d982eb 100644 --- a/crates/ty_python_semantic/src/types/bool.rs +++ b/crates/ty_python_semantic/src/types/bool.rs @@ -391,9 +391,18 @@ impl<'db> Type<'db> { Truthiness::Ambiguous } } - LiteralValueTypeKind::Enum(enum_type) => enum_type - .enum_class_instance(db, env) - .try_bool_impl(db, env, allow_short_circuit, visitor)?, + // A member of an enum with a built-in data type is the `int` or the `str` it + // was declared with as far as `bool()` is concerned, and asking the enum's + // instance type instead loses that: `int.__bool__` returns `bool`, so every + // member of a `class Priority(IntEnum)` would read as ambiguously truthy + LiteralValueTypeKind::Enum(enum_type) => { + match enum_type.member_truthiness(db, env) { + Some(truthiness) => truthiness, + None => enum_type + .enum_class_instance(db, env) + .try_bool_impl(db, env, allow_short_circuit, visitor)?, + } + } LiteralValueTypeKind::Int(num) => Truthiness::from(num.as_i64() != 0), LiteralValueTypeKind::Bool(bool) => Truthiness::from(bool), diff --git a/crates/ty_python_semantic/src/types/call.rs b/crates/ty_python_semantic/src/types/call.rs index 7a6a9f12a4..9ae8ff923b 100644 --- a/crates/ty_python_semantic/src/types/call.rs +++ b/crates/ty_python_semantic/src/types/call.rs @@ -221,6 +221,36 @@ impl<'db> Type<'db> { try_call_bin_op_result_impl(db, env.program(db), left_ty, op, right_ty, tcx).as_ref() } + /// basedpython: whether this operation resolves to the method named `method` bound to + /// `receiver`, which is one of the two operands + /// + /// a fold that knows more about an operation than its declared return type says, such as + /// `tuple.__mul__` repeating the tuple's elements, applies only when the operation resolves + /// to that method. this is ty's own dispatch, which asks the left operand first; cpython + /// instead offers a multiplication to both operands' number protocols before it repeats a + /// sequence, so an `int` subclass whose `__rmul__` answers something else wins there and not + /// here — the divergence every binary operation in ty already has + pub(crate) fn bin_op_calls_method_of( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + left_ty: Type<'db>, + op: ast::Operator, + right_ty: Type<'db>, + receiver: Type<'db>, + method: &str, + ) -> bool { + Self::try_call_bin_op(db, env, left_ty, op, right_ty).is_ok_and(|bindings| { + bindings.single_element().is_some_and(|binding| { + matches!( + binding.callable_type, + Type::BoundMethod(bound) + if bound.self_instance(db) == receiver + && bound.function(db).name(db) == method + ) + }) + }) + } + pub(crate) fn try_call_bin_op( db: &'db dyn Db, env: &ProgramEnvironment<'db>, diff --git a/crates/ty_python_semantic/src/types/call/bind.rs b/crates/ty_python_semantic/src/types/call/bind.rs index ce89c6fa5a..88ff6add30 100644 --- a/crates/ty_python_semantic/src/types/call/bind.rs +++ b/crates/ty_python_semantic/src/types/call/bind.rs @@ -1544,6 +1544,25 @@ impl<'db> Bindings<'db> { } /// Returns the single `CallableBinding` if this is not a union or intersection. + /// basedpython: every parameter a matching overload declares under `name`, + /// which is what a keyword argument written `name=...` names + pub(crate) fn keyword_parameters<'a>( + &'a self, + name: &'a str, + ) -> impl Iterator> + 'a { + self.elements + .iter() + .flat_map(|element| element.items.iter().map(CallableItem::callable)) + .flat_map(CallableBinding::matching_overloads) + .filter_map(move |(_, overload)| { + overload + .signature + .parameters() + .keyword_by_name(name) + .map(|(_, parameter)| parameter) + }) + } + pub(crate) fn single_element(&self) -> Option<&CallableBinding<'db>> { if self.is_single() { self.elements @@ -5941,6 +5960,9 @@ impl<'a, 'db> ArgumentMatcher<'a, 'db> { return; } + // basedpython: a length that is not a whole number of repetitions of + // `*args: *((int, str) * int)` has no per-argument expected types to hand out. + // `check_repeated_variadic_arguments` reports those arguments against the whole tuple. let Ok(expected) = tuple.resize(db, env, argument_length) else { return; }; @@ -6895,7 +6917,7 @@ impl<'a, 'db> ArgumentTypeChecker<'a, 'db> { } let Some((actual, argument_indices)) = - self.collect_typevartuple_arguments(parameter_index, parameter, formal) + self.collect_variadic_argument_tuple(parameter_index, parameter, formal) else { return true; }; @@ -7009,7 +7031,7 @@ impl<'a, 'db> ArgumentTypeChecker<'a, 'db> { /// tail(*values) # collected `*args`: tuple[str, bytes] /// prefixed(*numbers) # collected `*args`: tuple[int, *tuple[int, ...]] /// ``` - fn collect_typevartuple_arguments( + fn collect_variadic_argument_tuple( &self, parameter_index: usize, parameter: &Parameter<'db>, @@ -7515,7 +7537,64 @@ impl<'a, 'db> ArgumentTypeChecker<'a, 'db> { }) } + /// basedpython: checks the arguments matched to a variadic parameter that takes whole + /// repetitions, `*args: *((int, str) * int)`, against that tuple as a whole. + /// + /// Each argument is also checked against the element type at its position, but a splatted + /// argument of unknown length has no known position for any of its elements, and the number + /// of arguments is not a property of any one of them. Only what those per-argument checks + /// cannot see is reported here, so an argument of the wrong type at a known position is + /// still reported once, against that argument. + fn check_repeated_variadic_arguments(&mut self) { + let db = self.db; + let env = self.env; + let Some((parameter_index, parameter)) = self.signature.parameters().variadic() else { + return; + }; + if !parameter.has_starred_annotation() { + return; + } + let formal = parameter.annotated_type(); + let Some(formal_tuple) = formal.exact_tuple_instance_spec(db) else { + return; + }; + let TupleSpec::Variable(variable) = formal_tuple.as_ref() else { + return; + }; + if !matches!(variable.variable(), VariableSegment::Repeated(_)) { + return; + } + let parameter_context = ParameterContext::new(parameter, parameter_index, false); + let parameter = parameter.clone(); + let formal_tuple = formal_tuple.into_owned(); + + let Some((actual, argument_indices)) = + self.collect_variadic_argument_tuple(parameter_index, ¶meter, formal) + else { + return; + }; + let Some(actual_tuple) = actual.exact_tuple_instance_spec(db) else { + return; + }; + let as_type = |spec| Type::tuple(TupleType::new(db, env, &spec)); + let shape_fits = as_type(actual_tuple.shape(db, env)).is_assignable_to( + db, + env, + as_type(formal_tuple.shape(db, env)), + ); + if shape_fits && (!actual_tuple.is_variadic() || actual.is_assignable_to(db, env, formal)) { + return; + } + self.errors.push(BindingError::NotWholeRepetitions { + argument_index: argument_indices.map(|(first, _)| first), + parameter: parameter_context, + expected_ty: formal, + provided_ty: actual, + }); + } + fn check_argument_types(&mut self, constraints: &ConstraintSetBuilder<'db>) { + self.check_repeated_variadic_arguments(); let db = self.db; let paramspec = self.signature.parameters().as_paramspec_with_prefix(); let paramspec_component_start = paramspec.and_then(|(prefix, paramspec)| { @@ -9962,6 +10041,14 @@ pub(crate) enum BindingError<'db> { expected_positional_count: usize, provided_positional_count: usize, }, + /// basedpython: the arguments matched to a variadic parameter that takes whole repetitions, + /// `*args: *((int, str) * int)`, are not a whole number of them. + NotWholeRepetitions { + argument_index: Option, + parameter: ParameterContext, + expected_ty: Type<'db>, + provided_ty: Type<'db>, + }, /// Multiple arguments were provided for a single parameter. ParameterAlreadyAssigned { argument_index: Option, @@ -10090,6 +10177,7 @@ impl BindingError<'_> { } BindingError::InvalidKeyType { argument_index, .. } + | BindingError::NotWholeRepetitions { argument_index, .. } | BindingError::UnknownArgument { argument_index, .. } | BindingError::UnknownKeywordVariadicArgument { argument_index } | BindingError::PositionalOnlyParameterAsKwarg { argument_index, .. } @@ -10193,6 +10281,7 @@ impl<'db> BindingError<'db> { | Self::UnknownKeywordVariadicArgument { .. } | Self::PositionalOnlyParameterAsKwarg { .. } | Self::TooManyPositionalArguments { .. } + | Self::NotWholeRepetitions { .. } | Self::ParameterAlreadyAssigned { .. } | Self::SpecializationError { .. } | Self::UnmatchedOverload => true, @@ -10451,6 +10540,31 @@ impl<'db> BindingError<'db> { } } + Self::NotWholeRepetitions { + argument_index, + parameter, + expected_ty, + provided_ty, + } => { + let range = context.get_range(node, *argument_index); + if let Some(builder) = context.report_lint(&INVALID_ARGUMENT_TYPE, range) { + let mut diag = builder.into_diagnostic(format_args!( + "Arguments to {parameter}{} do not fill whole repetitions", + callable_description + .map(|description| format!(" of {description}")) + .unwrap_or_default() + )); + diag.set_primary_annotation_message(format_args!( + "Expected `{}`, found `{}`", + expected_ty.display(db, env), + provided_ty.display(db, env) + )); + if let Some(compound_diag) = compound_diag { + compound_diag.add_context(db, env, &mut diag); + } + } + } + Self::TooManyPositionalArguments { first_excess_argument_index, expected_positional_count, diff --git a/crates/ty_python_semantic/src/types/callable.rs b/crates/ty_python_semantic/src/types/callable.rs index 005f14e17d..27b68c4aa2 100644 --- a/crates/ty_python_semantic/src/types/callable.rs +++ b/crates/ty_python_semantic/src/types/callable.rs @@ -1082,7 +1082,8 @@ impl<'db> CallableTypes<'db> { let dedup_key = signature .clone() .with_definition(None) - .with_source_overload_index(None); + .with_source_overload_index(None) + .with_resolved_narrowing_guards(db); if seen_overloads.insert(dedup_key) { overloads.push(signature); } diff --git a/crates/ty_python_semantic/src/types/dedicated/pytest.rs b/crates/ty_python_semantic/src/types/dedicated/pytest.rs index d94a255a53..7b3781a5d4 100644 --- a/crates/ty_python_semantic/src/types/dedicated/pytest.rs +++ b/crates/ty_python_semantic/src/types/dedicated/pytest.rs @@ -487,6 +487,7 @@ use crate::types::may_exist_at_runtime; mod collection; mod fixtures; +pub use collection::{CollectedTest, CollectedTestClass, collected_pytest_tests}; pub use fixtures::{ FixtureBinding, FixtureExposure, FixtureNameSource, fixture_bindings_for_parameter, fixture_exposures_for_definition, pytest_global_plugin_files, diff --git a/crates/ty_python_semantic/src/types/dedicated/pytest/collection.rs b/crates/ty_python_semantic/src/types/dedicated/pytest/collection.rs index 437ef8a34a..49ea72f9f0 100644 --- a/crates/ty_python_semantic/src/types/dedicated/pytest/collection.rs +++ b/crates/ty_python_semantic/src/types/dedicated/pytest/collection.rs @@ -42,10 +42,15 @@ //! def test_method(self): ... # not recognized because the class defines __init__ //! ``` //! -//! There are two entry points: +//! A `.by` module is a test file under the same names (`test_*.by`, `*_test.by`): it transpiles to +//! the `.py` of the same stem, and that is what pytest collects. +//! +//! There are two entry points, and one view of the second for editors: //! //! - [`pytest_test_for_binding`] classifies one binding definition, returning `None` when it does //! not satisfy the collection rules. +//! - [`collected_pytest_tests`] is [`pytest_tests_in_file`] named and placed: each test's bound +//! name, the classes it is collected under, and its ranges. //! - [`pytest_tests_in_file`] applies the same classification to bindings that are still available //! at the end of their module or class scope, excluding bindings overwritten or deleted later in //! that scope. It returns the collected tests in source order. @@ -62,7 +67,7 @@ //! [unittest-tests]: https://docs.pytest.org/en/stable/how-to/unittest.html use ruff_db::parsed::parsed_module; -use ruff_text_size::Ranged; +use ruff_text_size::{Ranged, TextRange}; use ty_python_core::definition::{Definition, DefinitionKind}; use ty_python_core::scope::ScopeKind; use ty_python_core::{ProgramFile, global_scope, place_table, semantic_index, use_def_map}; @@ -77,6 +82,66 @@ use crate::types::{ binding_type, definition_expression_type, }; +/// A test pytest collects from a file, as an editor names and places it. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct CollectedTest { + /// The name pytest reports the test under: the name it is bound to, which for an alias is not + /// the underlying function's. + pub name: String, + /// The classes pytest collects the test under, outermost first. Together with [`Self::name`] + /// these are the `::`-separated parts of the test's node id after its file. + pub classes: Vec, + /// The whole binding: the `def`, with its decorators, or the assignment or import. + pub full_range: TextRange, + /// The bound name. + pub focus_range: TextRange, + /// Collected because its class inherits from `unittest.TestCase`, so pytest does not inject + /// fixtures into it. + pub is_unittest: bool, +} + +/// A class a [`CollectedTest`] is collected under. +#[derive(Debug, Clone, PartialEq, Eq)] +pub struct CollectedTestClass { + pub name: String, + pub full_range: TextRange, + pub focus_range: TextRange, +} + +/// The tests pytest collects from `file` under the default collection conventions, in source order. +/// +/// Statically: nothing is imported or run, so this is what an editor can show before anyone asks +/// pytest itself. +pub fn collected_pytest_tests<'db>(db: &'db dyn Db, file: ProgramFile<'db>) -> Vec { + let module = parsed_module(db, file.python_file(db)).load(db); + pytest_tests_in_file(db, file) + .iter() + .map(|test| { + let mut classes = Vec::new(); + let mut enclosing = test.enclosing_class; + while let Some(class) = enclosing { + classes.push(CollectedTestClass { + name: class.name(db).unwrap_or_default(), + full_range: class.full_range(db, &module).range(), + focus_range: class.focus_range(db, &module).range(), + }); + enclosing = match enclosing_scope(db, class) { + Some(EnclosingScope::Class(parent)) => Some(parent), + Some(EnclosingScope::Module) | None => None, + }; + } + classes.reverse(); + CollectedTest { + name: test.binding.name(db).unwrap_or_default(), + classes, + full_range: test.binding.full_range(db, &module).range(), + focus_range: test.binding.focus_range(db, &module).range(), + is_unittest: test.kind == PytestTestKind::StdlibUnittest, + } + }) + .collect() +} + /// Returns the tests that pytest collects from `file` under the default collection conventions. #[salsa::tracked(returns(deref), heap_size=ruff_memory_usage::heap_size)] fn pytest_tests_in_file<'db>(db: &'db dyn Db, file: ProgramFile<'db>) -> Box<[PytestTest<'db>]> { @@ -450,7 +515,11 @@ fn is_default_pytest_test_file(db: &dyn Db, file: ProgramFile<'_>) -> bool { return false; }; - let Some(stem) = file_name.strip_suffix(".py") else { + // a `.by` module transpiles to a `.py` of the same stem, which is the file pytest collects + let Some(stem) = file_name + .strip_suffix(".py") + .or_else(|| file_name.strip_suffix(".by")) + else { return false; }; @@ -1156,6 +1225,75 @@ class NonCallable(unittest.TestCase): pytest_db_with_files(&[(path, source)]) } + /// Each test's node id after its file, `Class::Nested::test`, as [`super::collected_pytest_tests`] + /// names it. + fn node_ids(db: &TestDb, path: &str) -> Vec { + super::collected_pytest_tests(db, program_file(db, path)) + .into_iter() + .map(|test| { + test.classes + .iter() + .map(|class| class.name.as_str()) + .chain(std::iter::once(test.name.as_str())) + .collect::>() + .join("::") + }) + .collect() + } + + #[test] + fn names_each_test_under_every_class_it_is_collected_in() { + let db = pytest_db( + "/src/test_example.py", + r#" +class TestA: + def test_method(self): ... + + class TestNested: + def test_deep(self): ... + +def outer(): + def test_inner(): ... + +def test_after(): ... +"#, + ); + + assert_eq!( + node_ids(&db, "/src/test_example.py"), + [ + "TestA::test_method", + "TestA::TestNested::test_deep", + "test_after" + ] + ); + } + + #[test] + fn collects_a_basedpython_test_module_under_its_own_name() { + let db = pytest_db( + "/src/test_example.by", + r#" +class TestA: + def test_method(self): ... + +def test_function(): ... +"#, + ); + + assert_eq!( + node_ids(&db, "/src/test_example.by"), + ["TestA::test_method", "test_function"] + ); + } + + #[test] + fn a_basedpython_module_not_named_like_a_test_holds_none() { + let db = pytest_db("/src/main.by", "def test_function(): ...\n"); + + assert!(node_ids(&db, "/src/main.by").is_empty()); + } + fn pytest_db_with_files(files: &[(&'static str, &'static str)]) -> TestDb { let builder = TestDbBuilder::new() .with_third_party_packages() diff --git a/crates/ty_python_semantic/src/types/deferred.rs b/crates/ty_python_semantic/src/types/deferred.rs index a636e5d5ea..fcf35259b6 100644 --- a/crates/ty_python_semantic/src/types/deferred.rs +++ b/crates/ty_python_semantic/src/types/deferred.rs @@ -41,7 +41,8 @@ use ruff_python_ast::name::Name; use super::Type; use super::infer::builder::binary_expressions::BinaryInferenceState; use super::infer::{ - deferred_comparison, fold_tuple_concat, fold_tuple_repeat, literal_binary_op, literal_unary_op, + deferred_comparison, fold_tuple_concat, fold_tuple_multiplication, literal_binary_op, + literal_unary_op, }; use super::visitor::{self, any_over_type}; use crate::types::ProgramEnvironment; @@ -231,7 +232,17 @@ impl<'db> DeferredType<'db> { /// basedpython: see [`DeferredOperation::is_checked`]. pub(crate) fn is_checked(self, db: &'db dyn Db) -> bool { - self.operation(db).is_checked() + if !self.operation(db).is_checked() { + return false; + } + // A tuple repetition, `(T, U) * int`, folds to a tuple type that still holds its type + // parameters and names exactly the same values, so a body is checked against that fold. + // An arithmetic operation over integers has no such fold — it collapses to `int` — which + // is why it is checked against the operation itself. + !self + .operands(db) + .iter() + .any(|operand| operand.exact_tuple_instance_spec(db).is_some()) } } @@ -524,8 +535,7 @@ fn evaluate<'db>( // `(X,) * Dim` would re-evaluate through typeshed's `tuple.__mul__` and // widen to `tuple[X, ...]`, throwing away the length the fold just learned .or_else(|| match op { - ast::Operator::Mult => fold_tuple_repeat(db, env, *left, *right) - .or_else(|| fold_tuple_repeat(db, env, *right, *left)), + ast::Operator::Mult => fold_tuple_multiplication(db, env, *left, *right), ast::Operator::Add => fold_tuple_concat(db, env, *left, *right), _ => None, }) diff --git a/crates/ty_python_semantic/src/types/definition_resolution.rs b/crates/ty_python_semantic/src/types/definition_resolution.rs index 14ade00177..48b7fac311 100644 --- a/crates/ty_python_semantic/src/types/definition_resolution.rs +++ b/crates/ty_python_semantic/src/types/definition_resolution.rs @@ -8,7 +8,7 @@ use std::collections::VecDeque; use indexmap::IndexSet; use itertools::Either; -use ruff_db::files::FileRange; +use ruff_db::files::{File, FileRange}; use ruff_db::parsed::parsed_module; use ruff_python_ast as ast; use ruff_text_size::TextRange; @@ -25,6 +25,8 @@ use ty_python_core::{ }; use crate::place::implicit_builtins_symbol_scope; +use crate::types::extensions::resolve_extension_members; +use crate::types::receivers; use crate::types::{ClassBase, ClassLiteral, ClassType, SubclassOfInner, Type, binding_type}; use crate::{Db, FxIndexSet, ProgramEnvironment, module_docstring}; @@ -446,6 +448,206 @@ pub(crate) fn definitions_for_attribute<'db>( resolved } +/// The annotation a definition was declared with, for the two forms that can +/// carry an inline protocol. +fn declared_annotation<'a>( + db: &dyn Db, + parsed: &'a ruff_db::parsed::ParsedModuleRef, + definition: Definition<'_>, +) -> Option<&'a ast::Expr> { + match definition.kind(db) { + DefinitionKind::Parameter(parameter) => match parameter { + ty_python_core::definition::ParameterDefinitionNodeKind::VariadicPositionalParameter( + parameter, + ) + | ty_python_core::definition::ParameterDefinitionNodeKind::VariadicKeywordParameter( + parameter, + ) => parameter.node(parsed).annotation.as_deref(), + ty_python_core::definition::ParameterDefinitionNodeKind::Parameter(parameter) => { + parameter.node(parsed).parameter.annotation.as_deref() + } + }, + DefinitionKind::AnnotatedAssignment(assignment) => Some(assignment.annotation(parsed)), + _ => None, + } +} + +/// The range of the member `name` declares itself at, anywhere inside an +/// annotation that writes an inline protocol. +/// +/// The search is over the whole annotation because a protocol can be written +/// nested — `list[protocol(a: int)]` — and the member is spelled the same way +/// wherever it sits. +fn inline_protocol_member_range(annotation: &ast::Expr, name: &str) -> Option { + match annotation { + ast::Expr::ProtocolType(protocol) => protocol.members.iter().find_map(|member| { + match member { + // `def g(self) -> int` + ast::Expr::ProtocolMethod(method) if method.name.as_str() == name => { + Some(method.name.range) + } + // `a: int` + ast::Expr::Named(named) => named + .target + .as_name_expr() + .filter(|target| target.id.as_str() == name) + .map(ruff_text_size::Ranged::range), + _ => None, + } + }), + ast::Expr::Subscript(subscript) => inline_protocol_member_range(&subscript.slice, name), + ast::Expr::Tuple(tuple) => tuple + .elts + .iter() + .find_map(|element| inline_protocol_member_range(element, name)), + ast::Expr::BinOp(binop) => inline_protocol_member_range(&binop.left, name) + .or_else(|| inline_protocol_member_range(&binop.right, name)), + _ => None, + } +} + +/// basedpython: where an attribute is read, which is everything a lookup that +/// falls back the way inference does needs beyond the member's own name +#[derive(Clone, Copy)] +pub(crate) struct AttributeRead<'db, 'ast> { + /// the file the read is written in + pub(crate) file: File, + /// the scope it is written in + pub(crate) scope: ScopeId<'db>, + /// the type the member is read off + pub(crate) receiver: Type<'db>, + /// the expression the member is read off, where the read is written as one + pub(crate) receiver_expr: Option<&'ast ast::Expr>, + /// whether the read was written `a?.x` + pub(crate) optional: bool, +} + +/// basedpython: the declarations of an attribute that no *declared* member +/// answers for — an `extension` member, a member of the inline protocol the +/// receiver was declared with, or an implicit-receiver callable. +/// +/// None of the three is a member of the receiver's class. An extension declares +/// its members in its own body, an inline protocol is structural and declares +/// its members in the annotation the receiver was written with, and a receiver +/// callable is an ordinary name in an enclosing scope, so the class-hierarchy +/// walk [`definitions_for_attribute`] does cannot reach any of them. Inference +/// reaches them through these fallbacks, in this order, once member lookup comes +/// up undefined — and everything that answers "where is this member declared" +/// has to take the same steps in the same order, or it answers differently than +/// the checker resolved. +/// +/// +/// Worth saying which access the extension fallback is for, because the bug it +/// fixes was subtle: `xs.second()` already worked, since a *call* resolves +/// through the call's own dispatch target and lands on the extension's function +/// that way. A bare `xs.second` has no call to go through, and neither does a +/// property — which can never be a callee — so those answered nothing at all. +pub(crate) fn fallback_attribute_definitions<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + access: &AttributeRead<'db, '_>, + name: &str, +) -> Vec> { + let AttributeRead { + file, + scope, + receiver, + receiver_expr, + optional, + } = *access; + // an optional-chain link resolves against the chain's *present* type — the + // `None` it short-circuits with is not part of the receiver + let receiver_ty = if optional || receiver_expr.is_some_and(receivers::spine_has_optional) { + receivers::strip_none(db, env, receiver) + } else { + receiver + }; + + let extensions = resolve_extension_members(db, env, file, receiver_ty, name); + if !extensions.is_empty() { + // every applicable extension is offered: when two supply the same name + // the checker reports the ambiguity at the access site, and an editor + // that lists both is telling the reader the same thing + return extensions + .iter() + .flat_map(|resolution| { + definitions_for_attribute_in_class_hierarchy( + db, + env, + &ClassLiteral::Static(resolution.extension), + name, + ) + }) + .collect(); + } + + let protocol = inline_protocol_member_definitions(db, scope, receiver_expr, name); + if !protocol.is_empty() { + return protocol; + } + + let Some((declaring_scope, _)) = + receivers::resolve_receiver_attribute_in_scope(db, env, file, scope, receiver_ty, name) + else { + return Vec::new(); + }; + find_symbol_in_scope(db, declaring_scope, name) + .into_iter() + .flat_map(|definition| { + resolve_definition( + db, + env, + definition, + Some(name), + ImportAliasResolution::ResolveAliases, + ) + }) + .collect() +} + +/// basedpython: the member declaration inside the [inline protocol] annotation +/// the receiver was declared with — the `a: int` of +/// `def f(x: protocol(a: int; def g(self) -> int))`, reached from `x.a`. +/// +/// An inline protocol is *structural*: two written the same way anywhere are the +/// same type, deliberately, so the type itself cannot say where any one of them +/// was written and there is no declaration for the ordinary member walk to find. +/// The annotation the receiver was declared with is the one place that can be +/// pointed at honestly, so that is what this answers with. +/// +/// [inline protocol]: https://docs.basedpython.org/features/inline-protocol +fn inline_protocol_member_definitions<'db>( + db: &'db dyn Db, + scope: ScopeId<'db>, + receiver_expr: Option<&ast::Expr>, + name: &str, +) -> Vec> { + let Some(ast::Expr::Name(receiver)) = receiver_expr else { + return Vec::new(); + }; + definitions_for_name( + db, + scope, + receiver.id.as_str(), + ImportAliasResolution::ResolveAliases, + ) + .into_iter() + .filter_map(|resolved| match resolved { + ResolvedDefinition::Definition(definition) => Some(definition), + _ => None, + }) + .filter_map(|definition| { + let parsed = parsed_module(db, definition.python_file(db)).load(db); + let annotation = declared_annotation(db, &parsed, definition)?; + let range = inline_protocol_member_range(annotation, name)?; + Some(ResolvedDefinition::FileWithRange(FileRange::new( + definition.file(db), + range, + ))) + }) + .collect() +} + pub(crate) fn definitions_for_attribute_in_class_hierarchy<'db>( db: &'db dyn Db, env: &ProgramEnvironment<'db>, diff --git a/crates/ty_python_semantic/src/types/diagnostic.rs b/crates/ty_python_semantic/src/types/diagnostic.rs index d10f530c85..2395681c23 100644 --- a/crates/ty_python_semantic/src/types/diagnostic.rs +++ b/crates/ty_python_semantic/src/types/diagnostic.rs @@ -162,6 +162,7 @@ pub(crate) fn register_lints(registry: &mut LintRegistryBuilder) { registry.register_lint(&INVALID_OVERRIDE_VISIBILITY); registry.register_lint(&INVALID_VISIBILITY); registry.register_lint(&PRIVATE_EXPORT); + registry.register_lint(&USED_UNDERSCORE_NAME); registry.register_lint(&INVALID_EXTENSION); registry.register_lint(&AMBIGUOUS_EXTENSION_MEMBER); registry.register_lint(&INVALID_CONFORMANCE); @@ -190,6 +191,7 @@ pub(crate) fn register_lints(registry: &mut LintRegistryBuilder) { registry.register_lint(&TRAILING_LAMBDA_RETURN_TYPE); registry.register_lint(&UNRESOLVED_NARROWING_GUARD); registry.register_lint(&NARROWING_GUARD_AS_VALUE); + registry.register_lint(&UNESTABLISHED_ASSERTION_GUARD); registry.register_lint(&ESCAPING_LOOP_VARIABLE); registry.register_lint(&MUTABLE_STATE_VALUE); registry.register_lint(&SILENT_MUTATION); @@ -1235,6 +1237,46 @@ declare_lint! { } } +declare_lint! { + /// ## What it does + /// Checks for a use of a name that a `.by` file spelled with a leading + /// underscore: a variable, a parameter, a function, a class, an import, or a + /// member of a class declared in a `.by` file. + /// + /// ## Why is this bad? + /// basedpython spells privacy with `private` and `protected`, so a leading + /// underscore says one thing only: the name is unused. A use contradicts it, + /// and a reader who trusts the underscore skips over code that matters. + /// + /// A name spelled by python or a stub is not reported — a library's + /// `_internal`, `_asdict`, an override of a python base class's `_hook` — and + /// neither is `_` or a dunder, which python gives meanings of their own. + /// + /// ## Example + /// + /// ```by + /// def _parse(text: str) -> int: + /// return int(text) + /// + /// _parse("1") # warning: `_parse` is used + /// ``` + /// + /// Drop the underscore, or declare the name `private`: + /// + /// ```by + /// private def parse(text: str) -> int: + /// return int(text) + /// + /// parse("1") + /// ``` + pub(crate) static USED_UNDERSCORE_NAME = { + summary: "detects a use of a name a leading underscore marks as unused", + status: LintStatus::stable("0.0.81"), + default_level: Level::Warn, + ty_compat: TyCompat::BasedPython, + } +} + declare_lint! { /// ## What it does /// Checks for a `private` symbol listed in the module's `__all__`. @@ -2066,8 +2108,7 @@ declare_lint! { /// /// ```by /// def check(value: int | None) -> asserts values: # error: `values` is nothing - /// if value is None: - /// raise ValueError + /// assert value /// ``` pub(crate) static UNRESOLVED_NARROWING_GUARD = { summary: "detects a narrowing return annotation that names no place", @@ -2091,8 +2132,7 @@ declare_lint! { /// /// ```by /// def check(x: int | None) -> asserts x: - /// if x is None: - /// raise ValueError + /// assert x /// /// def f(a: int | None): /// if check(a): # error: the guard narrows as a statement, not as a test @@ -2106,6 +2146,39 @@ declare_lint! { } } +declare_lint! { + /// ## What it does + /// Checks that a function with a basedpython assertion guard establishes what it asserts + /// wherever it returns. + /// + /// ## Why is this bad? + /// `-> asserts x` tells every caller that `x` is truthy once the call has returned, and each + /// call narrows its argument on the strength of that. A body that can return without having + /// established it — by falling off its end, or through a `return` — narrows the caller's + /// argument to something it may not be. + /// + /// ## Example + /// + /// ```by + /// def check(x: int | None) -> asserts x: # error: `x` can still be `0` here + /// if x is None: + /// raise ValueError + /// ``` + /// + /// Use instead: + /// + /// ```by + /// def check(x: int | None) -> asserts x: + /// assert x + /// ``` + pub(crate) static UNESTABLISHED_ASSERTION_GUARD = { + summary: "detects an assertion guard its function can return without establishing", + status: LintStatus::stable("0.0.1-alpha.40"), + default_level: Level::Error, + ty_compat: TyCompat::BasedPython, + } +} + declare_lint! { /// ## What it does /// Checks for a trailing-lambda block whose callback's declared return type diff --git a/crates/ty_python_semantic/src/types/display.rs b/crates/ty_python_semantic/src/types/display.rs index 3566d45248..3e600a1ceb 100644 --- a/crates/ty_python_semantic/src/types/display.rs +++ b/crates/ty_python_semantic/src/types/display.rs @@ -30,7 +30,7 @@ use crate::types::protocol_class::{InlineProtocolMemberForm, ProtocolInterface}; use crate::types::signatures::{ CallableSignature, Parameter, Parameters, ParametersKind, Signature, }; -use crate::types::tuple::{TupleSpec, VariableSegment}; +use crate::types::tuple::{RepeatedUnit, TupleSpec, VariableLengthTuple, VariableSegment}; use crate::types::typevar::BoundTypeVarIdentity; use crate::types::visitor::TypeVisitor; use crate::types::{ @@ -2371,6 +2371,12 @@ impl<'db> FmtDetailed<'db> for DisplayTuple<'_, 'db> { fn fmt_detailed(&self, f: &mut TypeWriter<'_, '_, 'db>) -> fmt::Result { let db = self.db; let env = self.env; + if let TupleSpec::Variable(tuple) = self.tuple + && let VariableSegment::Repeated(unit) = tuple.variable() + && !self.settings.reduce_symbolic_operations + { + return self.fmt_repeated(f, tuple, unit); + } if basedpython_display_enabled() { return self.fmt_basedpython(f); } @@ -2403,7 +2409,8 @@ impl<'db> FmtDetailed<'db> for DisplayTuple<'_, 'db> { .display_with(db, self.env, self.settings.singleline()) .fmt_detailed(f)?; } - VariableSegment::Homogeneous(variable) => { + segment @ (VariableSegment::Homogeneous(_) | VariableSegment::Repeated(_)) => { + let variable = segment.element_type(db); if !tuple.prefix_elements().is_empty() || !tuple.suffix_elements().is_empty() { @@ -2438,6 +2445,61 @@ impl<'db> FmtDetailed<'db> for DisplayTuple<'_, 'db> { } impl<'db> DisplayTuple<'_, 'db> { + /// basedpython: a tuple whose variable segment repeats a unit, spelled as the + /// multiplication that produces it: + /// (T1, T2) * int + /// (prefix, *(T1, T2) * int, suffix) + /// + /// Python has no spelling for it, so output that has to be valid python shows the unit's + /// elements as a homogeneous segment instead, which is what the other tuple displays do. + fn fmt_repeated( + &self, + f: &mut TypeWriter<'_, '_, 'db>, + tuple: &VariableLengthTuple, VariableSegment<'db>>, + unit: RepeatedUnit<'db>, + ) -> fmt::Result { + let db = self.db; + let env = self.env; + let basedpython = basedpython_display_enabled(); + if !basedpython { + f.set_invalid_type_annotation(); + } + let has_fixed_elements = + !tuple.prefix_elements().is_empty() || !tuple.suffix_elements().is_empty(); + if has_fixed_elements { + let tuple_class = KnownClass::Tuple.to_class_literal(db, env); + if basedpython { + f.with_type(tuple_class).write_char('(')?; + } else { + f.with_type(tuple_class).write_str("tuple")?; + f.write_char('[')?; + } + for prefix in tuple.prefix_elements() { + prefix + .display_with(db, env, self.settings.singleline()) + .fmt_detailed(f)?; + f.write_str(", ")?; + } + f.write_char('*')?; + } + TupleSpec::heterogeneous(unit.elements(db).iter().copied()) + .display_with(db, env, self.settings.clone()) + .fmt_detailed(f)?; + f.write_str(" * ")?; + f.with_type(KnownClass::Int.to_class_literal(db, env)) + .write_str("int")?; + if has_fixed_elements { + for suffix in tuple.suffix_elements() { + f.write_str(", ")?; + suffix + .display_with(db, env, self.settings.singleline()) + .fmt_detailed(f)?; + } + f.write_char(if basedpython { ')' } else { ']' })?; + } + Ok(()) + } + /// basedpython surface syntax for tuple types: /// tuple\[T1, T2\] → (T1, T2) /// tuple\[T\] → (T,) @@ -2476,9 +2538,12 @@ impl<'db> DisplayTuple<'_, 'db> { } f.write_str("*: ")?; match tuple.variable() { - VariableSegment::Homogeneous(variable) => variable - .display_with(self.db, env, self.settings.singleline()) - .fmt_detailed(f)?, + segment @ (VariableSegment::Homogeneous(_) | VariableSegment::Repeated(_)) => { + segment + .element_type(self.db) + .display_with(self.db, env, self.settings.singleline()) + .fmt_detailed(f)?; + } VariableSegment::TypeVarTuple(typevar) => Type::TypeVar(typevar) .display_with(self.db, env, self.settings.singleline()) .fmt_detailed(f)?, diff --git a/crates/ty_python_semantic/src/types/enums.rs b/crates/ty_python_semantic/src/types/enums.rs index 1fdcbb2b90..46aa120b69 100644 --- a/crates/ty_python_semantic/src/types/enums.rs +++ b/crates/ty_python_semantic/src/types/enums.rs @@ -24,7 +24,9 @@ use crate::{ }, }, }; -use ty_python_core::{definition::DefinitionKind, place_table, scope::ScopeId, use_def_map}; +use ty_python_core::{ + Truthiness, definition::DefinitionKind, place_table, scope::ScopeId, use_def_map, +}; /// A resolved enum method, retaining both whether it is analyzable and who defines it. /// @@ -307,6 +309,19 @@ pub(crate) struct EnumMetadata<'db> { /// How enum construction may transform declared member values. pub(super) value_construction: EnumValueConstruction<'db>, + + /// Whether `bool()` on a member of this enum reads the value it was declared with. + /// + /// A member is an instance of its enum class, so `bool()` finds whatever that class's MRO + /// offers — and an enum with a built-in data type has no `__bool__` of its own, so what it + /// finds is the data type's. `class Colour(int, Enum)` reads the `int` a member was declared + /// with, which makes `Colour.NONE = 0` falsy exactly as `0` is, and a `StrEnum` member + /// declared `""` falsy exactly as `""` is. + /// + /// False for an enum that writes its own `__bool__` or `__len__`, which decides for itself, + /// and for one with no data type at all, whose members are truthy the way any other object + /// with neither method is. + truthiness_reads_the_value: bool, } impl get_size2::GetSize for EnumMetadata<'_> {} @@ -583,6 +598,7 @@ impl<'db> EnumMetadata<'db> { auto_members: FxHashSet::default(), value_annotation: None, value_construction: EnumValueConstruction::default(), + truthiness_reads_the_value: false, } } @@ -619,6 +635,29 @@ impl<'db> EnumMetadata<'db> { } } + /// What `bool()` says about `member_name`, or `None` where the value does not decide it. + /// + /// `None` covers everything this cannot answer: an enum whose truthiness is its own business + /// (see [`Self::truthiness_reads_the_value`]), a member whose value construction may have + /// rewritten what it holds, and a value that is known only by its type — `int` rather than + /// `Literal[3]` — which says no more about `bool()` than the enum instance already did. + pub(super) fn member_truthiness( + &self, + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + member_name: &Name, + ) -> Option { + if !self.truthiness_reads_the_value { + return None; + } + + let value = self.concrete_value_type(db, env, member_name)?; + match value.bool(db, env) { + Truthiness::Ambiguous => None, + definite => Some(definite), + } + } + /// Returns the normalized member payload when construction is known not to transform it. /// /// Unlike [`Self::value_type`], this does not substitute a `_value_` annotation for the @@ -1089,6 +1128,11 @@ pub(crate) fn enum_metadata<'db>( auto_members: FxHashSet::default(), value_annotation: None, value_construction, + // an enum built by calling `Enum` has no class body, and the base it was given + // is reached from here without one to read: whether anything in it writes its + // own `__bool__` is not a question this can answer, so it is left to the + // instance type the way it was before + truthiness_reads_the_value: false, }); } }; @@ -1125,6 +1169,7 @@ pub(crate) fn enum_metadata<'db>( auto_members, value_annotation: None, value_construction: EnumValueConstruction::default(), + truthiness_reads_the_value: false, }); } @@ -1194,6 +1239,15 @@ pub(crate) fn enum_metadata<'db>( metaclass_may_transform_values, }; + // A data type this models is `int` or `str`, and neither the enum nor anything it inherits + // from has taken the decision away from it. `__len__` counts alongside `__bool__` because + // `bool()` falls back to it, which is how a `str`-backed member is falsy when it is empty. + let truthiness_reads_the_value = matches!(data_type, InheritedEnumDataType::Known(_)) + && ["__bool__", "__len__"].into_iter().all(|name| { + custom_enum_method(db, scope_id, name).is_none() + && inherited_user_defined_enum_method(db, &env, class, name).is_none() + }); + let mut aliases = FxHashMap::default(); let mut members = use_def_map @@ -1419,6 +1473,7 @@ pub(crate) fn enum_metadata<'db>( auto_members, value_annotation, value_construction, + truthiness_reads_the_value, }) } diff --git a/crates/ty_python_semantic/src/types/function.rs b/crates/ty_python_semantic/src/types/function.rs index 45ed33a3d7..01852929ed 100644 --- a/crates/ty_python_semantic/src/types/function.rs +++ b/crates/ty_python_semantic/src/types/function.rs @@ -89,14 +89,17 @@ use crate::types::generics::{ApplySpecialization, GenericContext, Specialization use crate::types::infer::{ function_known_decorators, infer_definition_types, nearest_enclosing_class, original_class_type, }; -use crate::types::inferred_narrowing::inferred_narrowing_guards; +use crate::types::inferred_narrowing::{ + inferred_predicate_guards, may_recover_assertions, recovered_assertion_guards, +}; use crate::types::inferred_signature::inferred_return_type; use crate::types::known_instance::DeprecatedInstance; use crate::types::list_members::all_members; use crate::types::narrow::ClassInfoConstraintFunction; use crate::types::relation::TypeRelationChecker; use crate::types::signatures::{ - CallableSignature, NarrowingGuard, NarrowingGuardKind, ReturnCallableTypeVarScope, Signature, + CallableSignature, DeferredAssertions, NarrowingGuard, NarrowingGuardKind, Parameters, + ReturnCallableTypeVarScope, Signature, }; use crate::types::tuple::TupleSpec; use crate::types::variance::{VarianceInferable, VarianceOrigin, VarianceTerm}; @@ -1299,6 +1302,7 @@ impl<'db> OverloadLiteral<'db> { // the three blocks above plus this one are the sources a `def` that leaves its return // type out draws on; [`OverloadLiteral::return_type_without_annotation`] mirrors them in // this order, so a change here belongs there too + let mut reads_body_for_guards = false; if infers_unannotated_signatures(db, self.file(db)) && !returns_written && !function_stmt_node.is_asserts_return @@ -1312,13 +1316,25 @@ impl<'db> OverloadLiteral<'db> { // That reading is recovered beside the return type and only where it is: a base's // return type stands for its overrides, so a body that answered nothing about the // return type answers nothing about the narrowing either - let guards = inferred_narrowing_guards(db, self); + let guards = inferred_predicate_guards(db, self); if !guards.is_empty() { if let Some(narrowed) = Self::symmetric_guard_type(db, env, guards) { raw_signature.return_ty = TypeIsType::from_type_expression(db, narrowed); } raw_signature.narrowing_guards.clone_from(guards); } + reads_body_for_guards = true; + } + + // basedpython: a body that hands back nothing makes assertions instead of predicates, and + // an override makes the assertions of the method it overrides. neither is worked out + // here — see [`DeferredAssertions`] + let from_body = reads_body_for_guards && may_recover_assertions(db, self); + if from_body || self.may_inherit_assertions(db) { + raw_signature.deferred_assertions = Some(DeferredAssertions { + function: self, + from_body, + }); } raw_signature @@ -1545,6 +1561,105 @@ impl<'db> OverloadLiteral<'db> { OverriddenReturnType::Declared(return_ty) } + /// basedpython: how to name the method this one overrides, for a diagnostic about it. + pub(crate) fn overridden_method_display( + self, + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + ) -> Option { + let base = self.overridden_method(db, env)?; + let base = base.literal(db).last_definition; + let definition = base.definition(db); + let index = semantic_index(db, db.program_file(definition.file(db))); + let class = index + .scope(definition.scope(db).file_scope_id(db)) + .node() + .as_class() + .map(|class| { + class + .node(&parsed_module(db, base.python_file(db)).load(db)) + .name + .to_string() + }); + Some(match class { + Some(class) => format!("{class}.{name}", name = base.name(db)), + None => base.name(db).to_string(), + }) + } + + /// basedpython: the assertions the method this one overrides makes about its parameters. + /// + /// A call through the base narrows on the strength of what the base asserts, and the value it + /// is called on may be an instance of this class, so an override has to make the same + /// assertion. It carries here — a caller of the override narrows by it too — and the + /// override's body is checked against it, which is where an override that does not establish + /// it is reported. + /// + /// The guard names a parameter of the base by name, and an override is free to rename its + /// parameters, so it is matched by position instead. A base guard on a place that is not a + /// parameter names a place of the base's own module, which is not this one's, and an override + /// with no parameter in that position has nothing for the guard to name; neither is inherited. + pub(crate) fn inherited_assertion_guards( + self, + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + parameters: &Parameters<'db>, + ) -> Box<[NarrowingGuard<'db>]> { + let Some(base) = self.overridden_method(db, env) else { + return Box::default(); + }; + let base_signature = base_raw_signature(db, base); + base_signature + .all_narrowing_guards(db) + .iter() + .filter(|guard| guard.kind.is_assertion()) + .filter_map(|guard| { + let index = base_signature + .parameters() + .iter() + .position(|parameter| parameter.name() == Some(&guard.name))?; + let name = parameters.iter().nth(index)?.name()?; + Some(NarrowingGuard { + name: name.clone(), + members: guard.members.clone(), + root_is_first_parameter: index == 0, + kind: guard.kind, + }) + }) + .collect() + } + + /// basedpython: whether an assertion can reach this method from one it overrides: written by + /// a method up the chain, or recovered from one's body. It resolves no signature, so a + /// signature being built can ask it. + fn may_inherit_assertions(self, db: &'db dyn Db) -> bool { + self.overridden_chain(db) + .any(|base| base.declares_assertion(db) || may_recover_assertions(db, base)) + } + + /// basedpython: whether a method this one overrides, however far up, writes an `asserts`. + pub(crate) fn overrides_a_written_assertion(self, db: &'db dyn Db) -> bool { + self.overridden_chain(db) + .any(|base| base.declares_assertion(db)) + } + + /// basedpython: the methods this one overrides, nearest first. + fn overridden_chain(self, db: &'db dyn Db) -> impl Iterator> { + std::iter::successors(Some(self), move |method| { + let env = ProgramEnvironment::from_scope(method.body_scope(db)); + method + .overridden_method(db, &env) + .map(|base| base.literal(db).last_definition) + }) + .skip(1) + } + + /// basedpython: whether this function's return annotation is an `asserts`. + fn declares_assertion(self, db: &'db dyn Db) -> bool { + let module = parsed_module(db, self.python_file(db)).load(db); + self.node(db, self.file(db), &module).is_asserts_return + } + /// basedpython: whether a return type nobody wrote is read off the body. /// /// It always is, except for `__new__`. Construction *reads* `__new__`'s return type @@ -1978,6 +2093,44 @@ impl<'db> FunctionLiteral<'db> { /// /// An unannotated override copies into its own raw signature, which `FunctionType::signature` /// then wraps. Copying the already-wrapped form would wrap a coroutine in a coroutine. +/// basedpython: the assertions a call to `function` makes beyond the guards its signature carries: +/// the ones recovered from its body, when `from_body`, then the ones it takes on from the method it +/// overrides — see [`DeferredAssertions`]. +/// +/// A guard `function` makes itself about a place is the whole of what it says about it, so an +/// inherited guard about the same place is left out. A cycle starts at "no assertions", for the +/// reason [`inferred_predicate_guards`] gives. +#[salsa::tracked( + returns(ref), + cycle_initial = |_, _, _, _| Box::default(), + heap_size = ruff_memory_usage::heap_size, +)] +pub(crate) fn deferred_assertion_guards<'db>( + db: &'db dyn Db, + function: OverloadLiteral<'db>, + from_body: bool, +) -> Box<[NarrowingGuard<'db>]> { + let mut guards = if from_body { + recovered_assertion_guards(db, function).to_vec() + } else { + Vec::new() + }; + + let signature = function.raw_signature(db, ReturnCallableTypeVarScope::Public); + let env = ProgramEnvironment::from_scope(function.body_scope(db)); + for inherited in function.inherited_assertion_guards(db, &env, signature.parameters()) { + let made = signature + .narrowing_guards + .iter() + .chain(&guards) + .any(|guard| guard.name == inherited.name && guard.members == inherited.members); + if !made { + guards.push(inherited); + } + } + guards.into_boxed_slice() +} + fn base_raw_signature<'db>(db: &'db dyn Db, base: FunctionType<'db>) -> &'db Signature<'db> { base.last_definition_raw_signature(db, ReturnCallableTypeVarScope::Public) } diff --git a/crates/ty_python_semantic/src/types/generics.rs b/crates/ty_python_semantic/src/types/generics.rs index bbfac0812d..8d0b8a66f6 100644 --- a/crates/ty_python_semantic/src/types/generics.rs +++ b/crates/ty_python_semantic/src/types/generics.rs @@ -4493,6 +4493,14 @@ impl<'db, 'c> SpecializationBuilder<'db, 'c> { return Ok(()); } + // basedpython: a formal written as an operation on a type parameter, `(T, U) * int`, is + // held symbolically so that it can be re-folded once the parameter is known. What it + // reads as everywhere else is the type it folds to, which is where its type parameters + // are found. + if let Type::Deferred(deferred) = formal { + return self.infer_map_impl(deferred.reduced(db, env), actual, polarity, seen); + } + // Avoid infinite recursion while retaining comparisons under different polarities. if !seen.insert((formal, actual, polarity)) { return Ok(()); @@ -5221,6 +5229,47 @@ impl<'db, 'c> SpecializationBuilder<'db, 'c> { return Ok(()); } + // basedpython: a formal that repeats a run of several types, `(T, U) * int`, + // is solved from the elements at the same positions in the actual's own run, or + // in a fixed-length actual that is a whole number of those runs. Resizing both + // to one variable-length segment, as the general case below does, would solve + // every type variable from the union of every element instead. + if let TupleSpec::Variable(formal_variable) = &*formal_tuple + && let VariableSegment::Repeated(_) = formal_variable.variable() + && formal_variable.prefix_elements().is_empty() + && formal_variable.suffix_elements().is_empty() + { + let formal_segment = formal_variable.variable(); + let unit_len = formal_segment.unit_len(db); + let actual_elements: Option>> = match &*actual_tuple { + TupleSpec::Fixed(actual) => actual + .len() + .is_multiple_of(unit_len) + .then(|| actual.iter_all_elements().collect()), + TupleSpec::Variable(actual) => (actual.prefix_elements().is_empty() + && actual.suffix_elements().is_empty() + && actual.variable().typevartuple().is_none() + && actual.variable().unit_len(db).is_multiple_of(unit_len)) + .then(|| { + (0..actual.variable().unit_len(db)) + .map(|index| actual.variable().unit_element(db, index)) + .collect() + }), + }; + if let Some(actual_elements) = actual_elements { + let variance = TypeVarVariance::Covariant.compose(polarity); + for (index, actual_element) in actual_elements.into_iter().enumerate() { + self.infer_map_impl( + formal_segment.unit_element(db, index), + actual_element, + variance, + seen, + )?; + } + return Ok(()); + } + } + let Some(most_precise_length) = formal_tuple.len().most_precise(actual_tuple.len()) else { return Ok(()); diff --git a/crates/ty_python_semantic/src/types/ide_support.rs b/crates/ty_python_semantic/src/types/ide_support.rs index fa706ef8b2..482aff3aa7 100644 --- a/crates/ty_python_semantic/src/types/ide_support.rs +++ b/crates/ty_python_semantic/src/types/ide_support.rs @@ -14,13 +14,14 @@ use crate::types::context_sensitive::for_each_candidate; use crate::types::dedicated::django; use crate::types::enums::enum_metadata; use crate::types::extensions::{ - applicable_extensions, extension_can_apply, resolve_extension_member, resolve_extension_members, + applicable_extensions, extension_can_apply, resolve_extension_member, }; use crate::types::function::FunctionDecorators; use crate::types::generics::GenericContext; use crate::types::implicit_names::{ImplicitNamePosition, implicit_name}; use crate::types::infer::{infer_definition_types, nearest_enclosing_function}; use crate::types::list_members::all_end_of_scope_members; +use crate::types::literal::LiteralValueTypeKind; use crate::types::overrides::is_constructor_like_method; use crate::types::receivers; use crate::types::signatures::{ @@ -271,85 +272,31 @@ pub fn definitions_for_attribute<'db>( } /// basedpython: the declarations of an attribute that no *declared* member -/// answers for — an `extension` member, or an implicit-receiver callable. -/// -/// Neither is a member of the receiver's class. An extension declares its -/// members in its own body, and a receiver callable is an ordinary name in an -/// enclosing scope, so the class-hierarchy walk `definitions_for_member` does -/// cannot reach either. Inference reaches them through two fallbacks that run -/// after member lookup comes up undefined, and goto has to take the same two -/// steps in the same order or the editor answers nothing about code the checker -/// resolved. -/// -/// Worth saying which access this is for, because the bug it fixes was subtle: -/// `xs.second()` already worked, since a *call* resolves through the call's own -/// dispatch target and lands on the extension's function that way. A bare -/// `xs.second` has no call to go through, and neither does a property — which -/// can never be a callee — so those answered nothing at all +/// answers for, inferring the receiver's scope through the IDE model — see +/// [`definition_resolution::fallback_attribute_definitions`], which is the order +/// inference itself takes fn definitions_for_fallback_attribute<'db>( model: &SemanticModel<'db>, attribute: &ast::ExprAttribute, lhs_ty: Type<'db>, ) -> Vec> { let db = model.db(); - let env = model.program_environment(); - let name = attribute.attr.as_str(); - // an optional-chain link resolves against the chain's *present* type — the - // `None` it short-circuits with is not part of the receiver - let receiver_ty = if attribute.optional || receivers::spine_has_optional(&attribute.value) { - receivers::strip_none(db, &env, lhs_ty) - } else { - lhs_ty - }; - - let extensions = resolve_extension_members(db, &env, model.file(), receiver_ty, name); - if !extensions.is_empty() { - // every applicable extension is offered: when two supply the same name - // the checker reports the ambiguity at the access site, and an editor - // that lists both is telling the reader the same thing - return extensions - .iter() - .flat_map(|resolution| { - definitions_for_attribute_in_class_hierarchy( - &ClassLiteral::Static(resolution.extension), - model, - name, - ) - }) - .collect(); - } - - let protocol = definitions_for_inline_protocol_member(model, attribute); - if !protocol.is_empty() { - return protocol; - } - let Some(scope) = model.scope(ast::AnyNodeRef::from(attribute)) else { return Vec::new(); }; - let scope = scope.to_scope_id(db, model.program_file()); - let Some((declaring_scope, _)) = receivers::resolve_receiver_attribute_in_scope( - db, - &env, - model.file(), - scope, - receiver_ty, - name, - ) else { - return Vec::new(); + let access = definition_resolution::AttributeRead { + file: model.file(), + scope: scope.to_scope_id(db, model.program_file()), + receiver: lhs_ty, + receiver_expr: Some(&attribute.value), + optional: attribute.optional, }; - find_symbol_in_scope(db, declaring_scope, name) - .into_iter() - .flat_map(|definition| { - resolve_definition( - db, - &env, - definition, - Some(name), - ImportAliasResolution::ResolveAliases, - ) - }) - .collect() + definition_resolution::fallback_attribute_definitions( + db, + &model.program_environment(), + &access, + attribute.attr.as_str(), + ) } /// Returns all resolved definitions for the member `name_str` of `lhs_ty`, the @@ -394,108 +341,6 @@ fn definitions_for_attribute_in_class_hierarchy<'db>( ) } -/// basedpython: the member declaration inside the [inline protocol] annotation -/// the receiver was declared with — the `a: int` of -/// `def f(x: protocol(a: int; def g(self) -> int))`, reached from `x.a`. -/// -/// An inline protocol is *structural*: two written the same way anywhere are the -/// same type, deliberately, so the type itself cannot say where any one of them -/// was written and there is no declaration for the ordinary member walk to find. -/// The annotation the receiver was declared with is the one place an editor can -/// honestly point at, so that is what this answers with. -/// -/// [inline protocol]: https://docs.basedpython.org/features/inline-protocol -fn definitions_for_inline_protocol_member<'db>( - model: &SemanticModel<'db>, - attribute: &ast::ExprAttribute, -) -> Vec> { - let db = model.db(); - let ast::Expr::Name(receiver) = attribute.value.as_ref() else { - return Vec::new(); - }; - let name = attribute.attr.as_str(); - let parsed = parsed_module(db, model.python_file()).load(db); - let mut found = Vec::new(); - for definition in definitions_for_name( - model, - receiver.id.as_str(), - ast::AnyNodeRef::from(receiver), - ImportAliasResolution::ResolveAliases, - ) { - let ResolvedDefinition::Definition(definition) = definition else { - continue; - }; - let Some(annotation) = declared_annotation(db, &parsed, definition) else { - continue; - }; - if let Some(range) = inline_protocol_member_range(annotation, name) { - found.push(ResolvedDefinition::FileWithRange(FileRange::new( - definition.file(db), - range, - ))); - } - } - found -} - -/// The annotation a definition was declared with, for the two forms that can -/// carry an inline protocol. -fn declared_annotation<'a>( - db: &dyn Db, - parsed: &'a ruff_db::parsed::ParsedModuleRef, - definition: Definition<'_>, -) -> Option<&'a ast::Expr> { - match definition.kind(db) { - DefinitionKind::Parameter(parameter) => match parameter { - ty_python_core::definition::ParameterDefinitionNodeKind::VariadicPositionalParameter( - parameter, - ) - | ty_python_core::definition::ParameterDefinitionNodeKind::VariadicKeywordParameter( - parameter, - ) => parameter.node(parsed).annotation.as_deref(), - ty_python_core::definition::ParameterDefinitionNodeKind::Parameter(parameter) => { - parameter.node(parsed).parameter.annotation.as_deref() - } - }, - DefinitionKind::AnnotatedAssignment(assignment) => Some(assignment.annotation(parsed)), - _ => None, - } -} - -/// The range of the member `name` declares itself at, anywhere inside an -/// annotation that writes an inline protocol. -/// -/// The search is over the whole annotation because a protocol can be written -/// nested — `list[protocol(a: int)]` — and the member is spelled the same way -/// wherever it sits. -fn inline_protocol_member_range(annotation: &ast::Expr, name: &str) -> Option { - match annotation { - ast::Expr::ProtocolType(protocol) => protocol.members.iter().find_map(|member| { - match member { - // `def g(self) -> int` - ast::Expr::ProtocolMethod(method) if method.name.as_str() == name => { - Some(method.name.range()) - } - // `a: int` - ast::Expr::Named(named) => named - .target - .as_name_expr() - .filter(|target| target.id.as_str() == name) - .map(ruff_text_size::Ranged::range), - _ => None, - } - }), - ast::Expr::Subscript(subscript) => inline_protocol_member_range(&subscript.slice, name), - ast::Expr::Tuple(tuple) => tuple - .elts - .iter() - .find_map(|element| inline_protocol_member_range(element, name)), - ast::Expr::BinOp(binop) => inline_protocol_member_range(&binop.left, name) - .or_else(|| inline_protocol_member_range(&binop.right, name)), - _ => None, - } -} - /// basedpython: the declaration of the enum member a bare name resolves to /// through context-sensitive resolution — the `Red` of `c: Color = Red`. /// @@ -2785,6 +2630,30 @@ pub fn constructor_signature(model: &SemanticModel, call_expr: &ast::ExprCall) - /// /// The IDE surfaces this as an inlay hint, so a declared clause returns `None`: /// the source already says what it is. +/// Whether ty folded `expr` down to one literal value. +/// +/// The checker folds an operation over literals to the literal it produces exactly when it has +/// carried that operation out: `60 * 60 * 24` folds to `Literal[86400]`, while `1 / 0` is only +/// `float`, `1 % 0` only `int` and `1 + "a"` is `Unknown`. So a folded type is a proof that +/// evaluating the expression yields a value rather than raising — which is what a caller moving +/// a literal expression somewhere it will always be evaluated needs to know. +pub fn folds_to_a_literal(model: &SemanticModel<'_>, expr: &ast::Expr) -> bool { + let Some(ty) = expr.inferred_type(model) else { + return false; + }; + matches!( + ty.as_literal_value_kind(), + Some( + LiteralValueTypeKind::String(_) + | LiteralValueTypeKind::Bytes(_) + | LiteralValueTypeKind::Int(_) + | LiteralValueTypeKind::Bool(_) + | LiteralValueTypeKind::Float(_) + | LiteralValueTypeKind::Complex(_) + ) + ) +} + pub fn inferred_raises<'db>( db: &'db dyn Db, env: &ProgramEnvironment<'db>, @@ -3390,12 +3259,25 @@ fn is_settled<'db>(db: &'db dyn Db, env: &ProgramEnvironment<'db>, ty: Type<'db> pub fn inferred_property_type<'db>( model: &SemanticModel<'db>, getter: &ast::StmtFunctionDef, +) -> Option> { + inferred_return_type(model, getter) +} + +/// The return type ty settled on for `function`, as it would be written after its `->`. +/// +/// This is the undecorated function's return type, so a decorator that changes what the name is +/// bound to does not change it, and unlike [`inferred_return_annotation`] it includes `None`. +/// `None` when ty could not read a return type from it at all. +pub fn inferred_return_type<'db>( + model: &SemanticModel<'db>, + function: &ast::StmtFunctionDef, ) -> Option> { let db = model.db(); let index = semantic_index(db, model.program_file()); - // the getter is decorated with `property`, so its *binding* type is the descriptor — - // the undecorated function is what carries the signature the source wrote - let definition = index.try_definition(getter)?; + // a decorated function's *binding* type is whatever its decorators return — a property + // getter's is the descriptor — while the undecorated function carries the signature the + // source wrote + let definition = index.try_definition(function)?; let function = infer_definition_types(db, definition).function_type(definition)?; let return_ty = function @@ -3405,6 +3287,41 @@ pub fn inferred_property_type<'db>( is_settled(db, &model.program_environment(), return_ty).then_some(return_ty) } +/// basedpython: why `class` cannot become a `data class` by writing the keyword, or `None` +/// when it can. +/// +/// A class that is already dataclass-like gets nothing from the keyword, and an enum, a +/// protocol, a `TypedDict` or a named tuple is a kind of class the dataclass machinery does not +/// apply to. The class is read before any decorator, since the keyword applies to that class. +pub fn data_class_conversion_obstacle( + model: &SemanticModel<'_>, + class: &ast::StmtClassDef, +) -> Option<&'static str> { + let db = model.db(); + let index = semantic_index(db, model.program_file()); + let definition = index.try_definition(class)?; + let literal = crate::types::infer::original_class_type(db, definition)?; + let Some(static_class) = literal.as_static() else { + return Some("the class is not one ty can read statically"); + }; + if crate::types::enums::is_enum_class(db, Type::ClassLiteral(literal)) { + return Some("an enum is not a data class"); + } + if static_class.is_dataclass_like(db) { + return Some("the class is already a data class"); + } + if static_class.is_protocol(db) { + return Some("a protocol is not a data class"); + } + if static_class.is_typed_dict(db) { + return Some("a `TypedDict` is not a data class"); + } + if static_class.has_named_tuple_class_in_mro(db) { + return Some("a named tuple is not a data class"); + } + None +} + /// The type worth showing for a parameter the source leaves unannotated. /// /// A receiver's `Self` type says nothing the enclosing class does not already, @@ -3425,6 +3342,16 @@ pub fn hintable_parameter_type<'db>( } } +/// Whether `ty` is `dataclasses.field`, the descriptor factory only the dataclass machinery +/// reads. +pub fn is_dataclass_field_function<'db>(db: &'db dyn Db, ty: Type<'db>) -> bool { + matches!( + ty.as_function_literal() + .and_then(|function| function.known(db)), + Some(KnownFunction::Field) + ) +} + /// Whether `ty` is the `reveal_type` function. pub fn is_reveal_type_function<'db>(db: &'db dyn Db, ty: Type<'db>) -> bool { matches!( diff --git a/crates/ty_python_semantic/src/types/infer.rs b/crates/ty_python_semantic/src/types/infer.rs index 8695875897..e58145b061 100644 --- a/crates/ty_python_semantic/src/types/infer.rs +++ b/crates/ty_python_semantic/src/types/infer.rs @@ -76,7 +76,7 @@ use ty_python_core::{ExpressionNodeKey, SemanticIndex, Statement, Truthiness, se pub(crate) mod builder; pub(crate) use builder::{ - fold_tuple_concat, fold_tuple_repeat, literal_binary_op, literal_unary_op, + fold_tuple_concat, fold_tuple_multiplication, literal_binary_op, literal_unary_op, }; mod comparisons; pub(crate) use comparisons::deferred_comparison; diff --git a/crates/ty_python_semantic/src/types/infer/builder.rs b/crates/ty_python_semantic/src/types/infer/builder.rs index 991956091a..9cd1b53981 100644 --- a/crates/ty_python_semantic/src/types/infer/builder.rs +++ b/crates/ty_python_semantic/src/types/infer/builder.rs @@ -74,6 +74,7 @@ use crate::types::context::InferContext; use crate::types::context_sensitive::{self, case_name_pattern_type}; use crate::types::dedicated::{django, pydantic}; use crate::types::deferred::{is_integer_operand, is_symbolic_operand}; +use crate::types::definition_resolution::AttributeRead; use crate::types::diagnostic::{ self, AMBIGUOUS_EXTENSION_MEMBER, CALL_NON_CALLABLE, CONFLICTING_DECLARATIONS, CYCLIC_TYPE_ALIAS_DEFINITION, DYNAMIC_FUNCTION_DECORATOR_RETURN, ERASED_CAST_ARGUMENT, @@ -89,8 +90,8 @@ use crate::types::diagnostic::{ TRAILING_LAMBDA_PARAMETERS, TypeCheckDiagnostics, UNANNOTATED_MODEL_FIELD, UNAVAILABLE_IMPLICIT_SUPER_ARGUMENTS, UNDEFINED_REVEAL, UNRESOLVED_ATTRIBUTE, UNRESOLVED_GLOBAL, UNRESOLVED_REFERENCE, UNSOUND_ASSIGNMENT, UNSOUND_CAST, UNSOUND_YIELD, - UNSPECIALIZED_REIFIED_GENERIC, UNSUPPORTED_OPERATOR, UNUSED_AWAITABLE, YieldKind, - autofix_with_notimplementederror, display_required_elements, + UNSPECIALIZED_REIFIED_GENERIC, UNSUPPORTED_OPERATOR, UNUSED_AWAITABLE, USED_UNDERSCORE_NAME, + YieldKind, autofix_with_notimplementederror, display_required_elements, hint_if_stdlib_attribute_exists_on_other_versions, refutable_unpacking_applies, report_attempted_protocol_instantiation, report_bad_dunder_delattr_call, report_bad_dunder_delete_call, report_bool_as_int, report_bool_as_int_assignment, @@ -138,7 +139,7 @@ use crate::types::receivers; use crate::types::regex; use crate::types::reified_infer::{self, ErasedTargetReason, ReifiedInferenceError}; use crate::types::set_theoretic::RecursivelyDefined; -use crate::types::signatures::{CallableSignature, NarrowingGuard, ReturnCallableTypeVarScope}; +use crate::types::signatures::{CallableSignature, ReturnCallableTypeVarScope}; use crate::types::soundness::{ cast_is_redundant, cast_target_is_unverifiable_protocol, erases_type_arguments, runtime_check_target, @@ -156,6 +157,7 @@ use crate::types::typed_dict::{TypedDictAssignmentKind, TypedDictKeyAssignment}; use crate::types::typevar::{ BoundTypeVarIdentity, TypeVarConstraints, TypeVarIdentity, TypeVarInstance, TypeVarSet, }; +use crate::types::underscore_names::{self, Spelled}; use crate::types::unpacker::{ UnpackResult, fixed_sequence_elements, sequence_from_literal_elements, tuple_literal_needs_promotion, @@ -166,15 +168,16 @@ use crate::types::visibility::{ use crate::types::{ BindingContext, BoundTypeVarInstance, CallDunderError, CallableBinding, CallableType, CallableTypes, ClassType, DeferredOperation, DeferredType, DynamicType, GeneratorTypeMode, - InferenceFlags, InternedConstraintSet, InternedType, IntersectionBuilder, IntersectionType, - KnownBoundMethodType, KnownClass, KnownInstanceType, KnownUnion, LiteralValueType, - LiteralValueTypeKind, MemberLookupPolicy, ParamSpecAttrKind, Parameter, Parameters, - ProgramEnvironment, PropertyDeprecations, RestrictedType, SentinelInstance, Signature, - SpecialFormType, SubclassOfType, Type, TypeAliasType, TypeAndQualifiers, TypeContext, - TypeQualifiers, TypeVarBoundOrConstraints, TypeVarKind, TypeVarVariance, TypedDictType, - TypingModule, UnionAccumulator, UnionBuilder, UnionType, any_over_type, binding_type, - extract_fixed_length_iterable_element_types, infer_complete_scope_types, infer_scope_types, - is_discarded_dict_key_assignment, report_iteration_over_character, todo_type, + InferenceFlags, InstanceProjection, InternedConstraintSet, InternedType, IntersectionBuilder, + IntersectionType, KnownBoundMethodType, KnownClass, KnownInstanceType, KnownUnion, + LiteralValueType, LiteralValueTypeKind, MemberLookupPolicy, ParamSpecAttrKind, Parameter, + Parameters, ProgramEnvironment, PropertyDeprecations, RestrictedType, SentinelInstance, + Signature, SpecialFormType, SubclassOfType, Type, TypeAliasType, TypeAndQualifiers, + TypeContext, TypeQualifiers, TypeVarBoundOrConstraints, TypeVarKind, TypeVarVariance, + TypedDictType, TypingModule, UnionAccumulator, UnionBuilder, UnionType, any_over_type, + binding_type, extract_fixed_length_iterable_element_types, infer_complete_scope_types, + infer_scope_types, is_discarded_dict_key_assignment, report_iteration_over_character, + todo_type, }; use crate::{AnalysisSettings, Db, DisplaySettings, FxIndexSet, FxOrderSet, SemanticModel}; use fluid::FluidTimeline; @@ -203,7 +206,7 @@ mod annotation_expression; mod attribute_assignment; pub(crate) mod binary_expressions; pub(crate) use binary_expressions::{ - fold_tuple_concat, fold_tuple_repeat, literal_binary_op, literal_unary_op, + fold_tuple_concat, fold_tuple_multiplication, literal_binary_op, literal_unary_op, }; mod class; mod conditions; @@ -625,6 +628,16 @@ fn transparent_callable_decorator_result<'db>( } } +/// basedpython: what an underscore name names, which decides the keyword that +/// would say what the underscore was standing in for — see [`USED_UNDERSCORE_NAME`] +#[derive(Clone, Copy)] +enum UnderscoreName { + /// a member of a class + Member, + /// anything else: a variable, a parameter, a module-level declaration + Symbol, +} + impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { /// How big a string do we build before bailing? /// @@ -3464,10 +3477,16 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { let db = self.db(); let env = self.program_environment(); // basedpython: `case A(x=...)` reads `x` off the subject exactly as `a.x` does - if self.context.is_lint_enabled(&INACCESSIBLE_MEMBER) { - for keyword in &pattern.arguments.keywords { + // basedpython: a keyword names a member of the *subject*, so an underscore + // name is read exactly as `a.x` reads one + let subject_ty = cls_ty + .to_instance(db, env) + .map_or_else(Type::unknown, InstanceProjection::into_inner); + for keyword in &pattern.arguments.keywords { + if self.context.is_lint_enabled(&INACCESSIBLE_MEMBER) { self.check_member_reach(&keyword.attr, cls_ty, keyword.attr.as_str()); } + self.check_underscore_member_use(&keyword.attr, subject_ty, None, false); } // basedpython `case A(x, *_, y)`: the starred wildcard is not a subpattern of its own, // it only says that what follows it is counted back from the end of `__match_args__` @@ -6272,12 +6291,19 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { let target_result = match &**target { ast::Expr::Name(name) => { let previous_value = self.infer_name_load(name, TypeContext::default()); + self.check_underscore_name_load(name); self.store_expression_type(target, previous_value); Ok(previous_value) } ast::Expr::Attribute(attr) => { let result = self.infer_attribute_load(attr); let previous_value = result.unwrap_or_else(|recovery_ty| recovery_ty); + self.check_underscore_member_use( + &attr.attr, + self.expression_type(&attr.value), + Some(&attr.value), + attr.optional, + ); self.store_expression_type(target, previous_value); result } @@ -6581,7 +6607,7 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { }; // a returned expression is a standalone one when the function leaves its return type to // be recovered, so that what it narrows can be read off it — see - // `inferred_narrowing_guards` + // `inferred_predicate_guards` if let Some(ty) = ret .value .as_deref() @@ -12735,6 +12761,23 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { } } + // basedpython: a keyword argument names a parameter, so an underscore name + // is read here exactly as a member is read off an attribute access + for keyword in &*arguments.keywords { + let Some(name) = keyword.arg.as_ref() else { + continue; + }; + self.check_underscore_name_use(name, name.as_str(), |builder| { + underscore_names::definitions_are_chosen( + builder.db(), + bindings + .keyword_parameters(name.as_str()) + .filter_map(Parameter::definition), + name.as_str(), + ) + }); + } + let mut bindings = match bindings_result { Ok(()) => bindings, Err(_) => { @@ -13121,13 +13164,7 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { let asserts = bindings .single_element() .and_then(|binding| binding.matching_overloads().next()) - .is_some_and(|(_, overload)| { - overload - .signature - .narrowing_guards - .iter() - .any(NarrowingGuard::is_assertion) - }); + .is_some_and(|(_, overload)| overload.signature.carries_written_assertion(self.db())); if !asserts { return; } @@ -14463,6 +14500,7 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { match name.ctx { ExprContext::Load => { let ty = self.infer_name_load(name, tcx); + self.check_underscore_name_load(name); // basedpython: a `type def` has no runtime existence — the // declaration is erased when transpiling — so naming one in a value // position would emit python that raises `NameError` @@ -14487,6 +14525,7 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { ExprContext::Store => Type::Never, ExprContext::Del => { self.infer_name_load(name, TypeContext::default()); + self.check_underscore_name_load(name); Type::Never } ExprContext::Invalid => Type::unknown(), @@ -15216,13 +15255,37 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { .collect::>() .join(", "); - builder.into_diagnostic(format_args!( + let mut diagnostic = builder.into_diagnostic(format_args!( "Attribute `{attr_name}` is not defined on {} \ in union `{union_like_type}`", missing_types, union_like_type = union_like_type.display_with(db, env, settings), )); + // basedpython: when `None` is all that lacks the attribute, + // `?.` is the access that reads it only when it is there. the + // fix is unsafe because the read then evaluates to `None` + // instead of raising, which whatever uses it has to handle + if attribute.ctx.is_load() + && !attribute.optional + && self.file().source_type(db).is_basedpython() + && elements_missing_the_attribute.len() == 1 + && elements_missing_the_attribute + .iter() + .all(|element| element.is_none(db)) + && let Some(dot) = attribute_dot( + &source_text(db, self.file()), + attribute, + ) + { + diagnostic.help(format_args!( + "Use `?.` to read `{attr_name}` only when the value is not `None`" + )); + diagnostic.set_fix(Fix::unsafe_edit(Edit::insertion( + "?".to_string(), + dot, + ))); + } } return type_when_bound; } @@ -15306,6 +15369,12 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { .infer_attribute_load(attribute) .unwrap_or_else(|recovery_ty| recovery_ty); self.validate_member_visibility(attribute, self.expression_type(value)); + self.check_underscore_member_use( + attr, + self.expression_type(value), + Some(value), + attribute.optional, + ); member_type } ExprContext::Store => { @@ -15322,6 +15391,12 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { true, ); self.validate_member_visibility(attribute, self.expression_type(value)); + self.check_underscore_member_use( + attr, + self.expression_type(value), + Some(value), + attribute.optional, + ); Type::Never } ExprContext::Invalid => { @@ -15331,6 +15406,115 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { } } + /// basedpython: reports a read of the member `attr` off `receiver` when a `.by` + /// file spelled it with a leading underscore — see [`USED_UNDERSCORE_NAME`] + fn check_underscore_member_use( + &self, + attr: &ast::Identifier, + receiver: Type<'db>, + receiver_expr: Option<&ast::Expr>, + optional: bool, + ) { + self.check_underscore_name_use_of(attr, attr.as_str(), UnderscoreName::Member, |builder| { + let access = AttributeRead { + file: builder.file(), + scope: builder.scope(), + receiver, + receiver_expr, + optional, + }; + underscore_names::member_is_chosen( + builder.db(), + builder.program_environment(), + &access, + attr.as_str(), + ) + }); + } + + /// basedpython: reports a read of the name `name` when a leading underscore + /// marks it unused — see [`USED_UNDERSCORE_NAME`] + fn check_underscore_name_load(&self, name: &ast::ExprName) { + self.check_underscore_name_use(name, &name.id, |builder| { + underscore_names::name_is_chosen( + builder.db(), + builder.program_environment(), + builder.file(), + builder.scope(), + name, + ) + }); + } + + /// basedpython: reports a read of `name` at `node` when a leading underscore + /// marks it unused and `is_chosen` says a `.by` file picked that spelling. the + /// cheap questions are asked first: the resolution runs only for an underscore + /// name read in a `.by` source file + /// + /// a read the parser wrote is not a use. `init(let x: int)` stands for a + /// `self.x = x` and a property accessor's `field` for a read of the property's + /// backing storage, and the author has nothing to rename at either + fn check_underscore_name_use( + &self, + node: impl Ranged, + name: &str, + is_chosen: impl FnOnce(&Self) -> Option, + ) { + self.check_underscore_name_use_of(node, name, UnderscoreName::Symbol, is_chosen); + } + + /// basedpython: [`Self::check_underscore_name_use`], for a name whose advice + /// differs — a class member is spelled `protected`, not `private` + fn check_underscore_name_use_of( + &self, + node: impl Ranged, + name: &str, + kind: UnderscoreName, + is_chosen: impl FnOnce(&Self) -> Option, + ) { + if self.source_type() != ast::PySourceType::BasedPython + || !underscore_names::is_underscore_name(name) + || !self.context.is_lint_enabled(&USED_UNDERSCORE_NAME) + || self + .module() + .generated_names() + .get(node.range(), ast::name::Name::new(name)) + .is_some() + { + return; + } + let Some(spelled) = is_chosen(self) else { + return; + }; + if let Some(builder) = self.context.report_lint(&USED_UNDERSCORE_NAME, node) { + let mut diagnostic = builder.into_diagnostic(format_args!( + "`{name}` is used, but its leading underscore marks it unused" + )); + // where the name was spelled is most of the answer when it was + // spelled somewhere else — an import, or a base class in another file + if let Some(declaration) = spelled.declaration + && declaration.file() != self.file() + { + diagnostic.annotate( + Annotation::secondary(Span::from(declaration)) + .message(format_args!("`{name}` is declared here")), + ); + } + diagnostic.info(match kind { + // `private` on a member emits `__name`, which python mangles, so a + // member python code still reads by its underscored name says + // `protected`: that is the keyword the lowering emits as `_name` + UnderscoreName::Member => { + "drop the underscore, or declare the member `protected` if it is meant to be \ + reached only by this class and its subclasses" + } + UnderscoreName::Symbol => { + "drop the underscore, or declare it `private` if it is meant to be private" + } + }); + } + } + /// basedpython: `a.x` where `x` carries a visibility keyword and the access is /// written outside the code that keyword admits — anywhere but the declaring /// class's own body for `private`, anywhere but that and a subclass's body for @@ -17557,6 +17741,21 @@ fn is_collection_literal(expression: &ast::Expr) -> bool { ) } +/// The offset of the `.` of `attribute`, past any parentheses closing its value and any comment or +/// line break before the dot. +fn attribute_dot(source: &str, attribute: &ast::ExprAttribute) -> Option { + use ruff_python_trivia::{SimpleTokenKind, SimpleTokenizer}; + + SimpleTokenizer::new( + source, + TextRange::new(attribute.value.end(), attribute.attr.start()), + ) + .skip_trivia() + .find(|token| token.kind() != SimpleTokenKind::RParen) + .filter(|token| token.kind() == SimpleTokenKind::Dot) + .map(|token| token.start()) +} + /// Returns `true` if `expression` is a link of a basedpython optional chain: a `?.` access, or a /// trailer applied to one. /// diff --git a/crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs b/crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs index 7286853ca2..d8b421eecf 100644 --- a/crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs +++ b/crates/ty_python_semantic/src/types/infer/builder/binary_expressions.rs @@ -14,7 +14,7 @@ use crate::types::diagnostic::{ use crate::types::function::OverloadLiteral; use crate::types::inferred_signature::gradual_hole; use crate::types::set_theoretic::RecursivelyDefined; -use crate::types::tuple::Tuple; +use crate::types::tuple::{Tuple, TupleSpecBuilder, TupleType, VariableSegment}; use crate::types::typevar::TypeVarConstraints; use crate::types::{ DeferredOperation, DeferredType, DynamicType, InternedConstraintSet, KnownClass, @@ -942,20 +942,15 @@ impl<'db> TypeInferenceBuilder<'db, '_> { binding.return_type(db, env) }), - // fold `(a, b) * n` (and `n * (a, b)`) into a fixed-length tuple with the - // elements repeated `n` times, matching the runtime behaviour of - // `tuple.__mul__`. without this, typeshed's stub widens the result to - // `tuple[T, ...]`, discarding the exact element order and count + // fold `(a, b) * n` (and `n * (a, b)`) into the tuple with its elements repeated + // `n` times, matching the runtime behaviour of `tuple.__mul__`. without this, + // typeshed's stub widens the result to `tuple[T, ...]`, discarding the element order (Type::NominalInstance(_), _, ast::Operator::Mult) - if right_ty.as_int_like_literal().is_some() => + | (_, Type::NominalInstance(_), ast::Operator::Mult) + if left_ty.exact_tuple_instance_spec(db).is_some() + || right_ty.exact_tuple_instance_spec(db).is_some() => { - fold_tuple_repeat(db, env, left_ty, right_ty) - .or_else(|| self.infer_binary_dunder(state, left_ty, op, right_ty, tcx)) - } - (_, Type::NominalInstance(_), ast::Operator::Mult) - if left_ty.as_int_like_literal().is_some() => - { - fold_tuple_repeat(db, env, right_ty, left_ty) + fold_tuple_multiplication(db, env, left_ty, right_ty) .or_else(|| self.infer_binary_dunder(state, left_ty, op, right_ty, tcx)) } @@ -1181,46 +1176,107 @@ fn complex_binary_op_result( LiteralArithOutcome::Literal(Type::complex_literal(db, re, im)) } -/// Fold `tuple * n` into a fixed-length tuple whose elements are those of `tuple_ty` -/// repeated `n` times, where `multiplier` is a literal integer (or `bool`). +/// Fold `left * right`, where one operand is an exact tuple, into that tuple with its elements +/// repeated. /// -/// Returns `None` — leaving the caller to fall back on typeshed's `tuple.__mul__`, which -/// widens to `tuple[T, ...]` — when `tuple_ty` is not an exact fixed-length tuple, when -/// `multiplier` is not a literal integer, or when the repeated tuple would grow beyond -/// `MAX_LENGTH`. A non-positive multiplier folds to the empty tuple. -pub(crate) fn fold_tuple_repeat<'db>( +/// A literal integer (or `bool`) repeats a fixed-length tuple into another fixed-length +/// tuple. Any other multiplier that `tuple.__mul__` accepts repeats it an unknown number of +/// times, `(a, b) * n` being `(a, b) * int`, whose elements still alternate. A tuple that +/// already repeats a run of elements with nothing before or after it is its own repetition. +/// +/// Returns `None`, leaving the caller to fall back on typeshed's `tuple.__mul__`, which widens +/// to `tuple[T, ...]`, when neither operand is an exact tuple, when the operation does not +/// reach the tuple's own `__mul__` or `__rmul__`, or when the tuple has elements before or +/// after its variable-length part, which would interleave with the repetitions. +pub(crate) fn fold_tuple_multiplication<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + left_ty: Type<'db>, + right_ty: Type<'db>, +) -> Option> { + fold_tuple_repeat(db, env, left_ty, right_ty, TupleOperand::Left) + .or_else(|| fold_tuple_repeat(db, env, left_ty, right_ty, TupleOperand::Right)) +} + +/// which operand of a multiplication is the tuple being repeated +#[derive(Clone, Copy)] +enum TupleOperand { + Left, + Right, +} + +fn fold_tuple_repeat<'db>( db: &'db dyn Db, env: &ProgramEnvironment<'db>, - tuple_ty: Type<'db>, - multiplier: Type<'db>, + left_ty: Type<'db>, + right_ty: Type<'db>, + tuple_operand: TupleOperand, ) -> Option> { - /// Repeating into a longer tuple discards the exact element types, so cap the work. + /// Repeating into a longer tuple spells out every element, so past this length the + /// result keeps only the repeated order. const MAX_LENGTH: usize = 512; - let factor = multiplier.as_int_like_literal()?; - let spec = tuple_ty.exact_tuple_instance_spec(db)?; - let Tuple::Fixed(fixed) = spec.as_ref() else { - return None; + let (tuple_ty, multiplier, method) = match tuple_operand { + TupleOperand::Left => (left_ty, right_ty, "__mul__"), + TupleOperand::Right => (right_ty, left_ty, "__rmul__"), }; - let elements = fixed.all_elements(); - let factor = usize::try_from(factor).unwrap_or(0); - let new_length = elements.len().checked_mul(factor)?; - if new_length > MAX_LENGTH { - return None; - } + let spec = tuple_ty.exact_tuple_instance_spec(db)?; - let mut repeated = Vec::with_capacity(new_length); - for _ in 0..factor { - repeated.extend_from_slice(elements); + let factor = match multiplier.as_int_like_literal() { + Some(factor) => Some(usize::try_from(factor).unwrap_or(0)), + None if Type::bin_op_calls_method_of( + db, + env, + left_ty, + ast::Operator::Mult, + right_ty, + tuple_ty, + method, + ) => + { + None + } + None => return None, + }; + + match spec.as_ref() { + Tuple::Fixed(fixed) => { + let elements = fixed.all_elements(); + if let Some(factor) = factor + && let Some(new_length) = elements.len().checked_mul(factor) + && new_length <= MAX_LENGTH + { + let mut repeated = Vec::with_capacity(new_length); + for _ in 0..factor { + repeated.extend_from_slice(elements); + } + return Some(Type::heterogeneous_tuple(db, env, repeated)); + } + Some(Type::tuple(TupleType::mixed_with_segment( + db, + env, + [], + VariableSegment::repeating(db, env, elements), + [], + ))) + } + Tuple::Variable(_) if factor == Some(0) => Some(Type::empty_tuple(db, env)), + Tuple::Variable(variable) + if variable.prefix_elements().is_empty() + && variable.suffix_elements().is_empty() + && variable.variable().typevartuple().is_none() => + { + Some(tuple_ty) + } + Tuple::Variable(_) => None, } - Some(Type::heterogeneous_tuple(db, env, repeated)) } -/// Fold `left + right` into a single fixed-length tuple concatenating their elements. +/// Fold `left + right` into a single tuple concatenating their elements. /// /// Returns `None` — leaving the caller to fall back on typeshed's `tuple.__add__` — unless -/// both operands are exact fixed-length tuples. +/// both operands are exact tuples. pub(crate) fn fold_tuple_concat<'db>( db: &'db dyn Db, env: &ProgramEnvironment<'db>, @@ -1229,17 +1285,13 @@ pub(crate) fn fold_tuple_concat<'db>( ) -> Option> { let left = left_ty.exact_tuple_instance_spec(db)?; let right = right_ty.exact_tuple_instance_spec(db)?; - let (Tuple::Fixed(left), Tuple::Fixed(right)) = (left.as_ref(), right.as_ref()) else { - return None; - }; - Some(Type::heterogeneous_tuple( + Some(Type::tuple(TupleType::new( db, env, - left.all_elements() - .iter() - .chain(right.all_elements()) - .copied(), - )) + &TupleSpecBuilder::from(left.as_ref()) + .concat(db, env, &right) + .build(), + ))) } /// basedpython: fold a unary operation on a literal operand (`-3` → `Literal[-3]`, diff --git a/crates/ty_python_semantic/src/types/infer/builder/imports.rs b/crates/ty_python_semantic/src/types/infer/builder/imports.rs index 69c7e7c00a..260e3fd82f 100644 --- a/crates/ty_python_semantic/src/types/infer/builder/imports.rs +++ b/crates/ty_python_semantic/src/types/infer/builder/imports.rs @@ -1,5 +1,5 @@ use ruff_python_ast as ast; -use ruff_text_size::{Ranged, TextRange}; +use ruff_text_size::{Ranged, TextLen, TextRange, TextSize}; use ty_module_resolver::{ DistributionName, ImportingFile, KnownModule, Module, ModuleName, ModuleNameResolutionError, ModuleResolveMode, resolve_module, search_paths, @@ -25,7 +25,7 @@ use crate::{ hint_if_stdlib_submodule_exists_on_other_versions, }, infer::{TypeInferenceBuilder, builder::DeclaredAndInferredType}, - infer_definition_types, static_resource, + infer_definition_types, static_resource, underscore_names, visibility::private_symbols, }, }; @@ -266,6 +266,30 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { )); } + // basedpython: every segment of a dotted import names a module, and an + // underscore segment is a use of the name that module's file was given + let mut segment_start = name.range.start(); + let mut prefix = String::new(); + for segment in name.split('.') { + let segment_range = TextRange::at(segment_start, segment.text_len()); + segment_start = segment_range.end() + TextSize::from(1); + if !prefix.is_empty() { + prefix.push('.'); + } + prefix.push_str(segment); + let Some(module_name) = ModuleName::new(&prefix) else { + break; + }; + self.check_underscore_name_use(segment_range, segment, |builder| { + underscore_names::imported_module_is_chosen( + builder.db(), + builder.program_environment(), + builder.file(), + &module_name, + ) + }); + } + // The name of the module being imported let Some(full_module_name) = ModuleName::new(name) else { tracing::debug!("Failed to resolve import due to invalid syntax"); @@ -809,6 +833,17 @@ impl<'db, 'ast> TypeInferenceBuilder<'db, 'ast> { }; self.check_private_import(module, &module_name, alias, name); + if &alias.name != "*" { + self.check_underscore_name_use(&alias.name, name, |builder| { + underscore_names::imported_name_is_chosen( + builder.db(), + env, + importing_file, + import_from, + name, + ) + }); + } // Avoid looking up attributes on a module if a module imports from itself // at the module-global scope, where the import definition itself is one of the diff --git a/crates/ty_python_semantic/src/types/infer/builder/post_inference/typeguard.rs b/crates/ty_python_semantic/src/types/infer/builder/post_inference/typeguard.rs index 6c51098d43..446ea119af 100644 --- a/crates/ty_python_semantic/src/types/infer/builder/post_inference/typeguard.rs +++ b/crates/ty_python_semantic/src/types/infer/builder/post_inference/typeguard.rs @@ -1,14 +1,23 @@ use ruff_python_ast as ast; +use ruff_text_size::{Ranged, TextRange}; +use ty_python_core::definition::Definition; use ty_python_core::place::PlaceExpr; use ty_python_core::place_table; +use crate::place::{ConsideredDefinitions, symbol}; use crate::semantic_index; +use crate::types::function::{FunctionDecorators, OverloadLiteral}; +use crate::types::inferred_narrowing::{ + NormalExit, holds_the_argument, narrowed_at_exit, normal_exits, +}; use crate::types::narrowing_guards::guard_place_display; use crate::types::signatures::{NarrowingGuard, NarrowingGuardKind, Signature}; use crate::types::{ - Type, + IntersectionBuilder, Type, binding_type, context::InferContext, - diagnostic::{INVALID_TYPE_GUARD_DEFINITION, UNRESOLVED_NARROWING_GUARD}, + diagnostic::{ + INVALID_TYPE_GUARD_DEFINITION, UNESTABLISHED_ASSERTION_GUARD, UNRESOLVED_NARROWING_GUARD, + }, }; /// Check that all type guard function definitions have at least one positional parameter @@ -31,13 +40,33 @@ pub(crate) fn check_type_guard_definition<'db>( let signature = overload.signature(db); let return_ty = signature.return_ty; + // basedpython: an assertion inherited from an overridden method is checked wherever the + // override is written, which is not always a return annotation + check_inherited_assertions(context, overload, &signature, node); + // Every check here reports on the return annotation. let Some(returns_expr) = node.returns.as_deref() else { return; }; - for guard in &signature.narrowing_guards { - check_guard_place_exists(context, &signature, guard, returns_expr); + let guards = signature.all_narrowing_guards(db); + for guard in guards.iter() { + // a guard that names nothing narrows nothing, and asking whether the body established + // what it claims about a place that does not exist would report the typo twice + if !check_guard_place_exists(context, &signature, guard, returns_expr) { + continue; + } + if node.is_asserts_return && guard.is_written_assertion() { + check_assertion_established( + context, + overload, + &signature, + guard, + node, + returns_expr.range(), + None, + ); + } } // Check if this is a `TypeIs` or `TypeGuard` return type, or basedpython's assertion @@ -46,7 +75,7 @@ pub(crate) fn check_type_guard_definition<'db>( let (type_guard_form_name, narrowed_type) = match return_ty { Type::TypeIs(type_is) => ("TypeIs", Some(type_is.return_type(db))), Type::TypeGuard(_) => ("TypeGuard", None), - _ => match signature.narrowing_guards.first() { + _ => match guards.first() { Some(NarrowingGuard { members, kind: @@ -63,7 +92,7 @@ pub(crate) fn check_type_guard_definition<'db>( // Check if this is a non-static method (first parameter is implicit `self`/`cls`). let has_implicit_receiver = overload.has_implicit_receiver(db); - let narrowed_param = match signature.narrowing_guards.first() { + let narrowed_param = match guards.first() { // basedpython: `-> x is T` names the parameter it narrows. a name that is not a // parameter is resolved in each calling scope instead, and a member's declared type // is the attribute's, so neither has a parameter type to check against here @@ -116,20 +145,69 @@ pub(crate) fn check_type_guard_definition<'db>( } } +/// basedpython: check this method's body against the assertions the method it overrides makes. +/// +/// A call through the base narrows on the strength of what the base asserts, and what it is called +/// on may be an instance of this class, so an override that does not establish the same thing +/// makes that narrowing wrong. The override carries the assertion for its own callers too, which +/// is what [`OverloadLiteral::inherited_assertion_guards`] puts on its signature. +fn check_inherited_assertions<'db>( + context: &InferContext<'db, '_>, + overload: OverloadLiteral<'db>, + signature: &Signature<'db>, + node: &ast::StmtFunctionDef, +) { + let db = context.db(); + let env = context.program_environment(); + let inherited = overload.inherited_assertion_guards(db, env, signature.parameters()); + if inherited.is_empty() { + return; + } + let Some(base) = overload.overridden_method_display(db, env) else { + return; + }; + + let guards = node + .is_asserts_return + .then(|| signature.all_narrowing_guards(db)); + for guard in &inherited { + // an assertion this method writes for itself is checked against its own annotation, and + // reporting the same place twice would say the same thing twice + if guards.as_ref().is_some_and(|guards| { + guards.iter().any(|own| { + own.is_written_assertion() && own.name == guard.name && own.members == guard.members + }) + }) { + continue; + } + check_assertion_established( + context, + overload, + signature, + guard, + node, + node.name.range(), + Some(&base), + ); + } +} + /// basedpython: report a guard whose root name is neither a parameter nor a place where the /// guard is written — it would narrow nothing at every call site. +/// +/// Returns whether the guard names something. fn check_guard_place_exists<'db>( context: &InferContext<'db, '_>, signature: &Signature<'db>, guard: &NarrowingGuard<'db>, returns_expr: &ast::Expr, -) { +) -> bool { if signature .parameters() .iter() .any(|parameter| parameter.name() == Some(&guard.name)) { - return; + return true; } // the annotation itself references the name, so merely appearing in a place table says @@ -150,7 +228,7 @@ fn check_guard_place_exists<'db>( }) }); if resolves { - return; + return true; } if let Some(builder) = context.report_lint(&UNRESOLVED_NARROWING_GUARD, returns_expr) { @@ -159,4 +237,196 @@ fn check_guard_place_exists<'db>( place = guard_place_display(guard) )); } + false +} + +/// basedpython: report each way out of a function body that does not establish what an assertion +/// guard claims about its place. +/// +/// A call narrows its argument to the asserted type as soon as it returns, so the claim has to +/// hold at every `return` that can be reached and at the end of the body, if that can be reached. +fn check_assertion_established<'db>( + context: &InferContext<'db, '_>, + overload: OverloadLiteral<'db>, + signature: &Signature<'db>, + guard: &NarrowingGuard<'db>, + node: &ast::StmtFunctionDef, + anchor: TextRange, + inherited_from: Option<&str>, +) { + let db = context.db(); + let env = context.program_environment(); + let Some(asserted) = guard.kind.asserted_type(db, env) else { + return; + }; + + // a `def` that declares a function without implementing one — in a stub file, as an + // `@overload` or an `@abstractmethod`, or with a `...` body — makes its claim for whatever + // implements it, and has no body of its own to establish anything + if context.in_stub() + || is_declaration_body(node) + || overload.has_known_decorator(db, FunctionDecorators::OVERLOAD) + || overload.has_known_decorator(db, FunctionDecorators::ABSTRACT_METHOD) + { + return; + } + + let program_file = overload.program_file(db); + let index = semantic_index(db, program_file); + let body_scope = overload.body_scope(db); + let file_scope_id = body_scope.file_scope_id(db); + let use_def = index.use_def_map(file_scope_id); + let place_table = index.place_table(file_scope_id); + + let is_parameter = signature + .parameters() + .iter() + .any(|parameter| parameter.name() == Some(&guard.name)); + + // a guard's root is the caller's — the argument it passed, or the place it can see — and a + // body that puts something else there, whether by assigning to the parameter or by binding a + // local of the place's name, can only establish something about that + if !holds_the_argument(db, index, file_scope_id, &guard.name, &[]) { + if let Some(builder) = context.report_lint(&UNESTABLISHED_ASSERTION_GUARD, anchor) { + let subject = if is_parameter { + "the argument this guard narrows" + } else { + "the place this guard narrows" + }; + builder.into_diagnostic(format_args!( + "the body puts another value in `{name}`, so what it establishes is not about \ + {subject}", + name = guard.name + )); + } + return; + } + + // what a place held when the body began, which the body did not put there: a parameter is + // always bound by then, and a place of the enclosing scopes is whatever it is there + let outer_root_type = || { + if is_parameter { + return Type::unknown(); + } + index + .ancestor_scopes(file_scope_id) + .skip(1) + // the names of a class body are not visible to the functions nested in it, so a guard + // written there names whatever place an enclosing scope has + .filter(|(_, scope)| !scope.kind().is_class()) + .find_map(|(scope_id, _)| { + let scope = scope_id.to_scope_id(db, program_file); + symbol(db, scope, &guard.name, ConsideredDefinitions::AllReachable) + .place + .ignore_possibly_undefined() + }) + .unwrap_or_else(Type::unknown) + }; + + let start_from = |definition: Option>, outer: &dyn Fn() -> Type<'db>| { + definition.map_or_else(outer, |definition| binding_type(db, definition)) + }; + + let claim = match guard.kind { + NarrowingGuardKind::Asserts { is_positive: true } => "truthy".to_string(), + NarrowingGuardKind::Asserts { is_positive: false } => "falsy".to_string(), + NarrowingGuardKind::AssertsType { + is_positive: true, + ty, + } => format!("`{}`", ty.display(db, env)), + NarrowingGuardKind::AssertsType { + is_positive: false, + ty, + } => format!("not `{}`", ty.display(db, env)), + // an assertion recovered from a body says what that body established, which is a type + NarrowingGuardKind::InferredAssertion { ty } => format!("`{}`", ty.display(db, env)), + // a predicate narrows where the call is tested rather than once it returns, so there is + // no assertion for a body to establish + NarrowingGuardKind::Predicate | NarrowingGuardKind::InferredPredicate { .. } => return, + }; + + // a member is read off whatever the place above it holds, so rebinding that place leaves what + // the body established about the member describing a value the caller never reads back + let prefixes_hold = (0..guard.members.len()).all(|depth| { + holds_the_argument( + db, + index, + file_scope_id, + &guard.name, + &guard.members[..depth], + ) + }); + + for exit in normal_exits(db, use_def) { + let mut established = match PlaceExpr::from_symbol_with_members(&guard.name, &[]) + .and_then(|root| place_table.place_id(&root)) + { + Some(root) => narrowed_at_exit(db, env, use_def, exit, root, &|definition| { + start_from(definition, &outer_root_type) + }), + None => outer_root_type(), + }; + // each member is read off the value above it, and then narrowed by what the body + // established about the member itself + for depth in 1..=guard.members.len() { + let parent = established; + let read_member = || { + parent + .member(db, env, &guard.members[depth - 1]) + .place + .ignore_possibly_undefined() + .unwrap_or_else(Type::unknown) + }; + established = + match PlaceExpr::from_symbol_with_members(&guard.name, &guard.members[..depth]) + .and_then(|place| place_table.place_id(&place)) + .filter(|_| prefixes_hold) + { + Some(place) => narrowed_at_exit(db, env, use_def, exit, place, &|definition| { + start_from(definition, &read_member) + }), + None => read_member(), + }; + } + + // what the place is has to leave no room for the assertion to fail, which asks more than + // assignability: `Any` is assignable to anything, and says nothing + if IntersectionBuilder::new(db, env) + .add_positive(established) + .add_positive(asserted.negate(db, env)) + .build() + .is_never() + { + continue; + } + let (range, location) = match exit { + NormalExit::Return { range, .. } => (range, "where this returns"), + NormalExit::EndOfBody => (anchor, "where the body ends"), + }; + let Some(builder) = context.report_lint(&UNESTABLISHED_ASSERTION_GUARD, range) else { + continue; + }; + let asserter = match inherited_from { + Some(base) => format!("`{base}`, which this overrides, asserts"), + None => "this function asserts".to_string(), + }; + builder.into_diagnostic(format_args!( + "`{place}` is `{established}` {location}, but {asserter} it is {claim}", + place = guard_place_display(guard), + established = established.display(db, env), + )); + } +} + +/// basedpython: whether `node` declares a function without implementing one. +/// +/// A `...` body is a declaration: what it claims is for whatever implements it to establish. A +/// `pass` body is an implementation, and an empty one establishes nothing. +fn is_declaration_body(node: &ast::StmtFunctionDef) -> bool { + ast::helpers::body_without_leading_docstring(&node.body) + .iter() + .all(|stmt| match stmt { + ast::Stmt::Expr(ast::StmtExpr { value, .. }) => value.is_ellipsis_literal_expr(), + _ => false, + }) } diff --git a/crates/ty_python_semantic/src/types/infer/builder/typeguard.rs b/crates/ty_python_semantic/src/types/infer/builder/typeguard.rs index da1529275e..576980ae6c 100644 --- a/crates/ty_python_semantic/src/types/infer/builder/typeguard.rs +++ b/crates/ty_python_semantic/src/types/infer/builder/typeguard.rs @@ -39,7 +39,7 @@ pub(super) fn bind_type_guard_return_type<'db>( let guard = || { let binding = bindings.single_element()?; let (_, overload) = binding.matching_overloads().next()?; - overload.signature.narrowing_guards.first() + overload.signature.all_narrowing_guards(db).first().cloned() }; // the receiver of a bound call is not among its arguments; it is the callee's own value @@ -53,17 +53,17 @@ pub(super) fn bind_type_guard_return_type<'db>( let binding = bindings.single_element()?; let (_, overload) = binding.matching_overloads().next()?; let bound_argument_offset = usize::from(binding.bound_type.is_some()); - match guard_root(guard, overload.signature.parameters(), call) { + match guard_root(&guard, overload.signature.parameters(), call) { // a bound call's signature keeps the receiver parameter, but the call has // no argument for it GuardRoot::Parameter(index) if index < bound_argument_offset => { - return narrowed_place(db, scope, guard, receiver()?); + return narrowed_place(db, scope, &guard, receiver()?); } GuardRoot::Parameter(_) => {} GuardRoot::Receiver(receiver) => { - return narrowed_place(db, scope, guard, receiver); + return narrowed_place(db, scope, &guard, receiver); } - GuardRoot::Scope => return narrowed_scope_place(db, scope, guard), + GuardRoot::Scope => return narrowed_scope_place(db, scope, &guard), } } @@ -77,8 +77,9 @@ pub(super) fn bind_type_guard_return_type<'db>( .or_else(|| binding.callable_type.as_function_literal()) .is_some_and(|function| function.has_implicit_receiver(db)); let bound_argument_offset = usize::from(binding.bound_type.is_some()); - let narrowed_parameter_index = - |overload: &Binding<'db>| match overload.signature.narrowing_guards.first() { + let narrowed_parameter_index = |overload: &Binding<'db>| { + let guards = overload.signature.all_narrowing_guards(db); + match guards.first() { Some(guard) => match guard_root(guard, overload.signature.parameters(), call) { GuardRoot::Parameter(index) => Some(index), GuardRoot::Receiver(_) | GuardRoot::Scope => None, @@ -86,7 +87,8 @@ pub(super) fn bind_type_guard_return_type<'db>( None => Some(usize::from( bound_argument_offset > 0 || has_implicit_receiver, )), - }; + } + }; let narrowed_argument_index = |overload: &Binding<'db>| { let narrowed_parameter_index = narrowed_parameter_index(overload)?; overload @@ -134,7 +136,7 @@ pub(super) fn bind_type_guard_return_type<'db>( match guard() { // the guard may name a member of the argument: `-> x.data is str` - Some(guard) => narrowed_place(db, scope, guard, argument.value()), + Some(guard) => narrowed_place(db, scope, &guard, argument.value()), None => { let place_expr = PlaceExpr::try_from_expr(argument.value())?; place_table(db, scope).place_id(&place_expr) diff --git a/crates/ty_python_semantic/src/types/inferred_narrowing.rs b/crates/ty_python_semantic/src/types/inferred_narrowing.rs index 3b516d9d16..c252b0654f 100644 --- a/crates/ty_python_semantic/src/types/inferred_narrowing.rs +++ b/crates/ty_python_semantic/src/types/inferred_narrowing.rs @@ -13,10 +13,18 @@ //! side is the same with the returns that can hand back a falsy value, and falling off the end of //! the body is one of those. //! +//! A body that returns nothing makes the other kind of claim: `def check(a): assert a` tells +//! every caller that `a` is truthy once the call has returned, just as `-> asserts a` would. What +//! is recovered there is what every way out of the body agrees on — each reachable `return`, and +//! falling off the end — and a body with no way out at all asserts nothing, since no call to it +//! ever returns. The semantic index merges those ways out into one state per place, which is what +//! `recovered_assertion_guards` reads. The same reading checks a written `-> asserts`, against each +//! way out on its own, so that the `return` which fails the assertion is the one reported. +//! //! Two things are asked of the body beyond that, and both are about the value a caller actually -//! holds: that testing the call really does test what the body returned — which rules out a -//! coroutine and a generator — and that the place the guard names still holds what the caller -//! passed, which rules out a body that rebinds it. +//! holds: that calling it really does run the body — which rules out a coroutine and a +//! generator — and that the place the guard names still holds what the caller passed, which +//! rules out a body that rebinds it. //! //! See `docs/basedpython/features/type-is.md`. @@ -24,15 +32,19 @@ use ruff_db::parsed::parsed_module; use ruff_python_ast::name::{Name, UnqualifiedName}; use ruff_python_ast::visitor::{Visitor, walk_expr, walk_stmt}; use ruff_python_ast::{self as ast, Expr, Stmt}; +use ruff_text_size::TextRange; use rustc_hash::FxHashSet; use ty_python_core::ast_ids::try_scoped_use_id; -use ty_python_core::definition::{DefinitionKind, DefinitionState}; +use ty_python_core::definition::{Definition, DefinitionKind, DefinitionState}; use ty_python_core::place::{PlaceExpr, PlaceExprRef, ScopedPlaceId}; use ty_python_core::predicate::{Predicate, PredicateNode}; use ty_python_core::scope::ScopeId; -use ty_python_core::{FileScopeId, SemanticIndex, semantic_index}; +use ty_python_core::{ + BindingWithConstraintsIterator, FileScopeId, SemanticIndex, UseDefMap, semantic_index, +}; use crate::Db; +use crate::reachability::ReachabilityConstraintsExtension; use crate::types::function::OverloadLiteral; use crate::types::infer::ScopeInference; use crate::types::inferred_signature::can_implicitly_return_none; @@ -46,7 +58,31 @@ use crate::types::{ UnionType, infer_scope_types, }; -/// The narrowing guards `overload`'s body establishes, for a `def` that wrote no return type. +/// Whether a `def`'s body is where its guards are stated: it wrote no return type, and calling +/// it runs the body. +fn states_guards_in_body<'db>(db: &'db dyn Db, overload: OverloadLiteral<'db>) -> bool { + let program_file = overload.program_file(db); + let module = parsed_module(db, program_file.python_file(db)).load(db); + let node = overload.node(db, overload.file(db), &module); + + // a written return type is the whole of what the function declares; a body is only read + // where nothing was written down + if node.returns.is_some() || node.is_asserts_return { + return false; + } + + // a guard is a claim about the value a call produces, and neither a generator nor a coroutine + // produces what its `return`s say: `if is_int(x)` on an `async def` tests the coroutine + // object, which is truthy without the body having run at all + let index = semantic_index(db, program_file); + !(node.is_async + || overload + .body_scope(db) + .file_scope_id(db) + .is_generator_function(index)) +} + +/// The predicate guards `overload`'s body establishes, for a `def` that wrote no return type. /// /// Resolving what the body returns infers types, and inferring them can reach this very /// function's signature — a recursive predicate is the ordinary case, not a pathological one. So @@ -58,29 +94,24 @@ use crate::types::{ cycle_initial = |_, _, _| Box::default(), heap_size = ruff_memory_usage::heap_size, )] -pub(crate) fn inferred_narrowing_guards<'db>( +pub(crate) fn inferred_predicate_guards<'db>( db: &'db dyn Db, overload: OverloadLiteral<'db>, ) -> Box<[NarrowingGuard<'db>]> { - let program_file = overload.program_file(db); - let file = overload.file(db); - let module = parsed_module(db, program_file.python_file(db)).load(db); - let node = overload.node(db, file, &module); - - // a written return type is the whole of what the function declares; a body is only read - // where nothing was written down - if node.returns.is_some() || node.is_asserts_return { + if !states_guards_in_body(db, overload) { return Box::default(); } + let program_file = overload.program_file(db); + let module = parsed_module(db, program_file.python_file(db)).load(db); + let node = overload.node(db, overload.file(db), &module); let index = semantic_index(db, program_file); let body_scope = overload.body_scope(db); let file_scope_id = body_scope.file_scope_id(db); - // a guard is a claim about the value a call produces, and neither a generator nor a coroutine - // produces what its `return`s say: `if is_int(x)` on an `async def` tests the coroutine - // object, which is truthy without the body having run at all - if node.is_async || file_scope_id.is_generator_function(index) { + // a body that hands back nothing gives a caller no value to test. what it establishes is an + // assertion instead — see [`recovered_assertion_guards`] + if index.use_def_map(file_scope_id).records_normal_exit() { return Box::default(); } @@ -169,8 +200,204 @@ pub(crate) fn inferred_narrowing_guards<'db>( .collect() } -/// Whether the place `name` and `members` describe still holds what the caller passed for the -/// parameter, everywhere in the body. +/// Whether [`recovered_assertion_guards`] can find anything for `overload`, from what the semantic +/// index alone says: the body records a merged exit state, and a predicate in it narrows a +/// parameter or a place below one. It infers nothing, so a signature can ask it while it is being +/// built. +pub(crate) fn may_recover_assertions<'db>(db: &'db dyn Db, overload: OverloadLiteral<'db>) -> bool { + if !states_guards_in_body(db, overload) { + return false; + } + + let program_file = overload.program_file(db); + let module = parsed_module(db, program_file.python_file(db)).load(db); + let node = overload.node(db, overload.file(db), &module); + let index = semantic_index(db, program_file); + let file_scope_id = overload.body_scope(db).file_scope_id(db); + + // the index records a merged exit state for exactly the bodies an assertion is read from: + // those that hand back nothing, and that cannot return through a `finally` suite + let use_def = index.use_def_map(file_scope_id); + if !use_def.records_normal_exit() { + return false; + } + + let place_table = index.place_table(file_scope_id); + let targets = use_def.predicate_narrowing_targets(); + node.parameters.iter_non_variadic_params().any(|parameter| { + let name = ¶meter.parameter.name.id; + place_table.symbol_id(name).is_some_and(|symbol| { + std::iter::once(ScopedPlaceId::Symbol(symbol)) + .chain(place_table.members_of_symbol(name)) + .any(|place| targets.contains_place(place)) + }) + }) +} + +/// The assertions `overload`'s body establishes, for a `def` that wrote no return type and hands +/// back nothing. +/// +/// A place is asserted to be what the merged state of every way out of the body says it is, +/// narrowing `object` so that a call site intersects the assertion with the argument it actually +/// passed. A body the index recorded no such state for — one that hands back a value, or that can +/// return through a `finally` suite — asserts nothing. +/// +/// These are not part of the function's signature, which only records whose they are — see +/// [`DeferredAssertions`](crate::types::signatures::DeferredAssertions). A cycle starts at "this +/// function asserts nothing", for the reason [`inferred_predicate_guards`] gives. +#[salsa::tracked( + returns(ref), + cycle_initial = |_, _, _| Box::default(), + heap_size = ruff_memory_usage::heap_size, +)] +pub(crate) fn recovered_assertion_guards<'db>( + db: &'db dyn Db, + overload: OverloadLiteral<'db>, +) -> Box<[NarrowingGuard<'db>]> { + if !may_recover_assertions(db, overload) { + return Box::default(); + } + + let program_file = overload.program_file(db); + let module = parsed_module(db, program_file.python_file(db)).load(db); + let node = overload.node(db, overload.file(db), &module); + let index = semantic_index(db, program_file); + let file_scope_id = overload.body_scope(db).file_scope_id(db); + let place_table = index.place_table(file_scope_id); + let use_def = index.use_def_map(file_scope_id); + let first_parameter = node + .parameters + .iter() + .next() + .map(ast::AnyParameterRef::name); + let env = &ProgramEnvironment::from_file(program_file); + + let mut guards = Vec::new(); + for parameter in node.parameters.iter_non_variadic_params() { + let name = ¶meter.parameter.name.id; + let Some(symbol) = place_table.symbol_id(name) else { + continue; + }; + let places = std::iter::once(ScopedPlaceId::Symbol(symbol)) + .chain(place_table.members_of_symbol(name)); + for place in places { + // a place no predicate narrows is `object` wherever the body returns, which is no + // assertion at all, and answering that costs nothing + if !use_def.predicate_narrowing_targets().contains_place(place) { + continue; + } + let Some(members) = place_table.place(place).attribute_chain() else { + continue; + }; + let members: Vec = members.into_iter().map(Name::new).collect(); + if !holds_the_argument(db, index, file_scope_id, name, &members) { + continue; + } + let Some(bindings) = use_def.normal_exit_bindings(place) else { + continue; + }; + let established = narrowed_over(db, env, use_def, bindings, place, &|_| Type::object()); + let Some(ty) = agreed_constraint(db, env, vec![established]) else { + continue; + }; + guards.push(NarrowingGuard { + root_is_first_parameter: first_parameter.is_some_and(|first| first.id == *name), + name: name.clone(), + members: members.into_boxed_slice(), + kind: NarrowingGuardKind::InferredAssertion { ty }, + }); + } + } + guards.into_boxed_slice() +} + +/// A way out of a function body that hands control back to the caller. +#[derive(Clone, Copy, Debug)] +pub(crate) enum NormalExit { + /// The `return` statement at this position among those recorded for the body, and its range. + Return { index: usize, range: TextRange }, + /// Falling off the end of the body. + EndOfBody, +} + +/// Every way out of a function body that can be reached, and whose state says what a caller sees. +/// +/// A `return` a `finally` suite can run after is left out: what the caller sees is the state after +/// that suite, which this model does not have. So it is neither read as establishing something nor +/// reported as failing to. +pub(crate) fn normal_exits<'db>(db: &'db dyn Db, use_def: &UseDefMap<'db>) -> Vec { + let is_reachable = |reachability| { + !use_def + .reachability_constraints() + .evaluate(db, use_def.predicates(), reachability) + .is_always_false() + }; + use_def + .return_exits() + .enumerate() + .filter(|(_, (_, reachability, through_finally))| { + !through_finally && is_reachable(*reachability) + }) + .map(|(index, (range, _, _))| NormalExit::Return { index, range }) + .chain(can_implicitly_return_none(db, use_def).then_some(NormalExit::EndOfBody)) + .collect() +} + +/// What `place` is where `exit` leaves the body. +/// +/// Each binding that reaches the exit is narrowed by what the flow established on the way there. +/// `start` gives the type narrowing starts from for a binding: `None` for the state the place was +/// in when the body began, which the body did not put there. +pub(crate) fn narrowed_at_exit<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + use_def: &UseDefMap<'db>, + exit: NormalExit, + place: ScopedPlaceId, + start: &dyn Fn(Option>) -> Type<'db>, +) -> Type<'db> { + let narrow = |bindings| narrowed_over(db, env, use_def, bindings, place, start); + match exit { + // a place first named after the `return` had nothing established about it there + NormalExit::Return { index, .. } => use_def + .return_exit_bindings(index, place) + .map_or_else(|| start(None), narrow), + NormalExit::EndOfBody => narrow(use_def.end_of_scope_bindings(place)), + } +} + +/// What `bindings` leave `place` as, each narrowed by what the flow established on the way to it. +fn narrowed_over<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + use_def: &UseDefMap<'db>, + bindings: BindingWithConstraintsIterator<'_, 'db>, + place: ScopedPlaceId, + start: &dyn Fn(Option>) -> Type<'db>, +) -> Type<'db> { + let mut narrowed = UnionBuilder::new(db, env); + for binding in bindings { + if use_def + .reachability_constraints() + .evaluate(db, use_def.predicates(), binding.reachability_constraint) + .is_always_false() + { + continue; + } + let start = match binding.binding { + DefinitionState::Undefined => start(None), + DefinitionState::Defined(definition) => start(Some(definition)), + // a deleted place holds nothing a caller could read back + DefinitionState::Deleted => continue, + }; + narrowed.add_in_place(binding.narrowing_constraint.narrow(db, env, start, place)); + } + narrowed.build() +} + +/// Whether the place `name` and `members` describe still holds the caller's value — the argument +/// passed for a parameter, or what the place held where the guard is written — everywhere in the +/// body. /// /// A guard names the argument a call passed, so it says nothing once the body puts something else /// where that argument was. `def f(a): a = 1; return a is int` hands back `True` whatever it was @@ -181,7 +408,7 @@ pub(crate) fn inferred_narrowing_guards<'db>( /// Any binding at all is enough to give up on, wherever in the body it is. Deciding which /// bindings reach which `return` is what the flow analysis of the body is for, and this is a /// claim about every call — one that has to hold for all of them or not be made. -fn holds_the_argument<'db>( +pub(crate) fn holds_the_argument<'db>( db: &'db dyn Db, index: &SemanticIndex<'db>, file_scope_id: FileScopeId, @@ -191,10 +418,16 @@ fn holds_the_argument<'db>( let place_table = index.place_table(file_scope_id); let use_def = index.use_def_map(file_scope_id); - // the parameter itself is a binding of its own name, and the only one there may be + // a name the body never mentions is one it cannot have put anything in let Some(symbol_id) = place_table.symbol_id(name) else { - return false; + return true; }; + // a `global` or `nonlocal` name is bound where the caller reads it, so writing to it writes + // what the caller goes on to see + let symbol = place_table.symbol(symbol_id); + if symbol.is_global() || symbol.is_nonlocal() { + return true; + } if !use_def .reachable_symbol_bindings(symbol_id) .all(|binding| match binding.binding { diff --git a/crates/ty_python_semantic/src/types/literal.rs b/crates/ty_python_semantic/src/types/literal.rs index 71e70515f7..1df32bd228 100644 --- a/crates/ty_python_semantic/src/types/literal.rs +++ b/crates/ty_python_semantic/src/types/literal.rs @@ -4,12 +4,12 @@ use compact_str::CompactString; use ruff_python_ast::name::Name; use crate::Db; -use crate::types::enums::EnumClassLiteral; +use crate::types::enums::{EnumClassLiteral, enum_metadata}; use crate::types::set_theoretic::RecursivelyDefined; use crate::types::template::TemplateLiteralType; use crate::types::{ClassLiteral, KnownClass, Type}; use ty_python_core::definition::Definition; -use ty_python_core::{place_table, use_def_map}; +use ty_python_core::{Truthiness, place_table, use_def_map}; /// A literal value. See [`LiteralValueTypeKind`] for details. #[derive(Copy, Clone, Debug, PartialEq, Eq, Hash, get_size2::GetSize, salsa::SalsaValue)] @@ -590,6 +590,19 @@ impl<'db> EnumLiteralType<'db> { self.enum_class(db).to_non_generic_instance(db, env) } + /// What `bool()` says about this member, where the value it holds decides that. + /// + /// `None` leaves the question to the enum's instance type, which is where it belongs for an + /// enum that has no data type to read a value out of or that answers `bool()` itself. See + /// [`EnumMetadata::member_truthiness`](crate::types::enums::EnumMetadata::member_truthiness). + pub(crate) fn member_truthiness( + self, + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + ) -> Option { + enum_metadata(db, self.enum_class(db))?.member_truthiness(db, env, self.name(db)) + } + pub(crate) fn definition(self, db: &'db dyn Db) -> Option> { let ClassLiteral::Static(class) = self.enum_class(db) else { return None; diff --git a/crates/ty_python_semantic/src/types/narrow.rs b/crates/ty_python_semantic/src/types/narrow.rs index d8816bdae1..f91cc7a13e 100644 --- a/crates/ty_python_semantic/src/types/narrow.rs +++ b/crates/ty_python_semantic/src/types/narrow.rs @@ -11,7 +11,9 @@ use crate::types::callable::CallableTypes; use crate::types::context_sensitive::case_name_pattern_type; use crate::types::function::KnownFunction; use crate::types::infer::{ExpressionInference, infer_same_file_expression_type}; -use crate::types::narrowing_guards::{GuardRoot, guard_root, narrowed_place, narrowed_scope_place}; +use crate::types::narrowing_guards::{ + GuardRoot, guard_root, narrowed_place, narrowed_scope_place, receiver_is_first_parameter, +}; use crate::types::signatures::NarrowingGuardKind; use crate::types::special_form::TypeQualifier; use crate::types::tuple::{TupleElement, TupleLength, TupleSpec, TupleSpecBuilder, TupleType}; @@ -206,11 +208,11 @@ fn asserts_guard_targets<'db>( return Box::default(); } - let callable_ty = infer_same_file_expression_type(db, callable, TypeContext::default()); - if matches!(callable_ty, Type::Dynamic(_)) { + let callee_ty = infer_same_file_expression_type(db, callable, TypeContext::default()); + if matches!(callee_ty, Type::Dynamic(_)) { return Box::default(); } - let Some(callable_ty) = callable_ty + let Some(callable_ty) = callee_ty .try_upcast_to_callable(db, env) .and_then(CallableTypes::exactly_one) else { @@ -219,7 +221,10 @@ fn asserts_guard_targets<'db>( let [signature] = callable_ty.signatures(db).overloads.as_slice() else { return Box::default(); }; - if signature.narrowing_guards.is_empty() { + // a statement is the one place an assertion narrows, so this is where one recovered from a + // body or taken on from an overridden method is worked out + let guards = signature.all_narrowing_guards(db); + if guards.is_empty() { return Box::default(); } @@ -232,39 +237,32 @@ fn asserts_guard_targets<'db>( return Box::default(); }; - signature - .narrowing_guards + guards .iter() .filter_map(|guard| { - let narrowed_to = match guard.kind { - NarrowingGuardKind::Asserts { is_positive } => { - if is_positive { - Type::AlwaysFalsy.negate(db, env) - } else { - Type::AlwaysTruthy.negate(db, env) - } - } - // a guard type that still mentions a type variable isn't resolved against the - // call's specialization here, so it says nothing about the argument - NarrowingGuardKind::AssertsType { ty, .. } if ty.has_typevar(db, env) => { - return None; - } - NarrowingGuardKind::AssertsType { is_positive, ty } => { - ty.negate_if(db, env, !is_positive) - } - // a predicate narrows where the call evaluates truthy, which is the reach of - // the call expression itself rather than of the statement it is in - NarrowingGuardKind::Predicate | NarrowingGuardKind::InferredPredicate { .. } => { - return None; - } - }; + // a predicate has no asserted type: it narrows where the call evaluates truthy, which + // is the reach of the call expression itself rather than of the statement it is in + let narrowed_to = guard.kind.asserted_type(db, env)?; + // a guard type that still mentions a type variable isn't resolved against the call's + // specialization here, so it says nothing about the argument + if narrowed_to.has_typevar(db, env) { + return None; + } let target = match guard_root(guard, signature.parameters(), call) { GuardRoot::Parameter(parameter_index) => { - let argument = asserted_argument(call, parameter_index, &guard.name)?; + let argument = asserted_argument( + call, + signature.parameters(), + parameter_index, + &guard.name, + )?; narrowed_place(db, scope, guard, argument)? } - GuardRoot::Receiver(receiver) => narrowed_place(db, scope, guard, receiver)?, + GuardRoot::Receiver(receiver) if receiver_is_first_parameter(db, callee_ty) => { + narrowed_place(db, scope, guard, receiver)? + } + GuardRoot::Receiver(_) => return None, GuardRoot::Scope => narrowed_scope_place(db, scope, guard)?, }; @@ -276,12 +274,21 @@ fn asserts_guard_targets<'db>( /// The argument `call` supplies for the parameter at `parameter_index`, named `name`. fn asserted_argument<'ast>( call: &'ast ast::ExprCall, + parameters: &Parameters<'_>, parameter_index: usize, name: &Name, ) -> Option<&'ast ast::Expr> { - if let Some(keyword) = call.arguments.find_keyword(name.as_str()) { + let parameter = parameters.iter().nth(parameter_index)?; + // a positional-only parameter cannot be the one a keyword of its name reaches: that keyword + // is collected by a `**kwargs` instead, and narrowing it would narrow the wrong argument + if !parameter.is_positional_only() + && let Some(keyword) = call.arguments.find_keyword(name.as_str()) + { return Some(&keyword.value); } + if parameter.is_keyword_only() { + return None; + } if call .arguments .keywords @@ -3380,7 +3387,7 @@ impl<'db> PatternSuccessAnalyzer<'db> { let unpacked = tuple .unpack( target_len, - |segment| vec![segment.element_type(db)], + |segment| segment.unpacked_elements(db), |elements| { UnionType::from_elements_leave_aliases(db, &self.env, elements.iter().copied()) }, @@ -4959,11 +4966,17 @@ impl<'db> NarrowingConstraintsBuilder<'db, '_> { continue; }; let target = match guard_root(guard, signature.parameters(), expr_call) { - GuardRoot::Parameter(parameter_index) => { - asserted_argument(expr_call, parameter_index, &guard.name) - .and_then(|argument| narrowed_place(db, scope, guard, argument)) + GuardRoot::Parameter(parameter_index) => asserted_argument( + expr_call, + signature.parameters(), + parameter_index, + &guard.name, + ) + .and_then(|argument| narrowed_place(db, scope, guard, argument)), + GuardRoot::Receiver(receiver) if receiver_is_first_parameter(db, callee_ty) => { + narrowed_place(db, scope, guard, receiver) } - GuardRoot::Receiver(receiver) => narrowed_place(db, scope, guard, receiver), + GuardRoot::Receiver(_) => None, GuardRoot::Scope => narrowed_scope_place(db, scope, guard), }; let Some(target) = target else { diff --git a/crates/ty_python_semantic/src/types/narrowing_guards.rs b/crates/ty_python_semantic/src/types/narrowing_guards.rs index 0754dd4819..8999eb974e 100644 --- a/crates/ty_python_semantic/src/types/narrowing_guards.rs +++ b/crates/ty_python_semantic/src/types/narrowing_guards.rs @@ -12,6 +12,8 @@ use ty_python_core::place_table; use ty_python_core::scope::ScopeId; use crate::Db; +use crate::types::Type; +use crate::types::function::FunctionDecorators; use crate::types::signatures::{NarrowingGuard, Parameters}; /// What a guard's root name refers to at a call site. @@ -25,6 +27,21 @@ pub(crate) enum GuardRoot<'ast> { Scope, } +/// Whether a bound call passes the expression it is called on as the parameter the signature +/// dropped. +/// +/// A bound method does: `h.ensure()` passes `h` as `self`. A `classmethod` does not — it passes +/// the class, so a guard on `cls` says nothing about the value `h` holds, and the place `h.data` +/// is not the place `cls.data` names. +pub(crate) fn receiver_is_first_parameter<'db>(db: &'db dyn Db, callee_ty: Type<'db>) -> bool { + match callee_ty { + Type::BoundMethod(method) => !method + .function(db) + .has_known_decorator(db, FunctionDecorators::CLASSMETHOD), + _ => true, + } +} + /// Resolve what `guard`'s root name refers to for this call. pub(crate) fn guard_root<'ast, 'db>( guard: &NarrowingGuard<'db>, diff --git a/crates/ty_python_semantic/src/types/relation_error.rs b/crates/ty_python_semantic/src/types/relation_error.rs index 3bb12e97db..989a56f5d1 100644 --- a/crates/ty_python_semantic/src/types/relation_error.rs +++ b/crates/ty_python_semantic/src/types/relation_error.rs @@ -211,6 +211,12 @@ pub(crate) enum ErrorContext<'db> { source_len: usize, target_len: TupleLength, }, + /// basedpython: a tuple whose elements repeat in runs of `source_len` is compared with one + /// whose runs are `target_len` long, and no number of the first is a number of the second. + RepeatedTupleLengthMismatch { + source_len: usize, + target_len: usize, + }, TupleElementNotCompatible { source: Type<'db>, target: Type<'db>, @@ -615,6 +621,12 @@ impl<'db> ErrorContext<'db> { relation.description(), target_len.display_minimum(), ), + Self::RepeatedTupleLengthMismatch { + source_len, + target_len, + } => format!( + "elements repeating in runs of {source_len} do not fill runs of {target_len}", + ), Self::TupleElementNotCompatible { source, target, diff --git a/crates/ty_python_semantic/src/types/signatures.rs b/crates/ty_python_semantic/src/types/signatures.rs index 8c9f0841f2..cf8cef907a 100644 --- a/crates/ty_python_semantic/src/types/signatures.rs +++ b/crates/ty_python_semantic/src/types/signatures.rs @@ -29,6 +29,7 @@ use crate::types::constraints::{ PathBounds, Solutions, }; use crate::types::cyclic::ActiveRecursionDetector; +use crate::types::function::{OverloadLiteral, deferred_assertion_guards}; use crate::types::generics::{ ApplySpecialization, GenericContext, Specialization, SpecializationBuilder, TypeVarInference, walk_generic_context, @@ -41,7 +42,7 @@ use crate::types::instance::ProtocolInstanceType; use crate::types::relation::{ HasRelationToVisitor, IsDisjointVisitor, TypeRelation, TypeRelationChecker, TypeVarEvaluation, }; -use crate::types::tuple::{Tuple, TupleType, VariableSegment}; +use crate::types::tuple::{Tuple, TupleSpec, TupleSpecBuilder, TupleType, VariableSegment}; use crate::types::typed_dict::extract_unpacked_typed_dict_keys_from_kwargs_annotation; use crate::types::typevar::{ MAX_TYPEVAR_FRESHNESS_DELTA, TypeVarInstance, TypeVarKind, TypeVarSet, @@ -58,6 +59,7 @@ use crate::{Db, FxOrderSet}; use ruff_db::parsed::parsed_module; use ruff_python_ast::helpers::ReturnGuardForm; use ruff_python_ast::{self as ast, ParameterBorrow, name::Name}; +use std::borrow::Cow; use ty_python_core::definition::{Definition, DefinitionKind, ParameterDefinitionNodeKind}; /// Selects which binding context to use for type variables that only appear in a return-position @@ -377,6 +379,7 @@ impl<'db> CallableSignature<'db> { visitor, ), narrowing_guards: self_signature.narrowing_guards.clone(), + deferred_assertions: self_signature.deferred_assertions, })) } Type::Callable(callable) @@ -430,6 +433,7 @@ impl<'db> CallableSignature<'db> { visitor, ), narrowing_guards: signature.narrowing_guards.clone(), + deferred_assertions: signature.deferred_assertions, }), )) } @@ -650,8 +654,33 @@ pub struct Signature<'db> { /// Return type. If no annotation was provided, this is `Unknown`. pub(crate) return_ty: Type<'db>, - /// basedpython: the places a call to this narrows. + /// basedpython: the places a call to this narrows, besides the ones in + /// [`Self::deferred_assertions`]. pub(crate) narrowing_guards: Box<[NarrowingGuard<'db>]>, + + /// basedpython: whose assertions a call to this also makes, when it may make any that are not + /// in [`Self::narrowing_guards`]. [`Self::all_narrowing_guards`] resolves them. + pub(crate) deferred_assertions: Option>, +} + +/// basedpython: the assertions a signature carries without having worked them out: the ones +/// recovered from a body that returns nothing, and the ones an override takes on from the method +/// it overrides. +/// +/// Neither changes the signature's type — an assertion's return type is the `None` the body hands +/// back — and working them out means inferring what a body leaves behind wherever it returns. A +/// signature is built far more often than anyone asks what a call to it establishes: to type a +/// parameter while the body itself is being inferred, to recover a return type, to decide whether +/// a call can return at all. Working the assertions out there would nest one body's inference +/// inside the next along every chain of calls. So the signature records whose assertions they +/// are, and the ones that act on an assertion resolve them. +#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash, get_size2::GetSize, salsa::SalsaValue)] +pub(crate) struct DeferredAssertions<'db> { + /// the function whose assertions they are + pub(crate) function: OverloadLiteral<'db>, + /// whether the function's body is read for assertions of its own. that is decided while its + /// signature is built, by whatever decides whether the body is read for a return type + pub(crate) from_body: bool, } /// basedpython: a place a call narrows, whether the function named it or not. @@ -696,11 +725,51 @@ pub(crate) enum NarrowingGuardKind<'db> { /// what it is where the call evaluates falsy negative: Option>, }, + /// basedpython: the assertion a `def` that wrote no return type makes anyway, recovered from + /// what every way out of its body establishes — see [`crate::types::inferred_narrowing`]. + /// + /// It narrows with the same reach as [`Self::AssertsType`], but nothing was written, so a + /// call using its value is not a misuse of an annotation. + InferredAssertion { ty: Type<'db> }, +} + +impl<'db> NarrowingGuardKind<'db> { + /// Whether this guard narrows once the call returns, rather than where it evaluates truthy. + pub(crate) fn is_assertion(self) -> bool { + matches!( + self, + NarrowingGuardKind::Asserts { .. } + | NarrowingGuardKind::AssertsType { .. } + | NarrowingGuardKind::InferredAssertion { .. } + ) + } + + /// What an assertion guard establishes about its place once the call returns. + pub(crate) fn asserted_type( + self, + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + ) -> Option> { + match self { + NarrowingGuardKind::Asserts { is_positive: true } => { + Some(Type::AlwaysFalsy.negate(db, env)) + } + NarrowingGuardKind::Asserts { is_positive: false } => { + Some(Type::AlwaysTruthy.negate(db, env)) + } + NarrowingGuardKind::AssertsType { is_positive, ty } => { + Some(ty.negate_if(db, env, !is_positive)) + } + NarrowingGuardKind::InferredAssertion { ty } => Some(ty), + NarrowingGuardKind::Predicate | NarrowingGuardKind::InferredPredicate { .. } => None, + } + } } impl<'db> NarrowingGuard<'db> { - /// Whether this guard narrows once the call returns, rather than when it evaluates truthy. - pub(crate) fn is_assertion(&self) -> bool { + /// Whether this guard is a *written* assertion: one a return annotation declares, rather than + /// one recovered from a body. + pub(crate) fn is_written_assertion(&self) -> bool { matches!( self.kind, NarrowingGuardKind::Asserts { .. } | NarrowingGuardKind::AssertsType { .. } @@ -913,6 +982,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards: Box::default(), + deferred_assertions: None, } } @@ -929,6 +999,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards: Box::default(), + deferred_assertions: None, } } @@ -942,6 +1013,7 @@ impl<'db> Signature<'db> { parameters: Parameters::gradual_form(), return_ty: signature_type, narrowing_guards: Box::default(), + deferred_assertions: None, } } @@ -1006,6 +1078,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards, + deferred_assertions: None, } } @@ -1114,6 +1187,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards: self.narrowing_guards.clone(), + deferred_assertions: self.deferred_assertions, } } @@ -1147,6 +1221,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards: self.narrowing_guards.clone(), + deferred_assertions: self.deferred_assertions, }) } @@ -1182,6 +1257,7 @@ impl<'db> Signature<'db> { .return_ty .apply_type_mapping_impl(db, env, type_mapping, tcx, visitor), narrowing_guards: self.narrowing_guards.clone(), + deferred_assertions: self.deferred_assertions, } } @@ -1588,6 +1664,61 @@ impl<'db> Signature<'db> { self.definition } + /// basedpython: every place a call to this narrows: [`Self::narrowing_guards`], followed by + /// the assertions [`Self::deferred_assertions`] names. + pub(crate) fn all_narrowing_guards(&self, db: &'db dyn Db) -> Cow<'_, [NarrowingGuard<'db>]> { + let deferred: &[NarrowingGuard<'db>] = match self.deferred_assertions { + Some(deferred) => deferred_assertion_guards(db, deferred.function, deferred.from_body), + None => &[], + }; + if deferred.is_empty() { + Cow::Borrowed(&self.narrowing_guards) + } else { + Cow::Owned( + self.narrowing_guards + .iter() + .chain(deferred) + .cloned() + .collect(), + ) + } + } + + /// basedpython: whether a call to this makes an assertion someone wrote down: its own + /// `-> asserts`, or one it takes on from a method it overrides. + /// + /// A recovered assertion is never a written one, so the deferred assertions are only + /// resolved when some method this one overrides writes an `asserts` of its own. + pub(crate) fn carries_written_assertion(&self, db: &'db dyn Db) -> bool { + if self + .narrowing_guards + .iter() + .any(NarrowingGuard::is_written_assertion) + { + return true; + } + self.deferred_assertions.is_some_and(|deferred| { + deferred.function.overrides_a_written_assertion(db) + && self + .all_narrowing_guards(db) + .iter() + .any(NarrowingGuard::is_written_assertion) + }) + } + + /// basedpython: this signature with every guard it carries in [`Self::narrowing_guards`], + /// for comparing signatures by what they say rather than by whose they are. + pub(crate) fn with_resolved_narrowing_guards(mut self, db: &'db dyn Db) -> Self { + if self.deferred_assertions.is_some() { + self.narrowing_guards = self + .all_narrowing_guards(db) + .into_owned() + .into_boxed_slice(); + self.deferred_assertions = None; + } + self + } + pub(crate) fn bind_self( &self, db: &'db dyn Db, @@ -1693,6 +1824,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards: self.narrowing_guards.clone(), + deferred_assertions: self.deferred_assertions, } } @@ -2107,6 +2239,7 @@ impl<'db> Signature<'db> { parameters, return_ty, narrowing_guards: self.narrowing_guards.clone(), + deferred_assertions: self.deferred_assertions, } } @@ -3029,6 +3162,26 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { .visit(&key, || self.always(), work) } + /// basedpython: relates two parameter lists, one of which has a variadic parameter taking + /// whole repetitions, through the tuples of positional arguments they accept. + /// + /// Parameters are contravariant, so every call the target accepts the source must accept + /// too, which is exactly the tuple relation between the two argument tuples. + fn check_positional_call_tuples( + &self, + db: &'db dyn Db, + source: &Parameters<'db>, + target: &Parameters<'db>, + ) -> ConstraintSet<'db, 'c> { + let (Some(source_tuple), Some(target_tuple)) = ( + positional_call_tuple(db, self.env, source, ParametersSide::Source), + positional_call_tuple(db, self.env, target, ParametersSide::Target), + ) else { + return self.never(); + }; + self.check_tuple_spec_pair(db, &target_tuple, &source_tuple) + } + fn check_paramspec_return_pair( &self, db: &'db dyn Db, @@ -3310,6 +3463,19 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { }); } + // basedpython: a variadic parameter that takes whole repetitions of several types, + // `*args: *((int, str) * int)`, cannot be written out as a list of parameters, so the two + // signatures are compared through the tuples of positional arguments they accept. + if !source_parameters.is_gradual() + && !target_parameters.is_gradual() + && (has_repeated_variadic(db, &source_parameters) + || has_repeated_variadic(db, &target_parameters)) + { + return result.and(db, self.constraints, || { + self.check_positional_call_tuples(db, &source_parameters, &target_parameters) + }); + } + // Concrete target keywords can collide with a fixed source prefix even when the source // has a gradual or ParamSpec tail. Check them before those specialized paths can return. let mut keyword_collision_checks = true; @@ -5911,8 +6077,6 @@ impl<'db> Parameters<'db> { parameters.extend(tuple.iter_all_elements().map(positional_parameter)); } Tuple::Variable(variable) => { - parameters - .extend(variable.iter_prefix_elements().map(positional_parameter)); let name = parameter .name() .cloned() @@ -5925,7 +6089,17 @@ impl<'db> Parameters<'db> { VariableSegment::TypeVarTuple(typevartuple) => variadic .with_annotated_type(Type::TypeVar(typevartuple)) .with_starred_annotation(), + // basedpython: a parameter list has no way to say that its + // variadic parameter takes whole repetitions of several types, so + // `*args: *((int, str) * int)` stays a single parameter, which call + // binding matches against the tuple as a whole. + VariableSegment::Repeated(_) => { + parameters.push(parameter.clone()); + continue; + } }; + parameters + .extend(variable.iter_prefix_elements().map(positional_parameter)); parameters.push( variadic .with_definition(parameter.definition()) @@ -7261,3 +7435,85 @@ mod tests { ); } } + +/// basedpython: which side of a relation a parameter list is on, which decides how the +/// calls it does not have to accept are approximated. +#[derive(Clone, Copy, Debug, Eq, PartialEq)] +enum ParametersSide { + /// The parameters of the more specific signature, which must accept every call the target + /// accepts. Leaving a call out of its tuple only rejects code that would have been fine. + Source, + /// The parameters of the signature being satisfied. Every call it promises must be in its + /// tuple, so a parameter list whose calls this cannot describe has no tuple at all. + Target, +} + +/// basedpython: whether a parameter list takes whole repetitions of several types, as +/// `*args: *((int, str) * int)` does. +fn has_repeated_variadic<'db>(db: &'db dyn Db, parameters: &Parameters<'db>) -> bool { + parameters.variadic().is_some_and(|(_, parameter)| { + parameter.has_starred_annotation() + && parameter + .annotated_type() + .exact_tuple_instance_spec(db) + .is_some_and(|tuple| match tuple.as_ref() { + TupleSpec::Variable(variable) => { + matches!(variable.variable(), VariableSegment::Repeated(_)) + } + TupleSpec::Fixed(_) => false, + }) + }) +} + +/// basedpython: the tuples of positional arguments a parameter list accepts. +/// +/// Returns `None` when the calls a parameter list accepts are not described by its positional +/// shape alone: a required keyword-only parameter means it cannot be called positionally at +/// all, and a target that can be called by keyword, or with a parameter left to its default, +/// accepts calls this tuple would leave out. +fn positional_call_tuple<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + parameters: &Parameters<'db>, + side: ParametersSide, +) -> Option> { + let mut builder = TupleSpecBuilder::with_capacity(parameters.len()); + for parameter in parameters { + match parameter.kind() { + ParameterKind::PositionalOnly { .. } | ParameterKind::PositionalOrKeyword { .. } => { + if side == ParametersSide::Target + && (parameter.has_default() || !parameter.is_positional_only()) + { + return None; + } + builder.push(parameter.annotated_type()); + } + ParameterKind::Variadic { .. } => { + let annotation = parameter.annotated_type(); + let tuple = match annotation { + _ if !parameter.has_starred_annotation() => { + Cow::Owned(TupleSpec::homogeneous(annotation)) + } + Type::TypeVar(typevar) if typevar.is_typevartuple(db) => Cow::Owned( + TupleType::unpacked_typevartuple(db, env, typevar) + .tuple(db) + .clone(), + ), + _ => annotation.exact_tuple_instance_spec(db)?, + }; + builder = builder.concat(db, env, &tuple); + } + ParameterKind::KeywordOnly { .. } => { + if side == ParametersSide::Target || !parameter.has_default() { + return None; + } + } + ParameterKind::KeywordVariadic { .. } => { + if side == ParametersSide::Target { + return None; + } + } + } + } + Some(builder.build()) +} diff --git a/crates/ty_python_semantic/src/types/tuple.rs b/crates/ty_python_semantic/src/types/tuple.rs index b5ff96eeb7..7f352540f0 100644 --- a/crates/ty_python_semantic/src/types/tuple.rs +++ b/crates/ty_python_semantic/src/types/tuple.rs @@ -154,6 +154,11 @@ pub(super) fn walk_tuple_type<'db, V: super::visitor::TypeVisitor<'db> + ?Sized> VariableSegment::Homogeneous(element) => { visitor.visit_type(db, element); } + VariableSegment::Repeated(unit) => { + for &element in unit.elements(db) { + visitor.visit_type(db, element); + } + } VariableSegment::TypeVarTuple(typevartuple) => { visitor.visit_type(db, Type::TypeVar(typevartuple)); } @@ -337,7 +342,7 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { self.check_tuple_spec_pair(db, source.tuple(db), target.tuple(db)) } - fn check_tuple_spec_pair( + pub(super) fn check_tuple_spec_pair( &self, db: &'db dyn Db, source: &TupleSpec<'db>, @@ -436,13 +441,29 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { self.check_type_pair(db, packed, Type::TypeVar(typevartuple)) }) } - VariableSegment::Homogeneous(target_ty) => { + target_segment @ (VariableSegment::Homogeneous(_) + | VariableSegment::Repeated(_)) => { // In addition, any remaining elements in this tuple must satisfy the - // variable-length portion of the other tuple. + // variable-length portion of the other tuple, which they can only fill + // with a whole number of its repetitions. + if !source_iter + .len() + .is_multiple_of(target_segment.unit_len(db)) + { + return self.never(); + } result.and(db, self.constraints, || { - source_iter.when_all(db, self.constraints, |&source_ty| { - self.check_type_pair(db, source_ty, target_ty) - }) + source_iter.enumerate().when_all( + db, + self.constraints, + |(index, &source_ty)| { + self.check_type_pair( + db, + source_ty, + target_segment.unit_element(db, index), + ) + }, + ) }) } } @@ -454,9 +475,9 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { &self, db: &'db dyn Db, source: &VariableLengthTuple, VariableSegment<'db>>, - target: &TupleSpec<'db>, + target_spec: &TupleSpec<'db>, ) -> ConstraintSet<'db, 'c> { - match target { + match target_spec { Tuple::Fixed(target) => { // The `...` length specifier of a variable-length tuple type is interpreted // differently depending on the type of the variable-length elements. @@ -651,6 +672,17 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { ); } + if matches!(source.variable(), VariableSegment::Repeated(_)) + || matches!(target.variable(), VariableSegment::Repeated(_)) + { + return self.check_repeated_variable_length_pair( + db, + source, + target, + target_spec, + ); + } + // When prenormalizing below, we assume that a dynamic variable-length portion of // one tuple materializes to the variable-length portion of the other tuple. let source_variable = source.variable().element_type(db); @@ -747,6 +779,127 @@ impl<'c, 'db> TypeRelationChecker<'_, 'c, 'db> { } } + /// basedpython: relates two variable-length tuples when at least one of their segments + /// repeats a unit of several elements. + /// + /// Every value of the source, `source_prefix + unit * k + source_suffix` for each `k`, must + /// be a value of the target. The short values, whose repetitions do not yet reach past the + /// target's fixed ends, are checked one at a time as fixed-length tuples. Every longer value + /// splits into a front that covers the target's prefix, a middle of whole repetitions, and + /// a back that covers the target's suffix. Each of those lines up with the same target + /// elements whatever `k` is, provided the source's unit is a whole number of the target's + /// units and the two tuples' lengths agree modulo the target's unit. + fn check_repeated_variable_length_pair( + &self, + db: &'db dyn Db, + source: &VariableLengthTuple, VariableSegment<'db>>, + target: &VariableLengthTuple, VariableSegment<'db>>, + target_spec: &TupleSpec<'db>, + ) -> ConstraintSet<'db, 'c> { + let env = self.env; + let source_segment = source.variable(); + let target_segment = target.variable(); + let source_unit_len = source_segment.unit_len(db); + let target_unit_len = target_segment.unit_len(db); + + // The `...` of a gradual segment is a gradual choice of length, so the source only needs + // to fit one of the target's values. Past the point where the target's repetitions + // reach beyond the source's fixed elements, a further repetition lines those elements up + // against the same target elements as the one before it. + if self.is_eager_assignability() && source_segment.gradual_element_type(db, env).is_some() { + let longest = source.len().minimum().div_ceil(target_unit_len); + return (0..=longest).when_any(db, self.constraints, |repetitions| { + self.check_variable_length_vs_tuple_spec( + db, + source, + &Tuple::Fixed(target.with_repetitions(db, repetitions)), + ) + }); + } + + // A symbolic pack stands for tuples of every shape, not just the repeated ones. + if source_segment.typevartuple().is_some() { + return self.never(); + } + if !source_unit_len.is_multiple_of(target_unit_len) + || source.len().minimum() % target_unit_len != target.len().minimum() % target_unit_len + { + if let Some(context) = self.report_context() { + context.push(ErrorContext::RepeatedTupleLengthMismatch { + source_len: source_unit_len, + target_len: target_unit_len, + }); + } + return self.never(); + } + + let short_repetitions = (target.prefix_len().saturating_sub(source.prefix_len())) + .max(target.suffix_len().saturating_sub(source.suffix_len())) + .div_ceil(source_unit_len); + + let mut result = self.always(); + let check = |result: &mut ConstraintSet<'db, 'c>, source_ty: Type<'db>, target_ty| { + let element_constraints = self.check_type_pair(db, source_ty, target_ty); + !result + .intersect(db, self.constraints, element_constraints) + .is_trivially_never_satisfied() + }; + + for repetitions in 0..2 * short_repetitions { + let instance = source.with_repetitions(db, repetitions); + let instance_constraints = + self.check_fixed_length_tuple_vs_tuple_spec(db, &instance, target_spec); + if result + .intersect(db, self.constraints, instance_constraints) + .is_trivially_never_satisfied() + { + return result; + } + } + + let target_front = |index: usize| match target.prefix_elements().get(index) { + Some(element) => *element, + None => target_segment.unit_element(db, index - target.prefix_len()), + }; + let front_len = source.prefix_len() + short_repetitions * source_unit_len; + let front = source.iter_prefix_elements().chain( + (0..short_repetitions * source_unit_len) + .map(|index| source_segment.unit_element(db, index)), + ); + for (index, source_ty) in front.enumerate() { + if !check(&mut result, source_ty, target_front(index)) { + return result; + } + } + + for index in 0..source_unit_len { + if !check( + &mut result, + source_segment.unit_element(db, index), + target_front(front_len + index), + ) { + return result; + } + } + + let back = source.iter_suffix_elements().rev().chain( + (0..short_repetitions * source_unit_len) + .map(|distance| source_segment.unit_element_from_end(db, distance)), + ); + for (distance, source_ty) in back.enumerate() { + let target_ty = if distance < target.suffix_len() { + target.suffix_elements()[target.suffix_len() - 1 - distance] + } else { + target_segment.unit_element_from_end(db, distance - target.suffix_len()) + }; + if !check(&mut result, source_ty, target_ty) { + return result; + } + } + + result + } + /// Compare the fixed ends, pairing any overhanging elements with the provided variable types. /// Use raw endpoints: a symbolic pack cannot be prenormalized as a homogeneous `object` segment. fn check_tuple_boundaries( @@ -899,15 +1052,143 @@ pub(crate) type TupleSpec<'db> = Tuple, VariableSegment<'db>>; pub enum VariableSegment<'db> { /// A segment whose elements all have the same type, such as `int` in `tuple[int, ...]`. Homogeneous(Type<'db>), + /// basedpython: a run of two or more element types repeated as a whole, such as + /// `(int, str)` in `(int, str) * int`. A unit of one element is [`Self::Homogeneous`]. + Repeated(RepeatedUnit<'db>), /// An unpacked type variable tuple, such as `Ts` in `tuple[*Ts]`. TypeVarTuple(BoundTypeVarInstance<'db>), } +/// basedpython: the unit of a [`VariableSegment::Repeated`] segment. +/// +/// `(1, " ") * n` evaluates to `()`, `(1, " ")`, `(1, " ", 1, " ")` and so on: every element +/// position is known relative to the start of the run, even though the number of repetitions +/// is not. +/// +/// Construct one through [`VariableSegment::repeating`], which holds at least two elements, +/// none of them `Never`. A unit is not shortened to the run it repeats, because the two say +/// different things: `(int, str) * int` has an even number of elements, while +/// `(int, str, int, str) * int` has a multiple of four. +#[salsa::interned(debug, heap_size=ruff_memory_usage::heap_size)] +pub struct RepeatedUnit<'db> { + #[returns(deref)] + pub(crate) elements: Box<[Type<'db>]>, + + /// The union of the elements, which is what iterating the segment produces. + #[returns(copy)] + pub(crate) element_type: Type<'db>, +} + +// The Salsa heap is tracked separately. +impl get_size2::GetSize for RepeatedUnit<'_> {} + impl<'db> VariableSegment<'db> { + /// The segment that repeats `elements` as a whole any number of times, including zero. + /// + /// An empty unit, or one with a `Never` element, can only be repeated zero times, which is + /// the `Homogeneous(Never)` segment. A single-element unit is [`Self::Homogeneous`]. + pub(crate) fn repeating( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + elements: &[Type<'db>], + ) -> Self { + Self::repeating_impl(db, env, elements, false) + } + + /// The same segment as [`Self::repeating`], for a caller that is itself part of a cycle + /// recovery function, which must not simplify the union of the elements against one + /// another (see [`Tuple::homogeneous_element_type_in_cycle_recovery`]). + fn repeating_in_cycle_recovery( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + elements: &[Type<'db>], + ) -> Self { + Self::repeating_impl(db, env, elements, true) + } + + fn repeating_impl( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + elements: &[Type<'db>], + cycle_recovery: bool, + ) -> Self { + if elements.is_empty() || elements.contains(&Type::Never) { + return Self::Homogeneous(Type::Never); + } + match elements { + [element] => Self::Homogeneous(*element), + unit => { + let mut element_type = UnionBuilder::new(db, env) + .unpack_aliases(false) + .cycle_recovery(cycle_recovery); + for element in unit { + element_type.add_in_place(*element); + } + Self::Repeated(RepeatedUnit::new( + db, + Box::<[Type<'db>]>::from(unit), + element_type.build(), + )) + } + } + } + pub(crate) const fn homogeneous_type(self) -> Option> { match self { Self::Homogeneous(element) => Some(element), - Self::TypeVarTuple(_) => None, + Self::Repeated(_) | Self::TypeVarTuple(_) => None, + } + } + + /// The elements this segment contributes when [unpacking](Tuple::unpack) its tuple. + pub(crate) fn unpacked_elements(self, db: &'db dyn Db) -> SegmentElements> { + match self { + Self::Repeated(unit) => SegmentElements::Repeated(unit.elements(db).to_vec()), + Self::Homogeneous(_) | Self::TypeVarTuple(_) => { + SegmentElements::Unordered(vec![self.element_type(db)]) + } + } + } + + /// The number of elements the segment's contents repeat in. A symbolic `TypeVarTuple` has + /// no known structure, so it is described as a run of `object`s. + pub(crate) fn unit_len(self, db: &'db dyn Db) -> usize { + match self { + Self::Repeated(unit) => unit.elements(db).len(), + Self::Homogeneous(_) | Self::TypeVarTuple(_) => 1, + } + } + + /// The type of the element at `index` within the segment, counted from its start. + pub(crate) fn unit_element(self, db: &'db dyn Db, index: usize) -> Type<'db> { + match self { + Self::Repeated(unit) => { + let elements = unit.elements(db); + elements[index % elements.len()] + } + Self::Homogeneous(_) | Self::TypeVarTuple(_) => self.element_type(db), + } + } + + /// The type of the element `distance` places from the segment's end, where the last + /// element is at distance zero. + fn unit_element_from_end(self, db: &'db dyn Db, distance: usize) -> Type<'db> { + let len = self.unit_len(db); + self.unit_element(db, len - 1 - distance % len) + } + + /// The segment whose elements are this segment's in reverse order. + fn reversed(self, db: &'db dyn Db, env: &ProgramEnvironment<'db>) -> Self { + match self { + Self::Repeated(unit) => { + let reversed: Vec<_> = unit.elements(db).iter().rev().copied().collect(); + Self::repeating(db, env, &reversed) + } + // Reversing a `TypeVarTuple` changes its element order, so the result can no longer + // use the original symbolic segment. + Self::Homogeneous(_) | Self::TypeVarTuple(_) => { + Self::Homogeneous(self.element_type(db)) + } } } @@ -927,14 +1208,15 @@ impl<'db> VariableSegment<'db> { pub(crate) const fn typevartuple(self) -> Option> { match self { - Self::Homogeneous(_) => None, + Self::Homogeneous(_) | Self::Repeated(_) => None, Self::TypeVarTuple(typevartuple) => Some(typevartuple), } } - pub(crate) fn element_type(self, _db: &'db dyn Db) -> Type<'db> { + pub(crate) fn element_type(self, db: &'db dyn Db) -> Type<'db> { match self { Self::Homogeneous(element) => element, + Self::Repeated(unit) => unit.element_type(db), Self::TypeVarTuple(_) => Type::object(), } } @@ -943,9 +1225,10 @@ impl<'db> VariableSegment<'db> { /// /// Preserve the `TypeVarTuple` here so that variance inference and generic-context traversal /// can still observe it. Runtime element operations must use [`Self::element_type`] instead. - fn tuple_class_type(self) -> Type<'db> { + fn tuple_class_type(self, db: &'db dyn Db) -> Type<'db> { match self { Self::Homogeneous(element) => element, + Self::Repeated(unit) => unit.element_type(db), Self::TypeVarTuple(typevartuple) => Type::TypeVar(typevartuple), } } @@ -1247,6 +1530,137 @@ impl VariableLengthTuple { }) } + /// The elements that can be `offset` places past the end of the prefix, when the variable + /// segment is `unit_len` elements repeated: the segment's element at that offset, and any + /// suffix element a whole number of units before it, which is where it lands when the + /// segment is short. + fn possible_elements_past_prefix( + &self, + unit_len: usize, + unit_element: impl FnOnce(usize) -> T, + offset: usize, + ) -> impl Iterator + where + T: Clone, + { + std::iter::once(unit_element(offset)).chain( + (offset % unit_len..=offset) + .step_by(unit_len) + .take_while(|suffix_index| *suffix_index < self.suffix_len()) + .map(|suffix_index| self.suffix_elements()[suffix_index].clone()), + ) + } + + /// The mirror image of [`Self::possible_elements_past_prefix`]: the elements that can be + /// `distance` places before the start of the suffix, where the element immediately before + /// it is at distance zero. The prefix elements come first, in their order in the prefix. + fn possible_elements_before_suffix( + &self, + unit_len: usize, + unit_element_from_end: impl FnOnce(usize) -> T, + distance: usize, + ) -> impl Iterator + where + T: Clone, + { + // The prefix elements this can be, nearest one last, counted in whole units back from + // the suffix. They are yielded in their order in the prefix, furthest one first. + let nearest = distance % unit_len + 1; + let count = (self.prefix_len() + unit_len) + .saturating_sub(nearest) + .min(distance + 1 - nearest + unit_len) + / unit_len; + (0..count) + .map(move |index| nearest + (count - 1 - index) * unit_len) + .map(|prefix_distance| { + self.prefix_elements()[self.prefix_len() - prefix_distance].clone() + }) + .chain(std::iter::once(unit_element_from_end(distance))) + } + + /// [`Tuple::unpack`] for a source whose variable segment repeats `unit` as a whole. + /// + /// The position of every element is known relative to either end of the segment. For + /// `a, b = (1, "two") * n`, `a` is always `1` and `b` is always `"two"`, and no `n` gives + /// `a, b, c = (1, "two") * n` a value for each target. + fn unpack_repeated( + &self, + length: TupleLength, + unit: &[T], + combine: impl Fn(&[T]) -> T, + ) -> Result>, ResizeTupleError> + where + T: Clone, + { + let unit_len = unit.len(); + match length { + TupleLength::Fixed(length) => { + let Some(count) = length.checked_sub(self.len().minimum()) else { + return Err(ResizeTupleError::TooManyValues); + }; + if count % unit_len != 0 { + return Err(ResizeTupleError::NotWholeRepetitions { + repeated_len: unit_len, + }); + } + Ok(Tuple::heterogeneous( + self.prefix_elements() + .iter() + .chain(unit.iter().cycle().take(count)) + .chain(self.suffix_elements()) + .cloned(), + )) + } + TupleLength::Variable(prefix, suffix) => { + let prefix_targets = + (0..prefix).map(|index| match self.prefix_elements().get(index) { + Some(element) => element.clone(), + None => combine( + &self + .possible_elements_past_prefix( + unit_len, + |offset| unit[offset % unit_len].clone(), + index - self.prefix_len(), + ) + .collect::>(), + ), + }); + let suffix_targets = (0..suffix).rev().map(|distance| { + if distance < self.suffix_len() { + self.suffix_elements()[self.suffix_len() - 1 - distance].clone() + } else { + combine( + &self + .possible_elements_before_suffix( + unit_len, + |distance| unit[unit_len - 1 - distance % unit_len].clone(), + distance - self.suffix_len(), + ) + .collect::>(), + ) + } + }); + let collected: Vec = self + .prefix_elements() + .iter() + .skip(prefix) + .chain(unit) + .chain( + self.suffix_elements() + .iter() + .take(self.suffix_len().saturating_sub(suffix)), + ) + .cloned() + .collect(); + Ok(VariableLengthTuple::mixed( + prefix_targets.collect::>(), + collected, + suffix_targets.collect::>(), + )) + } + } + } + fn prefix_len(&self) -> usize { self.prefix_len } @@ -1654,12 +2068,24 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { }) } - fn reversed(&self, db: &'db dyn Db) -> Self { - // Reversing a `TypeVarTuple` changes its element order, so the result can no longer use - // the original symbolic segment. + /// The fixed-length value of this tuple whose variable segment is its unit repeated + /// `repetitions` times. + fn with_repetitions(&self, db: &'db dyn Db, repetitions: usize) -> FixedLengthTuple> { + let variable = self.variable(); + FixedLengthTuple::from_elements( + self.iter_prefix_elements() + .chain( + (0..repetitions * variable.unit_len(db)) + .map(|index| variable.unit_element(db, index)), + ) + .chain(self.iter_suffix_elements()), + ) + } + + fn reversed(&self, db: &'db dyn Db, env: &ProgramEnvironment<'db>) -> Self { Self::new( self.iter_suffix_elements().rev(), - VariableSegment::Homogeneous(self.variable().element_type(db)), + self.variable().reversed(db, env), self.iter_prefix_elements().rev(), ) } @@ -1691,7 +2117,7 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { .forward_slice_plan(start, stop, step) .into_type(db, env, self), TupleSliceDirection::Backward => { - let reversed = self.reversed(db); + let reversed = self.reversed(db, env); reversed .forward_slice_plan( TupleSliceDirection::reverse_bound(start), @@ -2023,11 +2449,19 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { index: usize, ) -> Type<'db> { if let Some(element) = self.prefix_elements().get(index) { - *element - } else { - let suffix_stop = index - self.prefix_len() + 1; - self.variable_and_suffix_type(db, env, Some(suffix_stop)) + return *element; } + + let variable = self.variable(); + UnionType::from_elements_leave_aliases( + db, + env, + self.possible_elements_past_prefix( + variable.unit_len(db), + |offset| variable.unit_element(db, offset), + index - self.prefix_len(), + ), + ) } fn type_at_negative_distance( @@ -2036,25 +2470,34 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { env: &ProgramEnvironment<'db>, distance: usize, ) -> Option> { - if distance == 0 || distance > self.len().minimum() { - return None; - } + let distance = NonZeroUsize::new(distance)?; + (distance.get() <= self.len().minimum()) + .then(|| self.type_at_negative_distance_unbounded(db, env, distance)) + } + /// The type of the element `distance` places from the end, where the last element is at + /// distance one. + fn type_at_negative_distance_unbounded( + &self, + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + distance: NonZeroUsize, + ) -> Type<'db> { + let distance = distance.get(); if distance <= self.suffix_len() { - return self - .suffix_elements() - .get(self.suffix_len() - distance) - .copied(); + return self.suffix_elements()[self.suffix_len() - distance]; } - let prefix_and_variable_len = distance - self.suffix_len(); - Some(UnionType::from_elements_leave_aliases( + let variable = self.variable(); + UnionType::from_elements_leave_aliases( db, env, - self.iter_prefix_elements() - .skip(self.prefix_len() - prefix_and_variable_len) - .chain(std::iter::once(self.variable().element_type(db))), - )) + self.possible_elements_before_suffix( + variable.unit_len(db), + |distance| variable.unit_element_from_end(db, distance), + distance - self.suffix_len() - 1, + ), + ) } fn iter_all_elements( @@ -2071,22 +2514,6 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { Type::homogeneous_tuple(db, env, element) } - fn variable_and_suffix_type( - &self, - db: &'db dyn Db, - env: &ProgramEnvironment<'db>, - suffix_stop: Option, - ) -> Type<'db> { - UnionType::from_elements_leave_aliases( - db, - env, - std::iter::once(self.variable().element_type(db)).chain( - self.iter_suffix_elements() - .take(suffix_stop.unwrap_or_else(|| self.suffix_len())), - ), - ) - } - /// Returns the prefix of the prenormalization of this tuple. /// /// This is used in our subtyping and equivalence checks below to handle different tuple types @@ -2166,6 +2593,15 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { VariableSegment::Homogeneous(variable) => VariableSegment::Homogeneous( variable.recursive_type_normalized_impl(db, env, div, true)?, ), + VariableSegment::Repeated(unit) => VariableSegment::repeating_in_cycle_recovery( + db, + env, + &unit + .elements(db) + .iter() + .map(|ty| ty.recursive_type_normalized_impl(db, env, div, true)) + .collect::>>()?, + ), VariableSegment::TypeVarTuple(typevartuple) => { VariableSegment::TypeVarTuple(typevartuple) } @@ -2189,6 +2625,18 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { .recursive_type_normalized_impl(db, env, div, true) .unwrap_or(div), ), + VariableSegment::Repeated(unit) => VariableSegment::repeating_in_cycle_recovery( + db, + env, + &unit + .elements(db) + .iter() + .map(|ty| { + ty.recursive_type_normalized_impl(db, env, div, true) + .unwrap_or(div) + }) + .collect::>(), + ), VariableSegment::TypeVarTuple(typevartuple) => { VariableSegment::TypeVarTuple(typevartuple) } @@ -2232,6 +2680,19 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { )), suffix, ), + VariableSegment::Repeated(unit) => Self::mixed( + prefix, + VariableSegment::repeating( + db, + visitor.env, + &unit + .elements(db) + .iter() + .map(|ty| ty.apply_type_mapping_impl(db, env, type_mapping, tcx, visitor)) + .collect::>(), + ), + suffix, + ), VariableSegment::TypeVarTuple(typevartuple) => { let mapped = Type::TypeVar(typevartuple).apply_type_mapping_impl( db, @@ -2288,6 +2749,11 @@ impl<'db> VariableLengthTuple, VariableSegment<'db>> { VariableSegment::Homogeneous(variable) => { variable.find_legacy_typevars_impl(db, env, binding_context, typevars, visitor); } + VariableSegment::Repeated(unit) => { + for ty in unit.elements(db) { + ty.find_legacy_typevars_impl(db, env, binding_context, typevars, visitor); + } + } VariableSegment::TypeVarTuple(typevartuple) => { Type::TypeVar(typevartuple).find_legacy_typevars_impl( db, @@ -2316,27 +2782,11 @@ impl<'db> PyIndex<'db> for &VariableLengthTuple, VariableSegment<'db>> match Nth::from_index(index) { Nth::FromStart(index) => Ok(self.type_at_nonnegative_index_unbounded(db, env, index)), - Nth::FromEnd(index_from_end) => { - if index_from_end < self.suffix_elements().len() { - // index is small enough that it lands in the suffix of the tuple. - return Ok( - self.suffix_elements()[self.suffix_elements().len() - index_from_end - 1] - ); - } - - // index is large enough that it lands past the suffix. The tuple can always be - // large enough that it lands in the variable-length portion. It might also be - // small enough to land in the prefix. - let index_past_suffix = index_from_end - self.suffix_elements().len() + 1; - Ok(UnionType::from_elements_leave_aliases( - db, - env, - (self.prefix_elements().iter().rev().copied()) - .take(index_past_suffix) - .rev() - .chain(std::iter::once(self.variable().element_type(db))), - )) - } + Nth::FromEnd(index_from_end) => Ok(self.type_at_negative_distance_unbounded( + db, + env, + NonZeroUsize::MIN.saturating_add(index_from_end), + )), } } } @@ -2389,12 +2839,24 @@ impl Tuple { pub(crate) fn unpack( &self, length: TupleLength, - variable_elements: impl Fn(&V) -> Vec, + variable_elements: impl Fn(&V) -> SegmentElements, combine: impl Fn(&[T]) -> T, ) -> Result>, ResizeTupleError> where T: Clone, { + let segment_elements = match self { + Self::Fixed(_) => None, + Self::Variable(values) => Some(variable_elements(&values.variable_segment)), + }; + if let Self::Variable(values) = self + && let Some(SegmentElements::Repeated(unit)) = &segment_elements + { + return values.unpack_repeated(length, unit, combine); + } + let variable_elements = segment_elements + .map(SegmentElements::into_elements) + .unwrap_or_default(); match (length, self) { // Both lengths are fixed, as in `a, b = (1, "two")`; every target needs one value. (TupleLength::Fixed(length), Self::Fixed(values)) => match values.len().cmp(&length) { @@ -2436,7 +2898,7 @@ impl Tuple { let Some(count) = length.checked_sub(values.len().minimum()) else { return Err(ResizeTupleError::TooManyValues); }; - let variable = combine(&variable_elements(&values.variable_segment)); + let variable = combine(&variable_elements); Ok(Tuple::heterogeneous( values .prefix_elements() @@ -2471,7 +2933,7 @@ impl Tuple { .iter() .skip(prefix) .cloned() - .chain(variable_elements(&values.variable_segment)) + .chain(variable_elements) .chain( values .suffix_elements() @@ -2621,7 +3083,7 @@ impl<'db> Tuple, VariableSegment<'db>> { env, tuple .iter_prefix_elements() - .chain(std::iter::once(tuple.variable().tuple_class_type())) + .chain(std::iter::once(tuple.variable().tuple_class_type(db))) .chain(tuple.iter_suffix_elements()), ), } @@ -2644,6 +3106,23 @@ impl<'db> Tuple, VariableSegment<'db>> { } } + /// basedpython: the same tuple with every element type replaced by `object`, which relates + /// two tuples by their possible lengths alone. + pub(crate) fn shape(&self, db: &'db dyn Db, env: &ProgramEnvironment<'db>) -> Self { + let object = Type::object(); + match self { + Tuple::Fixed(tuple) => Tuple::heterogeneous(std::iter::repeat_n(object, tuple.len())), + Tuple::Variable(tuple) => { + let unit_len = tuple.variable().unit_len(db); + VariableLengthTuple::mixed( + std::iter::repeat_n(object, tuple.prefix_len()), + VariableSegment::repeating(db, env, &vec![object; unit_len]), + std::iter::repeat_n(object, tuple.suffix_len()), + ) + } + } + } + /// Returns the type of a static slice into this tuple. /// /// Fixed-length tuples produce an exact heterogeneous tuple. Variable-length tuples preserve @@ -2678,7 +3157,7 @@ impl<'db> Tuple, VariableSegment<'db>> { Ok(self .unpack( new_length, - |segment| vec![segment.element_type(db)], + |segment| segment.unpacked_elements(db), |elements| { UnionType::from_elements_leave_aliases(db, env, elements.iter().copied()) }, @@ -2964,6 +3443,36 @@ pub(crate) enum TupleElement { pub(crate) enum ResizeTupleError { TooFewValues, TooManyValues, + /// basedpython: the source repeats a run of `repeated_len` elements, and the length + /// falls between two whole numbers of repetitions, as `a, b, c = (1, "two") * n` does. + NotWholeRepetitions { + repeated_len: usize, + }, +} + +/// The elements a variable segment contributes when [unpacking](Tuple::unpack) a tuple. +#[derive(Clone)] +pub(crate) enum SegmentElements { + /// Elements that can appear in any order and any number, such as the elements of `items` + /// in `(1, *items)`. + Unordered(Vec), + /// basedpython: a run of elements that appears in this order, repeated as a whole, such + /// as `(1, "two")` in `(1, "two") * n`. + Repeated(Vec), +} + +impl SegmentElements { + pub(crate) fn elements(&self) -> &[T] { + match self { + Self::Unordered(elements) | Self::Repeated(elements) => elements, + } + } + + pub(crate) fn into_elements(self) -> Vec { + match self { + Self::Unordered(elements) | Self::Repeated(elements) => elements, + } + } } /// A builder for a fixed or variable-length sequence. @@ -2979,6 +3488,15 @@ pub(crate) enum TupleBuilder { pub(crate) type TupleSpecBuilder<'db> = TupleBuilder, VariableSegment<'db>>; +/// How [`TupleBuilder::concat_with`] joins two variable segments. +pub(crate) enum SegmentMerge { + /// The left segment now stands for both segments and the elements between them. + Merged, + /// The left segment is unchanged, and the elements between the segments move to the end of + /// the prefix. + KeepBetween, +} + impl TupleBuilder { pub(crate) fn with_capacity(capacity: usize) -> Self { Self::Fixed(Vec::with_capacity(capacity)) @@ -3021,10 +3539,16 @@ impl TupleBuilder { /// the suffix, prefix, and right segment into the left segment. Only `1` and `4` remain /// fixed in the result. The caller decides how to combine the segments' types or source /// expressions; `merge` is not called unless both sequences have variable segments. + /// + /// `merge` can instead report that the two segments and the elements between them are + /// together the left segment followed by those elements, by returning + /// [`SegmentMerge::KeepBetween`] without changing the left segment. `(1, *xs, *xs)` with + /// `xs: tuple[int, ...]` has the same values as `(1, *xs)`, and with `pair: (int, str) * n`, + /// `(*pair, 1, "a", *pair)` has the values of `(1, "a", *pair)`. pub(crate) fn concat_with( mut self, other: &Tuple, - merge: impl FnOnce(&[T], &mut V, &V, &[T]), + merge: impl FnOnce(&[T], &mut V, &V, &[T]) -> SegmentMerge, ) -> Self where T: Clone, @@ -3076,16 +3600,24 @@ impl TupleBuilder { // ``` ( Self::Variable { - segment, suffix, .. + prefix, + segment, + suffix, }, Tuple::Variable(right), ) => { - merge( + match merge( suffix, segment, &right.variable_segment, right.prefix_elements(), - ); + ) { + SegmentMerge::Merged => {} + SegmentMerge::KeepBetween => { + prefix.append(suffix); + prefix.extend_from_slice(right.prefix_elements()); + } + } suffix.clear(); suffix.extend_from_slice(right.suffix_elements()); self @@ -3126,6 +3658,22 @@ impl<'db> TupleSpecBuilder<'db> { other: &TupleSpec<'db>, ) -> Self { self.concat_with(other, |suffix, left, right, prefix| { + // `U* W U*` is `W U*` when `W` is a whole number of `U`s: every length of the + // combined run is reachable by one segment alone. A symbolic pack is not a repetition + // of anything, so two occurrences of it never combine. + let unit_len = left.unit_len(db); + let between_len = suffix.len() + prefix.len(); + if left == right + && left.typevartuple().is_none() + && between_len % unit_len == 0 + && suffix + .iter() + .chain(prefix) + .enumerate() + .all(|(index, element)| *element == left.unit_element(db, index)) + { + return SegmentMerge::KeepBetween; + } *left = VariableSegment::Homogeneous(UnionType::from_elements_leave_aliases( db, env, @@ -3135,6 +3683,7 @@ impl<'db> TupleSpecBuilder<'db> { .chain([left.element_type(db), right.element_type(db)]) .chain(prefix.iter().copied()), )); + SegmentMerge::Merged }) } @@ -3264,6 +3813,27 @@ impl<'db> TupleSpecBuilder<'db> { VariableSegment::TypeVarTuple(left), VariableSegment::TypeVarTuple(right), ) if left == right => VariableSegment::TypeVarTuple(left), + // With the prefixes the same length, both segments start at the same + // position, so when one unit's length divides the other's, the elements + // at each position of the longer unit are known on both sides. + (left, right) + if left.typevartuple().is_none() + && right.typevartuple().is_none() + && (left.unit_len(db) % right.unit_len(db) == 0 + || right.unit_len(db) % left.unit_len(db) == 0) => + { + let unit: Vec<_> = (0..left.unit_len(db).max(right.unit_len(db))) + .map(|index| { + IntersectionType::from_two_elements( + db, + env, + left.unit_element(db, index), + right.unit_element(db, index), + ) + }) + .collect(); + VariableSegment::repeating(db, env, &unit) + } (left, right) => { VariableSegment::Homogeneous(IntersectionType::from_two_elements( db, diff --git a/crates/ty_python_semantic/src/types/underscore_names.rs b/crates/ty_python_semantic/src/types/underscore_names.rs new file mode 100644 index 0000000000..1ed7b2263b --- /dev/null +++ b/crates/ty_python_semantic/src/types/underscore_names.rs @@ -0,0 +1,520 @@ +//! basedpython: whether a use of an underscore name reads a name a `.by` file chose +//! +//! basedpython spells privacy with `private` and `protected`, so in a `.by` file a +//! leading underscore says only that the name is unused. [`USED_UNDERSCORE_NAME`] +//! reports a use of one. the report is only fair where the author of a `.by` file +//! picked the spelling: a name read from python or from a stub (`_asdict`, a +//! library's `_internal`, an enum's `_missing_`) is spelled by someone else, and +//! renaming it is not an option +//! +//! so each question here resolves the use to every declaration of the name, and +//! answers yes only when there is at least one and every one of them is written in +//! a `.by` source file. an import without an alias passes the spelling through to +//! what it imports, while `from m import x as _y` spells `_y` itself. a member is +//! declared by every class in the MRO that declares it: an override of a python +//! member keeps the python member's name. anything that cannot be traced — an +//! unresolved import, a dynamic base class — answers no +//! +//! [`USED_UNDERSCORE_NAME`]: super::diagnostic::USED_UNDERSCORE_NAME + +use itertools::Either; +use ruff_db::files::{File, FileRange}; +use ruff_db::parsed::parsed_module; +use ruff_python_ast::generated_names::GeneratedName; +use ruff_python_ast::helpers::is_dunder; +use ruff_python_ast::name::Name; +use ruff_python_ast::{self as ast, PySourceType}; +use ruff_text_size::{Ranged, TextRange}; +use rustc_hash::{FxHashMap, FxHashSet}; +use ty_module_resolver::{ImportingFile, ModuleName, resolve_module}; +use ty_python_core::definition::{Definition, DefinitionKind}; +use ty_python_core::scope::ScopeId; +use ty_python_core::{ProgramFile, attribute_scopes, global_scope, semantic_index, use_def_map}; + +use crate::types::definition_resolution::{ + AttributeRead, ImportAliasResolution, ResolvedDefinition, definitions_for_name, + fallback_attribute_definitions, find_symbol_in_scope, resolve_definition, + resolve_from_import_definitions, +}; +use crate::types::receivers::{self, ImplicitReceiverName}; +use crate::types::{ClassBase, ClassLiteral, StaticClassLiteral, SubclassOfInner, Type}; +use crate::{Db, ProgramEnvironment}; + +/// whether `name` is spelled as unused: a leading underscore, other than a dunder +/// or a name made only of underscores, which python gives meanings of their own +pub(crate) fn is_underscore_name(name: &str) -> bool { + name.starts_with('_') && !is_dunder(name) && !name.trim_start_matches('_').is_empty() +} + +/// whether the name `name`, read in `scope` of `file`, was spelled by a `.by` +/// file +/// +/// the lookup takes the path inference does — inside a trailing lambda block the +/// receiver claims a name before any enclosing scope can +pub(crate) fn name_is_chosen<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + file: File, + scope: ScopeId<'db>, + name: &ast::ExprName, +) -> Option { + let id = name.id.as_str(); + if let Some(resolved) = receivers::implicit_receiver_name(db, env, file, scope, id, Some(name)) + { + return match resolved { + ImplicitReceiverName::Member(_) => { + let receiver = receivers::block_receiver_type(db, scope)?; + let access = AttributeRead { + file, + scope, + receiver, + receiver_expr: None, + optional: false, + }; + member_is_chosen(db, env, &access, id) + } + ImplicitReceiverName::ExtensionMember { resolution, .. } => { + match underscore_members(db, resolution.extension).get(id) { + Some(UnderscoreMember::AuthorSpelled { declaration }) => Some(Spelled { + declaration: Some(*declaration), + }), + Some(UnderscoreMember::ParserSpelled) | None => None, + } + } + ImplicitReceiverName::Receiver(_) => None, + }; + } + let resolved = definitions_for_name(db, scope, id, ImportAliasResolution::PreserveAliases); + all_chosen(db, &resolved, id) +} + +/// where a name a `.by` file spelled was declared, when the declaration can be +/// pointed at — an imported name is declared in another file, and saying where is +/// most of what a reader needs +#[derive(Clone, Copy, Debug)] +pub(crate) struct Spelled { + pub(crate) declaration: Option, +} + +/// whether `name`, imported by `import_from` in `importing_file`, was spelled by a +/// `.by` file +pub(crate) fn imported_name_is_chosen<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + importing_file: ImportingFile<'db>, + import_from: &ast::StmtImportFrom, + name: &str, +) -> Option { + let resolved = resolve_from_import_definitions( + db, + env, + importing_file, + import_from, + name, + &mut FxHashSet::default(), + ImportAliasResolution::PreserveAliases, + ); + all_chosen(db, &resolved, name) +} + +/// whether the module a dotted `import` names is a `.by` file that spelled the +/// segment `name` itself — `import pkg._sub` reads `_sub` from `pkg` +pub(crate) fn imported_module_is_chosen<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + importing_file: File, + module: &ModuleName, +) -> Option { + let importing = ImportingFile::File(importing_file, env.resolver_environment(db)); + let file = resolve_module(db, importing, module).and_then(|module| module.file(db))?; + // a module is named by its file, which has nowhere in it to point at + is_basedpython_source(db, file).then_some(Spelled { declaration: None }) +} + +/// whether the member `name`, read at `access`, was spelled by a `.by` file on +/// every type the receiver can be that declares it +pub(crate) fn member_is_chosen<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + access: &AttributeRead<'db, '_>, + name: &str, +) -> Option { + let elements = match access.receiver { + Type::Union(union) => union.elements(db), + _ => std::slice::from_ref(&access.receiver), + }; + let mut declared: Option = None; + for element in elements.iter().flat_map(|element| match element { + Type::Intersection(intersection) => Either::Left(intersection.positive(db).iter()), + _ => Either::Right(std::iter::once(element)), + }) { + match member_spelling(db, env, access.file, *element, name) { + Spelling::Undeclared => {} + Spelling::Chosen(spelled) => declared = declared.or(Some(spelled)), + Spelling::Dictated => return None, + } + } + if declared.is_some() { + return declared; + } + + // what no class declares, inference looks for in the same three places, in + // this order — an extension member, an inline protocol's member, a receiver + // callable — so the lint asks the resolver that answers for all three + let resolved = fallback_attribute_definitions(db, env, access, name); + all_chosen(db, &resolved, name) +} + +/// whether every declaration in `definitions` was spelled by the author of a +/// `.by` file, and there is at least one +pub(crate) fn definitions_are_chosen<'db>( + db: &'db dyn Db, + definitions: impl IntoIterator>, + name: &str, +) -> Option { + let mut declaration = None; + for definition in definitions { + if !*definition_is_author_spelled(db, definition, Name::new(name)) { + return None; + } + declaration = declaration.or_else(|| Some(definition_range(db, definition))); + } + declaration.map(|declaration| Spelled { + declaration: Some(declaration), + }) +} + +/// where a definition names what it declares +fn definition_range<'db>(db: &'db dyn Db, definition: Definition<'db>) -> FileRange { + let parsed = parsed_module(db, definition.python_file(db)).load(db); + definition.focus_range(db, &parsed) +} + +#[derive(Clone, Copy)] +enum Spelling { + /// nothing on this type declares the name + Undeclared, + /// every declaration of the name is in a `.by` source file + Chosen(Spelled), + /// some declaration is elsewhere, or could not be traced + Dictated, +} + +fn member_spelling<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + file: File, + ty: Type<'db>, + name: &str, +) -> Spelling { + if let Type::ModuleLiteral(module) = ty { + let Some(module_file) = module.module(db).file(db) else { + return Spelling::Undeclared; + }; + let module_scope = global_scope(db, ProgramFile::new(db, module_file, env.program(db))); + let resolved: Vec<_> = find_symbol_in_scope(db, module_scope, name) + .into_iter() + .flat_map(|definition| { + resolve_definition( + db, + env, + definition, + Some(name), + ImportAliasResolution::PreserveAliases, + ) + }) + .collect(); + if resolved.is_empty() { + // a submodule is not a symbol in its package's scope, so the name is + // the file's own + return submodule_spelling(db, env, file, module.module(db).name(db), name); + } + return match all_chosen(db, &resolved, name) { + Some(spelled) => Spelling::Chosen(spelled), + None => Spelling::Dictated, + }; + } + + // `super()._x` reads the member off the owner's MRO after the pivot class + if let Type::BoundSuper(bound_super) = ty { + let Some(mro) = bound_super.lookup_mro_after_pivot(db, env) else { + return Spelling::Undeclared; + }; + return mro_spelling(db, mro, name); + } + + let meta_type = ty.to_meta_type(db, env); + let lookup_type = match ty { + Type::ClassLiteral(_) | Type::SubclassOf(_) | Type::GenericAlias(_) => ty, + _ => meta_type, + }; + let Some(class) = class_of(db, env, lookup_type) else { + return Spelling::Undeclared; + }; + let spelling = mro_spelling(db, class.iter_mro(db), name); + // a class object also reads what its metaclass declares, which is only + // reached when the class hierarchy declares nothing + if matches!(spelling, Spelling::Undeclared) + && meta_type != lookup_type + && let Some(metaclass) = class_of(db, env, meta_type) + { + return mro_spelling(db, metaclass.iter_mro(db), name); + } + spelling +} + +fn class_of<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + ty: Type<'db>, +) -> Option> { + match ty { + Type::ClassLiteral(class) => Some(class), + Type::GenericAlias(alias) => Some(ClassLiteral::Static(alias.origin(db))), + Type::SubclassOf(subclass) => match subclass.subclass_of() { + SubclassOfInner::Protocol(protocol) => protocol + .class_origin(db) + .map(|origin| origin.class_literal(db)), + inner => inner + .into_class(db, env) + .map(|class| class.class_literal(db)), + }, + _ => None, + } +} + +/// the spelling of `name` across every class in `mro` that declares it +fn mro_spelling<'db>( + db: &'db dyn Db, + mro: impl Iterator>, + name: &str, +) -> Spelling { + let mut spelling = Spelling::Undeclared; + for base in mro { + let ancestor = match base { + ClassBase::Class(class) => match class.static_class_literal(db) { + Some((literal, _)) => literal, + None => return Spelling::Dictated, + }, + // an unknown base may declare any member at all + ClassBase::Any | ClassBase::Dynamic(_) | ClassBase::Divergent(_) => { + return Spelling::Dictated; + } + ClassBase::Protocol | ClassBase::Generic | ClassBase::TypedDict(_) => continue, + }; + match underscore_members(db, ancestor).get(name) { + None => continue, + Some(UnderscoreMember::ParserSpelled) => return Spelling::Dictated, + Some(UnderscoreMember::AuthorSpelled { declaration }) => { + spelling = Spelling::Chosen(Spelled { + declaration: Some(*declaration), + }); + } + } + } + spelling +} + +/// who spelled an underscore member a class declares +#[derive(Clone, Copy, Debug, PartialEq, Eq)] +enum UnderscoreMember { + /// the author, at this declaration + AuthorSpelled { declaration: FileRange }, + /// the parser: a property's backing storage, an enum variant's anonymous field + ParserSpelled, +} + +// a `FileRange` is a file handle and two offsets, all of it inline +impl get_size2::GetSize for UnderscoreMember {} + +/// every underscore member `class` itself declares, and who spelled the name +/// +/// only the underscore names are collected, because they are the only ones the +/// lint can ask about, and the answer is cached per class: a member read is on the +/// hot path of inference, and every read of one would otherwise walk the class +/// body and each of its method scopes again +#[salsa::tracked(returns(ref), heap_size = ruff_memory_usage::heap_size)] +fn underscore_members<'db>( + db: &'db dyn Db, + class: StaticClassLiteral<'db>, +) -> FxHashMap { + let class_scope = class.body_scope(db); + let mut members: FxHashMap = FxHashMap::default(); + let mut record = |name: &str, definition: Definition<'db>| { + if !is_underscore_name(name) { + return; + } + let spelling = if *definition_is_author_spelled(db, definition, Name::new(name)) { + UnderscoreMember::AuthorSpelled { + declaration: definition_range(db, definition), + } + } else { + UnderscoreMember::ParserSpelled + }; + members + .entry(Name::new(name)) + .and_modify(|previous| { + // a name any one declaration spells for the author is the + // parser's, whichever of them a read resolves to + if spelling == UnderscoreMember::ParserSpelled { + *previous = UnderscoreMember::ParserSpelled; + } + }) + .or_insert(spelling); + }; + + let place_table = ty_python_core::place_table(db, class_scope); + let use_def = use_def_map(db, class_scope); + for symbol in place_table.symbols() { + let name = symbol.name().as_str(); + if !is_underscore_name(name) { + continue; + } + let symbol_id = place_table + .symbol_id(name) + .expect("symbol is in this table"); + for definition in use_def + .reachable_symbol_declarations(symbol_id) + .filter_map(|declaration| declaration.declaration.definition()) + .chain( + use_def + .reachable_symbol_bindings(symbol_id) + .filter_map(|binding| binding.binding.definition()), + ) + { + record(name, definition); + } + } + + let index = semantic_index(db, class_scope.program_file(db)); + for method_scope in attribute_scopes(db, class_scope) { + let method_places = index.place_table(method_scope); + let method_use_def = index.use_def_map(method_scope); + for member in method_places.members() { + let Some(name) = member.as_instance_attribute() else { + continue; + }; + if !is_underscore_name(name) { + continue; + } + let Some(member_id) = method_places.member_id_by_instance_attribute_name(name) else { + continue; + }; + for definition in method_use_def + .reachable_member_declarations(member_id) + .filter_map(|declaration| declaration.declaration.definition()) + .chain( + method_use_def + .reachable_member_bindings(member_id) + .filter_map(|binding| binding.binding.definition()), + ) + { + record(name, definition); + } + } + } + + members.shrink_to_fit(); + members +} + +fn all_chosen(db: &dyn Db, resolved: &[ResolvedDefinition<'_>], name: &str) -> Option { + if resolved.is_empty() { + return None; + } + let chosen = resolved.iter().all(|resolved| match resolved { + ResolvedDefinition::Definition(definition) => { + *definition_is_author_spelled(db, *definition, Name::new(name)) + } + ResolvedDefinition::Module(file) => is_basedpython_source(db, file.file(db)), + ResolvedDefinition::FileWithRange(range) => { + is_basedpython_source(db, range.file()) + && written_by_author(db, range.file(), range.range(), name) + } + }); + chosen.then(|| Spelled { + declaration: resolved.iter().find_map(|resolved| match resolved { + ResolvedDefinition::Definition(definition) => Some(definition_range(db, *definition)), + ResolvedDefinition::FileWithRange(range) => Some(*range), + // a module is declared by its own file, which has no range to point at + ResolvedDefinition::Module(_) => None, + }), + }) +} + +/// whether `definition` is in a `.by` source file and its name written there by +/// its author +/// +/// the parser declares names nobody wrote — a property's backing storage, the +/// anonymous fields of an enum variant `case Same(int)` — and those are +/// basedpython's to spell, not the author's. it records each one, so the question +/// is answered by asking it rather than by reading the source back +/// +/// cached because it reads the *declaring* file's syntax tree, which inference of +/// every file that uses the name would otherwise depend on +#[salsa::tracked] +fn definition_is_author_spelled<'db>( + db: &'db dyn Db, + definition: Definition<'db>, + name: Name, +) -> bool { + let file = definition.file(db); + if !is_basedpython_source(db, file) || is_unresolved_import(db, definition) { + return false; + } + let module = parsed_module(db, definition.python_file(db)).load(db); + let range = definition.kind(db).target_range(&module); + module.generated_names().get(range, name) != Some(GeneratedName::ParserName) +} + +/// whether `definition` is an import that resolution handed back as it was: one +/// without an alias only does that when its target could not be found +fn is_unresolved_import<'db>(db: &'db dyn Db, definition: Definition<'db>) -> bool { + let module = parsed_module(db, definition.python_file(db)).load(db); + match definition.kind(db) { + DefinitionKind::Import(import) => import.alias(&module).asname.is_none(), + DefinitionKind::ImportFrom(import) => import.alias(&module).asname.is_none(), + DefinitionKind::StarImport(_) => true, + _ => false, + } +} + +fn is_basedpython_source(db: &dyn Db, file: File) -> bool { + file.source_type(db) == PySourceType::BasedPython +} + +/// whether the author wrote the name at `range` in `file`, rather than the parser +fn written_by_author(db: &dyn Db, file: File, range: TextRange, name: &str) -> bool { + let module = parsed_module(db, db.program_file(file).python_file(db)).load(db); + module + .generated_names() + .get(range, Name::new(name)) + .is_none() +} + +/// whether the submodule `name` of the package `package` is a `.by` file: a name +/// a module reaches as an attribute of its package, which no symbol in the +/// package's own scope declares +fn submodule_spelling<'db>( + db: &'db dyn Db, + env: &ProgramEnvironment<'db>, + importing_file: File, + package: &ModuleName, + name: &str, +) -> Spelling { + let Some(name) = ModuleName::new(name) else { + return Spelling::Undeclared; + }; + let mut submodule = package.clone(); + submodule.extend(&name); + let importing = ImportingFile::File(importing_file, env.resolver_environment(db)); + let Some(file) = resolve_module(db, importing, &submodule).and_then(|module| module.file(db)) + else { + return Spelling::Undeclared; + }; + if is_basedpython_source(db, file) { + Spelling::Chosen(Spelled { declaration: None }) + } else { + Spelling::Dictated + } +} diff --git a/crates/ty_python_semantic/src/types/unpacker.rs b/crates/ty_python_semantic/src/types/unpacker.rs index 31d67de51d..21b56cce00 100644 --- a/crates/ty_python_semantic/src/types/unpacker.rs +++ b/crates/ty_python_semantic/src/types/unpacker.rs @@ -14,8 +14,8 @@ use crate::Db; use crate::types::infer::{ExpressionInference, FrozenMap}; use crate::types::tuple::promotion::TupleSizePromotionConstraints; use crate::types::tuple::{ - ResizeTupleError, Tuple, TupleBuilder, TupleElement, TupleLength, TupleSpec, - VariableLengthTuple, + ResizeTupleError, SegmentElements, SegmentMerge, Tuple, TupleBuilder, TupleElement, + TupleLength, TupleSpec, VariableLengthTuple, }; use crate::types::{ KnownClass, Type, TypeCheckDiagnostics, TypeContext, UnionBuilder, UnionType, @@ -340,6 +340,15 @@ impl<'db, 'ast> Unpacker<'db, 'ast> { "Not enough values to unpack", sequence.len().display_maximum(), ), + ResizeTupleError::NotWholeRepetitions { repeated_len } => ( + "Wrong number of values to unpack", + match sequence.len().minimum() { + 0 => format!("a multiple of {repeated_len}"), + minimum => { + format!("{minimum} plus a multiple of {repeated_len}") + } + }, + ), }; let mut diag = builder.into_diagnostic(message); diag.set_primary_annotation_message(format_args!( @@ -570,7 +579,7 @@ fn assignment_values_for_target<'ast>( if let Some(length) = known_length { Tuple::heterogeneous(std::iter::repeat_n(None, length)) } else { - VariableLengthTuple::mixed([], vec![None], []) + VariableLengthTuple::mixed([], SegmentElements::Unordered(vec![None]), []) } }, )?; @@ -632,14 +641,21 @@ impl<'db> UnpackElement<'db, '_> { fn sequence_from_type<'db, 'ast>( db: &'db dyn Db, tuple: &TupleSpec<'db>, -) -> Tuple, Vec>> { +) -> Tuple, SegmentElements>> { match tuple { Tuple::Fixed(values) => { Tuple::heterogeneous(values.iter_all_elements().map(UnpackElement::from_type)) } Tuple::Variable(values) => VariableLengthTuple::mixed( values.iter_prefix_elements().map(UnpackElement::from_type), - vec![UnpackElement::from_type(values.variable().element_type(db))], + match values.variable().unpacked_elements(db) { + SegmentElements::Unordered(elements) => SegmentElements::Unordered( + elements.into_iter().map(UnpackElement::from_type).collect(), + ), + SegmentElements::Repeated(elements) => SegmentElements::Repeated( + elements.into_iter().map(UnpackElement::from_type).collect(), + ), + }, values.iter_suffix_elements().map(UnpackElement::from_type), ), } @@ -679,8 +695,8 @@ fn literal_sequence<'ast, T: Clone>( expression: &'ast ast::Expr, promote: bool, element: &impl Fn(&'ast ast::Expr, bool) -> T, - spread: &impl Fn(&'ast ast::Expr, bool, Option) -> Tuple>, -) -> Option>> { + spread: &impl Fn(&'ast ast::Expr, bool, Option) -> Tuple>, +) -> Option>> { let (values, promote) = literal_sequence_elements(expression, promote)?; Some(sequence_from_literal_elements( values, @@ -691,7 +707,11 @@ fn literal_sequence<'ast, T: Clone>( builder.concat_with(unpacked, |suffix, left, right, prefix| { // For `[*a, *b, *c, ...]`, retain the accumulated elements instead of copying // them again for every expansion. Positions within this segment are unknown. - left.extend(suffix.iter().chain(prefix).chain(right).cloned()); + let mut elements = + std::mem::replace(left, SegmentElements::Unordered(Vec::new())).into_elements(); + elements.extend(suffix.iter().chain(prefix).chain(right.elements()).cloned()); + *left = SegmentElements::Unordered(elements); + SegmentMerge::Merged }) }, )) diff --git a/crates/ty_server/src/capabilities.rs b/crates/ty_server/src/capabilities.rs index 247eaf7105..396f691927 100644 --- a/crates/ty_server/src/capabilities.rs +++ b/crates/ty_server/src/capabilities.rs @@ -40,6 +40,7 @@ bitflags::bitflags! { const TRIGGER_SIGNATURE_HELP_COMMAND = 1 << 22; const LANGUAGE_INJECTION = 1 << 23; const SEMANTIC_TOKENS_REFRESH = 1 << 24; + const CODE_ACTION_EDIT_RESOLVE = 1 << 25; } } @@ -211,6 +212,12 @@ impl ResolvedClientCapabilities { self.contains(Self::COMPLETION_ITEM_LABEL_DETAILS_SUPPORT) } + /// Returns `true` if the client can ask for a code action's edit later, with + /// `codeAction/resolve`, rather than needing it in the `textDocument/codeAction` reply. + pub(crate) const fn supports_code_action_edit_resolve(self) -> bool { + self.contains(Self::CODE_ACTION_EDIT_RESOLVE) + } + /// Returns `true` if the client supports snippets in completion items. pub(crate) const fn supports_completion_item_snippets(self) -> bool { self.contains(Self::COMPLETION_ITEM_SNIPPET_SUPPORT) @@ -458,6 +465,14 @@ impl ResolvedClientCapabilities { flags |= Self::COMPLETION_ITEM_LABEL_DETAILS_SUPPORT; } + if text_document + .and_then(|text_document| text_document.code_action.as_ref()) + .and_then(|code_action| code_action.resolve_support.as_ref()) + .is_some_and(|resolve| resolve.properties.iter().any(|property| property == "edit")) + { + flags |= Self::CODE_ACTION_EDIT_RESOLVE; + } + if text_document .and_then(|text_document| text_document.completion.as_ref()) .and_then(|completion| completion.completion_item.as_ref()) @@ -493,7 +508,16 @@ pub(crate) fn server_capabilities( position_encoding: Some(position_encoding.into()), code_action_provider: Some( CodeActionOptions { - code_action_kinds: Some(vec![CodeActionKind::QuickFix]), + code_action_kinds: Some( + std::iter::once(CodeActionKind::QuickFix) + .chain( + ty_ide::RefactorKind::ALL + .iter() + .map(|kind| CodeActionKind::new(kind.code_action_kind())), + ) + .collect(), + ), + resolve_provider: Some(true), ..CodeActionOptions::default() } .into(), diff --git a/crates/ty_server/src/project_server/client.rs b/crates/ty_server/src/project_server/client.rs index 4fb02b66ed..cc5a040ab5 100644 --- a/crates/ty_server/src/project_server/client.rs +++ b/crates/ty_server/src/project_server/client.rs @@ -22,13 +22,23 @@ use super::protocol::{ /// process that has died. There is no third case worth waiting on. const CONNECT_TIMEOUT: Duration = Duration::from_millis(500); -/// How long the server has to answer once it has accepted. +/// How long the server has to say it has the request. +/// +/// A server accepts connections on a thread of its own, so a connection being accepted says +/// nothing about the state of the loop that would answer. What says something is the loop +/// itself, which sends [`Response::Accepted`] before it does anything else with the request — +/// so this is the time one turn of a main loop is allowed to take, not the time a check is. +/// +/// Short, because every moment spent here is a moment not spent on the check this caller can +/// always run itself. +const ACCEPT_TIMEOUT: Duration = Duration::from_secs(5); + +/// How long the server has to answer once it has said it has the request. /// /// Long, because the answer is a real check: the usual case is a database that has the result /// already, but a server that has just started, or one whose project changed under it, does -/// the same work the caller would have done. Not unbounded, because a server whose main loop -/// has wedged would otherwise leave the caller waiting for something that is never coming, -/// with a check it could have run itself sitting there the whole time. +/// the same work the caller would have done. Not unbounded, because a check that was accepted +/// and then never came back is still a caller waiting on nothing. const RESPONSE_TIMEOUT: Duration = Duration::from_secs(120); const SEND_TIMEOUT: Duration = Duration::from_secs(10); @@ -66,7 +76,9 @@ pub fn check( tracing::debug!("It resolved: {server}"); } } - None => {} + // an acceptance is not an answer, and [`round_trip`] does not return one: it reads + // it and goes on waiting for what follows. this arm is the same nothing as `None` + Some(Response::Accepted) | None => {} } } @@ -130,7 +142,7 @@ fn round_trip( request: &Request, token: &str, ) -> anyhow::Result { - connection.set_read_timeout(Some(RESPONSE_TIMEOUT))?; + connection.set_read_timeout(Some(ACCEPT_TIMEOUT))?; connection.set_write_timeout(Some(SEND_TIMEOUT))?; let mut line = serde_json::to_vec(request)?; @@ -138,15 +150,33 @@ fn round_trip( connection.write_all(&line)?; connection.flush()?; - let mut response = String::new(); - BufReader::new(connection) - .take(MAX_RESPONSE) - .read_line(&mut response)?; - if response.is_empty() { + // reading through a second descriptor for the same socket, so that the timeout can be + // changed between the two lines: it is the socket that carries it, not the descriptor + let mut answers = BufReader::new(connection.try_clone()?).take(MAX_RESPONSE); + + match read_answer(&mut answers, token)? { + // the request is in the hands of a main loop that was running a moment ago, so what + // is being waited on from here is a check rather than a question of whether anybody + // is there + Response::Accepted => connection.set_read_timeout(Some(RESPONSE_TIMEOUT))?, + answered => return Ok(answered), + } + + match read_answer(&mut answers, token)? { + Response::Accepted => anyhow::bail!("the server took the request twice"), + answered => Ok(answered), + } +} + +/// Reads one line, and checks that a server wrote it. +fn read_answer(answers: &mut impl BufRead, token: &str) -> anyhow::Result { + let mut line = String::new(); + answers.read_line(&mut line)?; + if line.is_empty() { anyhow::bail!("the server closed the connection without answering"); } - let answer: Answer = serde_json::from_str(&response)?; + let answer: Answer = serde_json::from_str(&line)?; // the record's port was free to be taken by anything once the server that published it // died, so an answer only counts if it came from something that had read the record diff --git a/crates/ty_server/src/project_server/listener.rs b/crates/ty_server/src/project_server/listener.rs index 7ac58a1257..2e64ff33e8 100644 --- a/crates/ty_server/src/project_server/listener.rs +++ b/crates/ty_server/src/project_server/listener.rs @@ -60,6 +60,12 @@ pub(crate) struct Incoming { /// fresh snapshot, which is the only way to retry; giving up after a few is what keeps a /// caller from waiting on a session that is being typed into. pub(crate) attempts: u8, + + /// Whether the caller has been told that the main loop has this request. + /// + /// Exactly one such message crosses, however many passes the request takes: it says that + /// there is a main loop running, which is answered once and does not become more true. + pub(crate) accepted: bool, } /// Everything the server holds open for as long as it accepts command-line requests. @@ -206,6 +212,7 @@ fn accept( token: request.token, rescanned: false, attempts: 0, + accepted: false, }))) .map_err(|_| anyhow::anyhow!("the main loop is gone")) } diff --git a/crates/ty_server/src/project_server/protocol.rs b/crates/ty_server/src/project_server/protocol.rs index f7a2c6b35d..6dd2bf31ff 100644 --- a/crates/ty_server/src/project_server/protocol.rs +++ b/crates/ty_server/src/project_server/protocol.rs @@ -11,7 +11,7 @@ use ruff_db::system::SystemPathBuf; /// A client and a server that disagree on it stop talking, which matters because the two /// are separate builds of separate binaries: the server in the editor may be months older /// than the `by` on the `PATH`. -pub const PROTOCOL: u32 = 1; +pub const PROTOCOL: u32 = 2; /// A project's merged configuration, in the one shape both sides will produce for it. /// @@ -220,6 +220,14 @@ pub struct Answer { #[derive(Debug, Clone, serde::Serialize, serde::Deserialize)] #[serde(rename_all = "camelCase", tag = "kind")] pub enum Response { + /// The request has reached the server's main loop, and an answer is coming. + /// + /// Sent before the main loop does anything with the request, and followed by exactly one + /// further response. It is what separates a server that is working from a server that is + /// not going to answer at all: everything a caller asks for here it can do itself, so the + /// only wait worth having is one it knows something is at the other end of. + Accepted, + Check(CheckResponse), /// The server will not answer, and the caller should check for itself. diff --git a/crates/ty_server/src/server.rs b/crates/ty_server/src/server.rs index bc977dbf66..ea50ac3fe5 100644 --- a/crates/ty_server/src/server.rs +++ b/crates/ty_server/src/server.rs @@ -30,6 +30,7 @@ pub(crate) use api::{ pub(crate) use lazy_work_done_progress::LazyWorkDoneProgress; pub(crate) use main_loop::{ Action, ConnectionSender, Event, MainLoopReceiver, MainLoopSender, SendRequest, + main_loop_channel, }; pub(crate) use script_progress::ScriptProgress; pub(crate) type Result = std::result::Result; @@ -117,9 +118,7 @@ impl Server { }), )?; - // The number 32 was chosen arbitrarily. The main goal was to have enough capacity to queue - // some responses before blocking. - let (main_loop_sender, main_loop_receiver) = crossbeam::channel::bounded(32); + let (main_loop_sender, main_loop_receiver) = main_loop_channel(); let client = Client::new(main_loop_sender.clone(), connection.sender.clone()); let unknown_options = &initialization_options.options.unknown; diff --git a/crates/ty_server/src/server/api.rs b/crates/ty_server/src/server/api.rs index 85bc29b7e9..b18c537a8c 100644 --- a/crates/ty_server/src/server/api.rs +++ b/crates/ty_server/src/server/api.rs @@ -10,6 +10,7 @@ use std::panic::{AssertUnwindSafe, UnwindSafe}; pub(super) mod changes; mod diagnostics; mod notifications; +mod program_files; mod requests; mod semantic_tokens; mod symbols; @@ -38,6 +39,11 @@ pub(super) fn request(req: server::Request) -> Task { requests::CodeActionRequestHandler::METHOD => background_document_request_task::< requests::CodeActionRequestHandler, >(req, BackgroundSchedule::Worker), + requests::CodeActionResolveRequestHandler::METHOD => background_document_request_task::< + requests::CodeActionResolveRequestHandler, + >( + req, BackgroundSchedule::Worker + ), requests::DocumentDiagnosticRequestHandler::METHOD => background_document_request_task::< requests::DocumentDiagnosticRequestHandler, >( @@ -100,7 +106,7 @@ pub(super) fn request(req: server::Request) -> Task { // It reads the project db and writes nothing, which is what lets it run // on a worker at all requests::TranspileForBuildRequestHandler::METHOD => { - background_document_request_task::( + background_request_task::( req, BackgroundSchedule::LatencySensitive, ) @@ -110,6 +116,18 @@ pub(super) fn request(req: server::Request) -> Task { requests::ExplainRuleHandler::METHOD => { background_request_task::(req, BackgroundSchedule::Worker) } + // The program model a run configuration is built from. Asked by URI rather than by open + // document, because the module a configuration names is usually not open, and asked off + // an editor's own schedule, so none of the three is latency sensitive. + requests::EntryPointHandler::METHOD => { + background_request_task::(req, BackgroundSchedule::Worker) + } + requests::TestItemsHandler::METHOD => { + background_request_task::(req, BackgroundSchedule::Worker) + } + requests::RunModulesHandler::METHOD => { + background_request_task::(req, BackgroundSchedule::Worker) + } requests::TranspileRequestHandler::METHOD => background_document_request_task::< requests::TranspileRequestHandler, >(req, BackgroundSchedule::Worker), @@ -120,6 +138,15 @@ pub(super) fn request(req: server::Request) -> Task { >( req, BackgroundSchedule::LatencySensitive ), + // Asked after every keystroke, and answered to what the keystroke after it does — an + // Enter that indents a suite, a statement moved as a unit — so it is the typing path at + // its most direct. It parses and nothing more. + requests::SyntaxOutlineRequestHandler::METHOD => { + background_document_request_task::( + req, + BackgroundSchedule::LatencySensitive, + ) + } requests::ExplainTranspilationHandler::METHOD => background_document_request_task::< requests::ExplainTranspilationHandler, >(req, BackgroundSchedule::Worker), @@ -162,6 +189,9 @@ pub(super) fn request(req: server::Request) -> Task { >( req, BackgroundSchedule::Worker ), + requests::BuildOutputRequestHandler::METHOD => background_request_task::< + requests::BuildOutputRequestHandler, + >(req, BackgroundSchedule::Worker), // The client is holding a file move open waiting for this, so it is scheduled like the // other things a person is watching for rather than as background work. requests::WillRenameFilesRequestHandler::METHOD => { diff --git a/crates/ty_server/src/server/api/program_files.rs b/crates/ty_server/src/server/api/program_files.rs new file mode 100644 index 0000000000..0d2ec87fc4 --- /dev/null +++ b/crates/ty_server/src/server/api/program_files.rs @@ -0,0 +1,28 @@ +//! The project file a request names by URI, for the requests that ask about a file whether or not +//! the editor has it open. +//! +//! An open document is found through the session's index; a file a run configuration names — the +//! module `by run` is about to execute, say — usually is not open at all, and the project database +//! answers about it all the same: an open one through its overlay, anything else from disk. + +use lsp_types::Uri; +use ruff_db::files::{File, system_path_to_file}; +use ruff_db::system::SystemPathBuf; +use ty_project::{Db as _, ProjectDatabase}; + +use crate::session::SessionSnapshot; + +/// The project `uri` belongs to — the one with the deepest root containing it — and its file. +pub(super) fn project_file<'a>( + snapshot: &'a SessionSnapshot, + uri: &Uri, +) -> Option<(&'a ProjectDatabase, File)> { + let path = SystemPathBuf::from_path_buf(uri.to_file_path().ok()?).ok()?; + let db = snapshot + .projects() + .iter() + .filter(|db| path.starts_with(db.project().root(*db))) + .max_by_key(|db| db.project().root(*db).components().count())?; + let file = system_path_to_file(db, &path).ok()?; + Some((db, file)) +} diff --git a/crates/ty_server/src/server/api/requests.rs b/crates/ty_server/src/server/api/requests.rs index 16556a170e..3d8f17a186 100644 --- a/crates/ty_server/src/server/api/requests.rs +++ b/crates/ty_server/src/server/api/requests.rs @@ -13,9 +13,11 @@ module. For example, see `super::type_hierarchy`. */ mod alignment_groups; +mod build_output; mod call_hierarchy_incoming_calls; mod call_hierarchy_outgoing_calls; mod code_action; +mod code_action_resolve; mod code_lens; mod completion; mod data_flow; @@ -23,6 +25,7 @@ mod detached_transpile; mod diagnostic; mod doc_highlights; mod document_symbols; +mod entry_point; mod execute_command; mod explain_rule; mod explain_transpilation; @@ -39,11 +42,14 @@ mod prepare_rename; mod prepare_type_hierarchy; mod references; mod rename; +mod run_modules; mod selection_range; mod semantic_tokens; mod semantic_tokens_range; mod shutdown; mod signature_help; +mod syntax_outline; +mod test_items; mod transpile; mod transpile_for_build; mod type_hierarchy_subtypes; @@ -53,15 +59,18 @@ mod workspace_diagnostic; mod workspace_symbols; pub(super) use alignment_groups::AlignmentGroupsRequestHandler; +pub(super) use build_output::BuildOutputRequestHandler; pub(super) use call_hierarchy_incoming_calls::CallHierarchyIncomingCallsRequestHandler; pub(super) use call_hierarchy_outgoing_calls::CallHierarchyOutgoingCallsRequestHandler; pub(super) use code_action::CodeActionRequestHandler; +pub(super) use code_action_resolve::CodeActionResolveRequestHandler; pub(super) use code_lens::CodeLensRequestHandler; pub(super) use completion::CompletionRequestHandler; pub(super) use data_flow::DataFlowRequestHandler; pub(super) use diagnostic::DocumentDiagnosticRequestHandler; pub(super) use doc_highlights::DocumentHighlightRequestHandler; pub(super) use document_symbols::DocumentSymbolRequestHandler; +pub(super) use entry_point::EntryPointHandler; pub(super) use execute_command::ExecuteCommand; pub(super) use explain_rule::ExplainRuleHandler; pub(super) use explain_transpilation::ExplainTranspilationHandler; @@ -78,11 +87,14 @@ pub(super) use prepare_rename::PrepareRenameRequestHandler; pub(super) use prepare_type_hierarchy::PrepareTypeHierarchyRequestHandler; pub(super) use references::ReferencesRequestHandler; pub(super) use rename::RenameRequestHandler; +pub(super) use run_modules::RunModulesHandler; pub(super) use selection_range::SelectionRangeRequestHandler; pub(super) use semantic_tokens::SemanticTokensRequestHandler; pub(super) use semantic_tokens_range::SemanticTokensRangeRequestHandler; pub(super) use shutdown::ShutdownHandler; pub(super) use signature_help::SignatureHelpRequestHandler; +pub(super) use syntax_outline::SyntaxOutlineRequestHandler; +pub(super) use test_items::TestItemsHandler; pub(super) use transpile::TranspileRequestHandler; pub(super) use transpile_for_build::TranspileForBuildRequestHandler; pub(super) use type_hierarchy_subtypes::TypeHierarchySubtypesRequestHandler; diff --git a/crates/ty_server/src/server/api/requests/alignment_groups.rs b/crates/ty_server/src/server/api/requests/alignment_groups.rs index e57c97696e..74b8613aa0 100644 --- a/crates/ty_server/src/server/api/requests/alignment_groups.rs +++ b/crates/ty_server/src/server/api/requests/alignment_groups.rs @@ -18,6 +18,7 @@ //! only while a key is held. see [`ty_ide::alignment_groups`] use std::borrow::Cow; +use std::num::NonZeroU32; use lsp_types::{ LspRequestMethod, MessageDirection, Position, Range, Request, TextDocumentIdentifier, Uri, @@ -44,7 +45,7 @@ impl Request for AlignmentGroupsRequest { const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; } -/// the document to look through, and how much of it +/// the document to look through, how much of it, and how the client lays its lines out /// /// `range` mirrors [`lsp_types::InlayHintParams`] so a client can ask both questions about the same /// span. a group that only partly overlaps it comes back whole, since a column is a property of @@ -54,6 +55,13 @@ impl Request for AlignmentGroupsRequest { pub(crate) struct AlignmentGroupsParams { text_document: TextDocumentIdentifier, range: Range, + + /// the columns between tab stops where the client draws this document, named as + /// [`lsp_types::FormattingOptions`] names it + /// + /// required, because whether two `=` share a column depends on it as soon as a tab comes before + /// either, and it is the client's setting rather than anything the source says + tab_size: NonZeroU32, } /// assignments sharing one `=` column, which therefore have to be laid out together @@ -66,6 +74,10 @@ pub(crate) struct AlignmentGroup { /// one assignment's contribution to the column #[derive(Debug, serde::Deserialize, serde::Serialize)] #[serde(rename_all = "camelCase")] +#[expect( + clippy::struct_field_names, + reason = "the field names are the wire format a client reads" +)] pub(crate) struct AlignmentMember { /// where the padding before the `=` starts /// @@ -76,6 +88,19 @@ pub(crate) struct AlignmentMember { /// the `=` gap_end: Position, + + /// the display column `gapStart` is drawn at, counted from the start of its line + /// + /// not `gapStart.character`, which counts code units in the negotiated position encoding. a + /// display column counts a wide character as two, a combining mark as none, and a tab as the + /// distance to the next multiple of the `tabSize` the client sent. it is what a client laying + /// hints out in columns wants, and the measure the grouping itself was decided by + gap_start_column: u32, + + /// the display column of the `=`, the same for every member of a group + /// + /// the gap holds only spaces, so this less `gapStartColumn` is the number of them + gap_end_column: u32, } pub(crate) struct AlignmentGroupsRequestHandler; @@ -121,52 +146,60 @@ impl BackgroundDocumentRequestHandler for AlignmentGroupsRequestHandler { return Ok(None); }; - let groups = alignment_groups(db, db.program_file(file).python_file(db), range) - .into_iter() - .filter_map(|group| { - let positions = group - .members + let groups = alignment_groups( + db, + db.program_file(file).python_file(db), + range, + params.tab_size, + ) + .into_iter() + .filter_map(|group| { + let positions = group + .members + .into_iter() + .map(|member| { + Some(( + member + .gap_start + .to_lsp_position(db, file, snapshot.encoding())?, + member + .gap_end + .to_lsp_position(db, file, snapshot.encoding())?, + member, + )) + }) + // a member whose position will not convert takes the whole group with it: the + // column is the maximum over every member, and a group missing one is a group + // sized against the wrong maximum + .collect::>>()?; + + // a notebook is one file written as many cells, and a run of assignments can carry + // across the seam between two of them. the positions sent below are cell-local, so + // a group that straddles a seam would go out as lines from two different documents + // presented as one, with the later line numbered from a later origin. drop it + // rather than answer in coordinates that do not share one + let (first, _, _) = positions.first()?; + let document = first.uri(); + if !positions + .iter() + .all(|(start, end, _)| start.uri() == document && end.uri() == document) + { + return None; + } + + Some(AlignmentGroup { + members: positions .into_iter() - .map(|member| { - Some(( - member - .gap_start - .to_lsp_position(db, file, snapshot.encoding())?, - member - .gap_end - .to_lsp_position(db, file, snapshot.encoding())?, - )) + .map(|(gap_start, gap_end, member)| AlignmentMember { + gap_start: gap_start.local_position(), + gap_end: gap_end.local_position(), + gap_start_column: member.gap_start_column, + gap_end_column: member.gap_end_column, }) - // a member whose position will not convert takes the whole group with it: the - // column is the maximum over every member, and a group missing one is a group - // sized against the wrong maximum - .collect::>>()?; - - // a notebook is one file written as many cells, and a run of assignments can carry - // across the seam between two of them. the positions sent below are cell-local, so - // a group that straddles a seam would go out as lines from two different documents - // presented as one, with the later line numbered from a later origin. drop it - // rather than answer in coordinates that do not share one - let (first, _) = positions.first()?; - let document = first.uri(); - if !positions - .iter() - .all(|(start, end)| start.uri() == document && end.uri() == document) - { - return None; - } - - Some(AlignmentGroup { - members: positions - .into_iter() - .map(|(gap_start, gap_end)| AlignmentMember { - gap_start: gap_start.local_position(), - gap_end: gap_end.local_position(), - }) - .collect(), - }) + .collect(), }) - .collect(); + }) + .collect(); Ok(Some(groups)) } @@ -183,12 +216,28 @@ mod tests { #[test] fn the_params_a_client_sends_parse() { let parsed: AlignmentGroupsParams = serde_json::from_str( - r#"{"textDocument":{"uri":"file:///main.by"},"range":{"start":{"line":0,"character":0},"end":{"line":9,"character":0}}}"#, + r#"{"textDocument":{"uri":"file:///main.by"},"range":{"start":{"line":0,"character":0},"end":{"line":9,"character":0}},"tabSize":4}"#, ) - .expect("a client sends a document and a range"); + .expect("a client sends a document, a range and its tab size"); assert_eq!(parsed.text_document.uri.as_str(), "file:///main.by"); assert_eq!(parsed.range.end.line, 9); + assert_eq!(parsed.tab_size.get(), 4); + } + + /// without a tab size a column cannot be counted, so the request is refused rather than + /// answered against a tab size the client never chose + #[test] + fn params_without_a_usable_tab_size_are_refused() { + let parsed = serde_json::from_str::( + r#"{"textDocument":{"uri":"file:///main.by"},"range":{"start":{"line":0,"character":0},"end":{"line":9,"character":0}}}"#, + ); + assert!(parsed.is_err()); + + let parsed = serde_json::from_str::( + r#"{"textDocument":{"uri":"file:///main.by"},"range":{"start":{"line":0,"character":0},"end":{"line":9,"character":0}},"tabSize":0}"#, + ); + assert!(parsed.is_err()); } /// the shape a client reads back. two members in one group is the whole point of the reply, so @@ -200,17 +249,21 @@ mod tests { AlignmentMember { gap_start: Position::new(0, 1), gap_end: Position::new(0, 6), + gap_start_column: 1, + gap_end_column: 6, }, AlignmentMember { gap_start: Position::new(1, 5), gap_end: Position::new(1, 6), + gap_start_column: 5, + gap_end_column: 6, }, ], }]; assert_eq!( serde_json::to_string(&response).expect("a response to serialise"), - r#"[{"members":[{"gapStart":{"line":0,"character":1},"gapEnd":{"line":0,"character":6}},{"gapStart":{"line":1,"character":5},"gapEnd":{"line":1,"character":6}}]}]"# + r#"[{"members":[{"gapStart":{"line":0,"character":1},"gapEnd":{"line":0,"character":6},"gapStartColumn":1,"gapEndColumn":6},{"gapStart":{"line":1,"character":5},"gapEnd":{"line":1,"character":6},"gapStartColumn":5,"gapEndColumn":6}]}]"# ); } } diff --git a/crates/ty_server/src/server/api/requests/build_output.rs b/crates/ty_server/src/server/api/requests/build_output.rs new file mode 100644 index 0000000000..44940828d1 --- /dev/null +++ b/crates/ty_server/src/server/api/requests/build_output.rs @@ -0,0 +1,76 @@ +//! `by/buildOutput` — where a path stands in its project's build +//! +//! an editor relates a `.by` to what it becomes in more places than one: opening the generated +//! module, going back from it, keeping the output out of its own index, telling a test runner not +//! to collect a second copy of every test. every one of those used to be the editor's own guess at +//! the layout, and the guess was wrong twice — about the directory and about the path inside it, +//! which follows the module tree rather than the directory tree. see [`by_stage::layout`] +//! +//! not a document request, because half of what it is asked about is not a document the editor +//! has open: a project root, a directory it wants excluded, a generated file it wants to go back +//! from. the path is enough to find the project that holds it + +use by_stage::layout::{BuildOutput, build_output}; +use lsp_types::{LspRequestMethod, MessageDirection, Request, Uri}; +use ruff_db::system::SystemPath; +use ty_project::Db as _; + +use crate::server::api::traits::{ + BackgroundRequestHandler, RequestHandler, RetriableRequestHandler, +}; +use crate::session::SessionSnapshot; +use crate::session::client::Client; + +/// the request a client sends to relate a path to the build +pub(crate) enum BuildOutputRequest {} + +impl Request for BuildOutputRequest { + type Params = BuildOutputParams; + type Result = Option; + // not a method LSP defines, so it goes across as a custom one, under the same `by/` prefix as + // the rest of them + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/buildOutput"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// the path to place: a source, a generated file, or any directory in a project +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase", deny_unknown_fields)] +pub(crate) struct BuildOutputParams { + uri: Uri, +} + +pub(crate) struct BuildOutputRequestHandler; + +impl RequestHandler for BuildOutputRequestHandler { + type RequestType = BuildOutputRequest; +} + +impl BackgroundRequestHandler for BuildOutputRequestHandler { + fn run( + snapshot: &SessionSnapshot, + _client: &Client, + params: BuildOutputParams, + ) -> crate::server::Result> { + let Ok(path) = params.uri.to_file_path() else { + // not a file on disk, so not something a build is made of or writes + return Ok(None); + }; + let Some(system_path) = SystemPath::from_std_path(&path) else { + return Ok(None); + }; + // the project whose root holds the path, the deepest one when projects nest: that is the + // project a `by build` run there would build + let Some(db) = snapshot + .projects() + .iter() + .filter(|db| system_path.starts_with(db.project().root(*db))) + .max_by_key(|db| db.project().root(*db).components().count()) + else { + return Ok(None); + }; + Ok(Some(build_output(db, &path))) + } +} + +impl RetriableRequestHandler for BuildOutputRequestHandler {} diff --git a/crates/ty_server/src/server/api/requests/code_action.rs b/crates/ty_server/src/server/api/requests/code_action.rs index 8404154f35..536ba75c85 100644 --- a/crates/ty_server/src/server/api/requests/code_action.rs +++ b/crates/ty_server/src/server/api/requests/code_action.rs @@ -3,7 +3,7 @@ use std::collections::HashMap; use lsp_types::{self as types, Code, CodeActionRequest, CodeActionResponse, TextEdit, Uri}; use ruff_text_size::Ranged; -use ty_ide::{FileEdit, code_actions}; +use ty_ide::{FileEdit, RefactorKind, code_actions, refactors}; use ty_project::{ProjectDatabase, SemanticDb as _}; use types::CodeActionKind; @@ -37,6 +37,8 @@ impl BackgroundDocumentRequestHandler for CodeActionRequestHandler { params: types::CodeActionParams, ) -> Result>> { let diagnostics = params.context.diagnostics; + let only = params.context.only; + let invoked = params.context.trigger_kind == Some(types::CodeActionTriggerKind::Invoked); let Some(file) = snapshot.to_notebook_or_file(db) else { return Ok(None); @@ -44,10 +46,18 @@ impl BackgroundDocumentRequestHandler for CodeActionRequestHandler { let program_file = db.program_file(file); let mut actions = Vec::new(); - for mut diagnostic in diagnostics.into_iter().filter(|diagnostic| { - diagnostic.source.as_deref() == Some(DIAGNOSTIC_NAME) - && range_intersect(&diagnostic.range, ¶ms.range) - }) { + // a client that narrowed the request to kinds a quick fix is not one of is asking for no + // quick fixes, and the same holds of the refactorings below + let quick_fixes_wanted = is_requested(only.as_deref(), &CodeActionKind::QuickFix); + + for mut diagnostic in diagnostics + .into_iter() + .filter(|_| quick_fixes_wanted) + .filter(|diagnostic| { + diagnostic.source.as_deref() == Some(DIAGNOSTIC_NAME) + && range_intersect(&diagnostic.range, ¶ms.range) + }) + { let mut diagnostic_id = match &diagnostic.code { Some(Code::String(diagnostic_id)) => Some(Cow::Borrowed(diagnostic_id)), _ => None, @@ -159,6 +169,50 @@ impl BackgroundDocumentRequestHandler for CodeActionRequestHandler { } } + // asked for before anything is worked out, because answering for one refactoring costs + // computing its rewrite: a client narrowing to `quickfix` must not pay for seven + let wanted: Vec = RefactorKind::ALL + .iter() + .copied() + .filter(|kind| { + is_requested( + only.as_deref(), + &CodeActionKind::new(kind.code_action_kind()), + ) + }) + .collect(); + if !wanted.is_empty() + && !snapshot.is_django_template() + && let Some(range) = + params + .range + .to_text_range(db, file, snapshot.uri(), snapshot.encoding()) + { + for offer in refactors(db, program_file, range, &wanted) { + let kind = CodeActionKind::new(offer.kind.code_action_kind()); + let action = match offer.availability { + Ok(edits) => Some(refactor_action( + db, + snapshot, + offer.kind, + offer.title, + edits, + params.range, + )), + // a refactoring that cannot be applied is only worth showing to a + // user who asked for refactorings, who is owed the reason + Err(reason) if invoked => Some(lsp_types::CodeAction { + title: offer.title, + kind: Some(kind), + disabled: Some(types::CodeActionDisabled { reason }), + ..lsp_types::CodeAction::default() + }), + Err(_) => None, + }; + actions.extend(action.map(CodeActionResponse::CodeAction)); + } + } + if actions.is_empty() { Ok(None) } else { @@ -172,7 +226,7 @@ impl BackgroundDocumentRequestHandler for CodeActionRequestHandler { /// An action can change a file other than the one its diagnostic is in — adding a /// missing dependency edits `pyproject.toml` — so each edit carries its own file /// rather than being resolved against the diagnostic's. -fn to_lsp_edits( +pub(crate) fn to_lsp_edits( db: &dyn Db, encoding: PositionEncoding, edits: Vec, @@ -197,6 +251,74 @@ fn to_lsp_edits( (!lsp_edits.is_empty()).then_some(lsp_edits) } +/// The code action for a refactoring that applies. +/// +/// A client that can resolve an action's edit is sent the action without one, carrying what +/// `codeAction/resolve` needs to spell it again; any other client is sent `edits` up front. That +/// saves serialising a rewrite nobody chose, not working it out — the rewrite in hand is how this +/// refactoring was known to apply at all. +fn refactor_action( + db: &ProjectDatabase, + snapshot: &DocumentSnapshot, + kind: ty_ide::RefactorKind, + title: String, + edits: Vec, + lsp_range: types::Range, +) -> lsp_types::CodeAction { + let action_kind = CodeActionKind::new(kind.code_action_kind()); + if snapshot + .resolved_client_capabilities() + .supports_code_action_edit_resolve() + { + let data = RefactorData { + uri: snapshot.uri().clone(), + version: snapshot.document().version(), + refactor: kind.id().to_string(), + range: lsp_range, + }; + return lsp_types::CodeAction { + title, + kind: Some(action_kind), + data: serde_json::to_value(data).ok(), + ..lsp_types::CodeAction::default() + }; + } + lsp_types::CodeAction { + title, + kind: Some(action_kind), + edit: Some(lsp_types::WorkspaceEdit { + changes: to_lsp_edits(db, snapshot.encoding(), edits), + ..lsp_types::WorkspaceEdit::default() + }), + ..lsp_types::CodeAction::default() + } +} + +/// What a refactoring's code action carries for `codeAction/resolve` to compute +/// its edit: the refactoring, and the document and range it was offered for. +#[derive(serde::Serialize, serde::Deserialize)] +pub(crate) struct RefactorData { + pub(crate) uri: Uri, + /// The document version the refactoring was offered against. An edit + /// computed against any other version would land on the wrong text. + pub(crate) version: crate::document::DocumentVersion, + pub(crate) refactor: String, + pub(crate) range: types::Range, +} + +/// Whether a client that asked only for `only` wants actions of `kind`: a +/// requested kind covers itself and every kind nested under it. +fn is_requested(only: Option<&[CodeActionKind]>, kind: &CodeActionKind) -> bool { + let Some(only) = only else { + return true; + }; + let kind = kind.to_string(); + only.iter().any(|requested| { + let requested = requested.to_string(); + kind == requested || kind.starts_with(&format!("{requested}.")) + }) +} + fn range_intersect(range: &lsp_types::Range, other: &lsp_types::Range) -> bool { let start = range.start.max(other.start); let end = range.end.min(other.end); @@ -204,3 +326,73 @@ fn range_intersect(range: &lsp_types::Range, other: &lsp_types::Range) -> bool { } impl RetriableRequestHandler for CodeActionRequestHandler {} + +#[cfg(test)] +mod tests { + use super::is_requested; + use lsp_types::CodeActionKind; + use ty_ide::RefactorKind; + + fn only(kinds: &[&'static str]) -> Vec { + kinds.iter().map(|kind| CodeActionKind::new(kind)).collect() + } + + /// A client that sent no `only` asked for everything. + #[test] + fn without_only_every_kind_is_wanted() { + assert!(is_requested(None, &CodeActionKind::QuickFix)); + for kind in RefactorKind::ALL { + assert!(is_requested( + None, + &CodeActionKind::new(kind.code_action_kind()) + )); + } + } + + /// A requested kind covers the kinds nested under it, which is how a client asks for every + /// refactoring without naming each one. + #[test] + fn a_requested_kind_covers_what_is_nested_under_it() { + let refactor = only(&["refactor"]); + for kind in RefactorKind::ALL { + assert!(is_requested( + Some(&refactor), + &CodeActionKind::new(kind.code_action_kind()) + )); + } + assert!(is_requested( + Some(&only(&["refactor.extract"])), + &CodeActionKind::new(RefactorKind::ExtractVariable.code_action_kind()) + )); + } + + /// The narrowing runs both ways: the quick fixes are skipped for a client that asked only for + /// refactorings, and every refactoring for one that asked only for quick fixes. + #[test] + fn a_narrowed_request_excludes_the_other_kinds() { + assert!(!is_requested( + Some(&only(&["refactor"])), + &CodeActionKind::QuickFix + )); + let quick_fix = only(&["quickfix"]); + for kind in RefactorKind::ALL { + assert!(!is_requested( + Some(&quick_fix), + &CodeActionKind::new(kind.code_action_kind()) + )); + } + } + + /// A kind is not covered by one nested *under* it: `quickfix` is not a `quickfix.foo`. + #[test] + fn a_kind_is_not_covered_by_a_narrower_one() { + assert!(!is_requested( + Some(&only(&["quickfix.foo"])), + &CodeActionKind::QuickFix + )); + assert!(!is_requested( + Some(&only(&["refactor.extract"])), + &CodeActionKind::new(RefactorKind::InlineVariable.code_action_kind()) + )); + } +} diff --git a/crates/ty_server/src/server/api/requests/code_action_resolve.rs b/crates/ty_server/src/server/api/requests/code_action_resolve.rs new file mode 100644 index 0000000000..fb02084c12 --- /dev/null +++ b/crates/ty_server/src/server/api/requests/code_action_resolve.rs @@ -0,0 +1,98 @@ +use std::borrow::Cow; +use std::str::FromStr; + +use lsp_types::{self as types, CodeActionResolveRequest, Uri}; +use ty_ide::RefactorKind; +use ty_project::{ProjectDatabase, SemanticDb as _}; + +use crate::document::RangeExt; +use crate::server::api::RequestHandler; +use crate::server::api::requests::code_action::{RefactorData, to_lsp_edits}; +use crate::server::api::traits::{BackgroundDocumentRequestHandler, RetriableRequestHandler}; +use crate::server::{Error, Result}; +use crate::session::DocumentSnapshot; +use crate::session::client::Client; + +/// Computes the edit of a refactoring offered by `textDocument/codeAction`. +/// +/// Only the refactorings are resolved: every other action already carries its edit. +pub(crate) struct CodeActionResolveRequestHandler; + +impl RequestHandler for CodeActionResolveRequestHandler { + type RequestType = CodeActionResolveRequest; +} + +impl BackgroundDocumentRequestHandler for CodeActionResolveRequestHandler { + fn document_uri(params: &types::CodeAction) -> Cow<'_, Uri> { + // an action this server did not offer names no document; one that is never + // open is answered as not open + Cow::Owned(refactor_data(params).map_or_else( + || Uri::from_str("untitled:unresolvable-code-action").expect("a valid URI"), + |data| data.uri, + )) + } + + fn run_with_snapshot( + db: &ProjectDatabase, + snapshot: &DocumentSnapshot, + _client: &Client, + mut action: types::CodeAction, + ) -> Result { + let Some(data) = refactor_data(&action) else { + return Err(invalid_params( + "the code action carries no refactoring to resolve", + )); + }; + let Some(kind) = RefactorKind::from_id(&data.refactor) else { + return Err(invalid_params(&format!( + "unknown refactoring `{}`", + data.refactor + ))); + }; + if snapshot.document().version() != data.version { + return Err(Error { + code: lsp_server::ErrorCode::ContentModified, + error: anyhow::anyhow!("the document changed since the refactoring was offered"), + }); + } + let Some(file) = snapshot.to_notebook_or_file(db) else { + return Err(invalid_params( + "the document is not a file the server knows", + )); + }; + let Some(range) = data + .range + .to_text_range(db, file, snapshot.uri(), snapshot.encoding()) + else { + return Err(invalid_params( + "the refactoring's range is not in the document", + )); + }; + + match ty_ide::refactor(db, db.program_file(file), kind, range) { + Ok(refactor) => { + action.edit = Some(types::WorkspaceEdit { + changes: to_lsp_edits(db, snapshot.encoding(), refactor.edits), + ..types::WorkspaceEdit::default() + }); + } + // the document is the version the action was offered for, so this is a + // refactoring the offer already refused; say why rather than fail + Err(reason) => action.disabled = Some(types::CodeActionDisabled { reason }), + } + Ok(action) + } +} + +impl RetriableRequestHandler for CodeActionResolveRequestHandler {} + +fn refactor_data(action: &types::CodeAction) -> Option { + serde_json::from_value(action.data.clone()?).ok() +} + +fn invalid_params(message: &str) -> Error { + Error { + code: lsp_server::ErrorCode::InvalidParams, + error: anyhow::anyhow!("{message}"), + } +} diff --git a/crates/ty_server/src/server/api/requests/entry_point.rs b/crates/ty_server/src/server/api/requests/entry_point.rs new file mode 100644 index 0000000000..cf0096c0c6 --- /dev/null +++ b/crates/ty_server/src/server/api/requests/entry_point.rs @@ -0,0 +1,212 @@ +//! `by/entryPoint` — how a module runs as a program. +//! +//! basedpython turns a module's top-level `main` into its entry point: it appends the `__main__` +//! guard that calls it and generates an argument parser from its signature. Which `main` counts, +//! whether the module already invokes it, which parameters the command line can fill and how each +//! is spelled are all decisions of that transpiler pass — so an editor offering to run a module, or +//! to fill in its arguments, asks the pass's own reading ([`by_transforms::entry_point`]) rather +//! than reading the signature a second way that drifts from it. +//! +//! Asked by URI, not by open document: a run configuration names a module, and the file behind it +//! is usually not open when the run starts. + +use lsp_types::{LspRequestMethod, MessageDirection, Range, Request, Uri}; +use ruff_db::parsed::parsed_module; +use ruff_db::source::source_text; +use ruff_text_size::{Ranged, TextRange}; +use ty_python_semantic::Db as _; + +use crate::document::ToRangeExt; +use crate::server::api::program_files::project_file; +use crate::server::api::traits::{ + BackgroundRequestHandler, RequestHandler, RetriableRequestHandler, +}; +use crate::session::SessionSnapshot; +use crate::session::client::Client; + +pub(crate) enum EntryPointRequest {} + +impl Request for EntryPointRequest { + type Params = EntryPointParams; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/entryPoint"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// Which file to read. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase", deny_unknown_fields)] +pub(crate) struct EntryPointParams { + /// The file — the editor's buffer when it is open, the file on disk when it is not. + uri: Uri, +} + +/// How the module runs. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct EntryPointResponse { + /// The module's top-level `main`, when it is a module basedpython generates an entry point + /// for — a `.by` that is not a stub. Present whether or not it ends up the entry point; see + /// [`MainFunction::entry_point`]. + main: Option, + /// The module's own `if __name__ == "__main__":` headers, in source order: each runs the module + /// as a program, in a `.py` as much as in a `.by`. + guards: Vec, +} + +/// The last top-level `def main` / `async def main`. +// a wire format: each flag is a separate fact a client reads, not states of one enum +#[expect(clippy::struct_excessive_bools)] +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct MainFunction { + /// The function's name. + name_range: Range, + is_async: bool, + /// Whether the transpiler appends the guard that calls it, which is the conjunction of the + /// three below: it is not `private`, the module does not invoke `main` itself, and nothing + /// blocks it. + entry_point: bool, + /// `private def main`, which is renamed. + is_private: bool, + /// The module calls `main` itself — a hand-written guard or a bare top-level `main()` — so it + /// keeps that entry point and no argument parser is generated. + module_invokes_main: bool, + /// The first required parameter the command line cannot supply, which makes calling `main` + /// raise `TypeError`, so no guard is generated for it. + blocked_by: Option, + /// Every parameter but the variadics, in declared order. + parameters: Vec, + /// The converter the arguments nobody else claims are passed through, when a leading `*rest` + /// asks for them. + extra_arguments: Option, + /// The docstring, which is the generated parser's `--help` description. + docstring: Option, +} + +/// One parameter of `main`. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct MainParameter { + name: String, + /// `positional` (positional-only), `keyword` (keyword-only) or `any`. + kind: String, + required: bool, + /// The annotation as written. + annotation: Option, + /// The default as written. + default: Option, + /// How the command line spells it; absent when it does not, and the parameter keeps its + /// default. + cli: Option, +} + +/// A parameter as the generated argument parser registers it. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct CliParameter { + /// The callable that converts the argument, as the source names it — `int`, `Path`, + /// `pathlib.Path`. Absent for a flag pair, which takes no value. + converter: Option, + /// The command-line values a literal union admits. + choices: Option>, + /// The option spellings, the one to write first. + flags: Vec, + /// The `--no-…` spellings of a flag; empty for a value. + negative_flags: Vec, +} + +pub(crate) struct EntryPointHandler; + +impl RequestHandler for EntryPointHandler { + type RequestType = EntryPointRequest; +} + +impl BackgroundRequestHandler for EntryPointHandler { + fn run( + snapshot: &SessionSnapshot, + _client: &Client, + params: EntryPointParams, + ) -> crate::server::Result> { + let Some((db, file)) = project_file(snapshot, ¶ms.uri) else { + return Ok(None); + }; + let encoding = snapshot.position_encoding(); + let source = source_text(db, file); + let parsed = parsed_module(db, db.program_file(file).python_file(db)).load(db); + let body = &parsed.suite(); + let range = |range: TextRange| { + range + .to_lsp_range(db, file, encoding) + .map(|range| range.local_range()) + }; + let text = |range: TextRange| source.as_str()[range].to_owned(); + + let guards = by_transforms::entry_point::main_guards(body) + .filter_map(|guard| range(TextRange::new(guard.start(), guard.test.end()))) + .collect(); + + let source_type = file.source_type(db); + let generates_entry_points = source_type.is_basedpython() && !source_type.is_stub(); + let main = generates_entry_points + .then(|| by_transforms::entry_point::entry_point(body, source.as_str())) + .flatten() + .and_then(|entry| { + Some(MainFunction { + name_range: range(entry.function.name.range())?, + is_async: entry.function.is_async, + entry_point: entry.generates_guard(), + is_private: entry.is_private, + module_invokes_main: entry.module_invokes_main, + blocked_by: entry.blocked_by().map(|param| param.name().to_owned()), + parameters: entry + .parameters + .iter() + .map(|param| MainParameter { + name: param.name().to_owned(), + kind: param.kind.as_str().to_owned(), + required: param.is_required(), + annotation: param + .parameter + .parameter + .annotation + .as_deref() + .map(|annotation| text(annotation.range())), + default: param + .parameter + .default + .as_deref() + .map(|default| text(default.range())), + cli: param.spelling.as_ref().map(|spelling| CliParameter { + converter: spelling.converter.map(str::to_owned), + choices: spelling.choices.as_ref().map(|choices| { + choices.iter().map(|choice| choice.value.clone()).collect() + }), + flags: param.flags(), + negative_flags: param.negative_flags(), + }), + }) + .collect(), + extra_arguments: entry.extra_arguments.map(str::to_owned), + docstring: entry.docstring().map(str::to_owned), + }) + }); + + Ok(Some(EntryPointResponse { main, guards })) + } +} + +impl RetriableRequestHandler for EntryPointHandler {} + +#[cfg(test)] +mod tests { + use super::*; + + /// The wire form a client sends — the contract with a plugin written in another language. + #[test] + fn the_params_a_client_sends_parse() { + let parsed: EntryPointParams = + serde_json::from_str(r#"{"uri":"file:///p/main.by"}"#).expect("a client sends a uri"); + assert_eq!(parsed.uri.as_str(), "file:///p/main.by"); + } +} diff --git a/crates/ty_server/src/server/api/requests/run_modules.rs b/crates/ty_server/src/server/api/requests/run_modules.rs new file mode 100644 index 0000000000..e257eb8398 --- /dev/null +++ b/crates/ty_server/src/server/api/requests/run_modules.rs @@ -0,0 +1,133 @@ +//! `by/runModules` — the names `by run` runs a project's files under. +//! +//! `by run ` stages the project's module roots into a tree shaped like the module tree and +//! hands the name to `runpy`, and with no name it runs the project's configured `run.main` — read +//! through [`by_stage::run_module::configured_main`], which `by run` shares. Which file a name means +//! is the project resolver's answer: search paths in order, only the module roots the build stages, +//! a package running as its `__main__`, and one file per name — where two files would build to one +//! module, `by run` refuses to stage either, and the resolver's choice is the one reported. An +//! editor building a run configuration asks that here, rather than walking directories in an order +//! that agrees with the resolver only until a project has two roots. + +use lsp_types::{LspRequestMethod, MessageDirection, Request, Uri}; +use ruff_db::system::SystemPath; +use ty_project::Db as _; + +use crate::server::api::traits::{ + BackgroundRequestHandler, RequestHandler, RetriableRequestHandler, +}; +use crate::session::SessionSnapshot; +use crate::session::client::Client; +use crate::system::file_to_uri; + +pub(crate) enum RunModulesRequest {} + +impl Request for RunModulesRequest { + type Params = RunModulesParams; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/runModules"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// What to resolve beyond every project file. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase", deny_unknown_fields)] +pub(crate) struct RunModulesParams { + /// A module name as a run configuration holds it, resolved in each project as + /// [`RunModulesProject::requested`]. Not every name `by run` accepts names a file of its own — + /// a package runs as its `__main__` — so a name is resolved rather than looked up. + #[serde(default)] + module: Option, +} + +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct RunModulesResponse { + projects: Vec, +} + +/// One project's answer. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct RunModulesProject { + /// The project root, which is where `by run` resolves its configuration from. + root: Uri, + /// The configured `run.main`, which `by run` runs when it is given no module. + main: Option, + /// The requested module, resolved. + requested: Option, + /// Every project file `by run` runs by a name of its own, with that name. + modules: Vec, +} + +/// A module name and the file it runs. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct RunModule { + module: String, + /// Absent when the name resolves to nothing `by run` stages, which is how a mistyped + /// `run.main` reads. + uri: Option, +} + +pub(crate) struct RunModulesHandler; + +impl RequestHandler for RunModulesHandler { + type RequestType = RunModulesRequest; +} + +impl BackgroundRequestHandler for RunModulesHandler { + fn run( + snapshot: &SessionSnapshot, + _client: &Client, + params: RunModulesParams, + ) -> crate::server::Result> { + let projects = snapshot + .projects() + .iter() + .filter_map(|db| { + let resolve = |module: String| RunModule { + uri: by_stage::run_module::module_file(db, &module) + .and_then(|file| file_to_uri(db, file)), + module, + }; + let root: &SystemPath = db.project().root(db); + let mut modules: Vec = db + .project() + .files(db) + .into_iter() + .filter_map(|file| { + Some(RunModule { + module: by_stage::run_module::module_name(db, file)?, + uri: Some(file_to_uri(db, file)?), + }) + }) + .collect(); + modules.sort_by(|a, b| a.module.cmp(&b.module)); + Some(RunModulesProject { + root: Uri::from_file_path(root.as_std_path()).ok()?, + main: by_stage::run_module::configured_main(db).map(resolve), + requested: params.module.clone().map(resolve), + modules, + }) + }) + .collect(); + Ok(Some(RunModulesResponse { projects })) + } +} + +impl RetriableRequestHandler for RunModulesHandler {} + +#[cfg(test)] +mod tests { + use super::*; + + #[test] + fn the_params_a_client_sends_parse() { + let named: RunModulesParams = + serde_json::from_str(r#"{"module":"app.cli"}"#).expect("a client names a module"); + assert_eq!(named.module.as_deref(), Some("app.cli")); + let bare: RunModulesParams = serde_json::from_str("{}").expect("a client names nothing"); + assert!(bare.module.is_none()); + } +} diff --git a/crates/ty_server/src/server/api/requests/syntax_outline.rs b/crates/ty_server/src/server/api/requests/syntax_outline.rs new file mode 100644 index 0000000000..4aa0cedde8 --- /dev/null +++ b/crates/ty_server/src/server/api/requests/syntax_outline.rs @@ -0,0 +1,278 @@ +//! `by/syntaxOutline` — a document's block structure and string literals, as the parser sees them. +//! +//! What an editor needs to type in an indentation-delimited language and to draw what is inside a +//! string: which line opens a suite and where a compound statement ends, which clause keywords +//! belong to one statement, what a call statement calls, and each string literal's escapes, +//! interpolations and the indentation basedpython strips from it. +//! +//! None of it has a standard request. `textDocument/foldingRange` and +//! `textDocument/selectionRange` carry ranges without saying which is a header, a clause or a +//! suite; semantic tokens cannot overlap, and an interpolation is a span with tokens inside it. +//! The keyword pairs themselves are answered by `textDocument/documentHighlight`, which is +//! exactly that question; this reports the clause keywords too, because an editor also navigates +//! between them without a position to ask about. +//! +//! One document at a time, whole: a client keeps the answer against the revision it asked about +//! and serves every feature on that revision from it. + +use std::borrow::Cow; + +use lsp_types::{LspRequestMethod, MessageDirection, Range, Request, TextDocumentIdentifier, Uri}; +use ruff_db::files::File; +use ruff_text_size::TextRange; +use ty_ide::{OutlineStatement, OutlineString, syntax_outline}; +use ty_project::{ProjectDatabase, SemanticDb as _}; + +use crate::PositionEncoding; +use crate::document::ToRangeExt; +use crate::server::api::traits::{ + BackgroundDocumentRequestHandler, RequestHandler, RetriableRequestHandler, +}; +use crate::session::DocumentSnapshot; +use crate::session::client::Client; + +pub(crate) enum SyntaxOutlineRequest {} + +impl Request for SyntaxOutlineRequest { + type Params = SyntaxOutlineParams; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/syntaxOutline"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// Which document to outline. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase", deny_unknown_fields)] +pub(crate) struct SyntaxOutlineParams { + /// The document — its buffer, as the client last synchronised it. + text_document: TextDocumentIdentifier, +} + +/// The outline of one document. +#[derive(Debug, Default, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct SyntaxOutlineResponse { + /// The module's statements, in source order. + statements: Vec, + /// Every string literal part, in source order. + strings: Vec, +} + +/// One statement. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct Statement { + /// From the statement's first token — a decorator, on a decorated definition — to the end of + /// its last clause's body. + range: Range, + /// A compound statement's clauses, in source order. Absent on a simple statement. + #[serde(default, skip_serializing_if = "Vec::is_empty")] + clauses: Vec, + /// The basedpython modifier keywords a definition was declared with, in source order. + #[serde(default, skip_serializing_if = "Vec::is_empty")] + modifiers: Vec, + /// On an expression statement that is a call: the call. + #[serde(default, skip_serializing_if = "Option::is_none")] + call: Option, +} + +/// One clause of a compound statement. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct Clause { + /// The clause keyword: `if`, `elif`, `case`, the `def` of a function. Absent on a clause that + /// has none, which is a trailing lambda's. + #[serde(default, skip_serializing_if = "Option::is_none")] + keyword: Option, + /// The `:` that opens the suite. Absent when the header has none to find — a header the parser + /// recovered from, or the `let` half of a `let ... := ... else:`. + #[serde(default, skip_serializing_if = "Option::is_none")] + colon: Option, + /// From the start of the header to the end of the body, or of the header when the body is + /// empty. + range: Range, + /// The suite's statements. + #[serde(default, skip_serializing_if = "Vec::is_empty")] + body: Vec, +} + +/// A basedpython modifier keyword. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct Modifier { + /// The keyword or keywords (`frozen data`), without trailing whitespace. + range: Range, + /// What the parser read it as: `data_class`, `frozen_data_class`, `enum_def`, `classmethod`, + /// `protocol_class`, `final`, ... + name: String, +} + +/// A call made as a statement of its own. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct Call { + /// The expression called. + callee: Range, + /// From the start of the first argument to the end of the last. Absent when there are none. + #[serde(default, skip_serializing_if = "Option::is_none")] + arguments: Option, + /// Whether every argument is positional and none is unpacked. + positional_only: bool, +} + +/// One string literal part. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct StringPart { + /// The part, prefix and quotes included. + range: Range, + /// How many leading characters basedpython strips from every line of the literal. Absent when + /// it strips nothing, which includes every python file. + #[serde(default, skip_serializing_if = "Option::is_none")] + stripped_indent: Option, + /// An f-string's or t-string's `{...}` interpolations, braces included. + #[serde(default, skip_serializing_if = "Vec::is_empty")] + interpolations: Vec, + /// The escape sequences in the literal text. + #[serde(default, skip_serializing_if = "Vec::is_empty")] + escapes: Vec, +} + +pub(crate) struct SyntaxOutlineRequestHandler; + +impl RequestHandler for SyntaxOutlineRequestHandler { + type RequestType = SyntaxOutlineRequest; +} + +impl BackgroundDocumentRequestHandler for SyntaxOutlineRequestHandler { + fn document_uri(params: &SyntaxOutlineParams) -> Cow<'_, Uri> { + Cow::Borrowed(¶ms.text_document.uri) + } + + fn run_with_snapshot( + db: &ProjectDatabase, + snapshot: &DocumentSnapshot, + _client: &Client, + _params: SyntaxOutlineParams, + ) -> crate::server::Result> { + if snapshot + .workspace_settings() + .is_language_services_disabled() + { + return Ok(None); + } + // A notebook's ranges are per cell, and nothing here is asked about cells. + if snapshot.document().is_cell_or_notebook() || snapshot.is_django_template() { + return Ok(None); + } + let Some(file) = snapshot.to_notebook_or_file(db) else { + return Ok(None); + }; + + let outline = syntax_outline(db, db.program_file(file).python_file(db)); + let converter = Converter { + db, + file, + encoding: snapshot.encoding(), + }; + + // A part that does not map is dropped rather than the whole answer: every range here comes + // from the same parse of the same text, so one that fails to map is not something a client + // could have used anyway. + Ok(Some(SyntaxOutlineResponse { + statements: converter.statements(&outline.statements), + strings: outline + .strings + .iter() + .filter_map(|string| converter.string(string)) + .collect(), + })) + } +} + +impl RetriableRequestHandler for SyntaxOutlineRequestHandler {} + +struct Converter<'a> { + db: &'a ProjectDatabase, + file: File, + encoding: PositionEncoding, +} + +impl Converter<'_> { + fn range(&self, range: TextRange) -> Option { + range + .to_lsp_range(self.db, self.file, self.encoding) + .map(|range| range.local_range()) + } + + fn statements(&self, statements: &[OutlineStatement]) -> Vec { + statements + .iter() + .filter_map(|statement| { + Some(Statement { + range: self.range(statement.range)?, + clauses: statement + .clauses + .iter() + .filter_map(|clause| { + Some(Clause { + keyword: clause.keyword.and_then(|range| self.range(range)), + colon: clause.colon.and_then(|range| self.range(range)), + range: self.range(clause.range)?, + body: self.statements(&clause.body), + }) + }) + .collect(), + modifiers: statement + .modifiers + .iter() + .filter_map(|modifier| { + Some(Modifier { + range: self.range(modifier.range)?, + name: modifier.name.clone(), + }) + }) + .collect(), + call: statement.call.as_ref().and_then(|call| { + Some(Call { + callee: self.range(call.callee)?, + arguments: call.arguments.and_then(|range| self.range(range)), + positional_only: call.positional_only, + }) + }), + }) + }) + .collect() + } + + fn string(&self, string: &OutlineString) -> Option { + Some(StringPart { + range: self.range(string.range)?, + stripped_indent: string.stripped_indent.map(u32::from), + interpolations: string + .interpolations + .iter() + .filter_map(|range| self.range(*range)) + .collect(), + escapes: string + .escapes + .iter() + .filter_map(|range| self.range(*range)) + .collect(), + }) + } +} + +#[cfg(test)] +mod tests { + use super::*; + + /// The wire form, exactly as a client sends it. + #[test] + fn the_params_a_client_sends_parse() { + let parsed: SyntaxOutlineParams = + serde_json::from_str(r#"{"textDocument":{"uri":"file:///main.by"}}"#) + .expect("a client sends a document"); + assert_eq!(parsed.text_document.uri.as_str(), "file:///main.by"); + } +} diff --git a/crates/ty_server/src/server/api/requests/test_items.rs b/crates/ty_server/src/server/api/requests/test_items.rs new file mode 100644 index 0000000000..f6a5e44ba4 --- /dev/null +++ b/crates/ty_server/src/server/api/requests/test_items.rs @@ -0,0 +1,218 @@ +//! `by/testItems` — the tests pytest would collect, without running pytest. +//! +//! Collecting tests the way pytest does — `pytest --collect-only` — imports every test module, and +//! importing a module runs whatever it does at the top level. That is a fine price for a user who +//! asked to collect; it is not one an editor should pay on a user's behalf just to draw a gutter +//! icon or a tree. The checker already models pytest's collection rules statically +//! ([`ty_python_semantic::collected_pytest_tests`]) — a test nested in a function is not one, a +//! `Test` class with an `__init__` holds none, a `unittest.TestCase` method is one whatever its +//! class is called — so this answers from that model and executes nothing. +//! +//! A standard `textDocument/documentSymbol` answer is not enough to derive this from: it lists +//! declarations, and which of them pytest collects depends on inheritance, constructors, fixtures +//! and `__test__` flags that only the checker can resolve. + +use lsp_types::{LspRequestMethod, MessageDirection, Range, Request, Uri}; +use ruff_db::files::File; +use ruff_text_size::TextRange; +use ty_project::{Db as _, ProjectDatabase}; +use ty_python_semantic::{CollectedTest, Db as _, collected_pytest_tests}; + +use crate::PositionEncoding; +use crate::document::ToRangeExt; +use crate::server::api::program_files::project_file; +use crate::server::api::traits::{ + BackgroundRequestHandler, RequestHandler, RetriableRequestHandler, +}; +use crate::session::SessionSnapshot; +use crate::session::client::Client; +use crate::system::file_to_uri; + +pub(crate) enum TestItemsRequest {} + +impl Request for TestItemsRequest { + type Params = TestItemsParams; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/testItems"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// Where to look. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase", deny_unknown_fields)] +pub(crate) struct TestItemsParams { + /// One file — its buffer when it is open. Absent for every file of every project. + #[serde(default)] + uri: Option, +} + +/// The tests found, per file. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct TestItemsResponse { + /// For a request naming one file, that file, with an empty list when it holds no tests. For a + /// whole-project request, only the files that hold some. + files: Vec, +} + +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct TestFile { + uri: Uri, + /// The module-level classes and functions, in source order. + tests: Vec, +} + +/// A test, or a class tests are collected under. +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +pub(crate) struct TestItem { + /// The name pytest reports it under. + name: String, + /// `class` or `function`. + kind: String, + /// The `::`-separated names after the file in the item's pytest node id: `TestA::test_b`. + id: String, + /// The whole declaration. + range: Range, + /// The name. + selection_range: Range, + /// Collected as a `unittest.TestCase` method, into which pytest injects no fixtures. + unittest: bool, + /// The classes and tests collected under a class, in source order; empty for a function. + children: Vec, +} + +pub(crate) struct TestItemsHandler; + +impl RequestHandler for TestItemsHandler { + type RequestType = TestItemsRequest; +} + +impl BackgroundRequestHandler for TestItemsHandler { + fn run( + snapshot: &SessionSnapshot, + _client: &Client, + params: TestItemsParams, + ) -> crate::server::Result> { + let encoding = snapshot.position_encoding(); + if let Some(uri) = params.uri { + let Some((db, file)) = project_file(snapshot, &uri) else { + return Ok(None); + }; + let tests = test_items(db, file, encoding); + return Ok(Some(TestItemsResponse { + files: vec![TestFile { uri, tests }], + })); + } + + let mut files = Vec::new(); + for db in snapshot.projects() { + for file in &db.project().files(db) { + let tests = test_items(db, file, encoding); + if tests.is_empty() { + continue; + } + let Some(uri) = file_to_uri(db, file) else { + continue; + }; + files.push(TestFile { uri, tests }); + } + } + files.sort_by(|a, b| a.uri.as_str().cmp(b.uri.as_str())); + Ok(Some(TestItemsResponse { files })) + } +} + +impl RetriableRequestHandler for TestItemsHandler {} + +/// The tests in `file`, arranged under the classes they are collected in. +fn test_items(db: &ProjectDatabase, file: File, encoding: PositionEncoding) -> Vec { + let range = |range: TextRange| { + range + .to_lsp_range(db, file, encoding) + .map(|range| range.local_range()) + }; + let mut roots: Vec = Vec::new(); + for test in collected_pytest_tests(db, db.program_file(file)) { + let CollectedTest { + name, + classes, + full_range, + focus_range, + is_unittest, + } = test; + let mut siblings = &mut roots; + let mut id = String::new(); + let mut placed = true; + for class in classes { + if !id.is_empty() { + id.push_str("::"); + } + id.push_str(&class.name); + let (Some(class_range), Some(class_selection)) = + (range(class.full_range), range(class.focus_range)) + else { + placed = false; + break; + }; + let index = match siblings.iter().position(|item| { + item.kind == CLASS + && item.name == class.name + && item.selection_range == class_selection + }) { + Some(index) => index, + None => { + siblings.push(TestItem { + name: class.name, + kind: CLASS.to_owned(), + id: id.clone(), + range: class_range, + selection_range: class_selection, + unittest: false, + children: Vec::new(), + }); + siblings.len() - 1 + } + }; + siblings = &mut siblings[index].children; + } + let (true, Some(test_range), Some(test_selection)) = + (placed, range(full_range), range(focus_range)) + else { + continue; + }; + if !id.is_empty() { + id.push_str("::"); + } + id.push_str(&name); + siblings.push(TestItem { + name, + kind: FUNCTION.to_owned(), + id, + range: test_range, + selection_range: test_selection, + unittest: is_unittest, + children: Vec::new(), + }); + } + roots +} + +const CLASS: &str = "class"; +const FUNCTION: &str = "function"; + +#[cfg(test)] +mod tests { + use super::*; + + /// Both forms a client sends: one file, and the whole project. + #[test] + fn the_params_a_client_sends_parse() { + let one: TestItemsParams = serde_json::from_str(r#"{"uri":"file:///p/test_a.by"}"#) + .expect("a client names a file"); + assert_eq!(one.uri.expect("a uri").as_str(), "file:///p/test_a.by"); + let all: TestItemsParams = serde_json::from_str("{}").expect("a client names nothing"); + assert!(all.uri.is_none()); + } +} diff --git a/crates/ty_server/src/server/api/requests/transpile_for_build.rs b/crates/ty_server/src/server/api/requests/transpile_for_build.rs index cd75ff21a6..9567eacd0e 100644 --- a/crates/ty_server/src/server/api/requests/transpile_for_build.rs +++ b/crates/ty_server/src/server/api/requests/transpile_for_build.rs @@ -1,4 +1,4 @@ -//! `by/transpileForBuild` — one file's slot in a running build's tree, recomputed +//! `by/transpileForBuild` — the slots of an edit's files in a running build's tree, recomputed //! //! ## why the language server and not the `by` binary //! @@ -11,8 +11,16 @@ //! Rebuilding the tree to get them is not affordable. Measured on a 97-file project, `by check` is //! 8.5 seconds and `by build` is 24.9; one file's share of the latter is about 165 milliseconds. //! A CLI would pay project discovery and the whole check again on every press of a button. The -//! server has already paid both — it holds the project database, warm — so what is left is one -//! file's emit, which is the entire reason this is a request and not a subcommand. +//! server has already paid both — it holds the project database, warm — so what is left is the +//! edited files' emit, which is the entire reason this is a request and not a subcommand. +//! +//! ## one request for the whole edit +//! +//! A reload is a set of files, and the tree holds one `_by_sourcemap.py` for all of them. An answer +//! about one file can only carry the tree's map plus that file's entry, so a client writing each +//! such answer's map in turn keeps the last file's line table and silently loses the rest. The +//! request therefore names every file of the edit, and the answer carries one map with all of their +//! entries moved — see [`by_stage::restage`]. //! //! ## it writes nothing //! @@ -29,18 +37,18 @@ //! refusal costs the user a restart. A wrong answer costs them a session that reports lines from a //! file that no longer exists. -use std::borrow::Cow; - -use by_stage::restage::{Restage, restage_one}; +use by_stage::restage::{Restage, restage}; use super::detached_transpile::transpile_detached; -use lsp_types::{LspRequestMethod, MessageDirection, Request, TextDocumentIdentifier, Uri}; -use ty_project::ProjectDatabase; +use lsp_types::{LspRequestMethod, MessageDirection, Request, TextDocumentIdentifier}; +use ruff_db::system::{SystemPath, SystemPathBuf}; +use ty_project::{Db as _, ProjectDatabase}; +use crate::document::DocumentKey; use crate::server::api::traits::{ - BackgroundDocumentRequestHandler, RequestHandler, RetriableRequestHandler, + BackgroundRequestHandler, RequestHandler, RetriableRequestHandler, }; -use crate::session::DocumentSnapshot; +use crate::session::SessionSnapshot; use crate::session::client::Client; /// the request a client sends while its debuggee is running @@ -48,7 +56,7 @@ pub(crate) enum TranspileForBuildRequest {} impl Request for TranspileForBuildRequest { type Params = TranspileForBuildParams; - type Result = Option; + type Result = Restage; // not a method LSP defines, so it goes across as a custom one. the `by/` prefix is what keeps // it from ever colliding with something the protocol grows later — the same reason // `by/dataFlowAt` carries it @@ -56,17 +64,17 @@ impl Request for TranspileForBuildRequest { const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; } -/// what the client knows: which file it edited, and which tree is running +/// what the client knows: which files it edited, and which tree is running #[derive(Debug, serde::Deserialize, serde::Serialize)] #[serde(rename_all = "camelCase", deny_unknown_fields)] pub(crate) struct TranspileForBuildParams { - /// the file the user edited, in the project + /// every file of the edit, in the project /// - /// a document rather than a path, so the source that is transpiled is the one the editor holds. + /// documents rather than paths, so the source that is transpiled is the one the editor holds. /// A client that has not saved yet gets the buffer transpiled and the `.by` digest taken over /// that same buffer, which is coherent — though a client doing this for a debugger should save /// first anyway, because the traceback rewriter reads the file from disk. - text_document: TextDocumentIdentifier, + text_documents: Vec, /// the build tree the program is running out of /// @@ -83,30 +91,34 @@ impl RequestHandler for TranspileForBuildRequestHandler { type RequestType = TranspileForBuildRequest; } -impl BackgroundDocumentRequestHandler for TranspileForBuildRequestHandler { - fn document_uri(params: &TranspileForBuildParams) -> Cow<'_, Uri> { - Cow::Borrowed(¶ms.text_document.uri) - } - - fn run_with_snapshot( - db: &ProjectDatabase, - snapshot: &DocumentSnapshot, +// Session-wide rather than a document request, because the edit is several documents and none of +// them is the one the answer is about. +impl BackgroundRequestHandler for TranspileForBuildRequestHandler { + fn run( + snapshot: &SessionSnapshot, _client: &Client, params: TranspileForBuildParams, - ) -> crate::server::Result> { - if snapshot - .workspace_settings() - .is_language_services_disabled() - { - return Ok(None); + ) -> crate::server::Result { + let mut files = Vec::with_capacity(params.text_documents.len()); + for document in ¶ms.text_documents { + let Some(path) = DocumentKey::from_uri(&document.uri).file_path().cloned() else { + // an untitled buffer, a notebook cell. the build was made of files, so there is no + // slot in the tree for one of these + return Ok(Restage::refuse(format!( + "`{}` is not a file on disk, so no build was made from it", + document.uri.as_str(), + ))); + }; + files.push(path); } - let Some(file) = snapshot.to_notebook_or_file(db) else { - return Ok(None); - }; - let Some(path) = file.path(db).as_system_path() else { - // a file with no path on the filesystem — an untitled buffer, a notebook cell. the - // build was made of files, so there is no slot in the tree for one of these - return Ok(None); + + // A build is made of one project, so the set is answered out of that project's database. + // Files in different projects of this session are not an edit to one build, and either + // database would transpile the other project's files against the wrong project. + let Some(db) = project_of(snapshot, &files) else { + return Ok(Restage::refuse( + "the edited files belong to different projects, and a build is made of one", + )); }; // On a thread of its own, and that is not an optimisation — see @@ -116,30 +128,57 @@ impl BackgroundDocumentRequestHandler for TranspileForBuildRequestHandler { // server's worker threads already holds one. let owned = db.clone(); let directory = params.build_directory; - let file = path.as_std_path().to_path_buf(); - let restaged = transpile_detached(move || restage_one(&owned, &directory, &file)); + let files: Vec<_> = files + .into_iter() + .map(SystemPathBuf::into_std_path_buf) + .collect(); + let restaged = transpile_detached(move || restage(&owned, &directory, &files)); // A panic rather than a failure is reported as a refusal for the reason an error is: // a client has one shape to read, and a debugger that got no answer at all would // leave the tree it is about to write into in an unknown state. let Ok(restaged) = restaged else { - return Ok(Some(Restage::Refused(by_stage::restage::Refusal { - refused: "the transpiler panicked while re-staging this file".to_owned(), - diagnostics: Vec::new(), - }))); + return Ok(Restage::refuse( + "the transpiler panicked while re-staging these files", + )); }; match restaged { - Ok(restage) => Ok(Some(restage)), + Ok(restage) => Ok(restage), // an error here is the operation failing rather than refusing — the tree could not be - // read, the file could not be written out. it is reported as a refusal so that a client - // has one shape to read, and the reason is the error's own sentence - Err(error) => Ok(Some(Restage::Refused(by_stage::restage::Refusal { - refused: format!("{error:#}"), - diagnostics: Vec::new(), - }))), + // read, a file could not be read. it is reported as a refusal so that a client has one + // shape to read, and the reason is the error's own sentence + Err(error) => Ok(Restage::refuse(format!("{error:#}"))), } } } +/// The one project database every file of the set belongs to, or `None` when they belong to +/// different ones. +/// +/// A file belongs to the project with the deepest root above it, which is how the session routes a +/// document. A file under no project's root goes to the first project, as the session sends it too +/// — and the re-stage then refuses it as not one of the files the build was made from. +fn project_of<'a>( + snapshot: &'a SessionSnapshot, + files: &[SystemPathBuf], +) -> Option<&'a ProjectDatabase> { + let projects = snapshot.projects(); + let owner = |file: &SystemPath| { + projects + .iter() + .enumerate() + .filter(|(_, db)| file.starts_with(db.project().root(*db))) + .max_by_key(|(_, db)| db.project().root(*db).as_str().len()) + .map_or(0, |(index, _)| index) + }; + let mut owners = files.iter().map(|file| owner(file)); + let first = owners.next().unwrap_or(0); + if owners.all(|other| other == first) { + projects.get(first) + } else { + None + } +} + impl RetriableRequestHandler for TranspileForBuildRequestHandler {} diff --git a/crates/ty_server/src/server/lazy_work_done_progress.rs b/crates/ty_server/src/server/lazy_work_done_progress.rs index 01dbbb5bef..ada7c01e52 100644 --- a/crates/ty_server/src/server/lazy_work_done_progress.rs +++ b/crates/ty_server/src/server/lazy_work_done_progress.rs @@ -63,28 +63,20 @@ impl LazyWorkDoneProgress { percentage: Some(0), }, capabilities, - ProgressCreation::Queue, ) } - /// Returns a progress reporter that displays an indicator if the main-loop action queue has - /// capacity. + /// Returns a progress reporter for work that starts on the main loop itself. /// - /// Server-initiated progress requires sending a request to the client through the main loop. - /// If the queue is full, the progress indicator is not shown. Waiting for capacity would - /// deadlock because the main loop cannot drain its own queue until this call returns. + /// Server-initiated progress asks the client to create the indicator, and that request goes + /// out through the main loop's own queue — which this is called from. The queue takes it + /// without waiting, so the request is simply there when the loop comes round again. pub(crate) fn new_on_main_loop( client: &Client, begin: WorkDoneProgressBegin, capabilities: ResolvedClientCapabilities, ) -> Self { - Self::new_inner( - client, - None, - begin, - capabilities, - ProgressCreation::TryQueue, - ) + Self::new_inner(client, None, begin, capabilities) } fn new_inner( @@ -92,7 +84,6 @@ impl LazyWorkDoneProgress { request_token: Option, begin: WorkDoneProgressBegin, capabilities: ResolvedClientCapabilities, - creation: ProgressCreation, ) -> Self { let work_done = Self { inner: Arc::new(Inner { @@ -131,19 +122,7 @@ impl LazyWorkDoneProgress { } }; - match creation { - ProgressCreation::Queue => client - .send_deferred_request::( - params, - response_handler, - ), - ProgressCreation::TryQueue => { - client.try_send_deferred_request::( - params, - response_handler, - ); - } - } + client.send_deferred_request::(params, response_handler); } work_done @@ -185,12 +164,6 @@ impl LazyWorkDoneProgress { } } -#[derive(Clone, Copy)] -enum ProgressCreation { - Queue, - TryQueue, -} - impl ty_project::UvSyncProgress for LazyWorkDoneProgress {} struct Inner { diff --git a/crates/ty_server/src/server/main_loop.rs b/crates/ty_server/src/server/main_loop.rs index 2413ae3c3c..f6001634a3 100644 --- a/crates/ty_server/src/server/main_loop.rs +++ b/crates/ty_server/src/server/main_loop.rs @@ -24,6 +24,28 @@ pub(crate) type ConnectionSender = crossbeam::channel::Sender; pub(crate) type MainLoopSender = crossbeam::channel::Sender; pub(crate) type MainLoopReceiver = crossbeam::channel::Receiver; +/// The queue every event reaches the main loop through. +/// +/// Unbounded, and it has to be. The main loop is the only thing that takes events out of it, +/// and it is also — through everything it hands a [`Client`] to — one of the things that puts +/// them in: a worker answers a request by queueing the response here, a command-line request +/// arrives here, and a task the main loop runs on its own thread queues from here too. +/// +/// A bounded queue turns that into a cycle. Workers fill it and block; the main loop is by +/// then waiting to hand its next task to those same workers, whose own queue is full; and the +/// one thread that would have drained the events is the thread that is waiting. Nothing after +/// that makes progress — not the editor's requests, not a `by check` asking for the project's +/// diagnostics, not the shutdown that would have ended it. +/// +/// What a bound would have bought is backpressure on work that is already done: an event is a +/// response to hand back or a note to act on, never a unit of work to schedule. Holding one +/// back does not make less of it. What limits how many can be in flight is the number of +/// requests the editor has outstanding, which is what the worker pool's own bounded queue is +/// there to pace. +pub(crate) fn main_loop_channel() -> (MainLoopSender, MainLoopReceiver) { + crossbeam::channel::unbounded() +} + impl Server { pub(super) fn main_loop(&mut self) -> crate::Result<()> { self.initialize(&Client::new( @@ -234,6 +256,23 @@ impl Server { scheduler: &mut Scheduler, client: Client, ) { + // said here, before the re-read and before the check, because what it tells the caller + // is that this loop is running: a connection was accepted by a thread that would have + // accepted it just the same had this loop been wedged, and the caller is sitting on a + // check it could be running instead of waiting + if !incoming.accepted { + incoming.accepted = true; + let token = incoming.token.clone(); + if let Err(error) = project_server::respond( + &mut incoming.connection, + &token, + &project_server::protocol::Response::Accepted, + ) { + tracing::debug!("Failed to take a command-line request: {error}"); + return; + } + } + if incoming.rescanned { api::changes::apply(&mut self.session, &client, &[ChangeEvent::Rescan]); } diff --git a/crates/ty_server/src/server/schedule.rs b/crates/ty_server/src/server/schedule.rs index b9e931476a..ddfc751604 100644 --- a/crates/ty_server/src/server/schedule.rs +++ b/crates/ty_server/src/server/schedule.rs @@ -72,3 +72,56 @@ impl Scheduler { } } } + +#[cfg(test)] +mod tests { + use std::num::NonZeroUsize; + use std::time::Duration; + + use super::thread::{Pool, ThreadPriority}; + use crate::server::{Action, Event, main_loop_channel}; + + /// The main loop hands work to the pool, and it takes what comes back off its own queue — + /// and it has to get through the handing out before it reaches the taking back. So a worker + /// that cannot put its result down stops there: it never returns for the next job, the pool's + /// queue fills up behind it, and the main loop, waiting for room in that queue, never reaches + /// the take that would have let the worker go. Nothing in the server moves after that. + /// + /// Handing out far more work than the pool can hold, before reading anything back, is what a + /// burst of editor requests does to it — with a `by check` asking for the project's + /// diagnostics in among them. + #[test] + fn a_worker_that_has_finished_never_waits_on_the_main_loop() { + const JOBS: usize = 512; + const WORKERS: NonZeroUsize = NonZeroUsize::new(2).unwrap(); + const PATIENCE: Duration = Duration::from_secs(30); + + let (sender, receiver) = main_loop_channel(); + let (dispatched, all_dispatched) = crossbeam::channel::bounded(1); + + let dispatching = std::thread::spawn(move || { + let pool = Pool::new(WORKERS); + for _ in 0..JOBS { + let sender = sender.clone(); + pool.spawn(ThreadPriority::Worker, move || { + // ignored rather than unwrapped: a regression leaves this test's own + // receiver dropped, and a panic in a pool job aborts the process, which + // would take the failure message with it + sender.send(Event::Action(Action::RescanProjects)).ok(); + }); + } + dispatched.send(()).ok(); + }); + + all_dispatched + .recv_timeout(PATIENCE) + .expect("every job to have been handed to the pool without reading any event back"); + + for _ in 0..JOBS { + receiver + .recv_timeout(PATIENCE) + .expect("every job's event to have reached the queue"); + } + dispatching.join().expect("the dispatching thread to end"); + } +} diff --git a/crates/ty_server/src/session/client.rs b/crates/ty_server/src/session/client.rs index e81c791e93..bad3e3e57c 100644 --- a/crates/ty_server/src/session/client.rs +++ b/crates/ty_server/src/session/client.rs @@ -90,26 +90,6 @@ impl Client { } } - /// Attempts to queue a request without blocking the main loop. - /// - /// Returns `false` if the main-loop queue is full or disconnected. - pub(crate) fn try_send_deferred_request( - &self, - params: R::Params, - response_handler: impl FnOnce(&Client, R::Result) + Send + 'static, - ) -> bool - where - R: lsp_types::Request, - { - self.main_loop_sender - .try_send(Event::Action(Action::SendRequest(SendRequest { - method: R::METHOD.to_string(), - params: serde_json::to_value(params).expect("Params to be serializable"), - response_handler: ClientResponseHandler::for_request::(response_handler), - }))) - .is_ok() - } - pub(crate) fn send_request_raw(&self, session: &Session, request: SendRequest) { let id = session .request_queue() diff --git a/crates/ty_server/tests/e2e/alignment_groups.rs b/crates/ty_server/tests/e2e/alignment_groups.rs new file mode 100644 index 0000000000..3ae845e90e --- /dev/null +++ b/crates/ty_server/tests/e2e/alignment_groups.rs @@ -0,0 +1,163 @@ +//! `by/alignmentGroups` over the wire +//! +//! which lines make a group is `ty_ide::alignment_groups`'s; what these cover is that a client +//! gets that grouping decided in display columns at the tab size it sent, and gets those columns +//! back beside positions that stay in the negotiated encoding + +use anyhow::Result; +use lsp_types::{LspRequestMethod, MessageDirection, Request}; +use ruff_db::system::SystemPath; +use ty_server::ClientOptions; + +use crate::TestServerBuilder; + +/// the request as a client sends it, in json throughout +enum AlignmentGroups {} + +impl Request for AlignmentGroups { + type Params = serde_json::Value; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/alignmentGroups"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// `名前` is four columns wide as drawn and two utf-16 code units long, and `x:\tint` reaches +/// column seven at a tab size of four and column eleven at eight +const SOURCE: &str = "\ +名前 = [1] +abcd = [2] + +x:\tint = 1 +abcdefg = 2 +"; + +fn groups(tab_size: u32) -> Result { + let main = SystemPath::new("src/main.py"); + + let mut server = TestServerBuilder::new()? + .with_initialization_options(&ClientOptions::default()) + .with_workspace(SystemPath::new("src"), None)? + .with_file(main, SOURCE)? + .enable_inlay_hints(true) + .build() + .wait_until_workspaces_are_initialized(); + server.open_text_document(main, SOURCE, 1); + + let uri = server.file_uri(main); + Ok(server + .send_request_await::(serde_json::json!({ + "textDocument": { "uri": uri }, + "range": { + "start": { "line": 0, "character": 0 }, + "end": { "line": 5, "character": 0 }, + }, + "tabSize": tab_size, + })) + .expect("a document with inlay hints enabled is answered")) +} + +#[test] +fn columns_are_display_columns_at_the_clients_tab_size() -> Result<()> { + insta::assert_json_snapshot!(groups(4)?, @r#" + [ + { + "members": [ + { + "gapEnd": { + "character": 3, + "line": 0 + }, + "gapEndColumn": 5, + "gapStart": { + "character": 2, + "line": 0 + }, + "gapStartColumn": 4 + }, + { + "gapEnd": { + "character": 5, + "line": 1 + }, + "gapEndColumn": 5, + "gapStart": { + "character": 4, + "line": 1 + }, + "gapStartColumn": 4 + } + ] + }, + { + "members": [ + { + "gapEnd": { + "character": 7, + "line": 3 + }, + "gapEndColumn": 8, + "gapStart": { + "character": 6, + "line": 3 + }, + "gapStartColumn": 7 + }, + { + "gapEnd": { + "character": 8, + "line": 4 + }, + "gapEndColumn": 8, + "gapStart": { + "character": 7, + "line": 4 + }, + "gapStartColumn": 7 + } + ] + } + ] + "#); + Ok(()) +} + +/// the same lines at a tab size of eight: the tabbed `=` moves out of its neighbour's column and +/// that pair stops being a group, while the pair with no tab in it is untouched +#[test] +fn a_different_tab_size_moves_a_tabbed_column() -> Result<()> { + let answer = groups(8)?; + let groups = answer.as_array().expect("an array of groups"); + assert_eq!(groups.len(), 1); + assert_eq!(groups[0]["members"][0]["gapStart"]["line"], 0); + Ok(()) +} + +#[test] +fn a_request_without_a_tab_size_is_refused() -> Result<()> { + let main = SystemPath::new("src/main.py"); + + let mut server = TestServerBuilder::new()? + .with_initialization_options(&ClientOptions::default()) + .with_workspace(SystemPath::new("src"), None)? + .with_file(main, SOURCE)? + .enable_inlay_hints(true) + .build() + .wait_until_workspaces_are_initialized(); + server.open_text_document(main, SOURCE, 1); + + let uri = server.file_uri(main); + let id = server.send_request::(serde_json::json!({ + "textDocument": { "uri": uri }, + "range": { + "start": { "line": 0, "character": 0 }, + "end": { "line": 5, "character": 0 }, + }, + })); + match server.try_await_response::(&id, None) { + Err(crate::AwaitResponseError::RequestFailed(error)) => { + assert_eq!(error.code, lsp_server::ErrorCode::InvalidParams as i32); + } + other => panic!("expected the request to be refused, got {other:?}"), + } + Ok(()) +} diff --git a/crates/ty_server/tests/e2e/build_output.rs b/crates/ty_server/tests/e2e/build_output.rs new file mode 100644 index 0000000000..2d0d316b93 --- /dev/null +++ b/crates/ty_server/tests/e2e/build_output.rs @@ -0,0 +1,107 @@ +//! `by/buildOutput` over the wire +//! +//! the mapping itself is `by_stage::layout`'s; what these cover is that a client, sending a uri, +//! gets back the same layout `by build` writes — the directory, and the module-tree path inside it +//! rather than the directory-tree one — and gets it for paths that are not open documents + +use anyhow::Result; +use lsp_types::{LspRequestMethod, MessageDirection, Request, Uri}; +use ruff_db::system::{SystemPath, SystemPathBuf}; + +use crate::TestServerBuilder; + +/// the request as a client sends it, in json throughout +enum BuildOutput {} + +impl Request for BuildOutput { + type Params = serde_json::Value; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/buildOutput"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +fn ask(server: &mut crate::TestServer, uri: &Uri) -> serde_json::Value { + server + .send_request_await::(serde_json::json!({ "uri": uri })) + .expect("a path inside the project has a place in its build") +} + +/// compared as a path, so that `/` and `\` are the same separator on windows +fn path_of(answer: &serde_json::Value, key: &str) -> Option { + answer[key].as_str().map(SystemPathBuf::from) +} + +#[test] +fn a_source_in_a_src_layout_is_built_into_its_module_path() -> Result<()> { + let pyproject = SystemPath::new("pyproject.toml"); + let main = SystemPath::new("src/pkg/main.by"); + + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new(""), None)? + .with_file( + pyproject, + "[project]\nname = \"demo\"\nversion = \"0.1.0\"\n", + )? + .with_file(SystemPath::new("src/pkg/__init__.py"), "")? + .with_file(main, "def f() -> int:\n return 1\n")? + .build() + .wait_until_workspaces_are_initialized(); + + let root = server.file_path(SystemPath::new("")); + let build = root.join("build"); + let generated = build.join("pkg").join("main.py"); + + let uri = server.file_uri(main); + let answer = ask(&mut server, &uri); + assert_eq!( + path_of(&answer, "projectRoot").as_deref(), + Some(root.as_path()) + ); + assert_eq!( + path_of(&answer, "buildDirectory").as_deref(), + Some(build.as_path()) + ); + assert_eq!( + path_of(&answer, "generated").as_deref(), + Some(generated.as_path()) + ); + assert_eq!(path_of(&answer, "source"), None); + + // and back again, for a generated file that has never been written + let uri = server.file_uri(SystemPath::new("build/pkg/main.py")); + let back = ask(&mut server, &uri); + assert_eq!( + path_of(&back, "source").as_deref(), + Some(server.file_path(main).as_path()) + ); + assert_eq!(path_of(&back, "generated"), None); + Ok(()) +} + +#[test] +fn a_directory_is_placed_without_being_a_source_or_an_output() -> Result<()> { + let main = SystemPath::new("main.by"); + + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new(""), None)? + .with_file(main, "x = 1\n")? + .build() + .wait_until_workspaces_are_initialized(); + + let uri = server.file_uri(SystemPath::new("")); + let answer = ask(&mut server, &uri); + assert_eq!( + path_of(&answer, "buildDirectory").as_deref(), + Some(server.file_path(SystemPath::new("build")).as_path()), + ); + assert_eq!(path_of(&answer, "generated"), None); + assert_eq!(path_of(&answer, "source"), None); + + let uri = server.file_uri(main); + let flat = ask(&mut server, &uri); + assert_eq!( + path_of(&flat, "generated").as_deref(), + Some(server.file_path(SystemPath::new("build/main.py")).as_path()), + ); + Ok(()) +} diff --git a/crates/ty_server/tests/e2e/code_actions.rs b/crates/ty_server/tests/e2e/code_actions.rs index 68bdcef8b9..21ef04ab11 100644 --- a/crates/ty_server/tests/e2e/code_actions.rs +++ b/crates/ty_server/tests/e2e/code_actions.rs @@ -23,7 +23,9 @@ fn code_actions_at( panic!("Expected full diagnostic report") } }, - only: None, + // these are the fixes for diagnostics; the refactorings a range is also + // offered are tested in `refactors` + only: Some(vec![lsp_types::CodeActionKind::QuickFix]), trigger_kind: None, }, work_done_progress_params: lsp_types::WorkDoneProgressParams::default(), @@ -449,3 +451,36 @@ fn an_unresolved_import_in_a_uv_project_is_offered_the_command_that_installs() - Ok(()) } + +/// A basedpython attribute read that only `None` lacks is fixed by reading it with `?.`. +#[test] +fn attribute_missing_only_on_none_is_fixed_with_optional_chaining() -> Result<()> { + let workspace_root = SystemPath::new("src"); + let foo = SystemPath::new("src/foo.by"); + let foo_content = "\ +class User: + name: str + +def f(user: User | None): + return (user).name +"; + + let mut server = TestServerBuilder::new()? + .with_workspace(workspace_root, None)? + .with_file(foo, foo_content)? + .build() + .wait_until_workspaces_are_initialized(); + + server.open_text_document(foo, foo_content, 1); + + let diagnostics = server.document_diagnostic_request(foo, None); + let range = full_range(foo_content); + let code_action_params = code_actions_at(&server, diagnostics, foo, range); + + let code_action_id = server.send_request::(code_action_params); + let code_actions = server.await_response::(&code_action_id); + + insta::assert_json_snapshot!(code_actions); + + Ok(()) +} diff --git a/crates/ty_server/tests/e2e/main.rs b/crates/ty_server/tests/e2e/main.rs index 5f366522c8..59207ca930 100644 --- a/crates/ty_server/tests/e2e/main.rs +++ b/crates/ty_server/tests/e2e/main.rs @@ -27,6 +27,8 @@ //! [`await_request`]: TestServer::await_request //! [`await_notification`]: TestServer::await_notification +mod alignment_groups; +mod build_output; mod call_hierarchy; mod code_actions; mod commands; @@ -42,13 +44,16 @@ mod initialize; mod injections; mod inlay_hints; mod notebook; +mod program_model; mod project_server; mod publish_diagnostics; mod pull_diagnostics; +mod refactors; mod rename; mod script_preparation; mod semantic_tokens; mod signature_help; +mod syntax_outline; mod transpile; mod type_hierarchy; mod will_rename_files; @@ -1482,6 +1487,19 @@ impl TestServerBuilder { self } + /// Let the client resolve a code action's edit with `codeAction/resolve`. + pub(crate) fn enable_code_action_edit_resolve(mut self) -> Self { + self.client_capabilities + .text_document + .get_or_insert_default() + .code_action + .get_or_insert_default() + .resolve_support = Some(lsp_types::ClientCodeActionResolveOptions { + properties: vec!["edit".to_string()], + }); + self + } + /// Enable or disable file watching capability #[expect(dead_code)] pub(crate) fn enable_did_change_watched_files(mut self, enabled: bool) -> Self { diff --git a/crates/ty_server/tests/e2e/program_model.rs b/crates/ty_server/tests/e2e/program_model.rs new file mode 100644 index 0000000000..96cf3868e5 --- /dev/null +++ b/crates/ty_server/tests/e2e/program_model.rs @@ -0,0 +1,271 @@ +//! `by/entryPoint`, `by/testItems` and `by/runModules`: what a module runs as, which tests a file +//! holds, and which file a module name runs — the model an editor's run configurations are built +//! from, answered by the server so the editor never re-derives it from text. + +use anyhow::Result; +use lsp_types::{LspRequestMethod, MessageDirection, Request, Uri}; +use ruff_db::system::SystemPath; +use serde_json::{Value, json}; + +use crate::TestServerBuilder; + +enum EntryPoint {} + +impl Request for EntryPoint { + type Params = Value; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/entryPoint"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +enum TestItems {} + +impl Request for TestItems { + type Params = Value; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/testItems"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +enum RunModules {} + +impl Request for RunModules { + type Params = Value; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/runModules"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// A generic `main` is `main`, a `main(` inside a docstring is not a call, and every parameter +/// comes back as the generated parser registers it — for a file the editor never opened. +#[test] +fn entry_point_is_the_transpilers_reading_of_main() -> Result<()> { + let root = SystemPath::new("project"); + let main = SystemPath::new("project/main.by"); + let content = r#"""" +main() +""" + +def main[T](out_dir: Path, /, count: int = 1, *, mode: "fast" | "slow" = "fast", verbose: bool = False): + """Does the thing.""" +"#; + + let mut server = TestServerBuilder::new()? + .with_workspace(root, None)? + .with_file(main, content)? + .build() + .wait_until_workspaces_are_initialized(); + + let uri = server.file_uri(main); + let response = server + .send_request_await::(json!({ "uri": uri })) + .expect("the server answered nothing at all"); + + assert_eq!(response["guards"], json!([])); + let main = &response["main"]; + assert_eq!(main["entryPoint"], true, "{response:#}"); + assert_eq!(main["moduleInvokesMain"], false); + assert_eq!(main["blockedBy"], Value::Null); + assert_eq!(main["docstring"], "Does the thing."); + assert_eq!( + main["nameRange"]["start"], + json!({ "line": 4, "character": 4 }) + ); + assert_eq!( + main["parameters"], + json!([ + { + "name": "out_dir", "kind": "positional", "required": true, + "annotation": "Path", "default": null, + "cli": { + "converter": "Path", "choices": null, + "flags": ["--out-dir", "--out_dir"], "negativeFlags": [], + }, + }, + { + "name": "count", "kind": "any", "required": false, + "annotation": "int", "default": "1", + "cli": { "converter": "int", "choices": null, "flags": ["--count"], "negativeFlags": [] }, + }, + { + "name": "mode", "kind": "keyword", "required": false, + "annotation": "\"fast\" | \"slow\"", "default": "\"fast\"", + "cli": { + "converter": "str", "choices": ["fast", "slow"], + "flags": ["--mode"], "negativeFlags": [], + }, + }, + { + "name": "verbose", "kind": "keyword", "required": false, + "annotation": "bool", "default": "False", + "cli": { + "converter": null, "choices": null, + "flags": ["--verbose"], "negativeFlags": ["--no-verbose"], + }, + }, + ]) + ); + Ok(()) +} + +/// A hand-written guard is reported as an entry point of its own, and it is what stops `main` +/// being one. +#[test] +fn a_hand_written_guard_keeps_its_own_entry_point() -> Result<()> { + let root = SystemPath::new("project"); + let main = SystemPath::new("project/main.by"); + let content = + "def main(name: str):\n pass\n\nif __name__ == \"__main__\":\n main(\"x\")\n"; + + let mut server = TestServerBuilder::new()? + .with_workspace(root, None)? + .with_file(main, content)? + .build() + .wait_until_workspaces_are_initialized(); + + let uri = server.file_uri(main); + let response = server + .send_request_await::(json!({ "uri": uri })) + .expect("the server answered nothing at all"); + + assert_eq!( + response["guards"], + json!([{ "start": { "line": 3, "character": 0 }, "end": { "line": 3, "character": 25 } }]) + ); + assert_eq!(response["main"]["entryPoint"], false); + assert_eq!(response["main"]["moduleInvokesMain"], true); + Ok(()) +} + +/// A test nested in a function is not one, however its enclosing class came before it, and the +/// answer follows the buffer rather than the disk. +#[test] +fn test_items_are_what_pytest_would_collect() -> Result<()> { + let root = SystemPath::new("project"); + let tests = SystemPath::new("project/tests/test_math.by"); + let helper = SystemPath::new("project/main.by"); + let on_disk = "def test_old():\n pass\n"; + let buffer = r#"class TestA: + def test_one(self): + pass + + class TestNested: + def test_deep(self): + pass + +def outer(): + def test_inner(): + pass + +def test_top(): + pass +"#; + + let mut server = TestServerBuilder::new()? + .with_workspace(root, None)? + .with_file(tests, on_disk)? + .with_file(helper, "def test_not_collected():\n pass\n")? + .build() + .wait_until_workspaces_are_initialized(); + server.open_text_document(tests, buffer, 1); + + let uri = server.file_uri(tests); + let one = server + .send_request_await::(json!({ "uri": uri })) + .expect("the server answered nothing at all"); + let ids = |items: &Value| -> Vec { + fn walk(items: &Value, out: &mut Vec) { + for item in items.as_array().into_iter().flatten() { + out.push(item["id"].as_str().unwrap_or_default().to_owned()); + walk(&item["children"], out); + } + } + let mut out = Vec::new(); + walk(items, &mut out); + out + }; + assert_eq!( + ids(&one["files"][0]["tests"]), + [ + "TestA", + "TestA::test_one", + "TestA::TestNested", + "TestA::TestNested::test_deep", + "test_top" + ] + ); + assert_eq!( + one["files"][0]["tests"][1]["selectionRange"]["start"], + json!({ "line": 12, "character": 4 }) + ); + + let all = server + .send_request_await::(json!({})) + .expect("the server answered nothing at all"); + let files = all["files"].as_array().expect("files"); + assert_eq!(files.len(), 1, "only the test module holds tests: {all:#}"); + assert_eq!(files[0]["uri"], json!(uri)); + Ok(()) +} + +/// A name resolves the way the project resolves it: the configured `run.main` when none is given, a +/// package as its `__main__`, and a file another holds the name of runs under no name at all. +#[test] +fn run_modules_resolve_as_by_run_does() -> Result<()> { + let root = SystemPath::new("project"); + let shadowed = SystemPath::new("project/main.by"); + let src_main = SystemPath::new("project/src/main.by"); + let app = SystemPath::new("project/src/app/__main__.by"); + + let mut server = TestServerBuilder::new()? + .with_workspace(root, None)? + .with_file( + SystemPath::new("project/ty.toml"), + "[run]\nmain = \"app\"\n", + )? + .with_file(shadowed, "def main():\n pass\n")? + .with_file(src_main, "def main():\n pass\n")? + .with_file(SystemPath::new("project/src/app/__init__.by"), "")? + .with_file(app, "def main():\n pass\n")? + .with_file( + SystemPath::new("project/src/twin.by"), + "def main():\n pass\n", + )? + .with_file(SystemPath::new("project/src/twin.py"), "print(1)\n")? + .build() + .wait_until_workspaces_are_initialized(); + + let response = server + .send_request_await::(json!({ "module": "main" })) + .expect("the server answered nothing at all"); + let project = &response["projects"][0]; + + assert_eq!( + project["main"], + json!({ "module": "app", "uri": server.file_uri(app) }) + ); + let requested: Uri = serde_json::from_value(project["requested"]["uri"].clone())?; + let modules = project["modules"].as_array().expect("modules"); + let named_main: Vec<&Value> = modules.iter().filter(|m| m["module"] == "main").collect(); + assert_eq!(named_main.len(), 1, "one file runs as `main`: {project:#}"); + assert_eq!(named_main[0]["uri"], json!(requested)); + // the resolver gives the name to the file in the root it searches first, and the other one runs + // under none. (`by run` itself refuses to stage two files that build to one module, so neither + // pair runs until one is renamed; what is pinned here is that one name never means two files.) + assert_eq!(requested, server.file_uri(src_main)); + let twins: Vec<&Value> = modules.iter().filter(|m| m["module"] == "twin").collect(); + assert_eq!( + twins, + [&json!({ "module": "twin", "uri": server.file_uri("project/src/twin.py") })], + "one of `twin.by` and `twin.py` holds the name: {project:#}" + ); + assert!( + modules.iter().any(|m| m["module"] == "app.__main__"), + "{project:#}" + ); + assert!( + !modules.iter().any(|m| m["module"] == "app"), + "a package's `__init__` is not what `by run app` runs: {project:#}" + ); + Ok(()) +} diff --git a/crates/ty_server/tests/e2e/project_server.rs b/crates/ty_server/tests/e2e/project_server.rs index 56021ecd1a..237541ec0f 100644 --- a/crates/ty_server/tests/e2e/project_server.rs +++ b/crates/ty_server/tests/e2e/project_server.rs @@ -14,9 +14,9 @@ //! own, so that a `by check` running elsewhere on this machine never finds it. use std::io::{BufRead, BufReader, Write}; -use std::net::{Ipv4Addr, SocketAddr, TcpStream}; +use std::net::{Ipv4Addr, SocketAddr, TcpListener, TcpStream}; use std::sync::Arc; -use std::time::Duration; +use std::time::{Duration, Instant}; use anyhow::Result; use ruff_db::diagnostic::{DisplayDiagnosticConfig, DisplayDiagnostics}; @@ -28,7 +28,7 @@ use ty_server::project_server::protocol; use ty_server::project_server::protocol::{ Answer, Build, CheckRequest, PROTOCOL, Payload, Refusal, Request, Response, }; -use ty_server::project_server::{discovery, environment}; +use ty_server::project_server::{client, discovery, environment}; use ty_server::{ClientOptions, DiagnosticMode}; use crate::{TestServer, TestServerBuilder}; @@ -115,11 +115,28 @@ fn request_for(db: &ProjectDatabase) -> Result { /// One round trip on the side channel, bypassing the client so that a test can send something /// a client never would. +/// +/// Every response the main loop reaches is preceded by an acceptance, and this reads past it: +/// what these tests are about is the answer. [`takes_the_request_before_answering_it`] is where +/// the acceptance itself is asserted. fn ask( directory: &TempDir, project_root: &SystemPath, request: impl FnOnce(&discovery::Record) -> Result, ) -> Result> { + match responses(directory, project_root, request)?.as_slice() { + [] => Ok(None), + [Response::Accepted, answered] | [answered] => Ok(Some(answered.clone())), + several => anyhow::bail!("the server said {several:?}"), + } +} + +/// Everything one request is answered with, in order. +fn responses( + directory: &TempDir, + project_root: &SystemPath, + request: impl FnOnce(&discovery::Record) -> Result, +) -> Result> { let candidates = discovery::candidates(published(directory), project_root); let Some(record) = candidates.first().map(|candidate| &candidate.record) else { anyhow::bail!("the server published no record covering `{project_root}`"); @@ -134,17 +151,26 @@ fn ask( connection.write_all(&line)?; connection.flush()?; - let mut response = String::new(); - BufReader::new(&connection).read_line(&mut response)?; - if response.is_empty() { - return Ok(None); - } + let mut answers = BufReader::new(&connection); + let mut responses = Vec::new(); + loop { + let mut response = String::new(); + answers.read_line(&mut response)?; + if response.is_empty() { + return Ok(responses); + } - let answer: Answer = serde_json::from_str(&response)?; - // the caller has no way to know it is talking to the server unless the server proves it - // read the record, so every test asserts it along the way - assert_eq!(answer.token, record.token); - Ok(Some(answer.response)) + let answer: Answer = serde_json::from_str(&response)?; + // the caller has no way to know it is talking to the server unless the server proves + // it read the record, so every test asserts it along the way + assert_eq!(answer.token, record.token); + + let accepted = matches!(answer.response, Response::Accepted); + responses.push(answer.response); + if !accepted { + return Ok(responses); + } + } } /// A well-formed request, which the tests below then spoil one field at a time. @@ -200,6 +226,118 @@ fn answers_what_a_cold_check_would_have() -> Result<()> { Ok(()) } +/// A caller waits on this channel instead of running the check itself, so it has to be able to +/// tell a server that is working from one that is never going to answer. Accepting a connection +/// cannot tell it — that happens on a thread of its own, and would happen just the same with the +/// main loop wedged. So the main loop says so itself, before it re-reads the file system and +/// before it checks anything. +#[test] +fn takes_the_request_before_answering_it() -> Result<()> { + let directory = TempDir::new()?; + let server = server(&directory, &[(SystemPath::new("src/main.py"), MAIN)])?; + let db = cold(&server.file_path(SystemPath::new("src")))?; + + let said = responses(&directory, db.project().root(&db), |record| { + check_request(record, &db) + })?; + + assert!( + matches!(said.as_slice(), [Response::Accepted, Response::Check(_)]), + "the server said {said:?}" + ); + + Ok(()) +} + +/// A request the main loop never sees is answered without one: a listener that has already +/// decided it will not be answered has nothing to promise. +#[test] +fn does_not_take_a_request_it_refuses_out_of_hand() -> Result<()> { + let directory = TempDir::new()?; + let server = server(&directory, &[(SystemPath::new("src/main.py"), MAIN)])?; + let db = cold(&server.file_path(SystemPath::new("src")))?; + + let said = responses(&directory, db.project().root(&db), |record| { + Ok(Request { + protocol: PROTOCOL + 1, + ..check_request(record, &db)? + }) + })?; + + assert!( + matches!( + said.as_slice(), + [Response::Refused { + reason: Refusal::Protocol { .. } + }] + ), + "the server said {said:?}" + ); + + Ok(()) +} + +/// The whole point of asking is to be quicker than checking, so a server that has taken the +/// connection and then gone quiet has to be walked away from — and quickly. It is what a wedged +/// main loop looks like from the outside, and the caller cannot tell it apart from a busy one +/// except by being told. +/// +/// Slow enough to notice if this stops working: what it used to cost was two minutes on a +/// project that checks cold in fifteen seconds. +#[test] +fn walks_away_from_a_server_that_does_not_take_the_request() -> Result<()> { + let directory = TempDir::new()?; + let project = TempDir::new()?; + let project_root = SystemPath::from_std_path(project.path()) + .expect("a temporary directory to be utf-8") + .to_path_buf(); + + // accepted and then never read from, which is a listener thread that is doing its job + // above a main loop that is not doing its own + let silent = TcpListener::bind(SocketAddr::from((Ipv4Addr::LOCALHOST, 0)))?; + let port = silent.local_addr()?.port(); + std::thread::spawn(move || { + let _held: Vec<_> = silent.incoming().filter_map(Result::ok).collect(); + }); + + let build = Build::current("a build both sides are"); + let record = discovery::Record { + protocol: PROTOCOL, + build: build.clone(), + port, + token: "0".repeat(64), + roots: vec![project_root.clone()], + }; + std::fs::write( + directory.path().join("silent.json"), + serde_json::to_vec(&record)?, + )?; + + let asked = Instant::now(); + let answered = client::check( + published(&directory), + CheckRequest { + project_root, + working_directory: SystemPath::new(".").to_path_buf(), + options: serde_json::Value::Null, + environment: String::new(), + force_exclude: false, + verbose: false, + color: false, + }, + &build, + ); + + assert!(answered.is_none(), "a silent server answered"); + assert!( + asked.elapsed() < TIMEOUT, + "waited {:?} on a server that said nothing", + asked.elapsed() + ); + + Ok(()) +} + /// A change made behind the server's back is a change the answer has to include. The editor's /// watcher is what feeds this session, and nothing tells it about a file written by a `git /// checkout`, a code generator, or this test. diff --git a/crates/ty_server/tests/e2e/refactors.rs b/crates/ty_server/tests/e2e/refactors.rs new file mode 100644 index 0000000000..c7d1b36cd7 --- /dev/null +++ b/crates/ty_server/tests/e2e/refactors.rs @@ -0,0 +1,199 @@ +use crate::{AwaitResponseError, TestServer, TestServerBuilder}; +use anyhow::Result; +use lsp_types::{ + CodeAction, CodeActionContext, CodeActionKind, CodeActionParams, CodeActionRequest, + CodeActionResolveRequest, CodeActionResponse, CodeActionTriggerKind, Position, Range, + TextDocumentContentChangeEvent, TextDocumentContentChangeWholeDocument, TextDocumentIdentifier, +}; +use ruff_db::system::SystemPath; + +const SOURCE: &str = "\ +def f(): + x = compute() + return x + +def compute() -> int: + return 1 +"; + +fn caret(line: u32, character: u32) -> Range { + Range::new( + Position::new(line, character), + Position::new(line, character), + ) +} + +fn request( + server: &mut TestServer, + file: &SystemPath, + range: Range, + only: Option>, + trigger_kind: Option, +) -> Vec { + let params = CodeActionParams { + text_document: TextDocumentIdentifier { + uri: server.file_uri(file), + }, + range, + context: CodeActionContext { + diagnostics: Vec::new(), + only, + trigger_kind, + }, + work_done_progress_params: lsp_types::WorkDoneProgressParams::default(), + partial_result_params: lsp_types::PartialResultParams::default(), + }; + server + .send_request_await::(params) + .unwrap_or_default() + .into_iter() + .filter_map(|action| match action { + CodeActionResponse::CodeAction(action) => Some(action), + CodeActionResponse::Command(_) => None, + }) + .collect() +} + +fn server(resolve: bool) -> Result<(TestServer, &'static SystemPath)> { + let workspace_root = SystemPath::new("src"); + let file = SystemPath::new("src/main.py"); + let mut builder = TestServerBuilder::new()? + .with_workspace(workspace_root, None)? + .with_file(file, SOURCE)?; + if resolve { + builder = builder.enable_code_action_edit_resolve(); + } + let mut server = builder.build().wait_until_workspaces_are_initialized(); + server.open_text_document(file, SOURCE, 1); + Ok((server, file)) +} + +/// A client that resolves edits is offered the refactoring without one, and gets +/// the edit when it resolves the action. +#[test] +fn refactoring_edit_is_computed_on_resolve() -> Result<()> { + let (mut server, file) = server(true)?; + + let actions = request(&mut server, file, caret(1, 4), None, None); + let [action] = actions.as_slice() else { + panic!("expected exactly the inline refactoring, got {actions:#?}"); + }; + assert_eq!( + action.kind, + Some(CodeActionKind::new("refactor.inline.variable")) + ); + assert_eq!(action.edit, None); + assert!(action.data.is_some()); + + let resolved = server.send_request_await::(action.clone()); + insta::assert_json_snapshot!(resolved); + + Ok(()) +} + +/// A client that cannot resolve edits gets the edit with the action. +#[test] +fn refactoring_edit_is_sent_to_a_client_that_cannot_resolve() -> Result<()> { + let (mut server, file) = server(false)?; + + let actions = request(&mut server, file, caret(2, 11), None, None); + let [action] = actions.as_slice() else { + panic!("expected exactly the inline refactoring, got {actions:#?}"); + }; + assert_eq!(action.data, None); + insta::assert_json_snapshot!(action.edit); + + Ok(()) +} + +/// A refactoring that cannot be applied is shown, with its reason, only to a +/// user who explicitly asked for refactorings. +#[test] +fn refused_refactoring_is_disabled_only_when_invoked() -> Result<()> { + let workspace_root = SystemPath::new("src"); + let file = SystemPath::new("src/main.py"); + let source = "\ +def f(flag): + if flag: + x = 1 + return x +"; + let mut server = TestServerBuilder::new()? + .with_workspace(workspace_root, None)? + .with_file(file, source)? + .enable_code_action_edit_resolve() + .build() + .wait_until_workspaces_are_initialized(); + server.open_text_document(file, source, 1); + + let automatic = request( + &mut server, + file, + caret(3, 11), + None, + Some(CodeActionTriggerKind::Automatic), + ); + assert_eq!(automatic, Vec::new()); + + let invoked = request( + &mut server, + file, + caret(3, 11), + Some(vec![CodeActionKind::RefactorInline]), + Some(CodeActionTriggerKind::Invoked), + ); + insta::assert_json_snapshot!(invoked); + + Ok(()) +} + +/// Asking only for another kind of action leaves the refactorings out. +#[test] +fn refactoring_is_left_out_when_another_kind_is_requested() -> Result<()> { + let (mut server, file) = server(true)?; + + let actions = request( + &mut server, + file, + caret(1, 4), + Some(vec![CodeActionKind::QuickFix]), + None, + ); + assert_eq!(actions, Vec::new()); + + Ok(()) +} + +/// An action offered against an older version of the document is not resolved +/// against the newer one. +#[test] +fn resolve_after_an_edit_is_content_modified() -> Result<()> { + let (mut server, file) = server(true)?; + + let actions = request(&mut server, file, caret(1, 4), None, None); + let [action] = actions.as_slice() else { + panic!("expected exactly the inline refactoring, got {actions:#?}"); + }; + + server.change_text_document( + file, + vec![ + TextDocumentContentChangeEvent::TextDocumentContentChangeWholeDocument( + TextDocumentContentChangeWholeDocument { + text: format!("\n{SOURCE}"), + }, + ), + ], + 2, + ); + + let id = server.send_request::(action.clone()); + match server.try_await_response::(&id, None) { + Err(AwaitResponseError::RequestFailed(error)) => { + assert_eq!(error.code, lsp_server::ErrorCode::ContentModified as i32); + } + other => panic!("expected the resolve to fail as content modified, got {other:?}"), + } + + Ok(()) +} diff --git a/crates/ty_server/tests/e2e/snapshots/e2e__code_actions__attribute_missing_only_on_none_is_fixed_with_optional_chaining.snap b/crates/ty_server/tests/e2e/snapshots/e2e__code_actions__attribute_missing_only_on_none_is_fixed_with_optional_chaining.snap new file mode 100644 index 0000000000..9114b4ddb5 --- /dev/null +++ b/crates/ty_server/tests/e2e/snapshots/e2e__code_actions__attribute_missing_only_on_none_is_fixed_with_optional_chaining.snap @@ -0,0 +1,96 @@ +--- +source: crates/ty_server/tests/e2e/code_actions.rs +expression: code_actions +--- +[ + { + "title": "Use `?.` to read `name` only when the value is not `None`", + "kind": "quickfix", + "diagnostics": [ + { + "range": { + "start": { + "line": 4, + "character": 11 + }, + "end": { + "line": 4, + "character": 22 + } + }, + "severity": 1, + "code": "unresolved-attribute", + "codeDescription": { + "href": "https://ty.dev/rules#unresolved-attribute" + }, + "source": "ty", + "message": "Attribute `name` is not defined on `None` in union `User | None`\n\nhelp: Use `?.` to read `name` only when the value is not `None`" + } + ], + "isPreferred": false, + "edit": { + "changes": { + "file:///src/foo.by": [ + { + "range": { + "start": { + "line": 4, + "character": 17 + }, + "end": { + "line": 4, + "character": 17 + } + }, + "newText": "?" + } + ] + } + } + }, + { + "title": "Ignore 'unresolved-attribute' for this line", + "kind": "quickfix", + "diagnostics": [ + { + "range": { + "start": { + "line": 4, + "character": 11 + }, + "end": { + "line": 4, + "character": 22 + } + }, + "severity": 1, + "code": "unresolved-attribute", + "codeDescription": { + "href": "https://ty.dev/rules#unresolved-attribute" + }, + "source": "ty", + "message": "Attribute `name` is not defined on `None` in union `User | None`\n\nhelp: Use `?.` to read `name` only when the value is not `None`" + } + ], + "isPreferred": false, + "edit": { + "changes": { + "file:///src/foo.by": [ + { + "range": { + "start": { + "line": 4, + "character": 22 + }, + "end": { + "line": 4, + "character": 22 + } + }, + "newText": " # ty: ignore[unresolved-attribute]" + } + ] + } + } + } +] diff --git a/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization.snap b/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization.snap index 5b7b714e17..5a7fced022 100644 --- a/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization.snap +++ b/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization.snap @@ -54,8 +54,16 @@ expression: initialization_result "documentSymbolProvider": true, "codeActionProvider": { "codeActionKinds": [ - "quickfix" - ] + "quickfix", + "refactor.inline.variable", + "refactor.extract.variable", + "refactor.extract.constant", + "refactor.extract.function", + "refactor.rewrite.returnAnnotation", + "refactor.rewrite.toDataClass", + "refactor.rewrite.fromDataClass" + ], + "resolveProvider": true }, "codeLensProvider": { "resolveProvider": false diff --git a/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization_with_workspace.snap b/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization_with_workspace.snap index 5b7b714e17..5a7fced022 100644 --- a/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization_with_workspace.snap +++ b/crates/ty_server/tests/e2e/snapshots/e2e__initialize__initialization_with_workspace.snap @@ -54,8 +54,16 @@ expression: initialization_result "documentSymbolProvider": true, "codeActionProvider": { "codeActionKinds": [ - "quickfix" - ] + "quickfix", + "refactor.inline.variable", + "refactor.extract.variable", + "refactor.extract.constant", + "refactor.extract.function", + "refactor.rewrite.returnAnnotation", + "refactor.rewrite.toDataClass", + "refactor.rewrite.fromDataClass" + ], + "resolveProvider": true }, "codeLensProvider": { "resolveProvider": false diff --git a/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refactoring_edit_is_computed_on_resolve.snap b/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refactoring_edit_is_computed_on_resolve.snap new file mode 100644 index 0000000000..79f61d8ba9 --- /dev/null +++ b/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refactoring_edit_is_computed_on_resolve.snap @@ -0,0 +1,55 @@ +--- +source: crates/ty_server/tests/e2e/refactors.rs +expression: resolved +--- +{ + "title": "Inline variable `x`", + "kind": "refactor.inline.variable", + "edit": { + "changes": { + "file:///src/main.py": [ + { + "range": { + "start": { + "line": 2, + "character": 11 + }, + "end": { + "line": 2, + "character": 12 + } + }, + "newText": "compute()" + }, + { + "range": { + "start": { + "line": 1, + "character": 0 + }, + "end": { + "line": 2, + "character": 0 + } + }, + "newText": "" + } + ] + } + }, + "data": { + "range": { + "end": { + "character": 4, + "line": 1 + }, + "start": { + "character": 4, + "line": 1 + } + }, + "refactor": "inline-variable", + "uri": "file:///src/main.py", + "version": 1 + } +} diff --git a/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refactoring_edit_is_sent_to_a_client_that_cannot_resolve.snap b/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refactoring_edit_is_sent_to_a_client_that_cannot_resolve.snap new file mode 100644 index 0000000000..b93533674f --- /dev/null +++ b/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refactoring_edit_is_sent_to_a_client_that_cannot_resolve.snap @@ -0,0 +1,36 @@ +--- +source: crates/ty_server/tests/e2e/refactors.rs +expression: action.edit +--- +{ + "changes": { + "file:///src/main.py": [ + { + "range": { + "start": { + "line": 2, + "character": 11 + }, + "end": { + "line": 2, + "character": 12 + } + }, + "newText": "compute()" + }, + { + "range": { + "start": { + "line": 1, + "character": 0 + }, + "end": { + "line": 2, + "character": 0 + } + }, + "newText": "" + } + ] + } +} diff --git a/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refused_refactoring_is_disabled_only_when_invoked.snap b/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refused_refactoring_is_disabled_only_when_invoked.snap new file mode 100644 index 0000000000..a2d8d85198 --- /dev/null +++ b/crates/ty_server/tests/e2e/snapshots/e2e__refactors__refused_refactoring_is_disabled_only_when_invoked.snap @@ -0,0 +1,13 @@ +--- +source: crates/ty_server/tests/e2e/refactors.rs +expression: invoked +--- +[ + { + "title": "Inline variable `x`", + "kind": "refactor.inline.variable", + "disabled": { + "reason": "a read of `x` may see another value, or none" + } + } +] diff --git a/crates/ty_server/tests/e2e/syntax_outline.rs b/crates/ty_server/tests/e2e/syntax_outline.rs new file mode 100644 index 0000000000..d300dd66ab --- /dev/null +++ b/crates/ty_server/tests/e2e/syntax_outline.rs @@ -0,0 +1,202 @@ +//! `by/syntaxOutline`, and the keyword pairs `textDocument/documentHighlight` answers, over the wire +//! +//! the unit tests in `ty_ide` cover what the outline says about a parse. what they cannot cover is +//! the contract a client reads: json, in lsp line/character positions, with the fields a client +//! keys on spelled the way it expects. a position one character out puts an editor's suite one +//! column out, and nothing inside the crate can see it +//! +//! so the params here are written as a client would send them + +use anyhow::Result; +use lsp_types::{ + DocumentHighlightKind, DocumentHighlightParams, DocumentHighlightRequest, LspRequestMethod, + MessageDirection, PartialResultParams, Position, Request, TextDocumentIdentifier, + TextDocumentPositionParams, WorkDoneProgressParams, +}; +use ruff_db::system::SystemPath; +use ty_server::ClientOptions; + +use crate::{TestServer, TestServerBuilder}; + +/// the request as a client sends it, in json throughout +enum SyntaxOutline {} + +impl Request for SyntaxOutline { + type Params = serde_json::Value; + type Result = Option; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/syntaxOutline"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +fn server_with(content: &str) -> Result { + let workspace_root = SystemPath::new("src"); + let main = SystemPath::new("src/main.by"); + + let mut server = TestServerBuilder::new()? + .with_initialization_options(&ClientOptions::default()) + .with_workspace(workspace_root, None)? + .with_file(main, content)? + .build() + .wait_until_workspaces_are_initialized(); + + server.open_text_document(main, content, 1); + Ok(server) +} + +fn outline_of(content: &str) -> Result { + let mut server = server_with(content)?; + let main = SystemPath::new("src/main.by"); + let answer = server + .send_request_await::(serde_json::json!({ + "textDocument": { "uri": server.file_uri(main) }, + })) + .expect("the server answers a file it has open"); + Ok(answer) +} + +/// a range as (start line, start character, end line, end character) +fn range(value: &serde_json::Value) -> (u64, u64, u64, u64) { + ( + value["start"]["line"].as_u64().expect("a start line"), + value["start"]["character"] + .as_u64() + .expect("a start character"), + value["end"]["line"].as_u64().expect("an end line"), + value["end"]["character"] + .as_u64() + .expect("an end character"), + ) +} + +#[test] +fn a_suite_reaches_the_client_with_its_keyword_colon_and_body() -> Result<()> { + let outline = outline_of( + "\ +match: int = 1 +def f(x): + if x: # a: note + return \"a:b\" + else: + pass +", + )?; + + let statements = outline["statements"].as_array().expect("statements"); + assert_eq!(statements.len(), 2); + + // `match: int = 1` is an annotated assignment, and a simple statement carries no clauses + assert_eq!(range(&statements[0]["range"]), (0, 0, 0, 14)); + assert!(statements[0].get("clauses").is_none()); + + let def = &statements[1]["clauses"][0]; + assert_eq!(range(&def["keyword"]), (1, 0, 1, 3)); + assert_eq!(range(&def["colon"]), (1, 8, 1, 9)); + + let if_statement = &def["body"][0]; + assert_eq!(range(&if_statement["range"]), (2, 4, 5, 12)); + let clauses = if_statement["clauses"].as_array().expect("clauses"); + assert_eq!(range(&clauses[0]["keyword"]), (2, 4, 2, 6)); + // the header's colon, not the one in the comment or the string below it + assert_eq!(range(&clauses[0]["colon"]), (2, 8, 2, 9)); + assert_eq!(range(&clauses[0]["body"][0]["range"]), (3, 8, 3, 20)); + assert_eq!(range(&clauses[1]["keyword"]), (4, 4, 4, 8)); + assert_eq!(range(&clauses[1]["range"]), (4, 4, 5, 12)); + + Ok(()) +} + +#[test] +fn a_call_statement_and_its_arguments_reach_the_client() -> Result<()> { + let outline = outline_of("print(a, f\"{b}\")\nprint(c, end=\"\")\n")?; + let statements = outline["statements"].as_array().expect("statements"); + + let call = &statements[0]["call"]; + assert_eq!(range(&call["callee"]), (0, 0, 0, 5)); + assert_eq!(range(&call["arguments"]), (0, 6, 0, 15)); + assert_eq!(call["positionalOnly"], serde_json::json!(true)); + + assert_eq!( + statements[1]["call"]["positionalOnly"], + serde_json::json!(false) + ); + Ok(()) +} + +#[test] +fn a_string_reaches_the_client_with_what_is_inside_it() -> Result<()> { + let outline = outline_of( + "\ +x = f\"é\\n{y}\" +z = \"\"\" + text + \"\"\" +", + )?; + let strings = outline["strings"].as_array().expect("strings"); + assert_eq!(strings.len(), 2); + + // utf-16 positions: `é` is one code unit, and the escape after it starts at character 7 + assert_eq!(range(&strings[0]["range"]), (0, 4, 0, 13)); + assert_eq!(range(&strings[0]["escapes"][0]), (0, 7, 0, 9)); + assert_eq!(range(&strings[0]["interpolations"][0]), (0, 9, 0, 12)); + assert!(strings[0].get("strippedIndent").is_none()); + + // the content's eight, not the closing quotes' four + assert_eq!(strings[1]["strippedIndent"], serde_json::json!(8)); + assert_eq!(range(&strings[1]["range"]), (1, 4, 3, 7)); + Ok(()) +} + +#[test] +fn a_keyword_is_highlighted_with_the_keywords_it_belongs_with() -> Result<()> { + let content = "\ +for x in y: + if x: + break +else: + pass +"; + let mut server = server_with(content)?; + let main = SystemPath::new("src/main.by"); + let params = DocumentHighlightParams { + text_document_position_params: TextDocumentPositionParams { + text_document: TextDocumentIdentifier { + uri: server.file_uri(main), + }, + // on the `break` + position: Position::new(2, 10), + }, + work_done_progress_params: WorkDoneProgressParams::default(), + partial_result_params: PartialResultParams::default(), + }; + let answer = server + .send_request_await::(params) + .expect("a keyword with a family is highlighted"); + + let highlights: Vec<_> = answer + .iter() + .map(|highlight| { + let range = highlight.range; + ( + ( + u64::from(range.start.line), + u64::from(range.start.character), + u64::from(range.end.line), + u64::from(range.end.character), + ), + highlight.kind, + ) + }) + .collect(); + let text = Some(DocumentHighlightKind::Text); + // the loop, the `break` in its body and its `else` — not the `if` the `break` sits in + assert_eq!( + highlights, + vec![ + ((0, 0, 0, 3), text), + ((2, 8, 2, 13), text), + ((3, 0, 3, 4), text), + ] + ); + Ok(()) +} diff --git a/crates/ty_server/tests/e2e/transpile.rs b/crates/ty_server/tests/e2e/transpile.rs index 23ec150673..f45e9f92ec 100644 --- a/crates/ty_server/tests/e2e/transpile.rs +++ b/crates/ty_server/tests/e2e/transpile.rs @@ -10,10 +10,12 @@ //! passed throughout. Only a request does it. use anyhow::Result; +use by_stage::record::BuildRecord; +use by_transforms::config::Config; use lsp_types::{LspRequestMethod, MessageDirection, Request, TextDocumentIdentifier, Uri}; -use ruff_db::system::SystemPath; +use ruff_db::system::{SystemPath, SystemPathBuf}; -use crate::TestServerBuilder; +use crate::{TestServer, TestServerBuilder}; #[derive(Debug, serde::Deserialize, serde::Serialize)] #[serde(rename_all = "camelCase")] @@ -120,3 +122,279 @@ fn transpiling_a_document_answers_rather_than_panicking() -> Result<()> { ); Ok(()) } + +#[derive(Debug, serde::Deserialize, serde::Serialize)] +#[serde(rename_all = "camelCase")] +struct TranspileForBuildParams { + text_documents: Vec, + build_directory: std::path::PathBuf, +} + +enum TranspileForBuild {} + +impl Request for TranspileForBuild { + type Params = TranspileForBuildParams; + // read as json rather than as the server's own type, so the shape a client depends on is what + // is asserted + type Result = serde_json::Value; + const METHOD: LspRequestMethod<'static> = LspRequestMethod::Custom("by/transpileForBuild"); + const MESSAGE_DIRECTION: MessageDirection = MessageDirection::ClientToServer; +} + +/// A tree shaped the way a build leaves one for `project/main.by` and `project/other.by`: the +/// record naming this `by`, and a map holding an entry for each module — with digests that +/// describe nothing, so every file the server answers for comes back changed and moves its entry. +/// +/// Laid out by hand because the build lives in the `by` binary, which this crate's tests cannot +/// run; everything the server reads out of the tree is here. +fn stale_build(server: &TestServer, build: &SystemPath) -> Result { + let project = server.file_path("project"); + let build = server.file_path(build); + std::fs::create_dir_all(build.as_std_path())?; + let record = BuildRecord::new( + project.as_std_path(), + &[project.as_std_path().to_path_buf()], + None, + false, + &Config::default(), + ); + std::fs::write( + build.join("_by_build.json").as_std_path(), + serde_json::to_string_pretty(&record)?, + )?; + // the keys are paths inside python string literals, written the way `by build` writes + // them: joined with the separator this system uses, and with a backslash escaped rather + // than left to start an escape of its own. an unescaped windows path is a bad `\U` + // escape, and a map that does not parse names no file, so every file is refused as one + // the build was not made of + let literal = |path: &SystemPath| path.as_str().replace('\\', "\\\\"); + let entry = |module: &str| { + let generated = literal(&build.join(format!("{module}.py"))); + let source = literal(&project.join(format!("{module}.by"))); + ( + format!(" \"{generated}\": (\"{source}\", [None]),\n"), + format!(" \"{generated}\": {{\"by\": \"sha256:00\", \"py\": \"sha256:00\"}},\n"), + ) + }; + let (main_map, main_digests) = entry("main"); + let (other_map, other_digests) = entry("other"); + std::fs::write( + build.join("_by_sourcemap.py").as_std_path(), + format!( + "SOURCEMAP = {{\n{main_map}{other_map}}}\n\nDIGESTS = {{\n{main_digests}{other_digests}}}\n" + ), + )?; + Ok(build) +} + +fn restage(server: &mut TestServer, build: &SystemPath, modules: &[&str]) -> serde_json::Value { + let params = TranspileForBuildParams { + text_documents: modules + .iter() + .map(|module| TextDocumentIdentifier { + uri: server.file_uri(format!("project/{module}.by")), + }) + .collect(), + build_directory: build.as_std_path().to_path_buf(), + }; + server.send_request_await::(params) +} + +/// **One edit, one map.** Every file of the edit is named in one request, and the answer carries +/// one `_by_sourcemap.py` with each file's entry moved in it. A request per file could only answer +/// with the tree's map plus that one file, so a client writing each answer in turn kept the last +/// file's line table and lost the others'. +/// +/// And the answer is the tree the edit describes: once it is written, asking again finds every +/// file already in place and the map already the one on disk. +#[test] +fn an_edit_to_two_files_is_answered_with_one_map_describing_both() -> Result<()> { + let main = "def go() -> int:\n return 42\n"; + let other = "def other() -> str:\n return \"six\"\n"; + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new("project"), None)? + .with_file("project/main.by", main)? + .with_file("project/other.by", other)? + .build() + .wait_until_workspaces_are_initialized(); + let build = stale_build(&server, SystemPath::new("build"))?; + + let answer = restage(&mut server, &build, &["main", "other"]); + + let files = answer["files"] + .as_array() + .unwrap_or_else(|| panic!("not a re-stage of the set: {answer}")); + assert_eq!(files.len(), 2, "{answer}"); + let map = answer["sourcemap"] + .as_str() + .unwrap_or_else(|| panic!("no map: {answer}")); + for (file, module) in files.iter().zip(["main", "other"]) { + assert!( + file["generated"].as_str().unwrap().ends_with( + SystemPath::new("build") + .join(format!("{module}.py")) + .as_str() + ), + "{file}" + ); + assert_eq!(file["changed"].as_bool(), Some(true), "{file}"); + assert!( + map.contains(file["pyDigest"].as_str().unwrap()) + && map.contains(file["byDigest"].as_str().unwrap()), + "the one map carries {module}'s entry:\n{map}" + ); + } + assert!(!map.contains("sha256:00"), "no entry is left stale:\n{map}"); + + for file in files { + std::fs::write( + file["generated"].as_str().unwrap(), + file["content"].as_str().unwrap(), + )?; + } + std::fs::write(build.join("_by_sourcemap.py").as_std_path(), map)?; + + let again = restage(&mut server, &build, &["main", "other"]); + for file in again["files"].as_array().unwrap() { + assert_eq!(file["changed"].as_bool(), Some(false), "{again}"); + } + assert!(again["sourcemap"].is_null(), "{again}"); + Ok(()) +} + +/// One file that does not check refuses the set by name, and hands back no bytes for the other: a +/// tree holding half of an edit describes a program that never existed. +#[test] +fn one_file_of_an_edit_that_does_not_check_refuses_the_set() -> Result<()> { + let main = "def go() -> int:\n return 42\n"; + let other = "def other() -> int:\n return \"not an int\"\n"; + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new("project"), None)? + .with_file("project/main.by", main)? + .with_file("project/other.by", other)? + .build() + .wait_until_workspaces_are_initialized(); + let build = stale_build(&server, SystemPath::new("build"))?; + // open, as the editor that edited it holds it. a closed one refuses the same way — see + // `a_file_edited_then_closed_that_does_not_check_refuses_the_set` + server.open_text_document(SystemPath::new("project/other.by"), other, 1); + + let answer = restage(&mut server, &build, &["main", "other"]); + + assert_other_refused_for_not_checking(&answer); + Ok(()) +} + +/// The refusal a file that does not check gets, asserted for `other.by`. +fn assert_other_refused_for_not_checking(answer: &serde_json::Value) { + assert!(answer.get("files").is_none(), "{answer}"); + let refusals = answer["refusals"] + .as_array() + .unwrap_or_else(|| panic!("not a refusal: {answer}")); + assert_eq!(refusals.len(), 1, "{answer}"); + assert!( + refusals[0]["file"].as_str().unwrap().ends_with("other.by"), + "{answer}" + ); + assert!( + refusals[0]["refused"] + .as_str() + .unwrap() + .contains("does not check"), + "{answer}" + ); + assert!( + refusals[0]["diagnostics"] + .as_array() + .is_some_and(|diagnostics| diagnostics.iter().any(|d| d + .as_str() + .is_some_and(|d| d.contains("invalid-return-type")))), + "{answer}" + ); +} + +/// **A file the editor has closed is checked all the same.** The edit is saved and its tab closed +/// before the reload is pressed, and this server's default mode reports diagnostics only for open +/// files — but the gate is whether the file checks, not whether an editor is holding it, so the +/// type error must refuse exactly as it does while the file is open. +#[test] +fn a_file_edited_then_closed_that_does_not_check_refuses_the_set() -> Result<()> { + use lsp_types::{TextDocumentContentChangeEvent, TextDocumentContentChangeWholeDocument}; + + let main = "def go() -> int:\n return 42\n"; + let other = "def other() -> int:\n return 6\n"; + let broken = "def other() -> int:\n return \"not an int\"\n"; + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new("project"), None)? + .with_file("project/main.by", main)? + .with_file("project/other.by", other)? + .build() + .wait_until_workspaces_are_initialized(); + let build = stale_build(&server, SystemPath::new("build"))?; + + server.open_text_document(SystemPath::new("project/other.by"), other, 1); + server.change_text_document( + SystemPath::new("project/other.by"), + vec![ + TextDocumentContentChangeEvent::TextDocumentContentChangeWholeDocument( + TextDocumentContentChangeWholeDocument { + text: broken.to_string(), + }, + ), + ], + 2, + ); + server.write_file("project/other.by", broken)?; + server.close_text_document(SystemPath::new("project/other.by")); + + let answer = restage(&mut server, &build, &["main", "other"]); + + assert_other_refused_for_not_checking(&answer); + Ok(()) +} + +/// And a file no editor ever opened is checked too: the request names the files it re-stages, and +/// those are the files it checks. +#[test] +fn a_file_never_opened_that_does_not_check_refuses_the_set() -> Result<()> { + let main = "def go() -> int:\n return 42\n"; + let other = "def other() -> int:\n return \"not an int\"\n"; + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new("project"), None)? + .with_file("project/main.by", main)? + .with_file("project/other.by", other)? + .build() + .wait_until_workspaces_are_initialized(); + let build = stale_build(&server, SystemPath::new("build"))?; + + let answer = restage(&mut server, &build, &["main", "other"]); + + assert_other_refused_for_not_checking(&answer); + Ok(()) +} + +/// A tree nothing says is a build is refused for the whole set, not file by file. +#[test] +fn a_directory_that_is_not_a_build_refuses_the_set() -> Result<()> { + let mut server = TestServerBuilder::new()? + .with_workspace(SystemPath::new("project"), None)? + .with_file("project/main.by", "x: int = 1\n")? + .build() + .wait_until_workspaces_are_initialized(); + let nothing = server.file_path("nothing"); + std::fs::create_dir_all(nothing.as_std_path())?; + + let answer = restage(&mut server, ¬hing, &["main"]); + + let refusals = answer["refusals"].as_array().unwrap(); + assert_eq!(refusals.len(), 1, "{answer}"); + assert!(refusals[0]["file"].is_null(), "{answer}"); + assert!( + refusals[0]["refused"] + .as_str() + .unwrap() + .contains("_by_build.json"), + "{answer}" + ); + Ok(()) +} diff --git a/docs/basedpython/cli-reference.md b/docs/basedpython/cli-reference.md index ba1df84a4f..fe592550a2 100644 --- a/docs/basedpython/cli-reference.md +++ b/docs/basedpython/cli-reference.md @@ -63,6 +63,37 @@ on an import the checker had no complaint about. all of that resolves against the project root rather than the working directory, so `by run` in a subdirectory is still this project +`--launcher PATH` starts the program through another program — a debugger that +has to be the process the program runs in, say — without choosing the +interpreter for it. discovery runs exactly as above, and the program starts as +`PATH MODULE [ARGS...]`, so the launcher is handed the +interpreter `by run` chose and runs once, for the program: the version probe is +still made against the interpreter itself + +`--in-build` runs the program in the tree `by run` staged rather than in the +directory it was typed in. the default is right for an application: a relative +path on the command line, and anything the program reads or writes beside the +project, mean what they meant when they were written. but the project is python +only in the staged tree, which is reachable through `sys.path` alone — and +`sys.path` serves an import and nothing else. so a program whose arguments *are* +the project's own files could not name one: + +```console +$ by run pytest -v tests/test_calc.py +ERROR: file or directory not found: tests/test_calc.py +``` + +the only `tests/test_calc` in the working directory is a `.by`. with +`--in-build` the whole project is there — every transpiled module at its place +in the module tree, and beside them every file the build carries over unchanged, +`pyproject.toml` included — so the path resolves, the tool finds its own +configuration where it always was, and it reports against a tree laid out like +the project: `tests/test_calc.py::TestGroup::test_add`, whatever the source +layout + +it is a flag rather than something inferred because only the caller knows which +of the two directories they mean, and the program's name does not say + the emitted code targets that interpreter's version by default. an explicit `--min-version` wins, but must not exceed the interpreter — `by run` refuses rather than emit code the interpreter cannot parse. an interpreter *older* than @@ -107,7 +138,9 @@ whether anything was *reported*. so a build that prints an error exits 1 while still leaving a usable `build/`, and `by build && pytest build/tests` runs the tests only against a tree the checker had nothing to say about -writes the transpiled python to `./build/` mirroring the *module* tree. a +writes the transpiled python to the project root's `build/` — wherever in the +project it is run, as `by compile` does too; `--out DIR` names another directory, +relative to where you typed it — mirroring the *module* tree. a src-layout project's `src/package_name/main.by` is the module `package_name.main`, so it lands at `build/package_name/main.py` — `build/` is a directory you can put on `sys.path` as it stands, and `run.main` names a module diff --git a/docs/basedpython/features/editor.md b/docs/basedpython/features/editor.md index a53a774add..34354728cd 100644 --- a/docs/basedpython/features/editor.md +++ b/docs/basedpython/features/editor.md @@ -251,10 +251,15 @@ lines were meant to be read together, with `by/alignmentGroups`: "range": { "start": { "line": 0, "character": 0 }, "end": { "line": 1, "character": 13 } - } + }, + "tabSize": 4 } ``` +`tabSize` is required. whether two `=` share a column depends on it as soon as a +tab comes before either, and it is the client's setting rather than anything the +source says, so there is no value the server could assume + the reply is the blocks whose lines the range reaches. `gapStart` is where the padding before the `=` begins and `gapEnd` is the `=` itself, so the difference between them is the room the author left: @@ -263,13 +268,29 @@ between them is the room the author left: [ { "members": [ - { "gapStart": { "line": 0, "character": 5 }, "gapEnd": { "line": 0, "character": 10 } }, - { "gapStart": { "line": 1, "character": 9 }, "gapEnd": { "line": 1, "character": 10 } } + { + "gapStart": { "line": 0, "character": 5 }, + "gapEnd": { "line": 0, "character": 10 }, + "gapStartColumn": 5, + "gapEndColumn": 10 + }, + { + "gapStart": { "line": 1, "character": 9 }, + "gapEnd": { "line": 1, "character": 10 }, + "gapStartColumn": 9, + "gapEndColumn": 10 + } ] } ] ``` +`gapStart` and `gapEnd` are positions, counted in the negotiated encoding's code +units. `gapStartColumn` and `gapEndColumn` are display columns, counted the way a +fixed-width editor lays the line out — a wide character takes two, a combining +mark none, and a tab reaches the next multiple of `tabSize`. those are the +numbers the grouping itself was decided by, and the ones to lay hints out in + a block is a run of assignments that are siblings in one suite, unseparated by a blank line, already sharing a column, and padded — at least one of them written with two or more spaces before its `=`. that last condition is what keeps @@ -293,6 +314,98 @@ a [property](properties.md) is one member in the source, so it is one entry in the outline — not the getter, backing field and setter it lowers into. enum variants and an extension's methods appear under their declarations +## refactorings + +the server offers refactorings as code actions. each is worked out from what the +checker reads the file to mean, not from its text: inlining `x` replaces the reads +of that variable, never a same-named parameter of another function, an attribute +`obj.x` or a keyword argument `f(x=1)` + +a refactoring either keeps the program meaning what it meant or is refused, and a +refusal says why. an editor that asks for refactorings explicitly shows the reason; +one that asks while the caret moves is only offered what applies + +| refactoring | kind | offered on | +| ----------------------- | ----------------------------------- | --------------------------------- | +| inline variable | `refactor.inline.variable` | a variable assigned once | +| extract variable | `refactor.extract.variable` | a selected expression | +| introduce constant | `refactor.extract.constant` | a selected expression of literals | +| extract function | `refactor.extract.function` | selected statements | +| add return annotation | `refactor.rewrite.returnAnnotation` | a `def` header with no `->` | +| convert to data class | `refactor.rewrite.toDataClass` | a class header | +| convert from data class | `refactor.rewrite.fromDataClass` | a `data class` header | + +moving an expression can change when it runs, so that is what most refusals are +about. a value with an effect is only inlined into a single read in the very next +statement, with nothing that could observe the move evaluated before it; an +expression is only extracted above its statement when it runs exactly once each +time the statement does — not in a loop condition, a conditional branch, a lambda +or after a call + +```by +while queue.pending(): # extracting `queue.pending()` is refused: it runs every iteration + queue.pop() +``` + +extracting statements from a method makes a method of the same class, called +through the receiver. what the statements read from the function becomes a +parameter, and what they assign that is read afterwards is returned + +a constant goes further than a variable: it is bound at the top of the module, so +it is evaluated as the module loads whether or not the expression would have been +evaluated at all. only an expression made of literals that cannot raise is +hoisted, and whether an operation over literals raises is asked of the checker +rather than read off its spelling — `60 * 60 * 24` is offered because ty folds it +to `86400`, while `1 / 0` and `1 + "a"` are not offered at all + +a client that can resolve a code action's edit gets the action without one, and the +edit is computed when the action is chosen — against the document version it was +offered for, and refused as content modified if the document changed since. this +defers sending the edit, not working it out: whether a refactoring applies is +decided by working out the rewrite, so the actions a `textDocument/codeAction` +reply offers have each been computed to answer it. send `only` to narrow that — +a request that does not ask for `refactor` kinds does no refactoring work at all + +## keyword highlighting + +`textDocument/documentHighlight` on a keyword answers the keywords that belong +with it rather than the occurrences of a symbol: the `elif`s and `else` of an +`if`, the `except`, `else` and `finally` of a `try`, the `return`s of a `def`. +the pairing is read off the parse tree, so `match = 1` is an assignment and +nothing lights up on it. a position that is not a keyword is answered the way it +always was + +## the program model + +a run configuration, a test list and a "go to generated file" are all questions +about the project rather than about a position in a file, and each used to be an +editor's own guess at a layout the build decides. the server answers them +instead, from the same reading the transpiler and the checker use: + +| request | answers | +| ------------------ | --------------------------------------------------------------------------- | +| `by/entryPoint` | whether a module has a `main`, and the command line the transpiler gives it | +| `by/testItems` | the tests pytest collects from a document, with their node ids | +| `by/runModules` | the modules `by run` can be given, and the one `run.main` names | +| `by/buildOutput` | where a project's build writes, and which output came from which source | +| `by/syntaxOutline` | a document's suites, clause keywords, call statements and string parts | + +`by/buildOutput` maps both ways: given a `.by` it names the file the build writes +it to, given a file in the build directory it names the source. the path inside +the build follows the *module* tree, not the directory tree, so a src-layout +project's `src/pkg/main.by` is `build/pkg/main.py` — which is why this is the +build's answer rather than a path an editor can assemble + +`by/syntaxOutline` answers one document whole, on every revision the client wants +to serve features from: it is what an editor needs to type in an +indentation-delimited language — which line opens a suite, where a compound +statement ends, what a string literal's escapes and interpolations are, and how +much indentation a triple-quoted string has stripped + +`.by` test files are collected under the same names as python ones — `test_*.by` +and `*_test.by` — because a `.by` transpiles to the `.py` of the same stem, and +that is the file pytest sees + ## debugger facts while a program is stopped, an editor knows something no checker does: what the diff --git a/docs/basedpython/features/modifiers.md b/docs/basedpython/features/modifiers.md index 301c5fabb1..84492ccf10 100644 --- a/docs/basedpython/features/modifiers.md +++ b/docs/basedpython/features/modifiers.md @@ -362,6 +362,61 @@ a visibility keyword says who may reach a class member, or marks a module-level declaration as the module's own. a declaration inside a function body is a local, which nothing outside the function reaches anyway, so a keyword on one is an error +### a leading underscore means unused + +privacy is spelled with `private` and `protected`, so in a `.by` file a leading +underscore says only that a name is unused. using one is `used-underscore-name`, a +warning: + +```by +def _parse(text: str) -> int: + return int(text) + +_parse("1") # warning: `_parse` is used, but its leading underscore marks it unused +``` + +drop the underscore, or say what the underscore stood for: + +```by +private def parse(text: str) -> int: + return int(text) + +parse("1") +``` + +on a class member the keyword to reach for is `protected`, not `private`: both draw +a boundary, but `private` is emitted as `__name`, which python mangles, while +`protected` is emitted as `_name` — the name python code already reads it by + +every use of a name the `.by` source spelled is reported: a variable, a parameter, +a function or class, a module of a `.by` package, an import from another `.by` +module, a keyword argument naming a parameter or a dataclass field, the target of a +`del`, and a member of a `.by` class — whether it is read through `self`, +`super()`, an instance, the class, a class pattern keyword, an `extension`, an +[inline protocol](inline-protocol.md), or a [trailing lambda +block](trailing-lambdas.md) + +a name someone else spelled is left alone, because it is not yours to rename: + +- a name declared in python or a stub — a library's `_internal`, a named tuple's + `_asdict`, `sys._getframe` +- an override of a member a python or stub base class declares — `_missing_` on + an enum keeps the name `Enum` gave it +- a member of a class whose bases cannot all be resolved, which may declare it +- a name basedpython spells for you — a property's `field` storage, the `_0` + fields of an [enum](enums.md) variant, the `self._x = _x` an + [`init(let _x: int)`](init-method.md) stands for +- `_` and dunders, which python gives meanings of their own + +an import alias spells a name of its own: `from lib import helper as _helper` is +reported where `_helper` is used, and `from helpers import _parse as parse` only +at the import. a `.py` file keeps python's convention and is never reported + +python converted with [`by transpile --reverse`](../cli-reference.md) keeps the +names it was written with, underscores included, so a converted file reports every +use of one. that is the question worth answering once per name: rename it, or say +`protected` or `private` and keep the python spelling the keyword emits + ## inlay hints a method that overrides a superclass member without saying so gets an diff --git a/docs/basedpython/features/optional-chaining.md b/docs/basedpython/features/optional-chaining.md index f0ab2d9f2f..81d12ceec1 100644 --- a/docs/basedpython/features/optional-chaining.md +++ b/docs/basedpython/features/optional-chaining.md @@ -84,6 +84,11 @@ user?.address.city # error: `address` may be None add a `?.` at the step that needs guarding — `user?.address?.city` is `str | None` +when `None` is the only part of a value's type that lacks the attribute, the +`unresolved-attribute` error carries a quick fix that writes that `?.`. it is an +unsafe fix: the read now evaluates to `None` where it used to raise, and +whatever uses it has to handle that + ## scope `?.` is recognized in attribute-access expressions only. there is no optional diff --git a/docs/basedpython/features/project-server.md b/docs/basedpython/features/project-server.md index 9bad89ec83..4eea4f0812 100644 --- a/docs/basedpython/features/project-server.md +++ b/docs/basedpython/features/project-server.md @@ -37,6 +37,10 @@ configuration, when they resolved different environments, when a file open in th unsaved changes, and when the session is being typed into so fast that the check keeps being cancelled +a server that says nothing at all is given up on rather than waited for. it takes your request +before it starts on it, so one that is stuck, or busy enough that it has not reached you, costs +a few seconds and then the check runs the way it always did + **any flag that changes the check is a different check.** `--python-version`, `--error-on-warning`, `--output-format` and the rest all land in the configuration the two compare, so a `by check` carrying one of them is always run in full. so is a `-v` check, whose diff --git a/docs/basedpython/features/tuple-types.md b/docs/basedpython/features/tuple-types.md index f43a5c045c..58deae7068 100644 --- a/docs/basedpython/features/tuple-types.md +++ b/docs/basedpython/features/tuple-types.md @@ -62,10 +62,52 @@ positions the form is written in — another `type` alias, or any annotation onc that unpacks an alias raises at import, exactly as the same annotation would in python. unpacking a tuple type or a `TypeVarTuple` directly has no such limit +## repetition + +a tuple type multiplied by `int` is that tuple repeated any number of times, +including none. its length is unknown, but its elements still come in order: + +```by +def pairs(n: int) -> (int, str) * int: + return (1, "a") * n +``` + +multiplying a tuple value by an `int` whose value is unknown already has this +type, so the element at each position stays known: + +```by +def first_pair(n: int) -> (int, str)?: + items = (1, "a") * n + if not items: + return None + return items[0], items[1] +``` + +fixed elements before or after the repetitions unpack it into the outer tuple: + +```by +framed: (bytes, *(int, str) * int, bytes) +``` + +a tuple is only assignable when it is a whole number of repetitions, so +`(1, "a", 2)` is not a `(int, str) * int`, and unpacking one into three targets +is always an `invalid-assignment`. the length of the repeated run is part of the +type: every `(int, str, int, str) * int` is an `(int, str) * int`, but not the +other way around. a run of one element is the tuple that repeats it, so +`(int,) * int` is `(*: int)` + +python has no spelling for the repeated order, so the lowered annotation keeps +only which types the elements can be: + +```python +def pairs(n: int) -> tuple[int | str, ...]: + return (1, "a") * n +``` + ## syntax ```text -tuple_type ::= "(" element ("," element)* [","] ")" +tuple_type ::= "(" element ("," element)* [","] ")" | tuple_type "*" "int" element ::= type | "*" type ``` diff --git a/docs/basedpython/features/type-is.md b/docs/basedpython/features/type-is.md index 6bb81f5189..debbe16344 100644 --- a/docs/basedpython/features/type-is.md +++ b/docs/basedpython/features/type-is.md @@ -179,8 +179,7 @@ whose result is tested: ```by def check(x: int | None) -> asserts x: - if x is None: - raise ValueError + assert x def f(a: int | None): check(a) @@ -202,18 +201,60 @@ an assertion guard returns `None` — it raises when the assertion doesn't hold ```python def check(x: int | None) -> None: - if x is None: - raise ValueError + assert x ``` `and` asserts every place it names: ```by def check(a: int | None, b: str | None) -> asserts a is int and b: - if a is None or not b: + assert a is not None and b +``` + +every call narrows on the strength of the annotation, so the body has to +establish what it asserts wherever it returns — at each `return`, and at the +end of the body. ruling out `None` is not the same as truthiness, since `0` is +still falsy: + +```by +def check(x: int | None) -> asserts x: # error: `x` is `int` where the body ends + if x is None: raise ValueError ``` +a parameter is the argument the caller passed, so a body that assigns to it +establishes nothing about the argument. the same goes for a place: a local of +that name is a different place from the one a call narrows. a member is read +back by the caller, so assigning to one is how a body establishes it: + +```by +class Holder: + data: int | None = None + + def load(self) -> asserts self.data is not None: + self.data = 1 +``` + +an assertion an overridden method makes is one its callers rely on whatever the +value they hold turns out to be, so an override makes the same assertion — its +callers narrow by it too — and has to establish it in its own body. the guard +follows the parameter by position, so an override may rename a positional-only +parameter + +some ways out of a body are left alone rather than checked: a `return` a +`finally` suite can follow hands control back only once that suite has run, and +what the suite leaves behind is not modelled. such a body is neither read as +establishing an assertion nor reported for failing to. a `...` body declares a +function without implementing one — in a stub, an `@overload`, an +`@abstractmethod`, or a `Protocol` — so the claim is for whatever implements it + +what a body establishes is read the same way narrowing is, and rests on the +same thing: a call that mutates what was narrowed, or an alias that writes to +it, leaves the claim standing where it no longer holds. an argument a +[conversion](conversions.md) rewrites is another such case — the callee is +handed the converted value, while the narrowing lands on the place the call +was written with + an assertion narrows when it is called as a *statement*, which is where an assertion is written. its value is the `None` it returns, so testing that value (`if check(x):`) or binding it (`ok = check(x)`) is an error — it gets no @@ -221,6 +262,31 @@ narrowing, and the test is always false. a call whose arguments are unpacked (`check(*args)`) doesn't say which argument reached the parameter, so it narrows nothing +## an assertion that was never written down + +a `def` that leaves its return type out and returns nothing asserts what its +body establishes, and callers narrow by that too: + +```by +def check(x: int | None): + assert x + +def f(a: int | None): + check(a) + a # int, and truthy +``` + +what is asserted is what every way out of the body agrees on — each `return` +it can reach, and the end of the body — so an early `return` before the +assertion leaves nothing asserted, and so does a body that catches its own +failure. as with a predicate, a parameter the body rebinds asserts nothing, and +neither does an `async def`, whose call does not run the body. a body that +hands back a value is not an assertion, since the narrowing only reaches a call +written as a statement + +an override is handed what the method it overrides asserts, recovered or +written, and is checked against it + ## asserting a type `asserts x is T` narrows by a type instead of by truthiness, and `is not` @@ -255,8 +321,7 @@ nothing at every call site, which is almost always a typo: ```by def check(value: int | None) -> asserts values: # error: `values` is nothing - if value is None: - raise ValueError + assert value ``` ## scope diff --git a/ty.schema.json b/ty.schema.json index db038b2b8e..5d6a1d7271 100644 --- a/ty.schema.json +++ b/ty.schema.json @@ -1942,7 +1942,7 @@ }, "narrowing-guard-as-value": { "title": "detects an assertion guard whose result is used as a value", - "description": "## What it does\nChecks for a call to a basedpython assertion guard whose result is used as a value.\n\n## Why is this bad?\nAn assertion guard narrows once it *returns*, so it is written as a statement:\n`check(x)`. Its value is `None` — it raises when the assertion doesn't hold — so\ntesting that value (`if check(x):`) or binding it (`ok = check(x)`) never gets the\nnarrowing, and the test is always false.\n\n## Example\n\n```by\ndef check(x: int | None) -> asserts x:\n if x is None:\n raise ValueError\n\ndef f(a: int | None):\n if check(a): # error: the guard narrows as a statement, not as a test\n ...\n```", + "description": "## What it does\nChecks for a call to a basedpython assertion guard whose result is used as a value.\n\n## Why is this bad?\nAn assertion guard narrows once it *returns*, so it is written as a statement:\n`check(x)`. Its value is `None` — it raises when the assertion doesn't hold — so\ntesting that value (`if check(x):`) or binding it (`ok = check(x)`) never gets the\nnarrowing, and the test is always false.\n\n## Example\n\n```by\ndef check(x: int | None) -> asserts x:\n assert x\n\ndef f(a: int | None):\n if check(a): # error: the guard narrows as a statement, not as a test\n ...\n```", "default": "error", "oneOf": [ { @@ -2530,6 +2530,16 @@ } ] }, + "unestablished-assertion-guard": { + "title": "detects an assertion guard its function can return without establishing", + "description": "## What it does\nChecks that a function with a basedpython assertion guard establishes what it asserts\nwherever it returns.\n\n## Why is this bad?\n`-> asserts x` tells every caller that `x` is truthy once the call has returned, and each\ncall narrows its argument on the strength of that. A body that can return without having\nestablished it — by falling off its end, or through a `return` — narrows the caller's\nargument to something it may not be.\n\n## Example\n\n```by\ndef check(x: int | None) -> asserts x: # error: `x` can still be `0` here\n if x is None:\n raise ValueError\n```\n\nUse instead:\n\n```by\ndef check(x: int | None) -> asserts x:\n assert x\n```", + "default": "error", + "oneOf": [ + { + "$ref": "#/definitions/Level" + } + ] + }, "unhandled-exception": { "title": "detects an exception escaping the `main` entry point", "description": "## What it does\nChecks for an exception that can escape a basedpython `main` function.\n\n## Why is this bad?\n`main` is the program's entry point, so it has no caller to handle what\nit raises. An exception escaping it terminates the program with a\ntraceback rather than an error the program chose to report.\n\n## Example\n\n```by\ndef read() raises OSError: ...\n\ndef main():\n read() # error: `OSError` can escape `main`\n```", @@ -2672,7 +2682,7 @@ }, "unresolved-narrowing-guard": { "title": "detects a narrowing return annotation that names no place", - "description": "## What it does\nChecks for a basedpython narrowing return annotation whose place doesn't exist.\n\n## Why is this bad?\n`-> asserts x` and `-> x is T` name the place a call narrows. The name is\nresolved against the function's parameters, and otherwise against the places\nvisible where the guard is written. A name that is neither — a typo, or a\nparameter that was later renamed — silently narrows nothing at every call site.\n\n## Example\n\n```by\ndef check(value: int | None) -> asserts values: # error: `values` is nothing\n if value is None:\n raise ValueError\n```", + "description": "## What it does\nChecks for a basedpython narrowing return annotation whose place doesn't exist.\n\n## Why is this bad?\n`-> asserts x` and `-> x is T` name the place a call narrows. The name is\nresolved against the function's parameters, and otherwise against the places\nvisible where the guard is written. A name that is neither — a typo, or a\nparameter that was later renamed — silently narrows nothing at every call site.\n\n## Example\n\n```by\ndef check(value: int | None) -> asserts values: # error: `values` is nothing\n assert value\n```", "default": "error", "oneOf": [ { @@ -2870,6 +2880,16 @@ } ] }, + "used-underscore-name": { + "title": "detects a use of a name a leading underscore marks as unused", + "description": "## What it does\nChecks for a use of a name that a `.by` file spelled with a leading\nunderscore: a variable, a parameter, a function, a class, an import, or a\nmember of a class declared in a `.by` file.\n\n## Why is this bad?\nbasedpython spells privacy with `private` and `protected`, so a leading\nunderscore says one thing only: the name is unused. A use contradicts it,\nand a reader who trusts the underscore skips over code that matters.\n\nA name spelled by python or a stub is not reported — a library's\n`_internal`, `_asdict`, an override of a python base class's `_hook` — and\nneither is `_` or a dunder, which python gives meanings of their own.\n\n## Example\n\n```by\ndef _parse(text: str) -> int:\n return int(text)\n\n_parse(\"1\") # warning: `_parse` is used\n```\n\nDrop the underscore, or declare the name `private`:\n\n```by\nprivate def parse(text: str) -> int:\n return int(text)\n\nparse(\"1\")\n```", + "default": "warn", + "oneOf": [ + { + "$ref": "#/definitions/Level" + } + ] + }, "useless-overload-body": { "title": "detects `@overload`-decorated functions with non-stub bodies", "description": "## What it does\n\nChecks for various `@overload`-decorated functions that have non-stub bodies.\n\n## Why is this bad?\n\nFunctions decorated with `@overload` are ignored at runtime; they are overridden by the\nimplementation function that follows the series of overloads. While it is not illegal to provide a\nbody for an `@overload`-decorated function, it may indicate a misunderstanding of how the\n`@overload` decorator works.\n\n## Example\n\n```toml\n[environment]\npython-version = \"3.11\"\n```\n\n```py\nfrom typing import overload\n\n\n@overload\ndef foo(x: int) -> int:\n # will never be executed\n return x + 1 # error\n\n\n@overload\ndef foo(x: str) -> str:\n # will never be executed\n return \"Oh no, got a string\" # error\n\n\ndef foo(x: int | str) -> int | str:\n raise Exception(\"unexpected type encountered\")\n```\n\nUse instead:\n\n```py\nfrom typing import assert_never, overload\n\n\n@overload\ndef foo(x: int) -> int: ...\n\n\n@overload\ndef foo(x: str) -> str: ...\n\n\ndef foo(x: int | str) -> int | str:\n if isinstance(x, int):\n return x + 1\n elif isinstance(x, str):\n return \"Oh no, got a string\"\n else:\n assert_never(x)\n```\n\n## References\n\n- [Python documentation: `@overload`](https://docs.python.org/3/library/typing.html#typing.overload)",