32
33
#include "trx0types.h"
33
34
#include "row0types.h"
35
/*******************************************************************
36
/***************************************************************//**
36
37
Checks if foreign key constraint fails for an index entry. Sets shared locks
37
38
which lock either the success or the failure of the constraint. NOTE that
38
the caller must have a shared latch on dict_foreign_key_check_lock. */
39
the caller must have a shared latch on dict_foreign_key_check_lock.
40
@return DB_SUCCESS, DB_LOCK_WAIT, DB_NO_REFERENCED_ROW, or
41
DB_ROW_IS_REFERENCED */
41
44
row_ins_check_foreign_constraint(
42
45
/*=============================*/
43
/* out: DB_SUCCESS, DB_LOCK_WAIT,
45
or DB_ROW_IS_REFERENCED */
46
ibool check_ref,/* in: TRUE If we want to check that
46
ibool check_ref,/*!< in: TRUE If we want to check that
47
47
the referenced table is ok, FALSE if we
48
48
want to to check the foreign key table */
49
dict_foreign_t* foreign,/* in: foreign constraint; NOTE that the
49
dict_foreign_t* foreign,/*!< in: foreign constraint; NOTE that the
50
50
tables mentioned in it must be in the
51
51
dictionary cache if they exist at all */
52
dict_table_t* table, /* in: if check_ref is TRUE, then the foreign
52
dict_table_t* table, /*!< in: if check_ref is TRUE, then the foreign
53
53
table, else the referenced table */
54
dtuple_t* entry, /* in: index entry for index */
55
que_thr_t* thr); /* in: query thread */
56
/*************************************************************************
57
Creates an insert node struct. */
54
dtuple_t* entry, /*!< in: index entry for index */
55
que_thr_t* thr); /*!< in: query thread */
56
/*********************************************************************//**
57
Creates an insert node struct.
58
@return own: insert node struct */
62
/* out, own: insert node struct */
63
ulint ins_type, /* in: INS_VALUES, ... */
64
dict_table_t* table, /* in: table where to insert */
65
mem_heap_t* heap); /* in: mem heap where created */
66
/*************************************************************************
63
ulint ins_type, /*!< in: INS_VALUES, ... */
64
dict_table_t* table, /*!< in: table where to insert */
65
mem_heap_t* heap); /*!< in: mem heap where created */
66
/*********************************************************************//**
67
67
Sets a new row to insert for an INS_DIRECT node. This function is only used
68
68
if we have constructed the row separately, which is a rare case; this
69
69
function is quite slow. */
72
72
ins_node_set_new_row(
73
73
/*=================*/
74
ins_node_t* node, /* in: insert node */
75
dtuple_t* row); /* in: new row (or first row) for the node */
76
/*******************************************************************
74
ins_node_t* node, /*!< in: insert node */
75
dtuple_t* row); /*!< in: new row (or first row) for the node */
76
/***************************************************************//**
77
77
Inserts an index entry to index. Tries first optimistic, then pessimistic
78
78
descent down the tree. If the entry matches enough to a delete marked record,
79
79
performs the insert by updating or delete unmarking the delete marked
81
@return DB_SUCCESS, DB_LOCK_WAIT, DB_DUPLICATE_KEY, or some other error code */
83
84
row_ins_index_entry(
84
85
/*================*/
85
/* out: DB_SUCCESS, DB_LOCK_WAIT,
86
DB_DUPLICATE_KEY, or some other error code */
87
dict_index_t* index, /* in: index */
88
dtuple_t* entry, /* in: index entry to insert */
89
ulint n_ext, /* in: number of externally stored columns */
90
ibool foreign,/* in: TRUE=check foreign key constraints */
91
que_thr_t* thr); /* in: query thread */
92
/***************************************************************
86
dict_index_t* index, /*!< in: index */
87
dtuple_t* entry, /*!< in: index entry to insert */
88
ulint n_ext, /*!< in: number of externally stored columns */
89
ibool foreign,/*!< in: TRUE=check foreign key constraints */
90
que_thr_t* thr); /*!< in: query thread */
91
/***********************************************************//**
93
92
Inserts a row to a table. This is a high-level function used in
94
SQL execution graphs. */
94
@return query thread to run next or NULL */
99
/* out: query thread to run next or NULL */
100
que_thr_t* thr); /* in: query thread */
101
/***************************************************************
99
que_thr_t* thr); /*!< in: query thread */
100
/***********************************************************//**
102
101
Creates an entry template for each index of a table. */
105
104
ins_node_create_entry_list(
106
105
/*=======================*/
107
ins_node_t* node); /* in: row insert node */
106
ins_node_t* node); /*!< in: row insert node */
109
108
/* Insert node structure */
111
110
struct ins_node_struct{
112
que_common_t common; /* node type: QUE_NODE_INSERT */
111
que_common_t common; /*!< node type: QUE_NODE_INSERT */
113
112
ulint ins_type;/* INS_VALUES, INS_SEARCHED, or INS_DIRECT */
114
dtuple_t* row; /* row to insert */
115
dict_table_t* table; /* table where to insert */
116
sel_node_t* select; /* select in searched insert */
113
dtuple_t* row; /*!< row to insert */
114
dict_table_t* table; /*!< table where to insert */
115
sel_node_t* select; /*!< select in searched insert */
117
116
que_node_t* values_list;/* list of expressions to evaluate and
118
117
insert in an INS_VALUES insert */
119
ulint state; /* node execution state */
120
dict_index_t* index; /* NULL, or the next index where the index
118
ulint state; /*!< node execution state */
119
dict_index_t* index; /*!< NULL, or the next index where the index
121
120
entry should be inserted */
122
dtuple_t* entry; /* NULL, or entry to insert in the index;
121
dtuple_t* entry; /*!< NULL, or entry to insert in the index;
123
122
after a successful insert of the entry,
124
123
this should be reset to NULL */
125
124
UT_LIST_BASE_NODE_T(dtuple_t)
126
125
entry_list;/* list of entries, one for each index */
127
126
byte* row_id_buf;/* buffer for the row id sys field in row */
128
dulint trx_id; /* trx id or the last trx which executed the
127
trx_id_t trx_id; /*!< trx id or the last trx which executed the
130
129
byte* trx_id_buf;/* buffer for the trx id sys field in row */
131
130
mem_heap_t* entry_sys_heap;
added
removed
storage/innobase/include/row0ins.h
