rust/tests/ui/crashes/cc_seme.rs

// Test for https://github.com/rust-lang/rust-clippy/issues/478

enum Baz {
    One,
    Two,
}

struct Test {
    t: Option<usize>,
    b: Baz,
}

fn main() {}

pub fn foo() {
    use Baz::*;
    let x = Test { t: Some(0), b: One };

    match x {
        Test { t: Some(_), b: One } => unreachable!(),
        Test { t: Some(42), b: Two } => unreachable!(),
        Test { t: None, .. } => unreachable!(),
        Test { .. } => unreachable!(),
    }
}
Merge commit '7901289135257ca0fbed3a5522526f95b0f5edba' into clippy-subtree-update 2024-09-24 04:58:04 -05:00			`// Test for https://github.com/rust-lang/rust-clippy/issues/478`
Move run-pass tests to UI tests This should give us more UI coverage for free. It also removes the `run-pass` suite, so we now only have the `ui` suite. 2019-02-06 00:45:57 -06:00
fix cc computation in the presence of diverging calls CFG treats diverging calls as its completely own path out of the function. While this makes sense, it should also mean that a panic should increase the cyclomatic complexity. Instead it decreases it. Minimal example: ```rust if a { b } else { panic!("cake"); } d ``` creates the following graph ```dot digraph G { "if a" -> "b" "if a" -> "panic!(\"cake\")" "b" -> c } ``` which has a CC of 1 (3 - 4 + 2). A CC of 1 means there is one path through the program. Obviously that is wrong. There are two paths. One returning normally, and one panicking. 2015-12-14 07:29:20 -06:00			`enum Baz {`
fallout 2016-02-01 05:51:33 -06:00			`One,`
			`Two,`
fix cc computation in the presence of diverging calls CFG treats diverging calls as its completely own path out of the function. While this makes sense, it should also mean that a panic should increase the cyclomatic complexity. Instead it decreases it. Minimal example: ```rust if a { b } else { panic!("cake"); } d ``` creates the following graph ```dot digraph G { "if a" -> "b" "if a" -> "panic!(\"cake\")" "b" -> c } ``` which has a CC of 1 (3 - 4 + 2). A CC of 1 means there is one path through the program. Obviously that is wrong. There are two paths. One returning normally, and one panicking. 2015-12-14 07:29:20 -06:00			`}`

			`struct Test {`
			`t: Option<usize>,`
			`b: Baz,`
			`}`

rustfmt tests 2018-12-09 16:26:16 -06:00			`fn main() {}`
Remove all mention and testing of #[plugin(clippy)] and warn if used 2018-05-11 06:20:39 -05:00
			`pub fn foo() {`
fix cc computation in the presence of diverging calls CFG treats diverging calls as its completely own path out of the function. While this makes sense, it should also mean that a panic should increase the cyclomatic complexity. Instead it decreases it. Minimal example: ```rust if a { b } else { panic!("cake"); } d ``` creates the following graph ```dot digraph G { "if a" -> "b" "if a" -> "panic!(\"cake\")" "b" -> c } ``` which has a CC of 1 (3 - 4 + 2). A CC of 1 means there is one path through the program. Obviously that is wrong. There are two paths. One returning normally, and one panicking. 2015-12-14 07:29:20 -06:00			`use Baz::*;`
Run rustfmt 2017-04-12 04:06:32 -05:00			`let x = Test { t: Some(0), b: One };`
fix cc computation in the presence of diverging calls CFG treats diverging calls as its completely own path out of the function. While this makes sense, it should also mean that a panic should increase the cyclomatic complexity. Instead it decreases it. Minimal example: ```rust if a { b } else { panic!("cake"); } d ``` creates the following graph ```dot digraph G { "if a" -> "b" "if a" -> "panic!(\"cake\")" "b" -> c } ``` which has a CC of 1 (3 - 4 + 2). A CC of 1 means there is one path through the program. Obviously that is wrong. There are two paths. One returning normally, and one panicking. 2015-12-14 07:29:20 -06:00
			`match x {`
fallout 2016-02-01 05:51:33 -06:00			`Test { t: Some(_), b: One } => unreachable!(),`
rustfmt tests 2018-12-09 16:26:16 -06:00			`Test { t: Some(42), b: Two } => unreachable!(),`
fix cc computation in the presence of diverging calls CFG treats diverging calls as its completely own path out of the function. While this makes sense, it should also mean that a panic should increase the cyclomatic complexity. Instead it decreases it. Minimal example: ```rust if a { b } else { panic!("cake"); } d ``` creates the following graph ```dot digraph G { "if a" -> "b" "if a" -> "panic!(\"cake\")" "b" -> c } ``` which has a CC of 1 (3 - 4 + 2). A CC of 1 means there is one path through the program. Obviously that is wrong. There are two paths. One returning normally, and one panicking. 2015-12-14 07:29:20 -06:00			`Test { t: None, .. } => unreachable!(),`
			`Test { .. } => unreachable!(),`
			`}`
			`}`