fix(query): prevent stack overflow in CTE processing with recursive annotations

[BohuTANG]

I hereby agree to the terms of the CLA available at: https://docs.databend.com/dev/policies/cla/

Summary

Fix stack overflow in CTE processing that caused segmentation faults when processing complex queries with many UNION operations.

• Close refactor: bring back temp table to cte #18577 related issue

🐛 Problem Description

PR #18577 introduced a regression causing segmentation faults when processing complex CTE (Common Table Expression) queries with many UNION operations. The issue manifests as stack overflow due to deep recursive calls during query binding and AST traversal.

Root Cause

The m_cte_to_temp_table() function performs double recursion:

1. TableNameReplacer recursively traverses AST nodes via drive_mut()
2. Query binding recursively processes the modified query via bind_query()

For queries with 150+ UNION operations, this creates ~300 levels of recursive calls, exceeding stack limits.

🔧 Solution

Following the pattern established in PR #18268, this fix adds #[recursive::recursive] annotations to key CTE processing functions. The recursive library automatically grows stack size when needed, preventing overflow.

Modified Functions

• bind_query() - Main query binding entry point
• m_cte_to_temp_table() - CTE temporary table creation
• compute_cte_ref_count() - CTE reference counting
• bind_cte_definition() - CTE definition binding
• TableNameReplacer visitor methods - AST traversal for name replacement

Tests

• Unit Test
• Logic Test
• Benchmark Test
• No Test - Explain why

Type of change

• Bug Fix (non-breaking change which fixes an issue)
• New Feature (non-breaking change which adds functionality)
• Breaking Change (fix or feature that could cause existing functionality not to work as expected)
• Documentation Update
• Refactoring
• Performance Improvement
• Other (please describe):

---

This change is 

[BohuTANG]

Not working :/