perf(es/lints): Avoid needless allocations in no-dupe-args (#9041)

**Description:**

I introduced a zero-allocation variant for `swc_ecma_utils::DestructuringFinder` that does not allocate anything.

Author: kdy1

crates/swc/tests/errors/lints/no-dupe-args/hash-mode/input.js

@@ -0,0 +1,10 @@
+function foo(
+    [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9], [b0, b1, b2, b3, b4, b5, b6, b7, b8, b9],
+    [c0, c1, c2, c3, c4, c5, c6, c7, c8, c9], [d0, d1, d2, d3, d4, d5, d6, d7, d8, d9],
+    [e0, e1, e2, e3, e4, e5, e6, e7, e8, e9], [f0, f1, f2, f3, f4, f5, f6, f7, f8, f9],
+    [g0, g1, g2, g3, g4, g5, g6, g7, g8, g9], [h0, h1, h2, h3, h4, h5, h6, h7, h8, h9],
+    [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9], [b0, b1, b2, b3, b4, b5, b6, b7, b8, b9],
+    [i0, i1, i2, i3, i4, i5, i6, i7, i8, i9], [j0, j1, j2, j3, j4, j5, j6, j7, j8, j9],
+    [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9], [b0, b1, b2, b3, b4, b5, b6, b7, b8, b9],) {
+
+}

crates/swc/tests/errors/lints/no-dupe-args/hash-mode/output.swc-stderr

@@ -1,7 +1,8 @@
-use swc_atoms::JsWord;
-use swc_common::{collections::AHashMap, errors::HANDLER, Span};
+use std::collections::hash_map::Entry;
+
+use swc_common::{collections::AHashMap, errors::HANDLER};
 use swc_ecma_ast::*;
-use swc_ecma_utils::find_pat_ids;
+use swc_ecma_utils::for_each_binding_ident;
 use swc_ecma_visit::{noop_visit_type, Visit, VisitWith};
 
 use crate::rule::{visitor_rule, Rule};
@@ -13,54 +14,100 @@ pub fn no_dupe_args() -> Box<dyn Rule> {
 #[derive(Debug, Default)]
 struct NoDupeArgs {}
 
-impl NoDupeArgs {
-    fn check(&self, param_list: Vec<(JsWord, Span)>) {
-        let mut variables_map = AHashMap::<JsWord, Span>::default();
-
-        param_list.into_iter().for_each(|(js_word, span)| {
-            if let Some(old_span) = variables_map.insert(js_word.clone(), span) {
-                HANDLER.with(|handler| {
-                    handler
-                        .struct_span_err(
-                            span,
-                            &format!(
-                                "the name `{}` is bound more than once in this parameter list",
-                                js_word
-                            ),
-                        )
-                        .span_label(old_span, "previous definition here".to_string())
-                        .span_label(span, &"used as parameter more than once".to_string())
-                        .emit();
+fn error(first: &Ident, second: &Ident) {
+    HANDLER.with(|handler| {
+        handler
+            .struct_span_err(
+                second.span,
+                &format!(
+                    "the name `{}` is bound more than once in this parameter list",
+                    first.sym
+                ),
+            )
+            .span_label(first.span, "previous definition here".to_string())
+            .span_label(second.span, &"used as parameter more than once".to_string())
+            .emit();
+    });
+}
+
+/// This has time complexity of O(n^2), but it's fine as the number of paramters
+/// is usually small.
+macro_rules! check {
+    ($node:expr) => {{
+        // This vector allocates only if there are duplicate parameters.
+        // This is used to handle the case where the same parameter is used 3 or more
+        // times.
+        let mut done = vec![];
+
+        let mut hash_mode = false;
+
+        let mut i1 = 0;
+        for_each_binding_ident($node, |id1| {
+            i1 += 1;
+
+            if !hash_mode {
+                let mut i2 = 0;
+                for_each_binding_ident($node, |id2| {
+                    i2 += 1;
+
+                    if hash_mode {
+                        return;
+                    } else if i2 >= 100 {
+                        // While iterating for the first `id1`, we detect that there are more than
+                        // 100 identifiers. We switch to hash mode.
+                        hash_mode = true;
+                    }
+
+                    if i1 >= i2 || done.contains(&i1) {
+                        return;
+                    }
+
+                    if id1.span.ctxt == id2.span.ctxt && id1.sym == id2.sym {
+                        done.push(i1);
+
+                        error(id1, id2);
+                    }
                 });
             }
         });
-    }
+
+        if hash_mode {
+            let mut map = AHashMap::default();
+
+            for_each_binding_ident($node, |id| {
+                //
+                match map.entry((id.sym.clone(), id.span.ctxt)) {
+                    Entry::Occupied(v) => {
+                        error(v.get(), id);
+                    }
+
+                    Entry::Vacant(v) => {
+                        v.insert(id.clone());
+                    }
+                }
+            });
+        }
+    }};
 }
 
 impl Visit for NoDupeArgs {
     noop_visit_type!();
 
     fn visit_function(&mut self, f: &Function) {
-        let variables: Vec<(JsWord, Span)> = find_pat_ids(&f.params);
-
-        self.check(variables);
+        check!(&f.params);
 
         f.visit_children_with(self);
     }
 
-    fn visit_arrow_expr(&mut self, arrow_fn: &ArrowExpr) {
-        let variables: Vec<(JsWord, Span)> = find_pat_ids(&arrow_fn.params);
+    fn visit_arrow_expr(&mut self, f: &ArrowExpr) {
+        check!(&f.params);
 
-        self.check(variables);
-
-        arrow_fn.visit_children_with(self);
+        f.visit_children_with(self);
     }
 
-    fn visit_constructor(&mut self, n: &Constructor) {
-        let variables: Vec<(JsWord, Span)> = find_pat_ids(&n.params);
+    fn visit_constructor(&mut self, f: &Constructor) {
+        check!(&f.params);
 
-        self.check(variables);
-
-        n.visit_children_with(self);
+        f.visit_children_with(self);
     }
 }

crates/swc_ecma_lints/src/rules/no_dupe_args.rs

@@ -2373,6 +2373,8 @@ pub struct DestructuringFinder<I: IdentLike> {
 }
 
 /// Finds all **binding** idents of `node`.
+///
+/// If you want to avoid allocation, use [`for_each_binding_ident`] instead.
 pub fn find_pat_ids<T, I: IdentLike>(node: &T) -> Vec<I>
 where
     T: VisitWith<DestructuringFinder<I>>,
@@ -2397,6 +2399,39 @@ impl<I: IdentLike> Visit for DestructuringFinder<I> {
     fn visit_prop_name(&mut self, _: &PropName) {}
 }
 
+/// Finds all **binding** idents of variables.
+pub struct BindingIdentifierVisitor<F>
+where
+    F: for<'a> FnMut(&'a Ident),
+{
+    op: F,
+}
+
+/// Finds all **binding** idents of `node`. **Any nested identifiers in
+/// expressions are ignored**.
+pub fn for_each_binding_ident<T, F>(node: &T, op: F)
+where
+    T: VisitWith<BindingIdentifierVisitor<F>>,
+    F: for<'a> FnMut(&'a Ident),
+{
+    let mut v = BindingIdentifierVisitor { op };
+    node.visit_with(&mut v);
+}
+
+impl<F> Visit for BindingIdentifierVisitor<F>
+where
+    F: for<'a> FnMut(&'a Ident),
+{
+    noop_visit_type!();
+
+    /// No-op (we don't care about expressions)
+    fn visit_expr(&mut self, _: &Expr) {}
+
+    fn visit_binding_ident(&mut self, i: &BindingIdent) {
+        (self.op)(i);
+    }
+}
+
 pub fn is_valid_ident(s: &JsWord) -> bool {
     if s.len() == 0 {
         return false;