118 que_node_t* values_list;
140 #define INS_NODE_MAGIC_N 15849075
143 #define INS_SEARCHED 0
149 #define INS_NODE_SET_IX_LOCK 1
150 #define INS_NODE_ALLOC_ROW_ID 2
151 #define INS_NODE_INSERT_ENTRIES 3
155 #include "row0ins.ic"
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)
typedef UT_LIST_BASE_NODE_T(mutex_t) ut_list_base_node_t
UNIV_INTERN ulint row_ins_check_foreign_constraint(ibool check_ref, dict_foreign_t *foreign, dict_table_t *table, dtuple_t *entry, que_thr_t *thr)
UNIV_INTERN void ins_node_create_entry_list(ins_node_t *node)
UNIV_INTERN ulint row_ins_index_entry(dict_index_t *index, dtuple_t *entry, ulint n_ext, ibool foreign, que_thr_t *thr)
UNIV_INTERN que_thr_t * row_ins_step(que_thr_t *thr)