|
| 1 | +#include <benchmark/benchmark.h> |
| 2 | +#include "sql_parser/parser.h" |
| 3 | +#include "sql_parser/emitter.h" |
| 4 | + |
| 5 | +// libpg_query |
| 6 | +extern "C" { |
| 7 | +#include "pg_query.h" |
| 8 | +} |
| 9 | + |
| 10 | +using namespace sql_parser; |
| 11 | + |
| 12 | +// ========== Query set — same queries for both parsers ========== |
| 13 | + |
| 14 | +struct QueryCase { |
| 15 | + const char* name; |
| 16 | + const char* sql; |
| 17 | +}; |
| 18 | + |
| 19 | +static const QueryCase comparison_queries[] = { |
| 20 | + {"simple_select", "SELECT col FROM t WHERE id = 1"}, |
| 21 | + {"select_join", "SELECT u.id, o.total FROM users u JOIN orders o ON u.id = o.user_id WHERE o.status = 'active'"}, |
| 22 | + {"select_complex", "SELECT u.id, u.name, COUNT(o.id) AS order_count " |
| 23 | + "FROM users u LEFT JOIN orders o ON u.id = o.user_id " |
| 24 | + "WHERE u.status = 'active' " |
| 25 | + "GROUP BY u.id, u.name " |
| 26 | + "HAVING COUNT(o.id) > 5 " |
| 27 | + "ORDER BY order_count DESC LIMIT 50"}, |
| 28 | + {"insert_values", "INSERT INTO users (name, email) VALUES ('John', 'john@example.com')"}, |
| 29 | + {"update_simple", "UPDATE users SET status = 'inactive' WHERE last_login < '2024-01-01'"}, |
| 30 | + {"delete_simple", "DELETE FROM users WHERE id = 42"}, |
| 31 | + {"set_simple", "SET @@session.wait_timeout = 600"}, |
| 32 | + {"set_names", "SET NAMES utf8mb4 COLLATE utf8mb4_unicode_ci"}, |
| 33 | + {"begin", "BEGIN"}, |
| 34 | + {"create_table", "CREATE TABLE IF NOT EXISTS users (id INT PRIMARY KEY, name VARCHAR(255), email VARCHAR(255))"}, |
| 35 | +}; |
| 36 | + |
| 37 | +// ========== Our parser (PostgreSQL dialect for fair comparison) ========== |
| 38 | + |
| 39 | +static void BM_Ours_Select_Simple(benchmark::State& state) { |
| 40 | + Parser<Dialect::PostgreSQL> parser; |
| 41 | + const char* sql = comparison_queries[0].sql; |
| 42 | + size_t len = strlen(sql); |
| 43 | + for (auto _ : state) { |
| 44 | + auto r = parser.parse(sql, len); |
| 45 | + benchmark::DoNotOptimize(r.ast); |
| 46 | + } |
| 47 | +} |
| 48 | +BENCHMARK(BM_Ours_Select_Simple); |
| 49 | + |
| 50 | +static void BM_PgQuery_Select_Simple(benchmark::State& state) { |
| 51 | + const char* sql = comparison_queries[0].sql; |
| 52 | + for (auto _ : state) { |
| 53 | + PgQueryParseResult result = pg_query_parse(sql); |
| 54 | + benchmark::DoNotOptimize(result.parse_tree); |
| 55 | + pg_query_free_parse_result(result); |
| 56 | + } |
| 57 | +} |
| 58 | +BENCHMARK(BM_PgQuery_Select_Simple); |
| 59 | + |
| 60 | +static void BM_Ours_Select_Join(benchmark::State& state) { |
| 61 | + Parser<Dialect::PostgreSQL> parser; |
| 62 | + const char* sql = comparison_queries[1].sql; |
| 63 | + size_t len = strlen(sql); |
| 64 | + for (auto _ : state) { |
| 65 | + auto r = parser.parse(sql, len); |
| 66 | + benchmark::DoNotOptimize(r.ast); |
| 67 | + } |
| 68 | +} |
| 69 | +BENCHMARK(BM_Ours_Select_Join); |
| 70 | + |
| 71 | +static void BM_PgQuery_Select_Join(benchmark::State& state) { |
| 72 | + const char* sql = comparison_queries[1].sql; |
| 73 | + for (auto _ : state) { |
| 74 | + PgQueryParseResult result = pg_query_parse(sql); |
| 75 | + benchmark::DoNotOptimize(result.parse_tree); |
| 76 | + pg_query_free_parse_result(result); |
| 77 | + } |
| 78 | +} |
| 79 | +BENCHMARK(BM_PgQuery_Select_Join); |
| 80 | + |
| 81 | +static void BM_Ours_Select_Complex(benchmark::State& state) { |
| 82 | + Parser<Dialect::PostgreSQL> parser; |
| 83 | + const char* sql = comparison_queries[2].sql; |
| 84 | + size_t len = strlen(sql); |
| 85 | + for (auto _ : state) { |
| 86 | + auto r = parser.parse(sql, len); |
| 87 | + benchmark::DoNotOptimize(r.ast); |
| 88 | + } |
| 89 | +} |
| 90 | +BENCHMARK(BM_Ours_Select_Complex); |
| 91 | + |
| 92 | +static void BM_PgQuery_Select_Complex(benchmark::State& state) { |
| 93 | + const char* sql = comparison_queries[2].sql; |
| 94 | + for (auto _ : state) { |
| 95 | + PgQueryParseResult result = pg_query_parse(sql); |
| 96 | + benchmark::DoNotOptimize(result.parse_tree); |
| 97 | + pg_query_free_parse_result(result); |
| 98 | + } |
| 99 | +} |
| 100 | +BENCHMARK(BM_PgQuery_Select_Complex); |
| 101 | + |
| 102 | +static void BM_Ours_Insert(benchmark::State& state) { |
| 103 | + Parser<Dialect::PostgreSQL> parser; |
| 104 | + const char* sql = comparison_queries[3].sql; |
| 105 | + size_t len = strlen(sql); |
| 106 | + for (auto _ : state) { |
| 107 | + auto r = parser.parse(sql, len); |
| 108 | + benchmark::DoNotOptimize(r.ast); |
| 109 | + } |
| 110 | +} |
| 111 | +BENCHMARK(BM_Ours_Insert); |
| 112 | + |
| 113 | +static void BM_PgQuery_Insert(benchmark::State& state) { |
| 114 | + const char* sql = comparison_queries[3].sql; |
| 115 | + for (auto _ : state) { |
| 116 | + PgQueryParseResult result = pg_query_parse(sql); |
| 117 | + benchmark::DoNotOptimize(result.parse_tree); |
| 118 | + pg_query_free_parse_result(result); |
| 119 | + } |
| 120 | +} |
| 121 | +BENCHMARK(BM_PgQuery_Insert); |
| 122 | + |
| 123 | +static void BM_Ours_Update(benchmark::State& state) { |
| 124 | + Parser<Dialect::PostgreSQL> parser; |
| 125 | + const char* sql = comparison_queries[4].sql; |
| 126 | + size_t len = strlen(sql); |
| 127 | + for (auto _ : state) { |
| 128 | + auto r = parser.parse(sql, len); |
| 129 | + benchmark::DoNotOptimize(r.ast); |
| 130 | + } |
| 131 | +} |
| 132 | +BENCHMARK(BM_Ours_Update); |
| 133 | + |
| 134 | +static void BM_PgQuery_Update(benchmark::State& state) { |
| 135 | + const char* sql = comparison_queries[4].sql; |
| 136 | + for (auto _ : state) { |
| 137 | + PgQueryParseResult result = pg_query_parse(sql); |
| 138 | + benchmark::DoNotOptimize(result.parse_tree); |
| 139 | + pg_query_free_parse_result(result); |
| 140 | + } |
| 141 | +} |
| 142 | +BENCHMARK(BM_PgQuery_Update); |
| 143 | + |
| 144 | +static void BM_Ours_Delete(benchmark::State& state) { |
| 145 | + Parser<Dialect::PostgreSQL> parser; |
| 146 | + const char* sql = comparison_queries[5].sql; |
| 147 | + size_t len = strlen(sql); |
| 148 | + for (auto _ : state) { |
| 149 | + auto r = parser.parse(sql, len); |
| 150 | + benchmark::DoNotOptimize(r.ast); |
| 151 | + } |
| 152 | +} |
| 153 | +BENCHMARK(BM_Ours_Delete); |
| 154 | + |
| 155 | +static void BM_PgQuery_Delete(benchmark::State& state) { |
| 156 | + const char* sql = comparison_queries[5].sql; |
| 157 | + for (auto _ : state) { |
| 158 | + PgQueryParseResult result = pg_query_parse(sql); |
| 159 | + benchmark::DoNotOptimize(result.parse_tree); |
| 160 | + pg_query_free_parse_result(result); |
| 161 | + } |
| 162 | +} |
| 163 | +BENCHMARK(BM_PgQuery_Delete); |
| 164 | + |
| 165 | +static void BM_Ours_Begin(benchmark::State& state) { |
| 166 | + Parser<Dialect::PostgreSQL> parser; |
| 167 | + const char* sql = comparison_queries[8].sql; |
| 168 | + size_t len = strlen(sql); |
| 169 | + for (auto _ : state) { |
| 170 | + auto r = parser.parse(sql, len); |
| 171 | + benchmark::DoNotOptimize(r.stmt_type); |
| 172 | + } |
| 173 | +} |
| 174 | +BENCHMARK(BM_Ours_Begin); |
| 175 | + |
| 176 | +static void BM_PgQuery_Begin(benchmark::State& state) { |
| 177 | + const char* sql = comparison_queries[8].sql; |
| 178 | + for (auto _ : state) { |
| 179 | + PgQueryParseResult result = pg_query_parse(sql); |
| 180 | + benchmark::DoNotOptimize(result.parse_tree); |
| 181 | + pg_query_free_parse_result(result); |
| 182 | + } |
| 183 | +} |
| 184 | +BENCHMARK(BM_PgQuery_Begin); |
0 commit comments