1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
|
/*****************************************************************************
Copyright (c) 2016, 2025, Oracle and/or its affiliates.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License, version 2.0, as published by the
Free Software Foundation.
This program is designed to work with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have either included with
the program or referenced in the documentation.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU General Public License, version 2.0,
for more details.
You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
#include "zlob0index.h"
#include "lob0util.h"
#include "trx0purge.h"
#include "zlob0first.h"
namespace lob {
fil_addr_t z_index_entry_t::purge_version(dict_index_t *index,
z_first_page_t &first,
flst_base_node_t *lst,
flst_base_node_t *free_list) {
/* Save the location of next node. */
fil_addr_t next_loc = get_next();
/* Remove the current node from the list it belongs. */
remove(lst);
/* Purge the current node. */
purge(index, first);
/* Add the current node to the free list. */
push_front(free_list);
/* Return the next node location. */
return (next_loc);
}
fil_addr_t z_index_entry_t::make_old_version_current(dict_index_t *index,
z_first_page_t &first) {
flst_base_node_t *idx_flst = first.index_list();
flst_base_node_t *free_list = first.free_list();
flst_base_node_t *version_list = get_versions_list();
if (flst_get_len(version_list) > 0) {
space_id_t space = dict_index_get_space(index);
const page_size_t page_size = dict_table_page_size(index->table);
/* Remove the old version from versions list. */
fil_addr_t old_node_addr = flst_get_first(version_list, m_mtr);
flst_node_t *old_node =
fut_get_ptr(space, page_size, old_node_addr, RW_X_LATCH, m_mtr);
flst_remove(version_list, old_node, m_mtr);
/* Copy the version base node from current to old entry. */
z_index_entry_t old_entry(old_node, m_mtr, index);
move_version_base_node(old_entry);
/* Insert the old version after the current node. */
insert_after(idx_flst, old_entry);
}
fil_addr_t loc = purge_version(index, first, idx_flst, free_list);
ut_d(flst_validate(idx_flst, m_mtr));
return (loc);
}
/** Purge the current index entry. An index entry points to either a FIRST
page or DATA page. That LOB page will be freed if it is DATA page. A FIRST
page should not be freed. */
void z_index_entry_t::purge(dict_index_t *index, z_first_page_t &first) {
set_data_len(0);
const space_id_t space_id = dict_index_get_space(index);
const page_size_t page_size = dict_table_page_size(index->table);
while (true) {
page_no_t page_no = get_z_page_no();
if (page_no == FIL_NULL) {
break;
}
buf_block_t *block = buf_page_get(page_id_t(space_id, page_no), page_size,
RW_X_LATCH, UT_LOCATION_HERE, m_mtr);
page_type_t type = fil_page_get_type(block->frame);
page_no_t next = block->get_next_page_no();
set_z_page_no(next);
switch (type) {
case FIL_PAGE_TYPE_ZLOB_FIRST: {
z_first_page_t first(block, m_mtr, index);
first.set_data_len(0);
first.set_trx_id(0);
first.set_next_page_null();
} break;
case FIL_PAGE_TYPE_ZLOB_DATA:
btr_page_free_low(index, block, ULINT_UNDEFINED, m_mtr);
break;
case FIL_PAGE_TYPE_ZLOB_FRAG: {
z_frag_page_t frag_page(block, m_mtr, index);
frag_id_t fid = get_z_frag_id();
ut_ad(fid != FRAG_ID_NULL);
ut_ad(frag_page.get_n_frags() > 0);
frag_page.dealloc_fragment(fid);
if (frag_page.get_n_frags() == 0) {
frag_page.dealloc_with_entry(first, m_mtr);
}
} break;
default:
ut_d(ut_error);
}
if (type == FIL_PAGE_TYPE_ZLOB_FRAG) {
break;
}
}
init();
}
std::ostream &z_index_entry_t::print(std::ostream &out) const {
if (m_node == nullptr) {
out << "[z_index_entry_t: m_node=null]";
} else {
out << "[z_index_entry_t: m_node=" << (void *)m_node
<< ", prev=" << get_prev() << ", next=" << get_next()
<< ", versions=" << flst_bnode_t(get_versions_list(), m_mtr)
<< ", trx_id=" << get_trx_id()
<< ", modifier trx_id=" << get_trx_id_modifier()
<< ", trx_undo_no=" << get_trx_undo_no()
<< ", trx_undo_no_modifier=" << get_trx_undo_no_modifier()
<< ", z_page_no=" << get_z_page_no()
<< ", z_frag_id=" << get_z_frag_id() << ", data_len=" << get_data_len()
<< ", zdata_len=" << get_zdata_len() << "]";
}
return (out);
}
std::ostream &z_index_entry_t::print_pages(std::ostream &out) const {
page_no_t page_no = get_z_page_no();
const space_id_t space_id = dict_index_get_space(m_index);
const page_size_t page_size = dict_table_page_size(m_index->table);
out << "[PAGES: ";
while (page_no != FIL_NULL) {
buf_block_t *block = buf_page_get(page_id_t(space_id, page_no), page_size,
RW_S_LATCH, UT_LOCATION_HERE, m_mtr);
page_type_t type = block->get_page_type();
out << "[page_no=" << page_no << ", type=" << block->get_page_type_str()
<< "]";
page_no = block->get_next_page_no();
if (type == FIL_PAGE_TYPE_ZLOB_FRAG) {
/* Reached the fragment page. Stop. */
break;
}
}
out << "]";
return (out);
}
fil_addr_t z_index_entry_t::get_self() const {
if (m_node == nullptr) {
return (fil_addr_null);
}
page_t *frame = page_align(m_node);
page_no_t page_no = mach_read_from_4(frame + FIL_PAGE_OFFSET);
uint32_t offset = static_cast<uint32_t>(m_node - frame);
ut_ad(offset < UNIV_PAGE_SIZE);
return (fil_addr_t(page_no, offset));
}
void z_index_entry_t::read(z_index_entry_mem_t &entry_mem) const {
entry_mem.m_self = get_self();
entry_mem.m_prev = get_prev();
entry_mem.m_next = get_next();
entry_mem.m_versions = get_versions_mem();
entry_mem.m_trx_id = get_trx_id();
entry_mem.m_z_page_no = get_z_page_no();
entry_mem.m_z_frag_id = get_z_frag_id();
entry_mem.m_data_len = get_data_len();
entry_mem.m_z_data_len = get_zdata_len();
}
void z_index_entry_t::move_version_base_node(z_index_entry_t &entry) {
ut_ad(m_mtr != nullptr);
flst_base_node_t *from_node = get_versions_list();
flst_base_node_t *to_node = entry.get_versions_list();
/* Copy with redo logging the version list base node. */
mlog_write_string(to_node, from_node, FLST_BASE_NODE_SIZE, m_mtr);
ut_ad(flst_get_len(from_node) == flst_get_len(to_node));
fil_addr_t addr1 = flst_get_first(from_node, m_mtr);
fil_addr_t addr2 = flst_get_first(to_node, m_mtr);
ut_ad(addr1.is_equal(addr2));
addr1 = flst_get_last(from_node, m_mtr);
addr2 = flst_get_last(to_node, m_mtr);
ut_ad(addr1.is_equal(addr2));
flst_init(from_node, m_mtr);
}
/* The given entry becomes the old version of the current entry.
Move the version base node from old entry to current entry.
@param[in] entry the old entry */
void z_index_entry_t::set_old_version(z_index_entry_t &entry) {
flst_base_node_t *version_list = get_versions_list();
ut_ad(flst_get_len(version_list) == 0);
entry.move_version_base_node(*this);
entry.push_front(version_list);
}
std::ostream &z_index_entry_mem_t::print(std::ostream &out) const {
out << "[z_index_entry_mem_t: self=" << m_self << ", prev=" << m_prev
<< ", next=" << m_next << ", versions=" << m_versions
<< ", m_trx_id=" << m_trx_id
<< ", m_trx_id_modifier=" << m_trx_id_modifier
<< ", m_trx_undo_no=" << m_trx_undo_no
<< ", m_trx_undo_no_modifier=" << m_trx_undo_no_modifier
<< ", z_page_no=" << m_z_page_no << ", z_frag_id=" << m_z_frag_id
<< ", data_len=" << m_data_len << ", z_data_len=" << m_z_data_len << "]";
return (out);
}
size_t z_index_entry_t::free_data_pages(mtr_t *mtr) {
size_t n_pages = 0;
page_no_t page_no = get_z_page_no();
space_id_t space_id = dict_index_get_space(m_index);
while (page_no != FIL_NULL) {
buf_block_t *block =
buf_page_get(page_id_t(space_id, page_no), m_index->get_page_size(),
RW_X_LATCH, UT_LOCATION_HERE, mtr);
/* Save the next page number before freeing. */
page_no = block->get_next_page_no();
page_type_t ptype = block->get_page_type();
ut_ad(ptype == FIL_PAGE_TYPE_ZLOB_DATA ||
ptype == FIL_PAGE_TYPE_ZLOB_FRAG ||
ptype == FIL_PAGE_TYPE_ZLOB_FIRST);
if (ptype == FIL_PAGE_TYPE_ZLOB_DATA) {
z_data_page_t data_page(block, mtr, m_index);
data_page.dealloc();
set_z_page_no_null(mtr);
n_pages++;
} else if (ptype == FIL_PAGE_TYPE_ZLOB_FRAG) {
/* Reached the end of the stream. */
break;
} else if (ptype == FIL_PAGE_TYPE_ZLOB_FIRST) {
/* Do nothing. */
}
}
return (n_pages);
}
} /* namespace lob */
|