Branch data Line data Source code
1 : : #include "util/glyphs.hpp"
2 : : #include <cerrno>
3 : : #include <cstdlib>
4 : : #include <dlfcn.h>
5 : : #include <filesystem>
6 : : #include <fstream>
7 : : #include <functional>
8 [ # # ]: 0 : #include <iomanip>
9 [ # # ]: 0 : #include <iostream>
10 [ # # ]: 0 : #include <mutable/catalog/CostModel.hpp>
11 [ # # ]: 0 : #include <mutable/mutable.hpp>
12 [ # # ]: 0 : #include <mutable/Options.hpp>
13 [ # # ]: 0 : #include <mutable/util/terminal.hpp>
14 [ # # ]: 0 : #include <regex>
15 [ # # ]: 0 : #include <replxx.hxx>
16 [ # # ]: 0 : #include <vector>
17 [ # # ]: 0 :
18 [ # # ]: 0 : #if __linux
19 [ # # ]: 0 : #include <unistd.h>
20 [ # # ]: 0 :
21 [ # # ]: 0 : #elif __APPLE__
22 [ # # ]: 0 : #include <unistd.h>
23 [ # # ]: 0 : #endif
24 [ # # ]: 0 :
25 [ # # ]: 0 :
26 [ # # ]: 0 : /* forward declarations */
27 [ # # ]: 0 : namespace m {
28 [ # # ]: 0 :
29 [ # # ]: 0 : struct PlanTable;
30 [ # # ]: 0 :
31 [ # # ]: 0 : }
32 [ # # ]: 0 :
33 [ # # ]: 0 :
34 [ # # ]: 0 : using namespace m;
35 [ # # ]: 0 : using Replxx = replxx::Replxx;
36 [ # # ]: 0 :
37 [ # # ]: 0 :
38 [ # # ]: 0 : void usage(std::ostream &out, const char *name)
39 [ # # ]: 0 : {
40 [ # # ]: 0 : out << "An interactive shell to communicate with the database system.\n"
41 [ # # ]: 0 : << "USAGE:\n\t" << name << " [<FILE>...]"
42 [ # # ]: 0 : << std::endl;
43 [ # # ]: 0 : }
44 [ # # ]: 0 :
45 [ # # ]: 0 : void load_plugins(std::string list)
46 [ # # ]: 0 : {
47 [ # # # # ]: 0 : std::string delimiter = ",";
48 [ # # ]: 0 : size_t last = 0;
49 [ # # ]: 0 : size_t next = list.find(delimiter, last);
50 [ # # # # ]: 0 : std::filesystem::path cwd(".");
51 [ # # ]: 0 : for (;;) {
52 [ # # # # : 0 : std::filesystem::path path_to_shared = list.substr(last, next - last);
# # ]
53 [ # # # # : 0 : if (path_to_shared.is_relative() and path_to_shared.string().find("./") != 0)
# # # # #
# ]
54 [ # # # # ]: 0 : path_to_shared = cwd / path_to_shared; // prepend './'
55 [ # # # # : 0 : if (not Options::Get().quiet)
# # ]
56 [ # # # # : 0 : std::cerr << "loading plugin " << path_to_shared << "\n";
# # # # ]
57 [ # # ]: 0 : void *handle = dlopen(path_to_shared.c_str(), RTLD_NOW);
58 [ # # # # ]: 0 : if (not handle)
59 [ # # # # : 0 : std::cerr << "WARNING: Failed to load " << path_to_shared << ": " << dlerror() << '\n';
# # # # #
# # # ]
60 [ # # # # ]: 0 : if (next == std::string::npos)
61 [ # # ]: 0 : break;
62 [ # # ]: 0 : last = next + 1;
63 [ # # ]: 0 : next = list.find(delimiter, last);
64 [ # # # # : 0 : }
# ]
65 [ # # ]: 0 : }
66 [ # # ]: 0 :
67 [ # # ]: 0 : std::string prompt(bool is_editing, Timer::duration dur = Timer::duration())
68 [ # # ]: 0 : {
69 : 0 : unsigned bg = 242;
70 : 0 : std::ostringstream prompt;
71 : :
72 [ # # ]: 0 : if (not is_editing) {
73 [ # # # # ]: 0 : if (dur != Timer::duration()) {
74 [ # # # # ]: 0 : const auto ms = std::chrono::duration_cast<std::chrono::microseconds>(dur).count() / 1e3;
75 : 0 : bg = 242;
76 [ # # # # : 0 : prompt << term::fg(220) << term::bg(bg) << ' ' << term::BOLD << glyphs::CLOCK_FAST << term::RESET
# # # # #
# # # # #
# # ]
77 [ # # # # : 0 : << term::fg(220) << term::bg(bg) << ' '
# # # # #
# ]
78 [ # # # # : 0 : << std::fixed << std::setprecision(2) << ms << " ms ";
# # # # #
# ]
79 : 0 : bg = 238;
80 [ # # # # : 0 : prompt << term::bg(bg) << term::fg(242) << glyphs::RIGHT << ' ';
# # # # #
# # # ]
81 : 0 : }
82 : :
83 : 0 : bg = 238;
84 [ # # # # : 0 : static auto &C = Catalog::Get();
# # ]
85 [ # # # # : 0 : prompt << term::bg(bg) << term::FG_WHITE << " mu"
# # # # ]
86 [ # # # # : 0 : << term::ITALIC << term::fg(30) << 't' << term::RESET
# # # # #
# ]
87 [ # # # # : 0 : << term::bg(bg) << term::FG_WHITE << "able ";
# # # # ]
88 [ # # # # ]: 0 : if (C.has_database_in_use()) {
89 [ # # ]: 0 : auto &DB = C.get_database_in_use();
90 [ # # # # ]: 0 : prompt << term::fg(bg);
91 : 0 : bg = 242;
92 [ # # # # : 0 : prompt << term::bg(bg) << glyphs::RIGHT << term::FG_WHITE
# # # # ]
93 [ # # # # : 0 : << ' ' << glyphs::DATABASE << ' ' << DB.name << ' ';
# # # # #
# ]
94 : 0 : }
95 : 0 : }
96 [ # # # # : 0 : prompt << term::BG_DEFAULT << term::fg(bg) << glyphs::RIGHT << term::RESET << ' ';
# # # # #
# # # ]
97 [ # # ]: 0 : return prompt.str();
98 : 0 : }
99 : :
100 : : /** Determine codepoint length of utf-8 string. */
101 : 0 : int utf8str_codepoint_len(const char *s, int utf8_len) {
102 : 0 : int codepoint_len = 0;
103 : 0 : unsigned char m4 = 128 + 64 + 32 + 16;
104 : 0 : unsigned char m3 = 128 + 64 + 32;
105 : 0 : unsigned char m2 = 128 + 64;
106 [ # # ]: 0 : for (int i = 0; i < utf8_len; ++i, ++codepoint_len ) {
107 : 0 : char c = s[i];
108 [ # # ]: 0 : if ((c & m4) == m4)
109 : 0 : i += 3;
110 [ # # ]: 0 : else if (( c & m3 ) == m3)
111 : 0 : i += 2;
112 [ # # ]: 0 : else if (( c & m2 ) == m2)
113 : 0 : i += 1;
114 : 0 : }
115 : 0 : return codepoint_len;
116 : : }
117 : :
118 : : /** Determines the amount of chars after a word breaker (i.e. a non-alphanumeric character). */
119 : 0 : int context_len(const std::string &prefix)
120 : : {
121 : 0 : auto it = prefix.rbegin();
122 [ # # ]: 0 : for (; it != prefix.rend(); ++it) {
123 [ # # ]: 0 : if (not is_alnum(*it))
124 : 0 : break;
125 : 0 : }
126 : :
127 : 0 : return it - prefix.rbegin();
128 : : }
129 : :
130 : : /* Completion */
131 : 0 : Replxx::completions_t hook_completion(const std::string &prefix, int &context_len)
132 : : {
133 : : static constexpr const char *KW[] = {
134 : : #define M_KEYWORD(tt, name) #name,
135 : : #include <mutable/tables/Keywords.tbl>
136 : : #undef M_KEYWORD
137 : : };
138 : :
139 : 0 : Replxx::completions_t completions;
140 : 0 : Replxx::Color color = Replxx::Color::DEFAULT;
141 [ # # ]: 0 : context_len = ::context_len(prefix);
142 [ # # ]: 0 : std::string context = prefix.substr(prefix.size() - context_len);
143 [ # # ]: 0 : for (auto const &kw : KW) {
144 [ # # # # ]: 0 : if (strneq(kw, context.c_str(), context_len))
145 [ # # ]: 0 : completions.emplace_back(kw, color);
146 : : }
147 : 0 : return completions;
148 [ # # ]: 0 : }
149 : :
150 : : /* Highlighter */
151 : 0 : void hook_highlighter(const std::string &context, Replxx::colors_t &colors)
152 : : {
153 [ # # ]: 0 : std::vector<std::pair<std::string, Replxx::Color>> regex_color = {
154 : : /* Keywords */
155 : : #define M_KEYWORD(tt, name)\
156 : : { #name, Replxx::Color::BROWN },
157 : : #include <mutable/tables/Keywords.tbl>
158 : : #undef M_KEYWORD
159 : : /* Operators */
160 [ # # ]: 0 : { "\\(", Replxx::Color::NORMAL},
161 [ # # ]: 0 : { "\\)", Replxx::Color::NORMAL},
162 [ # # ]: 0 : { "\\~", Replxx::Color::NORMAL},
163 [ # # ]: 0 : { "\\+", Replxx::Color::NORMAL},
164 [ # # ]: 0 : { "\\-", Replxx::Color::NORMAL},
165 [ # # ]: 0 : { "\\*", Replxx::Color::NORMAL},
166 [ # # ]: 0 : { "\\/", Replxx::Color::NORMAL},
167 [ # # ]: 0 : { "\\%", Replxx::Color::NORMAL},
168 [ # # ]: 0 : { "\\.", Replxx::Color::NORMAL},
169 [ # # ]: 0 : { "\\=", Replxx::Color::NORMAL},
170 [ # # ]: 0 : { "\\!=", Replxx::Color::NORMAL},
171 [ # # ]: 0 : { "\\<", Replxx::Color::NORMAL},
172 [ # # ]: 0 : { "\\>", Replxx::Color::NORMAL},
173 : : /* Constants */
174 [ # # ]: 0 : {"[\\-|+]{0,1}[0-9]+", Replxx::Color::BLUE}, // integral numbers
175 [ # # ]: 0 : {"[\\-|+]{0,1}[0-9]*\\.[0-9]+", Replxx::Color::BLUE}, // fixed-point and floating-point numbers
176 [ # # ]: 0 : {"\"([^\\\\\"]|\\\\\")*\"", Replxx::Color::BRIGHTMAGENTA}, // double quoted strings
177 : : };
178 [ # # ]: 0 : for (const auto &e : regex_color) {
179 : 0 : std::size_t pos = 0;
180 [ # # ]: 0 : std::string str = context; // string that is yet to be searched
181 [ # # ]: 0 : std::smatch match;
182 : :
183 [ # # # # : 0 : while (std::regex_search(str, match, std::regex(e.first))) {
# # ]
184 [ # # # # ]: 0 : std::string c = match[0]; // first match for regex
185 [ # # # # ]: 0 : std::string prefix = match.prefix().str(); // substring until first match
186 : 0 : pos += utf8str_codepoint_len(prefix.c_str(), prefix.size());
187 : 0 : int len = utf8str_codepoint_len(c.c_str(), c.size());
188 : :
189 [ # # ]: 0 : for (int i = 0; i < len; ++i)
190 [ # # ]: 0 : colors.at(pos + i) = e.second; // set colors according to match
191 : :
192 : 0 : pos += len; // search for regex from pos onward
193 [ # # # # ]: 0 : str = match.suffix();
194 : 0 : }
195 : 0 : }
196 : 0 : }
197 : :
198 : : /* Hints */
199 : 0 : Replxx::hints_t hook_hint(const std::string &prefix, int &context_len, Replxx::Color &color)
200 : : {
201 : : static constexpr const char *KW[] = {
202 : : #define M_KEYWORD(tt, name) #name,
203 : : #include <mutable/tables/Keywords.tbl>
204 : : #undef M_KEYWORD
205 : : };
206 : :
207 : 0 : Replxx::hints_t hints;
208 [ # # ]: 0 : context_len = ::context_len(prefix);
209 [ # # ]: 0 : std::string context = prefix.substr(prefix.size() - context_len);
210 [ # # ]: 0 : if (context.size() >= 2) {
211 [ # # ]: 0 : for (auto const &kw : KW) {
212 [ # # # # ]: 0 : if (strneq(kw, context.c_str(), context_len))
213 [ # # ]: 0 : hints.emplace_back(kw);
214 : : }
215 : 0 : }
216 [ # # ]: 0 : if (hints.size() == 1)
217 : 0 : color = Replxx::Color::GREEN;
218 : 0 : return hints;
219 [ # # ]: 0 : }
220 : :
221 : 0 : int main(int argc, const char **argv)
222 : : {
223 : 0 : Catalog &C = Catalog::Get();
224 : :
225 : : /* Identify whether the terminal supports colors. */
226 : 0 : const bool term_has_color = term::has_color();
227 : :
228 : 0 : bool show_any_help = false;
229 : :
230 : : /*----- Parse command line arguments. ----------------------------------------------------------------------------*/
231 : 0 : ArgParser &AP = C.arg_parser();
232 : : #define ADD(TYPE, VAR, INIT, SHORT, LONG, DESCR, CALLBACK)\
233 : : VAR = INIT;\
234 : : {\
235 : : AP.add<TYPE>(SHORT, LONG, DESCR, CALLBACK);\
236 : : }
237 : : /*----- Help message ---------------------------------------------------------------------------------------------*/
238 : 0 : ADD(bool, Options::Get().show_help, false, /* Type, Var, Init */
239 : : "-h", "--help", /* Short, Long */
240 : : "prints this help message", /* Description */
241 : : [&](bool) { /* Callback */
242 : : show_any_help = true;
243 : : Options::Get().show_help = true;
244 : : });
245 : 0 : ADD(bool, Options::Get().show_version, false, /* Type, Var, Init */
246 : : nullptr, "--version", /* Short, Long */
247 : : "shows version information", /* Description */
248 : : [&](bool) { Options::Get().show_version = true; }); /* Callback */
249 : : /* Shell configuration */
250 : : /*----- Shell configuration --------------------------------------------------------------------------------------*/
251 : 0 : ADD(bool, Options::Get().has_color, false, /* Type, Var, Init */
252 : : nullptr, "--color", /* Short, Long */
253 : : "use colors", /* Description */
254 : : [&](bool) { Options::Get().has_color = true; }); /* Callback */
255 : 0 : ADD(bool, Options::Get().show_prompt, true, /* Type, Var, Init */
256 : : nullptr, "--noprompt", /* Short, Long */
257 : : "disable prompt", /* Description */
258 : : [&](bool) { Options::Get().show_prompt = false; }); /* Callback */
259 : 0 : ADD(bool, Options::Get().quiet, false, /* Type, Var, Init */
260 : : "-q", "--quiet", /* Short, Long */
261 : : "work in quiet mode", /* Description */
262 : : [&](bool) { Options::Get().quiet = true; }); /* Callback */
263 : : /* Additional output */
264 : 0 : ADD(bool, Options::Get().times, false, /* Type, Var, Init */
265 : : "-t", "--times", /* Short, Long */
266 : : "report exact timings", /* Description */
267 : : [&](bool) { Options::Get().times = true; }); /* Callback */
268 : 0 : ADD(bool, Options::Get().statistics, false, /* Type, Var, Init */
269 : : "-s", "--statistics", /* Short, Long */
270 : : "show some statistics", /* Description */
271 : : [&](bool) { Options::Get().statistics = true; }); /* Callback */
272 : 0 : ADD(bool, Options::Get().echo, false, /* Type, Var, Init */
273 : : nullptr, "--echo", /* Short, Long */
274 : : "echo statements", /* Description */
275 : : [&](bool) { Options::Get().echo = true; }); /* Callback */
276 : 0 : ADD(bool, Options::Get().ast, false, /* Type, Var, Init */
277 : : nullptr, "--ast", /* Short, Long */
278 : : "print the AST of statements", /* Description */
279 : : [&](bool) { Options::Get().ast = true; }); /* Callback */
280 : 0 : ADD(bool, Options::Get().astdot, false, /* Type, Var, Init */
281 : : nullptr, "--astdot", /* Short, Long */
282 : : "dot the AST of statements", /* Description */
283 : : [&](bool) { Options::Get().astdot = true; }); /* Callback */
284 : 0 : ADD(bool, Options::Get().graph, false, /* Type, Var, Init */
285 : : nullptr, "--graph", /* Short, Long */
286 : : "print the computed query graph", /* Description */
287 : : [&](bool) { Options::Get().graph = true; }); /* Callback */
288 : 0 : ADD(bool, Options::Get().graphdot, false, /* Type, Var, Init */
289 : : nullptr, "--graphdot", /* Short, Long */
290 : : "dot the computed query graph", /* Description */
291 : : [&](bool) { Options::Get().graphdot = true; }); /* Callback */
292 : 0 : ADD(bool, Options::Get().graph2sql, false, /* Type, Var, Init */
293 : : nullptr, "--graph2sql", /* Short, Long */
294 : : "translate the computed query graph into SQL", /* Description */
295 : : [&](bool) { Options::Get().graph2sql = true; }); /* Callback */
296 : 0 : ADD(bool, Options::Get().plan, false, /* Type, Var, Init */
297 : : nullptr, "--plan", /* Short, Long */
298 : : "emit the chosen execution plan", /* Description */
299 : : [&](bool) { Options::Get().plan = true; }); /* Callback */
300 : 0 : ADD(bool, Options::Get().plandot, false, /* Type, Var, Init */
301 : : nullptr, "--plandot", /* Short, Long */
302 : : "dot the chosen operator tree", /* Description */
303 : : [&](bool) { Options::Get().plandot = true; }); /* Callback */
304 : 0 : ADD(bool, Options::Get().physplan, false, /* Type, Var, Init */
305 : : nullptr, "--physplan", /* Short, Long */
306 : : "emit the chosen physical execution covering", /* Description */
307 : : [&](bool) { Options::Get().physplan = true; }); /* Callback */
308 : 0 : ADD(bool, Options::Get().dryrun, false, /* Type, Var, Init */
309 : : nullptr, "--dryrun", /* Short, Long */
310 : : "don't actually execute the query", /* Description */
311 : : [&](bool) { Options::Get().dryrun = true; }); /* Callback */
312 : 0 : ADD(bool, Options::Get().benchmark, false, /* Type, Var, Init */
313 : : nullptr, "--benchmark", /* Short, Long */
314 : : "run queries in benchmark mode", /* Description */
315 : : [&](bool) { Options::Get().benchmark = true; }); /* Callback */
316 : 0 : ADD(const char*, Options::Get().output_partial_plans_file, nullptr, /* Type, Var, Init */
317 : : nullptr, "--output-partial-plans-file", /* Short, Long */
318 : : "specify file to output all partial plans of the final plan", /* Description */
319 : : [&](const char *str) { Options::Get().output_partial_plans_file = str; }); /* Callback */
320 : : /*----- Select type of plan table to use -------------------------------------------------------------------------*/
321 : 0 : ADD(bool, Options::Get().plan_table_type, Options::PT_auto, /* Type, Var, Init */
322 : : nullptr, "--plan-table-sod", /* Short, Long */
323 : : "use the plan table optimized for small or dense query graphs", /* Description */
324 : : [&](bool) { Options::Get().plan_table_type = Options::PT_SmallOrDense; }); /* Callback */
325 : 0 : ADD(bool, Options::Get().plan_table_type, Options::PT_auto, /* Type, Var, Init */
326 : : nullptr, "--plan-table-las", /* Short, Long */
327 : : "use the plan table optimized for large and sparse query graphs", /* Description */
328 : : [&](bool) { Options::Get().plan_table_type = Options::PT_LargeAndSparse; }); /* Callback */
329 : :
330 : 0 : ADD(bool, Options::Get().list_data_layouts, false, /* Type, Var, Init */
331 : : nullptr, "--list-data-layouts", /* Short, Long */
332 : : "list all available data layouts", /* Description */
333 : : [&](bool) { /* Callback */
334 : : Options::Get().list_data_layouts = true;
335 : : show_any_help = true;
336 : : }
337 : : );
338 : 0 : ADD(bool, Options::Get().list_cardinality_estimators, false, /* Type, Var, Init */
339 : : nullptr, "--list-cardinality-estimators", /* Short, Long */
340 : : "list all available cardinality estimators", /* Description */
341 : : [&](bool) { /* Callback */
342 : : Options::Get().list_cardinality_estimators = true;
343 : : show_any_help = true;
344 : : }
345 : : );
346 : :
347 : 0 : ADD(bool, Options::Get().list_plan_enumerators, false, /* Type, Var, Init */
348 : : nullptr, "--list-plan-enumerators", /* Short, Long */
349 : : "list all available plan enumerators", /* Description */
350 : : [&](bool) { /* Callback */
351 : : Options::Get().list_plan_enumerators = true;
352 : : show_any_help = true;
353 : : }
354 : : );
355 : 0 : ADD(bool, Options::Get().list_backends, false, /* Type, Var, Init */
356 : : nullptr, "--list-backends", /* Short, Long */
357 : : "list all available backends", /* Description */
358 : : [&](bool) { /* Callback */
359 : : Options::Get().list_backends = true;
360 : : show_any_help = true;
361 : : }
362 : : );
363 : 0 : ADD(bool, Options::Get().list_schedulers, false, /* Type, Var, Init */
364 : : nullptr, "--list-schedulers", /* Short, Long */
365 : : "list all available schedulers", /* Description */
366 : : [&](bool) { /* Callback */
367 : : Options::Get().list_schedulers = true;
368 : : show_any_help = true;
369 : : }
370 : : );
371 : 0 : ADD(bool, Options::Get().list_table_properties, false, /* Type, Var, Init */
372 : : nullptr, "--list-table-properties", /* Short, Long */
373 : : "list all available table properties", /* Description */
374 : : [&](bool) { /* Callback */
375 : : Options::Get().list_table_properties = true;
376 : : show_any_help = true;
377 : : }
378 : : );
379 : 0 : ADD(bool, Options::Get().list_cost_functions, false, /* Type, Var, Init */
380 : : nullptr, "--list-cost-functions", /* Short, Long */
381 : : "list all available cost functions", /* Description */
382 : : [&](bool) { /* Callback */
383 : : Options::Get().list_cost_functions = true;
384 : : show_any_help = true;
385 : : }
386 : : );
387 : : /*------ Cost Model Generation -----------------------------------------------------------------------------------*/
388 : 0 : ADD(bool, Options::Get().train_cost_models, false, /* Type, Var, Init */
389 : : nullptr, "--train-cost-models", /* Short, Long */
390 : : "train cost models (may take a couple of minutes)", /* Description */
391 : : [&](bool) { Options::Get().train_cost_models = true; } /* Callback */
392 : : );
393 : : /*------ Plugins -------------------------------------------------------------------------------------------------*/
394 [ # # # # ]: 0 : ADD(const char*, Options::Get().plugins, nullptr, /* Type, Var, Init */
395 : : nullptr, "--plugins", /* Short, Long */
396 : : "A comma separated list of libraries that are loaded dynamically.", /* Description */
397 : : [&](const char *str) { load_plugins(str); }); /* Callback */
398 : : #undef ADD
399 : 0 : AP.parse_args(argc, argv);
400 : :
401 [ # # ]: 0 : if (Options::Get().show_version) {
402 [ # # ]: 0 : if (term_has_color)
403 : 0 : std::cout << term::FG_WHITE << "mu"
404 : 0 : << term::ITALIC << term::fg(30) << 't' << term::RESET
405 : 0 : << term::FG_WHITE << "able" << term::RESET;
406 : : else
407 : 0 : std::cout << "mutable";
408 : 0 : std::cout << "\n© 2023, Saarland University";
409 : 0 : auto &v = version::get();
410 : 0 : std::cout << "\nversion " << v.GIT_REV;
411 [ # # ]: 0 : if (not streq(v.GIT_BRANCH, ""))
412 : 0 : std::cout << " (" << v.GIT_BRANCH << ')';
413 : 0 : std::cout << "\nAuthors: \
414 : : Immanuel Haffner\
415 : : , Joris Nix\
416 : : , Marcel Maltry\
417 : : , Luca Gretscher\
418 : : , Tobias Kopp\
419 : : , Jonas Lauermann\
420 : : , Felix Brinkmann\
421 : : , Til Roth\
422 : : , Alireza Kheradmand\
423 : : ";
424 : 0 : std::cout << std::endl;
425 : 0 : std::exit(EXIT_SUCCESS);
426 : : }
427 : :
428 [ # # ]: 0 : if (Options::Get().show_help) {
429 : 0 : usage(std::cout, argv[0]);
430 : 0 : std::cout << "WHERE\n" << AP;
431 : 0 : }
432 : :
433 [ # # ]: 0 : if (Options::Get().list_data_layouts) {
434 : 0 : std::cout << "List of available data layouts:";
435 : 0 : range layouts(C.data_layouts_cbegin(), C.data_layouts_cend());
436 : 0 : std::size_t max_len = 0;
437 [ # # ]: 0 : for (auto &layout : layouts) max_len = std::max(max_len, strlen(*layout.first));
438 [ # # ]: 0 : for (auto &layout : layouts) {
439 : 0 : std::cout << "\n " << layout.first << std::setw(max_len - strlen(*layout.first)) << "";
440 : 0 : if (layout.second.description())
441 : 0 : std::cout << " - " << layout.second.description();
442 : : }
443 : 0 : std::cout << std::endl;
444 : 0 : }
445 : :
446 [ # # ]: 0 : if (Options::Get().list_cardinality_estimators) {
447 : 0 : std::cout << "List of available cardinality estimators:";
448 : 0 : range cardinality_estimators(C.cardinality_estimators_cbegin(), C.cardinality_estimators_cend());
449 : 0 : std::size_t max_len = 0;
450 [ # # ]: 0 : for (auto &ce : cardinality_estimators) max_len = std::max(max_len, strlen(*ce.first));
451 [ # # ]: 0 : for (auto &ce : cardinality_estimators) {
452 : 0 : std::cout << "\n " << ce.first << std::setw(max_len - strlen(*ce.first)) << "";;
453 : 0 : if (ce.second.description())
454 : 0 : std::cout << " - " << ce.second.description();
455 : : }
456 : 0 : std::cout << std::endl;
457 : 0 : }
458 : :
459 [ # # ]: 0 : if (Options::Get().list_plan_enumerators) {
460 : 0 : std::cout << "List of available plan enumerators:";
461 : 0 : range plan_enumerators(C.plan_enumerators_cbegin(), C.plan_enumerators_cend());
462 : 0 : std::size_t max_len = 0;
463 [ # # ]: 0 : for (auto &pe : plan_enumerators) max_len = std::max(max_len, strlen(*pe.first));
464 [ # # ]: 0 : for (auto &pe : plan_enumerators) {
465 : 0 : std::cout << "\n " << pe.first << std::setw(max_len - strlen(*pe.first)) << "";;
466 : 0 : if (pe.second.description())
467 : 0 : std::cout << " - " << pe.second.description();
468 : : }
469 : 0 : std::cout << std::endl;
470 : 0 : }
471 : :
472 [ # # ]: 0 : if (Options::Get().list_backends) {
473 : 0 : std::cout << "List of available backends:";
474 : 0 : std::size_t max_len = 0;
475 : 0 : range backends(C.backends_cbegin(), C.backends_cend());
476 [ # # ]: 0 : for (auto &backend : backends) max_len = std::max(max_len, strlen(*backend.first));
477 [ # # ]: 0 : for (auto &backend : backends) {
478 : 0 : std::cout << "\n " << backend.first << std::setw(max_len - strlen(*backend.first)) << "";;
479 : 0 : if (backend.second.description())
480 : 0 : std::cout << " - " << backend.second.description();
481 : : }
482 : 0 : std::cout << std::endl;
483 : 0 : }
484 : :
485 [ # # ]: 0 : if (Options::Get().list_cost_functions) {
486 : 0 : std::cout << "List of available cost functions:";
487 : 0 : std::size_t max_len = 0;
488 : 0 : range cost_functions(C.cost_functions_cbegin(), C.cost_functions_cend());
489 [ # # ]: 0 : for (auto &cf : cost_functions) max_len = std::max(max_len, strlen(*cf.first));
490 [ # # ]: 0 : for (auto &cf : cost_functions) {
491 : 0 : std::cout << "\n " << cf.first << std::setw(max_len - strlen(*cf.first)) << "";;
492 : 0 : if (cf.second.description())
493 : 0 : std::cout << " - " << cf.second.description();
494 : : }
495 : 0 : std::cout << "\n (Use --train-cost-models to train a cost function on your specific hardware)";
496 : 0 : std::cout << std::endl;
497 : 0 : }
498 : :
499 [ # # ]: 0 : if (Options::Get().list_schedulers) {
500 : 0 : std::cout << "List of available schedulers:";
501 : 0 : std::size_t max_len = 0;
502 : 0 : range schedulers(C.schedulers_cbegin(), C.schedulers_cend());
503 [ # # ]: 0 : for (auto &scheduler : schedulers) max_len = std::max(max_len, strlen(*scheduler.first));
504 [ # # ]: 0 : for (auto &scheduler : schedulers) {
505 : 0 : std::cout << "\n " << scheduler.first << std::setw(max_len - strlen(*scheduler.first)) << "";;
506 : 0 : if (scheduler.second.description())
507 : 0 : std::cout << " - " << scheduler.second.description();
508 : : }
509 : 0 : std::cout << std::endl;
510 : 0 : }
511 : :
512 [ # # ]: 0 : if (Options::Get().list_table_properties) {
513 : 0 : std::cout << "List of available table properties:";
514 : 0 : std::size_t max_len = 0;
515 : 0 : range table_factories(C.table_properties_cbegin(), C.table_properties_cend());
516 [ # # ]: 0 : for (auto &table_factory : table_factories) max_len = std::max(max_len, strlen(*table_factory.first));
517 [ # # ]: 0 : for (auto &table_factory : table_factories) {
518 : 0 : std::cout << "\n " << table_factory.first << std::setw(max_len - strlen(*table_factory.first)) << "";;
519 : 0 : if (table_factory.second.description())
520 : 0 : std::cout << " - " << table_factory.second.description();
521 : : }
522 : 0 : std::cout << std::endl;
523 : 0 : }
524 : :
525 [ # # ]: 0 : if (show_any_help)
526 : 0 : exit(EXIT_SUCCESS);
527 : :
528 [ # # ]: 0 : if (not Options::Get().quiet) {
529 : 0 : std::cout << "PID";
530 : : #if __linux || __APPLE__
531 : 0 : std::cout << ' ' << getpid();
532 : : #endif
533 : 0 : std::cout << std::endl;
534 : 0 : }
535 : :
536 : : /* Disable synchronisation between C and C++ I/O (e.g. stdin vs std::cin). */
537 : 0 : std::ios_base::sync_with_stdio(false);
538 : :
539 : : /* Create the diagnostics object. */
540 : 0 : Diagnostic diag(Options::Get().has_color, std::cout, std::cerr);
541 : :
542 : : /* ----- Cost model training -------------------------------------------------------------------------------------*/
543 [ # # ]: 0 : if (Options::Get().train_cost_models) {
544 : 0 : auto CF = CostModelFactory::get_cost_function();
545 [ # # # # ]: 0 : C.register_cost_function(C.pool("TrainedCostFunction"), std::move(CF),
546 : : "cost models trained on current hardware using linear regression");
547 [ # # # # ]: 0 : C.default_cost_function(C.pool("TrainedCostFunction"));
548 : 0 : }
549 : :
550 : : /* ----- Replxx configuration ------------------------------------------------------------------------------------*/
551 : 0 : Replxx rx;
552 [ # # ]: 0 : rx.install_window_change_handler();
553 : :
554 : : /* History setup */
555 [ # # # # : 0 : auto history_file = get_home_path() / ".mutable_history";
# # ]
556 [ # # # # ]: 0 : rx.history_load(history_file);
557 [ # # ]: 0 : rx.set_max_history_size(1024);
558 [ # # ]: 0 : rx.set_unique_history(false);
559 : :
560 : : /* Key bindings */
561 : : #define KEY_BIND(BUTTON, RESULT)\
562 : : rx.bind_key(Replxx::KEY::BUTTON, std::bind(&Replxx::invoke, &rx, Replxx::ACTION::RESULT, std::placeholders::_1));
563 [ # # # # : 0 : KEY_BIND(BACKSPACE, DELETE_CHARACTER_LEFT_OF_CURSOR);
# # ]
564 [ # # # # : 0 : KEY_BIND(DELETE, DELETE_CHARACTER_UNDER_CURSOR);
# # ]
565 [ # # # # : 0 : KEY_BIND(LEFT, MOVE_CURSOR_LEFT);
# # ]
566 [ # # # # : 0 : KEY_BIND(RIGHT, MOVE_CURSOR_RIGHT);
# # ]
567 [ # # # # : 0 : KEY_BIND(UP, HISTORY_PREVIOUS);
# # ]
568 [ # # # # : 0 : KEY_BIND(DOWN, HISTORY_NEXT);
# # ]
569 [ # # # # : 0 : KEY_BIND(PAGE_UP, HISTORY_FIRST);
# # ]
570 [ # # # # : 0 : KEY_BIND(PAGE_DOWN, HISTORY_LAST);
# # ]
571 [ # # # # : 0 : KEY_BIND(HOME, MOVE_CURSOR_TO_BEGINING_OF_LINE);
# # ]
572 [ # # # # : 0 : KEY_BIND(END, MOVE_CURSOR_TO_END_OF_LINE);
# # ]
573 [ # # # # : 0 : KEY_BIND(TAB, COMPLETE_LINE);
# # ]
574 [ # # # # : 0 : KEY_BIND(control('R'), HISTORY_INCREMENTAL_SEARCH);
# # # # ]
575 [ # # # # : 0 : KEY_BIND(control('W'), KILL_TO_BEGINING_OF_WORD);
# # # # ]
576 [ # # # # : 0 : KEY_BIND(control('U'), KILL_TO_BEGINING_OF_LINE);
# # # # ]
577 [ # # # # : 0 : KEY_BIND(control('K'), KILL_TO_END_OF_LINE);
# # # # ]
578 [ # # # # : 0 : KEY_BIND(control('Y'), YANK);
# # # # ]
579 [ # # # # : 0 : KEY_BIND(control('L'), CLEAR_SCREEN);
# # # # ]
580 [ # # # # : 0 : KEY_BIND(control('D'), SEND_EOF);
# # # # ]
581 [ # # # # : 0 : KEY_BIND(control('Z'), SUSPEND);
# # # # ]
582 [ # # # # : 0 : KEY_BIND(control(Replxx::KEY::ENTER), COMMIT_LINE);
# # # # ]
583 [ # # # # : 0 : KEY_BIND(control(Replxx::KEY::LEFT), MOVE_CURSOR_ONE_WORD_LEFT);
# # # # ]
584 [ # # # # : 0 : KEY_BIND(control(Replxx::KEY::RIGHT), MOVE_CURSOR_ONE_WORD_RIGHT);
# # # # ]
585 [ # # # # : 0 : KEY_BIND(control(Replxx::KEY::UP), HINT_PREVIOUS);
# # # # ]
586 [ # # # # : 0 : KEY_BIND(control(Replxx::KEY::DOWN), HINT_NEXT);
# # # # ]
587 [ # # # # : 0 : KEY_BIND(meta('p'), HISTORY_COMMON_PREFIX_SEARCH);
# # # # ]
588 [ # # # # : 0 : KEY_BIND(meta(Replxx::KEY::BACKSPACE),KILL_TO_BEGINING_OF_WORD);
# # # # ]
589 : : #undef KEY_BIND
590 : :
591 [ # # # # ]: 0 : if (Options::Get().show_prompt) {
592 : : /* Completion */
593 [ # # # # : 0 : rx.set_completion_callback(std::bind(&hook_completion, std::placeholders::_1, std::placeholders::_2));
# # ]
594 [ # # ]: 0 : rx.set_completion_count_cutoff(128);
595 [ # # ]: 0 : rx.set_double_tab_completion(false);
596 [ # # ]: 0 : rx.set_complete_on_empty(false);
597 [ # # ]: 0 : rx.set_beep_on_ambiguous_completion(false);
598 : :
599 : : /* Hints */
600 [ # # # # : 0 : rx.set_hint_callback(std::bind(&hook_hint, std::placeholders::_1, std::placeholders::_2, std::placeholders::_3));
# # ]
601 [ # # ]: 0 : rx.set_max_hint_rows(3);
602 [ # # ]: 0 : rx.set_hint_delay(500);
603 : :
604 : : /* Highlighter */
605 [ # # # # : 0 : rx.set_highlighter_callback(std::bind(&hook_highlighter, std::placeholders::_1, std::placeholders::_2));
# # ]
606 : 0 : }
607 : :
608 : : /* Other options */
609 [ # # ]: 0 : rx.set_word_break_characters(" \t.,-%!;:=*~^'\"/?<>|[](){}");
610 [ # # # # ]: 0 : rx.set_no_color(not Options::Get().show_prompt);
611 : :
612 [ # # # # ]: 0 : auto args = AP.args();
613 [ # # ]: 0 : if (args.empty())
614 [ # # ]: 0 : args.push_back("-"); // start in interactive mode
615 : :
616 : : /* Process all the inputs. */
617 : 0 : for (auto filename : args) {
618 : : /*----- Open the input stream. -------------------------------------------------------------------------------*/
619 [ # # # # ]: 0 : if (streq("-", filename)) {
620 : 0 : const char *cinput = nullptr;
621 [ # # ]: 0 : std::stringstream ss;
622 : 0 : for (;;) {
623 : 0 : do
624 [ # # # # : 0 : cinput = rx.input(Options::Get().show_prompt ? prompt(ss.str().size() != 0) : ""); // Read one line of input
# # # # #
# # # # #
# # # # #
# # # ]
625 [ # # ]: 0 : while ((cinput == nullptr) and (errno == EAGAIN));
626 [ # # ]: 0 : M_insist(errno != EAGAIN);
627 : :
628 : : /* User sent EOF */
629 [ # # ]: 0 : if (cinput == nullptr) {
630 [ # # # # ]: 0 : if (Options::Get().show_prompt)
631 [ # # ]: 0 : std::cout << std::endl;
632 : 0 : break;
633 : : }
634 [ # # ]: 0 : M_insist(cinput);
635 : :
636 : : /* User sent input */
637 : 0 : auto len = strlen(cinput);
638 [ # # # # ]: 0 : if (not isspace(cinput, len)) {
639 [ # # ]: 0 : ss.write(cinput, len); // append replxx line to stream
640 [ # # # # ]: 0 : rx.history_add(cinput);
641 [ # # ]: 0 : if (cinput[len - 1] == ';') {
642 [ # # ]: 0 : process_stream(ss, filename, diag);
643 [ # # # # ]: 0 : ss.str(""); // empty the stream
644 [ # # ]: 0 : ss.clear(); // and clear EOF bit
645 : 0 : } else
646 [ # # ]: 0 : ss.put('\n');
647 : 0 : }
648 [ # # # # ]: 0 : rx.history_save(history_file);
649 : : }
650 : 0 : } else {
651 [ # # ]: 0 : std::ifstream in(filename);
652 [ # # # # ]: 0 : if (not in) {
653 : 0 : const auto errsv = errno;
654 [ # # # # : 0 : diag.err() << "Could not open file '" << filename << '\'';
# # # # ]
655 [ # # ]: 0 : if (errsv)
656 [ # # # # : 0 : diag.err() << ": " << strerror(errsv);
# # ]
657 [ # # # # : 0 : diag.err() << ". Aborting." << std::endl;
# # ]
658 : 0 : break;
659 : : }
660 [ # # ]: 0 : process_stream(in, filename, diag);
661 [ # # ]: 0 : }
662 : : }
663 : :
664 : : /* Explicitly destroy the `Catalog` to dispose of all held resources. This is particularly important as the address
665 : : * sanitizer scans for leaked allocations *before* any `__attribute((destructor))__` annotated functions are run. */
666 [ # # ]: 0 : Catalog::Destroy();
667 [ # # ]: 0 : std::exit(diag.num_errors() ? EXIT_FAILURE : EXIT_SUCCESS);
668 : 0 : }
|
