|
| 1 | +#include <benchmark/benchmark.h> |
| 2 | +#include <libsqlglot/transpiler.h> |
| 3 | +#include <libsqlglot/parser.h> |
| 4 | +#include <libsqlglot/tokenizer.h> |
| 5 | +#include <string> |
| 6 | + |
| 7 | +using namespace libsqlglot; |
| 8 | + |
| 9 | +// ============================================================================= |
| 10 | +// Tokenizer Benchmarks - Hot Path #1 |
| 11 | +// ============================================================================= |
| 12 | +// The tokenizer is called for every query and processes every character |
| 13 | + |
| 14 | +static void BM_Tokenizer_Simple(benchmark::State& state) { |
| 15 | + std::string sql = "SELECT id, name, email FROM users WHERE age > 18"; |
| 16 | + LocalStringPool pool; |
| 17 | + |
| 18 | + for (auto _ : state) { |
| 19 | + Tokenizer tokenizer(sql, &pool); |
| 20 | + auto tokens = tokenizer.tokenize_all(); |
| 21 | + benchmark::DoNotOptimize(tokens); |
| 22 | + } |
| 23 | + |
| 24 | + state.SetBytesProcessed(state.iterations() * sql.size()); |
| 25 | +} |
| 26 | +BENCHMARK(BM_Tokenizer_Simple); |
| 27 | + |
| 28 | +static void BM_Tokenizer_Complex(benchmark::State& state) { |
| 29 | + std::string sql = R"( |
| 30 | + WITH ranked AS ( |
| 31 | + SELECT *, |
| 32 | + ROW_NUMBER() OVER (PARTITION BY category ORDER BY price DESC) as rank |
| 33 | + FROM products |
| 34 | + WHERE price > 100 |
| 35 | + ) |
| 36 | + SELECT category, product, price, rank |
| 37 | + FROM ranked |
| 38 | + WHERE rank <= 10 |
| 39 | + ORDER BY category, rank |
| 40 | + )"; |
| 41 | + LocalStringPool pool; |
| 42 | + |
| 43 | + for (auto _ : state) { |
| 44 | + Tokenizer tokenizer(sql, &pool); |
| 45 | + auto tokens = tokenizer.tokenize_all(); |
| 46 | + benchmark::DoNotOptimize(tokens); |
| 47 | + } |
| 48 | + |
| 49 | + state.SetBytesProcessed(state.iterations() * sql.size()); |
| 50 | +} |
| 51 | +BENCHMARK(BM_Tokenizer_Complex); |
| 52 | + |
| 53 | +static void BM_Tokenizer_LongIdentifiers(benchmark::State& state) { |
| 54 | + std::string sql = "SELECT very_long_column_name_with_many_underscores FROM " |
| 55 | + "very_long_table_name_with_many_underscores WHERE " |
| 56 | + "very_long_column_name_with_many_underscores > 100"; |
| 57 | + LocalStringPool pool; |
| 58 | + |
| 59 | + for (auto _ : state) { |
| 60 | + Tokenizer tokenizer(sql, &pool); |
| 61 | + auto tokens = tokenizer.tokenize_all(); |
| 62 | + benchmark::DoNotOptimize(tokens); |
| 63 | + } |
| 64 | + |
| 65 | + state.SetBytesProcessed(state.iterations() * sql.size()); |
| 66 | +} |
| 67 | +BENCHMARK(BM_Tokenizer_LongIdentifiers); |
| 68 | + |
| 69 | +// ============================================================================= |
| 70 | +// Parser Benchmarks - Hot Path #2 |
| 71 | +// ============================================================================= |
| 72 | +// Parser is the most complex and CPU-intensive component |
| 73 | + |
| 74 | +static void BM_Parser_Simple(benchmark::State& state) { |
| 75 | + std::string sql = "SELECT * FROM users WHERE id = 1"; |
| 76 | + |
| 77 | + for (auto _ : state) { |
| 78 | + Arena arena; |
| 79 | + Parser parser(arena, sql); |
| 80 | + auto result = parser.parse(); |
| 81 | + benchmark::DoNotOptimize(result); |
| 82 | + } |
| 83 | +} |
| 84 | +BENCHMARK(BM_Parser_Simple); |
| 85 | + |
| 86 | +static void BM_Parser_Join(benchmark::State& state) { |
| 87 | + std::string sql = "SELECT u.name, o.total FROM users u " |
| 88 | + "INNER JOIN orders o ON u.id = o.user_id " |
| 89 | + "WHERE o.status = 'completed'"; |
| 90 | + |
| 91 | + for (auto _ : state) { |
| 92 | + Arena arena; |
| 93 | + Parser parser(arena, sql); |
| 94 | + auto result = parser.parse(); |
| 95 | + benchmark::DoNotOptimize(result); |
| 96 | + } |
| 97 | +} |
| 98 | +BENCHMARK(BM_Parser_Join); |
| 99 | + |
| 100 | +static void BM_Parser_MultiJoin(benchmark::State& state) { |
| 101 | + std::string sql = "SELECT * FROM users u " |
| 102 | + "JOIN orders o ON u.id = o.user_id " |
| 103 | + "JOIN products p ON o.product_id = p.id " |
| 104 | + "JOIN categories c ON p.category_id = c.id"; |
| 105 | + |
| 106 | + for (auto _ : state) { |
| 107 | + Arena arena; |
| 108 | + Parser parser(arena, sql); |
| 109 | + auto result = parser.parse(); |
| 110 | + benchmark::DoNotOptimize(result); |
| 111 | + } |
| 112 | +} |
| 113 | +BENCHMARK(BM_Parser_MultiJoin); |
| 114 | + |
| 115 | +static void BM_Parser_CTE(benchmark::State& state) { |
| 116 | + std::string sql = R"( |
| 117 | + WITH cte1 AS (SELECT * FROM users WHERE age > 18), |
| 118 | + cte2 AS (SELECT * FROM orders WHERE total > 100) |
| 119 | + SELECT * FROM cte1 JOIN cte2 ON cte1.id = cte2.user_id |
| 120 | + )"; |
| 121 | + |
| 122 | + for (auto _ : state) { |
| 123 | + Arena arena; |
| 124 | + Parser parser(arena, sql); |
| 125 | + auto result = parser.parse(); |
| 126 | + benchmark::DoNotOptimize(result); |
| 127 | + } |
| 128 | +} |
| 129 | +BENCHMARK(BM_Parser_CTE); |
| 130 | + |
| 131 | +static void BM_Parser_WindowFunction(benchmark::State& state) { |
| 132 | + std::string sql = "SELECT *, ROW_NUMBER() OVER (PARTITION BY category ORDER BY price DESC) " |
| 133 | + "FROM products"; |
| 134 | + |
| 135 | + for (auto _ : state) { |
| 136 | + Arena arena; |
| 137 | + Parser parser(arena, sql); |
| 138 | + auto result = parser.parse(); |
| 139 | + benchmark::DoNotOptimize(result); |
| 140 | + } |
| 141 | +} |
| 142 | +BENCHMARK(BM_Parser_WindowFunction); |
| 143 | + |
| 144 | +static void BM_Parser_Subquery(benchmark::State& state) { |
| 145 | + std::string sql = "SELECT * FROM users WHERE id IN " |
| 146 | + "(SELECT user_id FROM orders WHERE total > 1000)"; |
| 147 | + |
| 148 | + for (auto _ : state) { |
| 149 | + Arena arena; |
| 150 | + Parser parser(arena, sql); |
| 151 | + auto result = parser.parse(); |
| 152 | + benchmark::DoNotOptimize(result); |
| 153 | + } |
| 154 | +} |
| 155 | +BENCHMARK(BM_Parser_Subquery); |
| 156 | + |
| 157 | +// ============================================================================= |
| 158 | +// Generator Benchmarks - Hot Path #3 |
| 159 | +// ============================================================================= |
| 160 | +// Generator converts AST back to SQL text |
| 161 | + |
| 162 | +static void BM_Generator_Simple(benchmark::State& state) { |
| 163 | + std::string sql = "SELECT * FROM users WHERE id = 1"; |
| 164 | + Arena arena; |
| 165 | + Parser parser(arena, sql); |
| 166 | + auto stmt = parser.parse(); |
| 167 | + |
| 168 | + for (auto _ : state) { |
| 169 | + std::string result = Generator::generate(stmt); |
| 170 | + benchmark::DoNotOptimize(result); |
| 171 | + } |
| 172 | +} |
| 173 | +BENCHMARK(BM_Generator_Simple); |
| 174 | + |
| 175 | +static void BM_Generator_Complex(benchmark::State& state) { |
| 176 | + std::string sql = R"( |
| 177 | + WITH ranked AS ( |
| 178 | + SELECT *, ROW_NUMBER() OVER (PARTITION BY category ORDER BY price DESC) as rank |
| 179 | + FROM products |
| 180 | + ) |
| 181 | + SELECT * FROM ranked WHERE rank <= 10 |
| 182 | + )"; |
| 183 | + Arena arena; |
| 184 | + Parser parser(arena, sql); |
| 185 | + auto stmt = parser.parse(); |
| 186 | + |
| 187 | + for (auto _ : state) { |
| 188 | + std::string result = Generator::generate(stmt); |
| 189 | + benchmark::DoNotOptimize(result); |
| 190 | + } |
| 191 | +} |
| 192 | +BENCHMARK(BM_Generator_Complex); |
| 193 | + |
| 194 | +// ============================================================================= |
| 195 | +// Full Pipeline Benchmarks - Hot Path #4 |
| 196 | +// ============================================================================= |
| 197 | +// Complete tokenize → parse → generate → transpile pipeline |
| 198 | + |
| 199 | +static void BM_Transpile_Simple(benchmark::State& state) { |
| 200 | + std::string sql = "SELECT * FROM users WHERE age > 18"; |
| 201 | + |
| 202 | + for (auto _ : state) { |
| 203 | + auto result = Transpiler::transpile(sql); |
| 204 | + benchmark::DoNotOptimize(result); |
| 205 | + } |
| 206 | +} |
| 207 | +BENCHMARK(BM_Transpile_Simple); |
| 208 | + |
| 209 | +static void BM_Transpile_CrossDialect(benchmark::State& state) { |
| 210 | + std::string sql = "SELECT * FROM users WHERE age > 18 LIMIT 10"; |
| 211 | + |
| 212 | + for (auto _ : state) { |
| 213 | + auto result = Transpiler::transpile(sql, Dialect::MySQL, Dialect::PostgreSQL); |
| 214 | + benchmark::DoNotOptimize(result); |
| 215 | + } |
| 216 | +} |
| 217 | +BENCHMARK(BM_Transpile_CrossDialect); |
| 218 | + |
| 219 | +static void BM_Transpile_Complex(benchmark::State& state) { |
| 220 | + std::string sql = R"( |
| 221 | + WITH user_orders AS ( |
| 222 | + SELECT u.id, u.name, COUNT(*) as order_count, SUM(o.total) as total_spent |
| 223 | + FROM users u |
| 224 | + JOIN orders o ON u.id = o.user_id |
| 225 | + WHERE o.status = 'completed' |
| 226 | + GROUP BY u.id, u.name |
| 227 | + ) |
| 228 | + SELECT * FROM user_orders WHERE total_spent > 1000 ORDER BY total_spent DESC |
| 229 | + )"; |
| 230 | + |
| 231 | + for (auto _ : state) { |
| 232 | + auto result = Transpiler::transpile(sql); |
| 233 | + benchmark::DoNotOptimize(result); |
| 234 | + } |
| 235 | +} |
| 236 | +BENCHMARK(BM_Transpile_Complex); |
| 237 | + |
| 238 | +// ============================================================================= |
| 239 | +// String Interning Benchmarks - Memory Hot Path |
| 240 | +// ============================================================================= |
| 241 | +// String interning is critical for memory efficiency and lookup speed |
| 242 | + |
| 243 | +static void BM_StringPool_Intern(benchmark::State& state) { |
| 244 | + LocalStringPool pool; |
| 245 | + std::vector<std::string> strings = { |
| 246 | + "SELECT", "FROM", "WHERE", "users", "orders", "products", |
| 247 | + "id", "name", "email", "age", "price", "quantity" |
| 248 | + }; |
| 249 | + |
| 250 | + size_t idx = 0; |
| 251 | + for (auto _ : state) { |
| 252 | + const char* interned = pool.intern(strings[idx % strings.size()]); |
| 253 | + benchmark::DoNotOptimize(interned); |
| 254 | + idx++; |
| 255 | + } |
| 256 | +} |
| 257 | +BENCHMARK(BM_StringPool_Intern); |
| 258 | + |
| 259 | +static void BM_StringPool_InternLong(benchmark::State& state) { |
| 260 | + LocalStringPool pool; |
| 261 | + std::string long_string(100, 'a'); |
| 262 | + |
| 263 | + for (auto _ : state) { |
| 264 | + const char* interned = pool.intern(long_string); |
| 265 | + benchmark::DoNotOptimize(interned); |
| 266 | + } |
| 267 | +} |
| 268 | +BENCHMARK(BM_StringPool_InternLong); |
| 269 | + |
| 270 | +// ============================================================================= |
| 271 | +// Arena Allocator Benchmarks - Memory Hot Path |
| 272 | +// ============================================================================= |
| 273 | +// Arena allocation is used for all AST nodes |
| 274 | + |
| 275 | +static void BM_Arena_Allocate(benchmark::State& state) { |
| 276 | + for (auto _ : state) { |
| 277 | + Arena arena; |
| 278 | + // Simulate typical parse workload - many small allocations |
| 279 | + for (int i = 0; i < 1000; ++i) { |
| 280 | + void* ptr = arena.allocate(64); |
| 281 | + benchmark::DoNotOptimize(ptr); |
| 282 | + } |
| 283 | + } |
| 284 | +} |
| 285 | +BENCHMARK(BM_Arena_Allocate); |
| 286 | + |
| 287 | +static void BM_Arena_Create(benchmark::State& state) { |
| 288 | + struct TestNode { |
| 289 | + int value; |
| 290 | + const char* name; |
| 291 | + TestNode* left; |
| 292 | + TestNode* right; |
| 293 | + }; |
| 294 | + |
| 295 | + for (auto _ : state) { |
| 296 | + Arena arena; |
| 297 | + // Simulate AST node creation |
| 298 | + for (int i = 0; i < 100; ++i) { |
| 299 | + auto node = arena.create<TestNode>(); |
| 300 | + benchmark::DoNotOptimize(node); |
| 301 | + } |
| 302 | + } |
| 303 | +} |
| 304 | +BENCHMARK(BM_Arena_Create); |
| 305 | + |
| 306 | +// ============================================================================= |
| 307 | +// Real-World Query Benchmarks |
| 308 | +// ============================================================================= |
| 309 | +// Queries from actual production workloads |
| 310 | + |
| 311 | +static void BM_RealWorld_Dashboard(benchmark::State& state) { |
| 312 | + std::string sql = R"( |
| 313 | + SELECT |
| 314 | + DATE_TRUNC('day', created_at) as date, |
| 315 | + COUNT(*) as total_orders, |
| 316 | + SUM(total) as revenue, |
| 317 | + AVG(total) as avg_order_value, |
| 318 | + COUNT(DISTINCT user_id) as unique_customers |
| 319 | + FROM orders |
| 320 | + WHERE created_at >= NOW() - INTERVAL '30 days' |
| 321 | + GROUP BY DATE_TRUNC('day', created_at) |
| 322 | + ORDER BY date DESC |
| 323 | + )"; |
| 324 | + |
| 325 | + for (auto _ : state) { |
| 326 | + auto result = Transpiler::transpile(sql); |
| 327 | + benchmark::DoNotOptimize(result); |
| 328 | + } |
| 329 | +} |
| 330 | +BENCHMARK(BM_RealWorld_Dashboard); |
| 331 | + |
| 332 | +static void BM_RealWorld_Report(benchmark::State& state) { |
| 333 | + std::string sql = R"( |
| 334 | + WITH monthly_revenue AS ( |
| 335 | + SELECT |
| 336 | + DATE_TRUNC('month', o.created_at) as month, |
| 337 | + p.category, |
| 338 | + SUM(o.total) as revenue |
| 339 | + FROM orders o |
| 340 | + JOIN products p ON o.product_id = p.id |
| 341 | + WHERE o.status = 'completed' |
| 342 | + GROUP BY DATE_TRUNC('month', o.created_at), p.category |
| 343 | + ), |
| 344 | + category_rankings AS ( |
| 345 | + SELECT |
| 346 | + month, |
| 347 | + category, |
| 348 | + revenue, |
| 349 | + RANK() OVER (PARTITION BY month ORDER BY revenue DESC) as rank |
| 350 | + FROM monthly_revenue |
| 351 | + ) |
| 352 | + SELECT * FROM category_rankings WHERE rank <= 10 |
| 353 | + ORDER BY month DESC, rank ASC |
| 354 | + )"; |
| 355 | + |
| 356 | + for (auto _ : state) { |
| 357 | + auto result = Transpiler::transpile(sql); |
| 358 | + benchmark::DoNotOptimize(result); |
| 359 | + } |
| 360 | +} |
| 361 | +BENCHMARK(BM_RealWorld_Report); |
| 362 | + |
| 363 | +BENCHMARK_MAIN(); |
0 commit comments