⚡ Bolt: Optimize IR block predecessor mapping from O(N^2) to O(N)

[Tcode-Motion]

💡 What: Replaced the $O(N^2)$ contains check when building block predecessors in compiler/ir/src/builder.rs with an $O(N + E)$ approach using a HashMap.

🎯 Why: Reconstructing backwards CFG edges by looping over all blocks and scanning their successor vectors creates quadratic scaling. For flat, linear modules or large match statements containing tens of thousands of basic blocks, this can cause significant compilation lag.

📊 Measured Improvement:

• Baseline (100,000 blocks): 4.66 ms
• Optimized (100,000 blocks): 0.99 ms
• Improvement: ~4.7x faster for large blocks, scaling linearly instead of quadratically.

🔬 Measurement: Added a temporary bench_map_predecessors test generating thousands of basic blocks, measuring builder.seal_function() completion time with std::time::Instant.

---

PR created automatically by Jules for task 8316661530692621468 started by @Tcode-Motion

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.