31#include "plugin/innobase/include/yyparse.h"
34#include "pars0pars.ic"
56UNIV_INTERN ibool pars_print_lexed = FALSE;
61UNIV_INTERN sym_tab_t* pars_sym_tab_global;
66UNIV_INTERN pars_res_word_t pars_to_char_token = {PARS_TO_CHAR_TOKEN};
67UNIV_INTERN pars_res_word_t pars_to_number_token = {PARS_TO_NUMBER_TOKEN};
68UNIV_INTERN pars_res_word_t pars_to_binary_token = {PARS_TO_BINARY_TOKEN};
69UNIV_INTERN pars_res_word_t pars_binary_to_number_token = {PARS_BINARY_TO_NUMBER_TOKEN};
70UNIV_INTERN pars_res_word_t pars_substr_token = {PARS_SUBSTR_TOKEN};
71UNIV_INTERN pars_res_word_t pars_replstr_token = {PARS_REPLSTR_TOKEN};
72UNIV_INTERN pars_res_word_t pars_concat_token = {PARS_CONCAT_TOKEN};
73UNIV_INTERN pars_res_word_t pars_instr_token = {PARS_INSTR_TOKEN};
74UNIV_INTERN pars_res_word_t pars_length_token = {PARS_LENGTH_TOKEN};
75UNIV_INTERN pars_res_word_t pars_sysdate_token = {PARS_SYSDATE_TOKEN};
76UNIV_INTERN pars_res_word_t pars_printf_token = {PARS_PRINTF_TOKEN};
77UNIV_INTERN pars_res_word_t pars_assert_token = {PARS_ASSERT_TOKEN};
78UNIV_INTERN pars_res_word_t pars_rnd_token = {PARS_RND_TOKEN};
79UNIV_INTERN pars_res_word_t pars_rnd_str_token = {PARS_RND_STR_TOKEN};
80UNIV_INTERN pars_res_word_t pars_count_token = {PARS_COUNT_TOKEN};
81UNIV_INTERN pars_res_word_t pars_sum_token = {PARS_SUM_TOKEN};
82UNIV_INTERN pars_res_word_t pars_distinct_token = {PARS_DISTINCT_TOKEN};
83UNIV_INTERN pars_res_word_t pars_binary_token = {PARS_BINARY_TOKEN};
84UNIV_INTERN pars_res_word_t pars_blob_token = {PARS_BLOB_TOKEN};
85UNIV_INTERN pars_res_word_t pars_int_token = {PARS_INT_TOKEN};
86UNIV_INTERN pars_res_word_t pars_char_token = {PARS_CHAR_TOKEN};
87UNIV_INTERN pars_res_word_t pars_float_token = {PARS_FLOAT_TOKEN};
88UNIV_INTERN pars_res_word_t pars_update_token = {PARS_UPDATE_TOKEN};
89UNIV_INTERN pars_res_word_t pars_asc_token = {PARS_ASC_TOKEN};
90UNIV_INTERN pars_res_word_t pars_desc_token = {PARS_DESC_TOKEN};
91UNIV_INTERN pars_res_word_t pars_open_token = {PARS_OPEN_TOKEN};
92UNIV_INTERN pars_res_word_t pars_close_token = {PARS_CLOSE_TOKEN};
93UNIV_INTERN pars_res_word_t pars_share_token = {PARS_SHARE_TOKEN};
94UNIV_INTERN pars_res_word_t pars_unique_token = {PARS_UNIQUE_TOKEN};
95UNIV_INTERN pars_res_word_t pars_clustered_token = {PARS_CLUSTERED_TOKEN};
111 case '+':
case '-':
case '*':
case '/':
114 case '=':
case '<':
case '>':
115 case PARS_GE_TOKEN:
case PARS_LE_TOKEN:
case PARS_NE_TOKEN:
118 case PARS_AND_TOKEN:
case PARS_OR_TOKEN:
case PARS_NOT_TOKEN:
121 case PARS_COUNT_TOKEN:
case PARS_SUM_TOKEN:
124 case PARS_TO_CHAR_TOKEN:
125 case PARS_TO_NUMBER_TOKEN:
126 case PARS_TO_BINARY_TOKEN:
127 case PARS_BINARY_TO_NUMBER_TOKEN:
128 case PARS_SUBSTR_TOKEN:
129 case PARS_CONCAT_TOKEN:
130 case PARS_LENGTH_TOKEN:
131 case PARS_INSTR_TOKEN:
132 case PARS_SYSDATE_TOKEN:
133 case PARS_NOTFOUND_TOKEN:
134 case PARS_PRINTF_TOKEN:
135 case PARS_ASSERT_TOKEN:
137 case PARS_RND_STR_TOKEN:
138 case PARS_REPLSTR_TOKEN:
158 node =
static_cast<func_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(func_node_t)));
162 node->
common.val_buf_size = 0;
182 que_node_t* res_word,
185 return(pars_func_low(((pars_res_word_t*)res_word)->code, arg));
206 return(pars_func_low(func, arg1));
217 pars_res_word_t* asc)
221 node =
static_cast<order_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(order_node_t)));
227 if (asc == &pars_asc_token) {
230 ut_a(asc == &pars_desc_token);
248 case DATA_VARCHAR:
case DATA_CHAR:
249 case DATA_FIXBINARY:
case DATA_BINARY:
261pars_resolve_func_data_type(
271 switch (node->
func) {
273 case '+':
case '-':
case '*':
case '/':
284 case PARS_COUNT_TOKEN:
289 case PARS_TO_CHAR_TOKEN:
290 case PARS_RND_STR_TOKEN:
296 case PARS_TO_BINARY_TOKEN:
306 case PARS_TO_NUMBER_TOKEN:
307 case PARS_BINARY_TO_NUMBER_TOKEN:
308 case PARS_LENGTH_TOKEN:
309 case PARS_INSTR_TOKEN:
314 case PARS_SYSDATE_TOKEN:
319 case PARS_SUBSTR_TOKEN:
320 case PARS_CONCAT_TOKEN:
326 case '>':
case '<':
case '=':
333 case PARS_NOTFOUND_TOKEN:
354pars_resolve_exp_variables_and_types(
356 sel_node_t* select_node,
360 que_node_t* exp_node)
362 func_node_t* func_node;
364 sym_node_t* sym_node;
370 func_node =
static_cast<func_node_t *
>(exp_node);
372 arg = func_node->
args;
375 pars_resolve_exp_variables_and_types(select_node, arg);
380 pars_resolve_func_data_type(func_node);
387 sym_node =
static_cast<sym_node_t *
>(exp_node);
419 fprintf(stderr,
"PARSER ERROR: Unresolved identifier %s\n",
427 sym_node->
alias = node;
445pars_resolve_exp_list_variables_and_types(
447 sel_node_t* select_node,
448 que_node_t* exp_node)
452 pars_resolve_exp_variables_and_types(select_node, exp_node);
462pars_resolve_exp_columns(
464 sym_node_t* table_node,
465 que_node_t* exp_node)
467 func_node_t* func_node;
469 sym_node_t* sym_node;
478 func_node =
static_cast<func_node_t *
>(exp_node);
480 arg = func_node->
args;
483 pars_resolve_exp_columns(table_node, arg);
493 sym_node =
static_cast<sym_node_t *
>(exp_node);
506 table = t_node->
table;
510 for (i = 0; i < n_cols; i++) {
511 const dict_col_t* col
512 = dict_table_get_nth_col(table, i);
514 = dict_table_get_col_name(table, i);
522 sym_node->
table = table;
528 dfield_get_type(&sym_node
543pars_resolve_exp_list_columns(
545 sym_node_t* table_node,
546 que_node_t* exp_node)
550 pars_resolve_exp_columns(table_node, exp_node);
560pars_retrieve_table_def(
562 sym_node_t* sym_node)
564 const char* table_name;
572 table_name = (
const char*) sym_node->
name;
584pars_retrieve_table_list_defs(
586 sym_node_t* sym_node)
590 if (sym_node == NULL) {
596 pars_retrieve_table_def(sym_node);
610pars_select_all_columns(
612 sel_node_t* select_node)
615 sym_node_t* col_node;
616 sym_node_t* table_node;
625 table = table_node->
table;
628 const char* col_name = dict_table_get_col_name(
651 que_node_t* select_list,
652 sym_node_t* into_list)
661 pars_resolve_exp_list_variables_and_types(NULL, into_list);
673 sel_node_t* select_node)
676 que_node_t* exp_node;
677 func_node_t* func_node;
679 ulint n_aggregate_nodes = 0;
689 func_node =
static_cast<func_node_t *
>(exp_node);
700 if (n_aggregate_nodes > 0) {
701 ut_a(n_nodes == n_aggregate_nodes);
716 sel_node_t* select_node,
718 sym_node_t* table_list,
719 que_node_t* search_cond,
720 pars_res_word_t* for_update,
721 pars_res_word_t* lock_shared,
722 order_node_t* order_by)
727 select_node->
n_tables = pars_retrieve_table_list_defs(table_list);
732 pars_select_all_columns(select_node);
742 pars_resolve_exp_list_columns(table_list, select_node->
select_list);
743 pars_resolve_exp_list_variables_and_types(select_node,
745 pars_check_aggregate(select_node);
750 pars_resolve_exp_columns(table_list, search_cond);
751 pars_resolve_exp_variables_and_types(select_node, search_cond);
762 }
else if (lock_shared){
778 pars_resolve_exp_columns(table_list, order_by->
column);
799 sym_node_t* sym_node,
801 sel_node_t* select_node)
820 sym_node_t* sym_node)
841 sym_node_t* table_sym,
842 col_assign_node_t* col_assign_list)
849 node->is_delete = is_delete;
851 node->table_sym = table_sym;
852 node->col_assign_list = col_assign_list;
867 col_assign_node_t* node;
869 node =
static_cast<col_assign_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
870 sizeof(col_assign_node_t)));
883pars_process_assign_list(
887 col_assign_node_t* col_assign_list;
888 sym_node_t* table_sym;
889 col_assign_node_t* assign_node;
890 upd_field_t* upd_field;
891 dict_index_t* clust_index;
893 ulint changes_ord_field;
894 ulint changes_field_size;
898 table_sym = node->table_sym;
899 col_assign_list =
static_cast<col_assign_node_t *
>(node->col_assign_list);
900 clust_index = dict_table_get_first_index(node->
table);
902 assign_node = col_assign_list;
905 while (assign_node) {
906 pars_resolve_exp_columns(table_sym, assign_node->
col);
907 pars_resolve_exp_columns(table_sym, assign_node->
val);
908 pars_resolve_exp_variables_and_types(NULL, assign_node->
val);
915 assign_node->
val))));
930 assign_node = col_assign_list;
932 changes_field_size = UPD_NODE_NO_SIZE_CHANGE;
934 for (i = 0; i < n_assigns; i++) {
935 upd_field = upd_get_nth_field(node->
update, i);
937 col_sym = assign_node->
col;
940 clust_index, col_sym->
col_no),
942 upd_field->
exp = assign_node->
val;
948 changes_field_size = 0;
956 changes_ord_field = UPD_NODE_NO_ORD_CHANGE;
960 changes_ord_field = 0;
963 node->cmpl_info = changes_ord_field | changes_field_size;
974 sym_node_t* cursor_sym,
976 que_node_t* search_cond)
978 sym_node_t* table_sym;
979 sel_node_t* sel_node;
982 table_sym = node->table_sym;
984 pars_retrieve_table_def(table_sym);
994 pars_resolve_exp_variables_and_types(NULL, cursor_sym);
998 node->searched_update = FALSE;
1003 &pars_share_token, NULL);
1004 node->searched_update = TRUE;
1010 ut_a(!node->is_delete || (node->col_assign_list == NULL));
1011 ut_a(node->is_delete || (node->col_assign_list != NULL));
1013 if (node->is_delete) {
1014 node->cmpl_info = 0;
1016 pars_process_assign_list(node);
1019 if (node->searched_update) {
1020 node->has_clust_rec_x_lock = TRUE;
1024 node->has_clust_rec_x_lock = sel_node->
set_x_locks;
1034 node->
state = UPD_NODE_UPDATE_CLUSTERED;
1059 sym_node_t* table_sym,
1060 que_node_t* values_list,
1067 ut_a(values_list || select);
1068 ut_a(!values_list || !select);
1071 ins_type = INS_VALUES;
1073 ins_type = INS_SEARCHED;
1076 pars_retrieve_table_def(table_sym);
1079 pars_sym_tab_global->
heap);
1084 dict_table_copy_types(row, table_sym->
table);
1097 node->values_list = values_list;
1099 if (node->values_list) {
1100 pars_resolve_exp_list_variables_and_types(NULL, values_list);
1113pars_set_dfield_type(
1116 pars_res_word_t* type,
1127 flags |= DATA_NOT_NULL;
1131 flags |= DATA_UNSIGNED;
1134 if (type == &pars_int_token) {
1135 ut_a((len == 0) || (len == 8));
1137 dtype_set(dfield_get_type(dfield), DATA_INT, flags, 8);
1139 dtype_set(dfield_get_type(dfield), DATA_INT, flags, 4);
1142 }
else if (type == &pars_char_token) {
1145 dtype_set(dfield_get_type(dfield), DATA_VARCHAR,
1146 DATA_ENGLISH | flags, 0);
1147 }
else if (type == &pars_binary_token) {
1150 dtype_set(dfield_get_type(dfield), DATA_FIXBINARY,
1151 DATA_BINARY_TYPE | flags, len);
1152 }
else if (type == &pars_blob_token) {
1155 dtype_set(dfield_get_type(dfield), DATA_BLOB,
1156 DATA_BINARY_TYPE | flags, 0);
1171 pars_res_word_t* type)
1194 pars_res_word_t* type)
1196 ut_a((param_type == PARS_INPUT) || (param_type == PARS_OUTPUT));
1209pars_set_parent_in_list(
1211 que_node_t* node_list,
1215 que_common_t* common;
1217 common =
static_cast<que_common_t *
>(node_list);
1234 que_node_t* stat_list)
1238 node =
static_cast<elsif_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(elsif_node_t)));
1244 pars_resolve_exp_variables_and_types(NULL, cond);
1259 que_node_t* stat_list,
1260 que_node_t* else_part)
1264 elsif_node_t* elsif_node;
1266 node =
static_cast<if_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(if_node_t)));
1272 pars_resolve_exp_variables_and_types(NULL, cond);
1281 node->
elsif_list =
static_cast<elsif_node_t *
>(else_part);
1283 elsif_node =
static_cast<elsif_node_t *
>(else_part);
1285 while (elsif_node) {
1286 pars_set_parent_in_list(elsif_node->
stat_list, node);
1294 pars_set_parent_in_list(else_part, node);
1297 pars_set_parent_in_list(stat_list, node);
1310 que_node_t* stat_list)
1314 node =
static_cast<while_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(while_node_t)));
1320 pars_resolve_exp_variables_and_types(NULL, cond);
1324 pars_set_parent_in_list(stat_list, node);
1336 sym_node_t* loop_var,
1337 que_node_t* loop_start_limit,
1338 que_node_t* loop_end_limit,
1339 que_node_t* stat_list)
1343 node =
static_cast<for_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(for_node_t)));
1347 pars_resolve_exp_variables_and_types(NULL, loop_var);
1348 pars_resolve_exp_variables_and_types(NULL, loop_start_limit);
1349 pars_resolve_exp_variables_and_types(NULL, loop_end_limit);
1360 pars_set_parent_in_list(stat_list, node);
1375 node =
static_cast<exit_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(exit_node_t)));
1389 return_node_t* node;
1391 node =
static_cast<return_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
1392 sizeof(return_node_t)));
1408 assign_node_t* node;
1410 node =
static_cast<assign_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
1411 sizeof(assign_node_t)));
1417 pars_resolve_exp_variables_and_types(NULL, var);
1418 pars_resolve_exp_variables_and_types(NULL, val);
1433 que_node_t* res_word,
1440 pars_resolve_exp_list_variables_and_types(NULL, args);
1454 sym_node_t* into_list,
1455 sym_node_t* user_func)
1457 sym_node_t* cursor_decl;
1461 ut_a(!into_list != !user_func);
1463 node =
static_cast<fetch_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(fetch_node_t)));
1467 pars_resolve_exp_variables_and_types(NULL, cursor);
1470 pars_resolve_exp_list_variables_and_types(NULL, into_list);
1474 pars_resolve_exp_variables_and_types(NULL, user_func);
1483 cursor_decl = cursor->
alias;
1508 sym_node_t* cursor_decl;
1511 node =
static_cast<open_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(open_node_t)));
1515 pars_resolve_exp_variables_and_types(NULL, cursor);
1517 cursor_decl = cursor->
alias;
1534 sel_node_t* sel_node)
1536 row_printf_node_t* node;
1538 node =
static_cast<row_printf_node_t *
>(
mem_heap_alloc(pars_sym_tab_global->heap,
1539 sizeof(row_printf_node_t)));
1578 sym_node_t* sym_node,
1580 pars_res_word_t* type,
1597 is_unsigned != NULL, is_not_null != NULL);
1609 sym_node_t* table_sym,
1611 sym_node_t* column_defs,
1624 dict_table_t* table;
1627 const dtype_t* dtype;
1635 table = dict_mem_table_create(table_sym->
name, 0, n_cols, 0);
1638 if (not_fit_in_memory != NULL) {
1639 table->does_not_fit_in_memory = TRUE;
1642 column = column_defs;
1647 dict_mem_table_add_col(table, table->heap,
1656 node = tab_create_graph_create(table, pars_sym_tab_global->heap);
1671 pars_res_word_t* unique_def,
1672 pars_res_word_t* clustered_def,
1673 sym_node_t* index_sym,
1675 sym_node_t* table_sym,
1677 sym_node_t* column_list)
1679 dict_index_t* index;
1693 if (clustered_def) {
1697 index = dict_mem_index_create(table_sym->
name, index_sym->
name, 0,
1698 ind_type, n_fields);
1699 column = column_list;
1702 dict_mem_index_add_field(index, column->
name, 0);
1710 node = ind_create_graph_create(index, pars_sym_tab_global->heap);
1728 sym_node_t* sym_node,
1730 sym_node_t* param_list,
1731 que_node_t* stat_list)
1738 heap = pars_sym_tab_global->
heap;
1745 node =
static_cast<proc_node_t *
>(
mem_heap_alloc(heap,
sizeof(proc_node_t)));
1757 pars_set_parent_in_list(stat_list, node);
1759 node->
sym_tab = pars_sym_tab_global;
1763 pars_sym_tab_global->query_graph = fork;
1801 len = pars_sym_tab_global->string_len
1802 - pars_sym_tab_global->next_char_pos;
1812 if (len > max_size) {
1816#ifdef UNIV_SQL_DEBUG
1817 if (pars_print_lexed) {
1823 fwrite(pars_sym_tab_global->sql_string
1824 + pars_sym_tab_global->next_char_pos,
1829 ut_memcpy(buf, pars_sym_tab_global->sql_string
1830 + pars_sym_tab_global->next_char_pos, len);
1833 pars_sym_tab_global->next_char_pos += len;
1847 fputs(
"PARSER ERROR: Syntax error in SQL string\n", stderr);
1862 sym_node_t* sym_node;
1871 ut_ad(mutex_own(&(dict_sys->mutex)));
1875 pars_sym_tab_global->string_len = strlen(str);
1876 pars_sym_tab_global->sql_string =
static_cast<const char *
>(
mem_heap_dup(
1877 heap, str, pars_sym_tab_global->string_len + 1));
1878 pars_sym_tab_global->next_char_pos = 0;
1879 pars_sym_tab_global->info = info;
1891 graph = pars_sym_tab_global->query_graph;
1893 graph->
sym_tab = pars_sym_tab_global;
1945 info =
static_cast<pars_info_t *
>(
mem_heap_alloc(heap,
sizeof(*info)));
1975 const void* address,
1981 pars_bound_lit_t* pbl;
2012 DATA_VARCHAR, DATA_ENGLISH);
2073 pars_user_func_t* puf;
2100 pars_bound_id_t* bid;
2129 if (!info || !info->
funcs) {
2136 pars_user_func_t* puf =
static_cast<pars_user_func_t *
>(
ib_vector_get(vec, i));
2138 if (strcmp(puf->
name, name) == 0) {
2166 pars_bound_lit_t* pbl =
static_cast<pars_bound_lit_t *
>(
ib_vector_get(vec, i));
2168 if (strcmp(pbl->
name, name) == 0) {
2196 pars_bound_id_t* bid =
static_cast<pars_bound_id_t *
>(
ib_vector_get(vec, i));
2198 if (strcmp(bid->
name, name) == 0) {
UNIV_INLINE void dfield_set_data(dfield_t *field, const void *data, ulint len)
UNIV_INLINE dtuple_t * dtuple_create(mem_heap_t *heap, ulint n_fields)
UNIV_INLINE void dfield_set_type(dfield_t *field, dtype_t *type)
UNIV_INLINE void dtype_set(dtype_t *type, ulint mtype, ulint prtype, ulint len)
UNIV_INLINE ulint dtype_get_mtype(const dtype_t *type)
UNIV_INLINE void dtype_copy(dtype_t *type1, const dtype_t *type2)
UNIV_INLINE const dict_col_t * dict_index_get_nth_col(const dict_index_t *index, ulint pos)
UNIV_INLINE ulint dict_col_get_fixed_size(const dict_col_t *col, ulint comp)
UNIV_INLINE ulint dict_index_is_clust(const dict_index_t *index) __attribute__((pure))
UNIV_INLINE dict_table_t * dict_table_get_low(const char *table_name)
UNIV_INLINE ulint dict_table_get_n_user_cols(const dict_table_t *table)
UNIV_INLINE ulint dict_table_get_n_cols(const dict_table_t *table)
UNIV_INLINE void dict_col_copy_type(const dict_col_t *col, dtype_t *type)
UNIV_INLINE ibool dict_table_is_comp(const dict_table_t *table)
UNIV_INLINE lint eval_node_get_int_val(que_node_t *node)
UNIV_INLINE void mach_write_to_8(byte *b, ib_uint64_t n)
UNIV_INLINE void mach_write_to_4(byte *b, ulint n)
#define mem_heap_create(N)
UNIV_INTERN void * mem_heap_dup(mem_heap_t *heap, const void *data, ulint len)
UNIV_INLINE void * mem_heap_alloc(mem_heap_t *heap, ulint n)
#define mem_heap_free(heap)
UNIV_INTERN void opt_search_plan(sel_node_t *sel_node)
UNIV_INTERN void opt_find_all_cols(ibool copy_val, dict_index_t *index, sym_node_list_t *col_list, plan_t *plan, que_node_t *exp)
UNIV_INTERN que_node_t * pars_cursor_declaration(sym_node_t *sym_node, sel_node_t *select_node)
UNIV_INTERN void pars_info_add_id(pars_info_t *info, const char *name, const char *id)
UNIV_INTERN ind_node_t * pars_create_index(pars_res_word_t *unique_def, pars_res_word_t *clustered_def, sym_node_t *index_sym, sym_node_t *table_sym, sym_node_t *column_list)
UNIV_INTERN void pars_info_add_str_literal(pars_info_t *info, const char *name, const char *str)
UNIV_INTERN pars_info_t * pars_info_create(void)
UNIV_INTERN upd_node_t * pars_update_statement_start(ibool is_delete, sym_node_t *table_sym, col_assign_node_t *col_assign_list)
UNIV_INTERN void pars_info_add_ull_literal(pars_info_t *info, const char *name, ib_uint64_t val)
#define PARS_FUNC_AGGREGATE
UNIV_INTERN assign_node_t * pars_assignment_statement(sym_node_t *var, que_node_t *val)
UNIV_INTERN sym_node_t * pars_parameter_declaration(sym_node_t *node, ulint param_type, pars_res_word_t *type)
UNIV_INTERN func_node_t * pars_op(int func, que_node_t *arg1, que_node_t *arg2)
UNIV_INTERN void yyerror(const char *s)
UNIV_INTERN sym_node_t * pars_variable_declaration(sym_node_t *node, pars_res_word_t *type)
#define PARS_FUNC_LOGICAL
UNIV_INTERN exit_node_t * pars_exit_statement(void)
UNIV_INTERN open_node_t * pars_open_statement(ulint type, sym_node_t *cursor)
UNIV_INTERN void pars_info_free(pars_info_t *info)
UNIV_INTERN while_node_t * pars_while_statement(que_node_t *cond, que_node_t *stat_list)
UNIV_INTERN pars_bound_id_t * pars_info_get_bound_id(pars_info_t *info, const char *name)
UNIV_INTERN pars_bound_lit_t * pars_info_get_bound_lit(pars_info_t *info, const char *name)
UNIV_INTERN que_fork_t * pars_stored_procedure_call(sym_node_t *sym_node)
UNIV_INTERN que_fork_t * pars_procedure_definition(sym_node_t *sym_node, sym_node_t *param_list, que_node_t *stat_list)
UNIV_INTERN que_node_t * pars_function_declaration(sym_node_t *sym_node)
UNIV_INTERN fetch_node_t * pars_fetch_statement(sym_node_t *cursor, sym_node_t *into_list, sym_node_t *user_func)
UNIV_INTERN roll_node_t * pars_rollback_statement(void)
UNIV_INTERN func_node_t * pars_func(que_node_t *res_word, que_node_t *arg)
UNIV_INTERN upd_node_t * pars_update_statement(upd_node_t *node, sym_node_t *cursor_sym, que_node_t *search_cond)
UNIV_INTERN sel_node_t * pars_select_list(que_node_t *select_list, sym_node_t *into_list)
UNIV_INTERN commit_node_t * pars_commit_statement(void)
UNIV_INTERN void pars_get_lex_chars(char *buf, int *result, int max_size)
UNIV_INTERN que_thr_t * pars_complete_graph_for_exec(que_node_t *node, trx_t *trx, mem_heap_t *heap)
UNIV_INTERN col_assign_node_t * pars_column_assignment(sym_node_t *column, que_node_t *exp)
UNIV_INTERN sel_node_t * pars_select_statement(sel_node_t *select_node, sym_node_t *table_list, que_node_t *search_cond, pars_res_word_t *for_update, pars_res_word_t *consistent_read, order_node_t *order_by)
UNIV_INTERN order_node_t * pars_order_by(sym_node_t *column, pars_res_word_t *asc)
UNIV_INTERN row_printf_node_t * pars_row_printf_statement(sel_node_t *sel_node)
UNIV_INTERN elsif_node_t * pars_elsif_element(que_node_t *cond, que_node_t *stat_list)
#define PARS_FUNC_PREDEFINED
UNIV_INTERN if_node_t * pars_if_statement(que_node_t *cond, que_node_t *stat_list, que_node_t *else_part)
UNIV_INTERN void pars_info_add_literal(pars_info_t *info, const char *name, const void *address, ulint length, ulint type, ulint prtype)
UNIV_INTERN void pars_info_add_function(pars_info_t *info, const char *name, pars_user_func_cb_t func, void *arg)
UNIV_INTERN void pars_info_add_int4_literal(pars_info_t *info, const char *name, lint val)
void *(* pars_user_func_cb_t)(void *arg, void *user_arg)
UNIV_INTERN func_node_t * pars_procedure_call(que_node_t *res_word, que_node_t *args)
UNIV_INTERN que_t * pars_sql(pars_info_t *info, const char *str)
UNIV_INTERN pars_user_func_t * pars_info_get_user_func(pars_info_t *info, const char *name)
UNIV_INTERN tab_node_t * pars_create_table(sym_node_t *table_sym, sym_node_t *column_defs, void *not_fit_in_memory)
UNIV_INTERN for_node_t * pars_for_statement(sym_node_t *loop_var, que_node_t *loop_start_limit, que_node_t *loop_end_limit, que_node_t *stat_list)
UNIV_INTERN sym_node_t * pars_column_def(sym_node_t *sym_node, pars_res_word_t *type, sym_node_t *len, void *is_unsigned, void *is_not_null)
UNIV_INTERN return_node_t * pars_return_statement(void)
UNIV_INTERN ins_node_t * pars_insert_statement(sym_node_t *table_sym, que_node_t *values_list, sel_node_t *select)
UNIV_INTERN sym_tab_t * sym_tab_create(mem_heap_t *heap)
UNIV_INTERN sym_node_t * sym_tab_add_id(sym_tab_t *sym_tab, byte *name, ulint len)
UNIV_INLINE dfield_t * que_node_get_val(que_node_t *node)
UNIV_INLINE ulint que_node_get_type(que_node_t *node)
UNIV_INLINE ulint que_node_list_get_len(que_node_t *node_list)
UNIV_INTERN que_thr_t * que_thr_create(que_fork_t *parent, mem_heap_t *heap)
UNIV_INLINE dtype_t * que_node_get_data_type(que_node_t *node)
UNIV_INLINE que_node_t * que_node_list_add_last(que_node_t *node_list, que_node_t *node)
UNIV_INTERN que_fork_t * que_fork_create(que_t *graph, que_node_t *parent, ulint fork_type, mem_heap_t *heap)
UNIV_INLINE que_node_t * que_node_get_next(que_node_t *node)
UNIV_INLINE void que_node_set_parent(que_node_t *node, que_node_t *parent)
UNIV_INTERN ins_node_t * ins_node_create(ulint ins_type, dict_table_t *table, mem_heap_t *heap)
UNIV_INTERN void ins_node_set_new_row(ins_node_t *node, dtuple_t *row)
UNIV_INTERN sel_node_t * sel_node_create(mem_heap_t *heap)
UNIV_INLINE plan_t * sel_node_get_nth_plan(sel_node_t *node, ulint i)
UNIV_INLINE upd_t * upd_create(ulint n, mem_heap_t *heap)
UNIV_INTERN upd_node_t * upd_node_create(mem_heap_t *heap)
UNIV_INLINE void upd_field_set_field_no(upd_field_t *upd_field, ulint field_no, dict_index_t *index, trx_t *trx)
UNIV_INTERN ibool row_upd_changes_some_index_ord_field_binary(const dict_table_t *table, const upd_t *update)
que_node_t * loop_start_limit
que_node_t * loop_end_limit
elsif_node_t * elsif_list
enum open_node_op op_type
sym_node_t * explicit_cursor
enum sel_node_state state
enum sym_tab_entry token_type
UNIV_INTERN roll_node_t * roll_node_create(mem_heap_t *heap)
UNIV_INTERN commit_node_t * commit_node_create(mem_heap_t *heap)
struct roll_node_struct roll_node_t
struct commit_node_struct commit_node_t
#define UT_LIST_GET_FIRST(BASE)
#define UT_LIST_ADD_LAST(NAME, BASE, N)
#define UT_LIST_GET_NEXT(NAME, N)
#define UT_LIST_INIT(BASE)
UNIV_INLINE void * ut_memcpy(void *dest, const void *sour, ulint n)
UNIV_INLINE ulint ut_strlen(const char *str)
UNIV_INLINE int ut_memcmp(const void *str1, const void *str2, ulint n)
UNIV_INTERN void ib_vector_push(ib_vector_t *vec, void *elem)
UNIV_INTERN ib_vector_t * ib_vector_create(mem_heap_t *heap, ulint size)
struct ib_vector_struct ib_vector_t
UNIV_INLINE void * ib_vector_get(ib_vector_t *vec, ulint n)
UNIV_INLINE ulint ib_vector_size(const ib_vector_t *vec)