|
| 1 | +#include <benchmark/benchmark.h> |
| 2 | +#include "sql_parser/parser.h" |
| 3 | +#include "sql_parser/emitter.h" |
| 4 | + |
| 5 | +using namespace sql_parser; |
| 6 | + |
| 7 | +// ========== Tier 2: Classification ========== |
| 8 | +// Target: <100ns |
| 9 | + |
| 10 | +static void BM_Classify_Insert(benchmark::State& state) { |
| 11 | + Parser<Dialect::MySQL> parser; |
| 12 | + const char* sql = "INSERT INTO users VALUES (1, 'name', 'email')"; |
| 13 | + size_t len = strlen(sql); |
| 14 | + for (auto _ : state) { |
| 15 | + auto r = parser.parse(sql, len); |
| 16 | + benchmark::DoNotOptimize(r.stmt_type); |
| 17 | + } |
| 18 | +} |
| 19 | +BENCHMARK(BM_Classify_Insert); |
| 20 | + |
| 21 | +static void BM_Classify_Update(benchmark::State& state) { |
| 22 | + Parser<Dialect::MySQL> parser; |
| 23 | + const char* sql = "UPDATE users SET name = 'x' WHERE id = 1"; |
| 24 | + size_t len = strlen(sql); |
| 25 | + for (auto _ : state) { |
| 26 | + auto r = parser.parse(sql, len); |
| 27 | + benchmark::DoNotOptimize(r.stmt_type); |
| 28 | + } |
| 29 | +} |
| 30 | +BENCHMARK(BM_Classify_Update); |
| 31 | + |
| 32 | +static void BM_Classify_Delete(benchmark::State& state) { |
| 33 | + Parser<Dialect::MySQL> parser; |
| 34 | + const char* sql = "DELETE FROM users WHERE id = 1"; |
| 35 | + size_t len = strlen(sql); |
| 36 | + for (auto _ : state) { |
| 37 | + auto r = parser.parse(sql, len); |
| 38 | + benchmark::DoNotOptimize(r.stmt_type); |
| 39 | + } |
| 40 | +} |
| 41 | +BENCHMARK(BM_Classify_Delete); |
| 42 | + |
| 43 | +static void BM_Classify_Begin(benchmark::State& state) { |
| 44 | + Parser<Dialect::MySQL> parser; |
| 45 | + const char* sql = "BEGIN"; |
| 46 | + size_t len = strlen(sql); |
| 47 | + for (auto _ : state) { |
| 48 | + auto r = parser.parse(sql, len); |
| 49 | + benchmark::DoNotOptimize(r.stmt_type); |
| 50 | + } |
| 51 | +} |
| 52 | +BENCHMARK(BM_Classify_Begin); |
| 53 | + |
| 54 | +// ========== Tier 1: SET parse ========== |
| 55 | +// Target: <300ns |
| 56 | + |
| 57 | +static void BM_Set_Simple(benchmark::State& state) { |
| 58 | + Parser<Dialect::MySQL> parser; |
| 59 | + const char* sql = "SET @@session.wait_timeout = 600"; |
| 60 | + size_t len = strlen(sql); |
| 61 | + for (auto _ : state) { |
| 62 | + auto r = parser.parse(sql, len); |
| 63 | + benchmark::DoNotOptimize(r.ast); |
| 64 | + } |
| 65 | +} |
| 66 | +BENCHMARK(BM_Set_Simple); |
| 67 | + |
| 68 | +static void BM_Set_Names(benchmark::State& state) { |
| 69 | + Parser<Dialect::MySQL> parser; |
| 70 | + const char* sql = "SET NAMES utf8mb4 COLLATE utf8mb4_unicode_ci"; |
| 71 | + size_t len = strlen(sql); |
| 72 | + for (auto _ : state) { |
| 73 | + auto r = parser.parse(sql, len); |
| 74 | + benchmark::DoNotOptimize(r.ast); |
| 75 | + } |
| 76 | +} |
| 77 | +BENCHMARK(BM_Set_Names); |
| 78 | + |
| 79 | +static void BM_Set_MultiVar(benchmark::State& state) { |
| 80 | + Parser<Dialect::MySQL> parser; |
| 81 | + const char* sql = "SET autocommit = 1, wait_timeout = 28800, sql_mode = 'STRICT_TRANS_TABLES'"; |
| 82 | + size_t len = strlen(sql); |
| 83 | + for (auto _ : state) { |
| 84 | + auto r = parser.parse(sql, len); |
| 85 | + benchmark::DoNotOptimize(r.ast); |
| 86 | + } |
| 87 | +} |
| 88 | +BENCHMARK(BM_Set_MultiVar); |
| 89 | + |
| 90 | +static void BM_Set_FunctionRHS(benchmark::State& state) { |
| 91 | + Parser<Dialect::MySQL> parser; |
| 92 | + const char* sql = "SET sql_mode = CONCAT(@@sql_mode, ',STRICT_TRANS_TABLES')"; |
| 93 | + size_t len = strlen(sql); |
| 94 | + for (auto _ : state) { |
| 95 | + auto r = parser.parse(sql, len); |
| 96 | + benchmark::DoNotOptimize(r.ast); |
| 97 | + } |
| 98 | +} |
| 99 | +BENCHMARK(BM_Set_FunctionRHS); |
| 100 | + |
| 101 | +// ========== Tier 1: SELECT parse ========== |
| 102 | +// Target: <500ns simple, <2us complex |
| 103 | + |
| 104 | +static void BM_Select_Simple(benchmark::State& state) { |
| 105 | + Parser<Dialect::MySQL> parser; |
| 106 | + const char* sql = "SELECT col FROM t WHERE id = 1"; |
| 107 | + size_t len = strlen(sql); |
| 108 | + for (auto _ : state) { |
| 109 | + auto r = parser.parse(sql, len); |
| 110 | + benchmark::DoNotOptimize(r.ast); |
| 111 | + } |
| 112 | +} |
| 113 | +BENCHMARK(BM_Select_Simple); |
| 114 | + |
| 115 | +static void BM_Select_MultiColumn(benchmark::State& state) { |
| 116 | + Parser<Dialect::MySQL> parser; |
| 117 | + const char* sql = "SELECT id, name, email, status FROM users WHERE active = 1 ORDER BY name LIMIT 100"; |
| 118 | + size_t len = strlen(sql); |
| 119 | + for (auto _ : state) { |
| 120 | + auto r = parser.parse(sql, len); |
| 121 | + benchmark::DoNotOptimize(r.ast); |
| 122 | + } |
| 123 | +} |
| 124 | +BENCHMARK(BM_Select_MultiColumn); |
| 125 | + |
| 126 | +static void BM_Select_Join(benchmark::State& state) { |
| 127 | + Parser<Dialect::MySQL> parser; |
| 128 | + const char* sql = "SELECT u.id, o.total FROM users u JOIN orders o ON u.id = o.user_id WHERE o.status = 'active'"; |
| 129 | + size_t len = strlen(sql); |
| 130 | + for (auto _ : state) { |
| 131 | + auto r = parser.parse(sql, len); |
| 132 | + benchmark::DoNotOptimize(r.ast); |
| 133 | + } |
| 134 | +} |
| 135 | +BENCHMARK(BM_Select_Join); |
| 136 | + |
| 137 | +static void BM_Select_Complex(benchmark::State& state) { |
| 138 | + Parser<Dialect::MySQL> parser; |
| 139 | + const char* sql = |
| 140 | + "SELECT u.id, u.name, COUNT(o.id) AS order_count " |
| 141 | + "FROM users u " |
| 142 | + "LEFT JOIN orders o ON u.id = o.user_id " |
| 143 | + "WHERE u.status = 'active' AND u.created_at > '2024-01-01' " |
| 144 | + "GROUP BY u.id, u.name " |
| 145 | + "HAVING COUNT(o.id) > 5 " |
| 146 | + "ORDER BY order_count DESC " |
| 147 | + "LIMIT 50 OFFSET 10"; |
| 148 | + size_t len = strlen(sql); |
| 149 | + for (auto _ : state) { |
| 150 | + auto r = parser.parse(sql, len); |
| 151 | + benchmark::DoNotOptimize(r.ast); |
| 152 | + } |
| 153 | +} |
| 154 | +BENCHMARK(BM_Select_Complex); |
| 155 | + |
| 156 | +static void BM_Select_MultiJoin(benchmark::State& state) { |
| 157 | + Parser<Dialect::MySQL> parser; |
| 158 | + const char* sql = |
| 159 | + "SELECT a.id, b.name, c.value, d.total " |
| 160 | + "FROM t1 a " |
| 161 | + "JOIN t2 b ON a.id = b.a_id " |
| 162 | + "LEFT JOIN t3 c ON b.id = c.b_id " |
| 163 | + "JOIN t4 d ON c.id = d.c_id " |
| 164 | + "WHERE a.status = 1 AND d.total > 100 " |
| 165 | + "ORDER BY d.total DESC " |
| 166 | + "LIMIT 20"; |
| 167 | + size_t len = strlen(sql); |
| 168 | + for (auto _ : state) { |
| 169 | + auto r = parser.parse(sql, len); |
| 170 | + benchmark::DoNotOptimize(r.ast); |
| 171 | + } |
| 172 | +} |
| 173 | +BENCHMARK(BM_Select_MultiJoin); |
| 174 | + |
| 175 | +// ========== Query Reconstruction (round-trip) ========== |
| 176 | +// Target: <500ns |
| 177 | + |
| 178 | +static void BM_Emit_SetSimple(benchmark::State& state) { |
| 179 | + Parser<Dialect::MySQL> parser; |
| 180 | + const char* sql = "SET autocommit = 1"; |
| 181 | + size_t len = strlen(sql); |
| 182 | + for (auto _ : state) { |
| 183 | + auto r = parser.parse(sql, len); |
| 184 | + Emitter<Dialect::MySQL> emitter(parser.arena()); |
| 185 | + emitter.emit(r.ast); |
| 186 | + benchmark::DoNotOptimize(emitter.result()); |
| 187 | + } |
| 188 | +} |
| 189 | +BENCHMARK(BM_Emit_SetSimple); |
| 190 | + |
| 191 | +static void BM_Emit_SelectSimple(benchmark::State& state) { |
| 192 | + Parser<Dialect::MySQL> parser; |
| 193 | + const char* sql = "SELECT * FROM users WHERE id = 1"; |
| 194 | + size_t len = strlen(sql); |
| 195 | + for (auto _ : state) { |
| 196 | + auto r = parser.parse(sql, len); |
| 197 | + Emitter<Dialect::MySQL> emitter(parser.arena()); |
| 198 | + emitter.emit(r.ast); |
| 199 | + benchmark::DoNotOptimize(emitter.result()); |
| 200 | + } |
| 201 | +} |
| 202 | +BENCHMARK(BM_Emit_SelectSimple); |
| 203 | + |
| 204 | +// ========== Arena reset ========== |
| 205 | +// Target: <10ns |
| 206 | + |
| 207 | +static void BM_ArenaReset(benchmark::State& state) { |
| 208 | + Arena arena(65536); |
| 209 | + for (auto _ : state) { |
| 210 | + arena.allocate(256); // allocate something |
| 211 | + arena.reset(); |
| 212 | + benchmark::DoNotOptimize(arena.bytes_used()); |
| 213 | + } |
| 214 | +} |
| 215 | +BENCHMARK(BM_ArenaReset); |
| 216 | + |
| 217 | +// ========== PostgreSQL ========== |
| 218 | + |
| 219 | +static void BM_PgSQL_Select_Simple(benchmark::State& state) { |
| 220 | + Parser<Dialect::PostgreSQL> parser; |
| 221 | + const char* sql = "SELECT col FROM t WHERE id = 1"; |
| 222 | + size_t len = strlen(sql); |
| 223 | + for (auto _ : state) { |
| 224 | + auto r = parser.parse(sql, len); |
| 225 | + benchmark::DoNotOptimize(r.ast); |
| 226 | + } |
| 227 | +} |
| 228 | +BENCHMARK(BM_PgSQL_Select_Simple); |
| 229 | + |
| 230 | +static void BM_PgSQL_Set_Simple(benchmark::State& state) { |
| 231 | + Parser<Dialect::PostgreSQL> parser; |
| 232 | + const char* sql = "SET work_mem = '256MB'"; |
| 233 | + size_t len = strlen(sql); |
| 234 | + for (auto _ : state) { |
| 235 | + auto r = parser.parse(sql, len); |
| 236 | + benchmark::DoNotOptimize(r.ast); |
| 237 | + } |
| 238 | +} |
| 239 | +BENCHMARK(BM_PgSQL_Set_Simple); |
0 commit comments