1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
use super::*; use std::convert::Infallible; use full_moon::{ ast::{self, Ast}, visitors::Visitor, }; pub struct CompareNanLint; impl Rule for CompareNanLint { type Config = (); type Error = Infallible; fn new(_: Self::Config) -> Result<Self, Self::Error> { Ok(CompareNanLint) } fn pass(&self, ast: &Ast, _: &Context) -> Vec<Diagnostic> { let mut visitor = CompareNanVisitor { comparisons: Vec::new(), }; visitor.visit_ast(ast); visitor .comparisons .iter() .map(|comparisons| { Diagnostic::new_complete( "compare_nan", "comparing things to nan directly is not allowed".to_owned(), Label::new(comparisons.range), vec![format!( "try: `{variable} {operator} {variable}` instead", variable = comparisons.variable, operator = comparisons.operator, )], Vec::new(), ) }) .collect() } fn severity(&self) -> Severity { Severity::Error } fn rule_type(&self) -> RuleType { RuleType::Correctness } } struct CompareNanVisitor { comparisons: Vec<Comparison>, } struct Comparison { variable: String, operator: String, range: (usize, usize), } fn value_is_zero(value: &ast::Value) -> bool { if let ast::Value::Number(token) = value { token.token().to_string() == "0" } else { false } } fn expression_is_nan(node: &ast::Expression) -> bool { if_chain::if_chain! { if let ast::Expression::BinaryOperator { lhs, binop: ast::BinOp::Slash(_), rhs } = node; if let ast::Expression::Value { value, .. } = &**lhs; if let ast::Expression::Value { value: rhs_value, .. } = &**rhs; if value_is_zero(rhs_value) && value_is_zero(value); then { return true; } } false } impl Visitor for CompareNanVisitor { fn visit_expression(&mut self, node: &ast::Expression) { if_chain::if_chain! { if let ast::Expression::BinaryOperator { lhs, binop, rhs } = node; if let ast::Expression::Value { value, .. } = &**lhs; if let ast::Value::Var(_) = value.as_ref(); then { match binop { ast::BinOp::TildeEqual(_) => { if expression_is_nan(rhs) { let range = node.range().unwrap(); self.comparisons.push( Comparison { variable: value.to_string().trim().to_owned(), operator: "==".to_owned(), range: (range.0.bytes(), range.1.bytes()), } ); } }, ast::BinOp::TwoEqual(_) => { if expression_is_nan(rhs) { let range = node.range().unwrap(); self.comparisons.push( Comparison { variable: value.to_string().trim().to_owned(), operator: "~=".to_owned(), range: (range.0.bytes(), range.1.bytes()), } ); } }, _ => {}, } } } } } #[cfg(test)] mod tests { use super::{super::test_util::test_lint, *}; #[test] fn test_compare_nan_variables() { test_lint( CompareNanLint::new(()).unwrap(), "compare_nan", "compare_nan_variables", ); } #[test] fn test_compare_nan_if() { test_lint( CompareNanLint::new(()).unwrap(), "compare_nan", "compare_nan_if", ); } }