Commit b8e694a3 authored by Marko Mäkelä's avatar Marko Mäkelä

Merge 10.3 into 10.4

parents 96bc626b ed41947b
...@@ -58,35 +58,22 @@ check. ...@@ -58,35 +58,22 @@ check.
If you make a change in this module make sure that no codepath is If you make a change in this module make sure that no codepath is
introduced where a call to log_free_check() is bypassed. */ introduced where a call to log_free_check() is bypassed. */
/***********************************************************//** /** Create an row template for each index of a table. */
Creates an entry template for each index of a table. */ static void ins_node_create_entry_list(ins_node_t *node)
static
void
ins_node_create_entry_list(
/*=======================*/
ins_node_t* node) /*!< in: row insert node */
{ {
dict_index_t* index; node->entry_list.reserve(UT_LIST_GET_LEN(node->table->indexes));
dtuple_t* entry;
for (dict_index_t *index= dict_table_get_first_index(node->table); index;
ut_ad(node->entry_sys_heap); index= dict_table_get_next_index(index))
{
/* We will include all indexes (include those corrupted /* Corrupted or incomplete secondary indexes will be filtered out in
secondary indexes) in the entry list. Filtration of row_ins(). */
these corrupted index will be done in row_ins() */ dtuple_t *entry= index->online_status >= ONLINE_INDEX_ABORTED
? dtuple_create(node->entry_sys_heap, 0)
node->entry_list.reserve(UT_LIST_GET_LEN(node->table->indexes)); : row_build_index_entry_low(node->row, NULL, index, node->entry_sys_heap,
ROW_BUILD_FOR_INSERT);
for (index = dict_table_get_first_index(node->table); node->entry_list.push_back(entry);
index != 0; }
index = dict_table_get_next_index(index)) {
entry = row_build_index_entry_low(
node->row, NULL, index, node->entry_sys_heap,
ROW_BUILD_FOR_INSERT);
node->entry_list.push_back(entry);
}
} }
/*****************************************************************//** /*****************************************************************//**
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment