2018-07-28 17:34:52 +02:00
|
|
|
#![warn(clippy::integer_arithmetic, clippy::float_arithmetic)]
|
2018-12-09 23:26:16 +01:00
|
|
|
#![allow(
|
|
|
|
unused,
|
|
|
|
clippy::shadow_reuse,
|
|
|
|
clippy::shadow_unrelated,
|
|
|
|
clippy::no_effect,
|
2020-03-17 23:32:30 +01:00
|
|
|
clippy::unnecessary_operation,
|
2020-04-03 03:46:01 +02:00
|
|
|
clippy::op_ref
|
2018-12-09 23:26:16 +01:00
|
|
|
)]
|
2018-12-08 18:56:59 +01:00
|
|
|
|
|
|
|
#[rustfmt::skip]
|
2016-04-30 04:01:47 +02:00
|
|
|
fn main() {
|
2019-09-26 09:47:06 +02:00
|
|
|
let mut i = 1i32;
|
2020-10-26 14:58:22 +01:00
|
|
|
let mut var1 = 0i32;
|
|
|
|
let mut var2 = -1i32;
|
2017-02-08 14:58:07 +01:00
|
|
|
1 + i;
|
|
|
|
i * 2;
|
|
|
|
1 %
|
2016-04-30 17:11:59 +02:00
|
|
|
i / 2; // no error, this is part of the expression in the preceding line
|
2017-02-08 14:58:07 +01:00
|
|
|
i - 2 + 2 - i;
|
2019-01-21 13:59:49 +01:00
|
|
|
-i;
|
2020-04-13 05:11:19 +02:00
|
|
|
i >> 1;
|
|
|
|
i << 1;
|
2019-01-21 13:59:49 +01:00
|
|
|
|
|
|
|
// no error, overflows are checked by `overflowing_literals`
|
|
|
|
-1;
|
|
|
|
-(-1);
|
2016-05-13 16:43:47 +02:00
|
|
|
|
2016-04-30 04:01:47 +02:00
|
|
|
i & 1; // no wrapping
|
2016-05-13 16:43:47 +02:00
|
|
|
i | 1;
|
2016-04-30 04:01:47 +02:00
|
|
|
i ^ 1;
|
2016-05-13 16:43:47 +02:00
|
|
|
|
2019-09-26 09:47:06 +02:00
|
|
|
i += 1;
|
|
|
|
i -= 1;
|
|
|
|
i *= 2;
|
|
|
|
i /= 2;
|
2020-10-26 14:58:22 +01:00
|
|
|
i /= 0;
|
|
|
|
i /= -1;
|
|
|
|
i /= var1;
|
|
|
|
i /= var2;
|
2019-09-26 09:47:06 +02:00
|
|
|
i %= 2;
|
2020-10-26 14:58:22 +01:00
|
|
|
i %= 0;
|
|
|
|
i %= -1;
|
|
|
|
i %= var1;
|
|
|
|
i %= var2;
|
2019-09-26 09:47:06 +02:00
|
|
|
i <<= 3;
|
|
|
|
i >>= 2;
|
2020-04-13 05:11:19 +02:00
|
|
|
|
|
|
|
// no errors
|
2019-09-26 09:47:06 +02:00
|
|
|
i |= 1;
|
|
|
|
i &= 1;
|
|
|
|
i ^= i;
|
|
|
|
|
2018-10-18 06:20:36 +02:00
|
|
|
// No errors for the following items because they are constant expressions
|
|
|
|
enum Foo {
|
|
|
|
Bar = -2,
|
|
|
|
}
|
|
|
|
struct Baz([i32; 1 + 1]);
|
|
|
|
union Qux {
|
|
|
|
field: [i32; 1 + 1],
|
|
|
|
}
|
|
|
|
type Alias = [i32; 1 + 1];
|
|
|
|
|
|
|
|
const FOO: i32 = -2;
|
|
|
|
static BAR: i32 = -2;
|
|
|
|
|
|
|
|
let _: [i32; 1 + 1] = [0, 0];
|
|
|
|
|
|
|
|
let _: [i32; 1 + 1] = {
|
|
|
|
let a: [i32; 1 + 1] = [0, 0];
|
|
|
|
a
|
|
|
|
};
|
|
|
|
|
|
|
|
trait Trait {
|
|
|
|
const ASSOC: i32 = 1 + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Trait for Foo {
|
|
|
|
const ASSOC: i32 = {
|
|
|
|
let _: [i32; 1 + 1];
|
|
|
|
fn foo() {}
|
|
|
|
1 + 1
|
|
|
|
};
|
|
|
|
}
|
2020-03-17 23:32:30 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// warn on references as well! (#5328)
|
|
|
|
pub fn int_arith_ref() {
|
|
|
|
3 + &1;
|
|
|
|
&3 + 1;
|
|
|
|
&3 + &1;
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn foo(x: &i32) -> i32 {
|
|
|
|
let a = 5;
|
|
|
|
a + x
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn bar(x: &i32, y: &i32) -> i32 {
|
|
|
|
x + y
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn baz(x: i32, y: &i32) -> i32 {
|
|
|
|
x + y
|
|
|
|
}
|
|
|
|
|
|
|
|
pub fn qux(x: i32, y: i32) -> i32 {
|
|
|
|
(&x + &y)
|
|
|
|
}
|