Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
M
MariaDB
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
nexedi
MariaDB
Commits
b8e694a3
Commit
b8e694a3
authored
May 20, 2020
by
Marko Mäkelä
Browse files
Options
Browse Files
Download
Plain Diff
Merge 10.3 into 10.4
parents
96bc626b
ed41947b
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
15 additions
and
28 deletions
+15
-28
storage/innobase/row/row0ins.cc
storage/innobase/row/row0ins.cc
+15
-28
No files found.
storage/innobase/row/row0ins.cc
View file @
b8e694a3
...
...
@@ -58,35 +58,22 @@ check.
If you make a change in this module make sure that no codepath is
introduced where a call to log_free_check() is bypassed. */
/***********************************************************//**
Creates an entry template for each index of a table. */
static
void
ins_node_create_entry_list
(
/*=======================*/
ins_node_t
*
node
)
/*!< in: row insert node */
/** Create an row template for each index of a table. */
static
void
ins_node_create_entry_list
(
ins_node_t
*
node
)
{
dict_index_t
*
index
;
dtuple_t
*
entry
;
ut_ad
(
node
->
entry_sys_heap
);
/* We will include all indexes (include those corrupted
secondary indexes) in the entry list. Filtration of
these corrupted index will be done in row_ins() */
node
->
entry_list
.
reserve
(
UT_LIST_GET_LEN
(
node
->
table
->
indexes
));
for
(
index
=
dict_table_get_first_index
(
node
->
table
);
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
);
}
node
->
entry_list
.
reserve
(
UT_LIST_GET_LEN
(
node
->
table
->
indexes
));
for
(
dict_index_t
*
index
=
dict_table_get_first_index
(
node
->
table
);
index
;
index
=
dict_table_get_next_index
(
index
))
{
/* Corrupted or incomplete secondary indexes will be filtered out in
row_ins(). */
dtuple_t
*
entry
=
index
->
online_status
>=
ONLINE_INDEX_ABORTED
?
dtuple_create
(
node
->
entry_sys_heap
,
0
)
:
row_build_index_entry_low
(
node
->
row
,
NULL
,
index
,
node
->
entry_sys_heap
,
ROW_BUILD_FOR_INSERT
);
node
->
entry_list
.
push_back
(
entry
);
}
}
/*****************************************************************//**
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment