5 // Make sure arithmetic unary/binary ops actually return the right result, even when overflowing.
6 // We have to put them in `const fn` and turn on optimizations to avoid overflow checks.
8 const fn add(x: i8, y: i8) -> i8 { x+y }
9 const fn sub(x: i8, y: i8) -> i8 { x-y }
10 const fn mul(x: i8, y: i8) -> i8 { x*y }
11 // div and rem are always checked, so we cannot test their result in case of overflow.
12 const fn neg(x: i8) -> i8 { -x }
15 const ADD_OFLOW: i8 = add(100, 100);
16 assert_eq!(ADD_OFLOW, -56);
18 const SUB_OFLOW: i8 = sub(100, -100);
19 assert_eq!(SUB_OFLOW, -56);
21 const MUL_OFLOW: i8 = mul(-100, -2);
22 assert_eq!(MUL_OFLOW, -56);
24 const NEG_OFLOW: i8 = neg(-128);
25 assert_eq!(NEG_OFLOW, -128);