perf(es/minifier): Make DCE analyzer parallel

[kdy1]

Description:

The analyzer of the DCE pass can be parallelized in a similar way to mark-sweep GC. It currently uses &mut petgraph::DiGraphMap to find reachable bindings, but we can split the graph creation into multiple threads.

Also, I decided to amort allocations because swc_parallel::join is called an enormous amount of time, meaning that it will be slower if I allocate one hashmap from each closure. I'll use thread_local crate to reuse the hashmap and collect all of them after the traversal is done.

[kdy1]

Warning

This pull request is not mergeable via GitHub because a downstack PR is open. Once all requirements are satisfied, merge this PR as a stack on Graphite.
Learn more

• perf(es/minifier): Make DCE analyzer parallel #10076 👈 (View in Graphite)
• feat(swc_parallel): Add parallel iterators #10075
• perf(es/minifier): Prevent double boxing #10074
• doc(swc_core): Add ChangeLog for swc_core #10072
• refactor(atoms): Remove JsWord alias #10071
• refactor(atoms): Rename FastAtom to UnsafeAtom #10070
• main

This stack of pull requests is managed by Graphite. Learn more about stacking.

[changeset-bot]

⚠️ No Changeset found

Latest commit: 64e308b

Merging this PR will not cause a version bump for any packages. If these changes should not result in a new version, you're good to go. If these changes should result in a version bump, you need to add a changeset.

Click here to learn what changesets are, and how to add one.

Click here if you're a maintainer who wants to add a changeset to this PR

[changeset-bot]

⚠️ No Changeset found

Latest commit: 6f16e73

Merging this PR will not cause a version bump for any packages. If these changes should not result in a new version, you're good to go. If these changes should result in a version bump, you need to add a changeset.

Click here to learn what changesets are, and how to add one.

Click here if you're a maintainer who wants to add a changeset to this PR