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