mirror of
https://github.com/MariaDB/server.git
synced 2025-01-19 05:22:25 +01:00
60bbfd6d0b
traversing the index B-tree twice (first in BTR_WATCH_LEAF mode and then in BTR_DELETE mode), let BTR_DELETE take care of checking that the record can be purged, and either buffering or performing the purge. row_purge_poss_sec(): New function, to check if it is possible to purge a secondary index record. Refactored from row_purge_remove_sec_if_poss_low(). row_purge_remove_sec_if_poss_nonbuffered(): Rename to row_purge_remove_sec_if_poss_tree(). Remove the parameter mode (always use BTR_MODIFY_TREE). Use row_purge_poss_sec(). row_purge_remove_sec_if_poss_low(): Rename to row_purge_remove_sec_if_poss_leaf(). Remove the parameter mode (always use BTR_MODIFY_LEAF). Let row_search_index_entry() do all the hard work. btr_cur_t: Add purge_node, which will be needed by btr_cur_search_to_nth_level() for BTR_DELETE. Replace the flag value BTR_CUR_ABORTED with BTR_CUR_DELETE_REF and BTR_CUR_DELETE_FAILED. enum row_search_result, row_search_index_entry(): Replace ROW_NOT_IN_POOL with ROW_NOT_DELETED_REF and ROW_NOT_DELETED. btr_cur_search_to_nth_level(): Remove BTR_WATCH_LEAF. As a side effect, the adaptive hash index can be used in purge as well. If BTR_DELETE cannot be buffered, attempt btr_cur_optimistic_delete(). Either way, check row_purge_poss_sec(). Move the code to set cursor->ibuf_count to get rid of another if (height == 0) check. Eliminate the label loop_end. Do not call ibuf_should_try() twice. ibuf_should_try(): Now that the successful calls to this function will be halved, halve the magic constant that ibuf_flush_count will be compared to, accordingly. The changes regarding ibuf_should_try() were merged from branches/zip r3515. rb://60 approved by Heikki over IM
332 lines
12 KiB
C
332 lines
12 KiB
C
/******************************************************
|
|
General row routines
|
|
|
|
(c) 1996 Innobase Oy
|
|
|
|
Created 4/20/1996 Heikki Tuuri
|
|
*******************************************************/
|
|
|
|
#ifndef row0row_h
|
|
#define row0row_h
|
|
|
|
#include "univ.i"
|
|
#include "data0data.h"
|
|
#include "dict0types.h"
|
|
#include "trx0types.h"
|
|
#include "que0types.h"
|
|
#include "mtr0mtr.h"
|
|
#include "rem0types.h"
|
|
#include "read0types.h"
|
|
#include "row0types.h"
|
|
#include "btr0types.h"
|
|
|
|
/*************************************************************************
|
|
Gets the offset of the trx id field, in bytes relative to the origin of
|
|
a clustered index record. */
|
|
UNIV_INTERN
|
|
ulint
|
|
row_get_trx_id_offset(
|
|
/*==================*/
|
|
/* out: offset of DATA_TRX_ID */
|
|
const rec_t* rec, /* in: record */
|
|
dict_index_t* index, /* in: clustered index */
|
|
const ulint* offsets);/* in: rec_get_offsets(rec, index) */
|
|
/*************************************************************************
|
|
Reads the trx id field from a clustered index record. */
|
|
UNIV_INLINE
|
|
dulint
|
|
row_get_rec_trx_id(
|
|
/*===============*/
|
|
/* out: value of the field */
|
|
const rec_t* rec, /* in: record */
|
|
dict_index_t* index, /* in: clustered index */
|
|
const ulint* offsets);/* in: rec_get_offsets(rec, index) */
|
|
/*************************************************************************
|
|
Reads the roll pointer field from a clustered index record. */
|
|
UNIV_INLINE
|
|
dulint
|
|
row_get_rec_roll_ptr(
|
|
/*=================*/
|
|
/* out: value of the field */
|
|
const rec_t* rec, /* in: record */
|
|
dict_index_t* index, /* in: clustered index */
|
|
const ulint* offsets);/* in: rec_get_offsets(rec, index) */
|
|
/*********************************************************************
|
|
When an insert or purge to a table is performed, this function builds
|
|
the entry to be inserted into or purged from an index on the table. */
|
|
UNIV_INTERN
|
|
dtuple_t*
|
|
row_build_index_entry(
|
|
/*==================*/
|
|
/* out: index entry which should be
|
|
inserted or purged, or NULL if the
|
|
externally stored columns in the
|
|
clustered index record are unavailable
|
|
and ext != NULL */
|
|
const dtuple_t* row, /* in: row which should be
|
|
inserted or purged */
|
|
row_ext_t* ext, /* in: externally stored column prefixes,
|
|
or NULL */
|
|
dict_index_t* index, /* in: index on the table */
|
|
mem_heap_t* heap); /* in: memory heap from which the memory for
|
|
the index entry is allocated */
|
|
/***********************************************************************
|
|
An inverse function to row_build_index_entry. Builds a row from a
|
|
record in a clustered index. */
|
|
UNIV_INTERN
|
|
dtuple_t*
|
|
row_build(
|
|
/*======*/
|
|
/* out, own: row built;
|
|
see the NOTE below! */
|
|
ulint type, /* in: ROW_COPY_POINTERS or
|
|
ROW_COPY_DATA; the latter
|
|
copies also the data fields to
|
|
heap while the first only
|
|
places pointers to data fields
|
|
on the index page, and thus is
|
|
more efficient */
|
|
const dict_index_t* index, /* in: clustered index */
|
|
const rec_t* rec, /* in: record in the clustered
|
|
index; NOTE: in the case
|
|
ROW_COPY_POINTERS the data
|
|
fields in the row will point
|
|
directly into this record,
|
|
therefore, the buffer page of
|
|
this record must be at least
|
|
s-latched and the latch held
|
|
as long as the row dtuple is used! */
|
|
const ulint* offsets,/* in: rec_get_offsets(rec,index)
|
|
or NULL, in which case this function
|
|
will invoke rec_get_offsets() */
|
|
const dict_table_t* col_table,
|
|
/* in: table, to check which
|
|
externally stored columns
|
|
occur in the ordering columns
|
|
of an index, or NULL if
|
|
index->table should be
|
|
consulted instead; the user
|
|
columns in this table should be
|
|
the same columns as in index->table */
|
|
row_ext_t** ext, /* out, own: cache of
|
|
externally stored column
|
|
prefixes, or NULL */
|
|
mem_heap_t* heap); /* in: memory heap from which
|
|
the memory needed is allocated */
|
|
/***********************************************************************
|
|
Converts an index record to a typed data tuple. */
|
|
UNIV_INTERN
|
|
dtuple_t*
|
|
row_rec_to_index_entry_low(
|
|
/*=======================*/
|
|
/* out: index entry built; does not
|
|
set info_bits, and the data fields in
|
|
the entry will point directly to rec */
|
|
const rec_t* rec, /* in: record in the index */
|
|
const dict_index_t* index, /* in: index */
|
|
const ulint* offsets,/* in: rec_get_offsets(rec, index) */
|
|
ulint* n_ext, /* out: number of externally
|
|
stored columns */
|
|
mem_heap_t* heap); /* in: memory heap from which
|
|
the memory needed is allocated */
|
|
/***********************************************************************
|
|
Converts an index record to a typed data tuple. NOTE that externally
|
|
stored (often big) fields are NOT copied to heap. */
|
|
UNIV_INTERN
|
|
dtuple_t*
|
|
row_rec_to_index_entry(
|
|
/*===================*/
|
|
/* out, own: index entry
|
|
built; see the NOTE below! */
|
|
ulint type, /* in: ROW_COPY_DATA, or
|
|
ROW_COPY_POINTERS: the former
|
|
copies also the data fields to
|
|
heap as the latter only places
|
|
pointers to data fields on the
|
|
index page */
|
|
const rec_t* rec, /* in: record in the index;
|
|
NOTE: in the case
|
|
ROW_COPY_POINTERS the data
|
|
fields in the row will point
|
|
directly into this record,
|
|
therefore, the buffer page of
|
|
this record must be at least
|
|
s-latched and the latch held
|
|
as long as the dtuple is used! */
|
|
const dict_index_t* index, /* in: index */
|
|
ulint* offsets,/* in/out: rec_get_offsets(rec) */
|
|
ulint* n_ext, /* out: number of externally
|
|
stored columns */
|
|
mem_heap_t* heap); /* in: memory heap from which
|
|
the memory needed is allocated */
|
|
/***********************************************************************
|
|
Builds from a secondary index record a row reference with which we can
|
|
search the clustered index record. */
|
|
UNIV_INTERN
|
|
dtuple_t*
|
|
row_build_row_ref(
|
|
/*==============*/
|
|
/* out, own: row reference built; see the
|
|
NOTE below! */
|
|
ulint type, /* in: ROW_COPY_DATA, or ROW_COPY_POINTERS:
|
|
the former copies also the data fields to
|
|
heap, whereas the latter only places pointers
|
|
to data fields on the index page */
|
|
dict_index_t* index, /* in: secondary index */
|
|
const rec_t* rec, /* in: record in the index;
|
|
NOTE: in the case ROW_COPY_POINTERS
|
|
the data fields in the row will point
|
|
directly into this record, therefore,
|
|
the buffer page of this record must be
|
|
at least s-latched and the latch held
|
|
as long as the row reference is used! */
|
|
mem_heap_t* heap); /* in: memory heap from which the memory
|
|
needed is allocated */
|
|
/***********************************************************************
|
|
Builds from a secondary index record a row reference with which we can
|
|
search the clustered index record. */
|
|
UNIV_INTERN
|
|
void
|
|
row_build_row_ref_in_tuple(
|
|
/*=======================*/
|
|
dtuple_t* ref, /* in/out: row reference built;
|
|
see the NOTE below! */
|
|
const rec_t* rec, /* in: record in the index;
|
|
NOTE: the data fields in ref
|
|
will point directly into this
|
|
record, therefore, the buffer
|
|
page of this record must be at
|
|
least s-latched and the latch
|
|
held as long as the row
|
|
reference is used! */
|
|
const dict_index_t* index, /* in: secondary index */
|
|
ulint* offsets,/* in: rec_get_offsets(rec, index)
|
|
or NULL */
|
|
trx_t* trx); /* in: transaction */
|
|
/***********************************************************************
|
|
From a row build a row reference with which we can search the clustered
|
|
index record. */
|
|
UNIV_INTERN
|
|
void
|
|
row_build_row_ref_from_row(
|
|
/*=======================*/
|
|
dtuple_t* ref, /* in/out: row reference built;
|
|
see the NOTE below!
|
|
ref must have the right number
|
|
of fields! */
|
|
const dict_table_t* table, /* in: table */
|
|
const dtuple_t* row); /* in: row
|
|
NOTE: the data fields in ref will point
|
|
directly into data of this row */
|
|
/***********************************************************************
|
|
Builds from a secondary index record a row reference with which we can
|
|
search the clustered index record. */
|
|
UNIV_INLINE
|
|
void
|
|
row_build_row_ref_fast(
|
|
/*===================*/
|
|
dtuple_t* ref, /* in/out: typed data tuple where the
|
|
reference is built */
|
|
const ulint* map, /* in: array of field numbers in rec
|
|
telling how ref should be built from
|
|
the fields of rec */
|
|
const rec_t* rec, /* in: record in the index; must be
|
|
preserved while ref is used, as we do
|
|
not copy field values to heap */
|
|
const ulint* offsets);/* in: array returned by rec_get_offsets() */
|
|
/*******************************************************************
|
|
Searches the clustered index record for a row, if we have the row
|
|
reference. */
|
|
UNIV_INTERN
|
|
ibool
|
|
row_search_on_row_ref(
|
|
/*==================*/
|
|
/* out: TRUE if found */
|
|
btr_pcur_t* pcur, /* out: persistent cursor, which must
|
|
be closed by the caller */
|
|
ulint mode, /* in: BTR_MODIFY_LEAF, ... */
|
|
const dict_table_t* table, /* in: table */
|
|
const dtuple_t* ref, /* in: row reference */
|
|
mtr_t* mtr); /* in/out: mtr */
|
|
/*************************************************************************
|
|
Fetches the clustered index record for a secondary index record. The latches
|
|
on the secondary index record are preserved. */
|
|
UNIV_INTERN
|
|
rec_t*
|
|
row_get_clust_rec(
|
|
/*==============*/
|
|
/* out: record or NULL, if no record found */
|
|
ulint mode, /* in: BTR_MODIFY_LEAF, ... */
|
|
const rec_t* rec, /* in: record in a secondary index */
|
|
dict_index_t* index, /* in: secondary index */
|
|
dict_index_t** clust_index,/* out: clustered index */
|
|
mtr_t* mtr); /* in: mtr */
|
|
|
|
/* Result of row_search_index_entry */
|
|
enum row_search_result {
|
|
ROW_FOUND = 0, /* the record was found */
|
|
ROW_NOT_FOUND, /* record not found */
|
|
ROW_BUFFERED, /* one of BTR_INSERT, BTR_DELETE, or
|
|
BTR_DELETE_MARK was specified, the
|
|
secondary index leaf page was not in
|
|
the buffer pool, and the operation was
|
|
enqueued in the insert/delete buffer */
|
|
ROW_NOT_DELETED_REF, /* BTR_DELETE was specified, and
|
|
row_purge_poss_sec() failed */
|
|
ROW_NOT_DELETED, /* BTR_DELETE was specified, and the
|
|
optimistic delete failed */
|
|
};
|
|
|
|
/*******************************************************************
|
|
Searches an index record. */
|
|
UNIV_INTERN
|
|
enum row_search_result
|
|
row_search_index_entry(
|
|
/*===================*/
|
|
/* out: whether the record was found
|
|
or buffered */
|
|
dict_index_t* index, /* in: index */
|
|
const dtuple_t* entry, /* in: index entry */
|
|
ulint mode, /* in: BTR_MODIFY_LEAF, ... */
|
|
btr_pcur_t* pcur, /* in/out: persistent cursor, which must
|
|
be closed by the caller */
|
|
mtr_t* mtr); /* in: mtr */
|
|
|
|
|
|
#define ROW_COPY_DATA 1
|
|
#define ROW_COPY_POINTERS 2
|
|
|
|
/* The allowed latching order of index records is the following:
|
|
(1) a secondary index record ->
|
|
(2) the clustered index record ->
|
|
(3) rollback segment data for the clustered index record.
|
|
|
|
No new latches may be obtained while the kernel mutex is reserved.
|
|
However, the kernel mutex can be reserved while latches are owned. */
|
|
|
|
/***********************************************************************
|
|
Formats the raw data in "data" (in InnoDB on-disk format) using
|
|
"dict_field" and writes the result to "buf".
|
|
Not more than "buf_size" bytes are written to "buf".
|
|
The result is always '\0'-terminated (provided buf_size > 0) and the
|
|
number of bytes that were written to "buf" is returned (including the
|
|
terminating '\0'). */
|
|
UNIV_INTERN
|
|
ulint
|
|
row_raw_format(
|
|
/*===========*/
|
|
/* out: number of bytes
|
|
that were written */
|
|
const char* data, /* in: raw data */
|
|
ulint data_len, /* in: raw data length
|
|
in bytes */
|
|
const dict_field_t* dict_field, /* in: index field */
|
|
char* buf, /* out: output buffer */
|
|
ulint buf_size); /* in: output buffer size
|
|
in bytes */
|
|
|
|
#ifndef UNIV_NONINL
|
|
#include "row0row.ic"
|
|
#endif
|
|
|
|
#endif
|