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 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376
|
/*****************************************************************************
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 "lob0impl.h"
#include "lob0del.h"
#include "lob0index.h"
#include "lob0inf.h"
#include "lob0ins.h"
#include "lob0pages.h"
#include "lob0util.h"
#include "lob0zip.h"
#include "my_dbug.h"
#include "trx0sys.h"
#include "ut0ut.h"
#include "zlob0first.h"
#include "zlob0index.h"
#include "zlob0read.h"
namespace lob {
static void buf_block_set_next_page_no(buf_block_t *block,
page_no_t next_page_no, mtr_t *mtr) {
mlog_write_ulint(block->frame + FIL_PAGE_NEXT, next_page_no, MLOG_4BYTES,
mtr);
}
#ifdef UNIV_DEBUG
/** Validate the page list.
@return true if valid, false otherwise. */
bool plist_base_node_t::validate() const {
ulint len = 0;
ulint exp = get_len();
for (plist_node_t cur = get_first_node(); !cur.is_null();
cur = cur.get_next_node()) {
len++;
ut_ad(len <= exp);
}
ut_ad(len == exp);
return (true);
}
#endif /* UNIV_DEBUG */
/** Allocate one node page. */
buf_block_t *node_page_t::alloc(first_page_t &first_page, bool bulk) {
ut_ad(m_block == nullptr);
page_no_t hint = FIL_NULL;
/* For testing purposes, pretend that the LOB page allocation failed.*/
DBUG_EXECUTE_IF("innodb_lob_alloc_node_page_failed", return (nullptr););
m_block = alloc_lob_page(m_index, m_mtr, hint, bulk);
if (m_block == nullptr) {
return (nullptr);
}
set_page_type();
set_version_0();
set_next_page(first_page.get_next_page());
first_page.set_next_page(get_page_no());
/* Use fully for the LOB index contents */
ulint lob_metadata_len = payload();
ulint node_count = lob_metadata_len / index_entry_t::SIZE;
flst_base_node_t *free_list = first_page.free_list();
byte *cur = nodes_begin();
/* Populate the free list with empty index entry nodes. */
for (ulint i = 0; i < node_count; ++i) {
flst_add_last(free_list, cur, m_mtr);
cur += index_entry_t::SIZE;
}
ut_d(flst_validate(free_list, m_mtr));
return (m_block);
}
std::ostream &z_frag_entry_t::print(std::ostream &out) const {
out << "[z_frag_entry_t: prev=" << get_prev() << ", next=" << get_next()
<< ", page_no=" << get_page_no() << ", n_frags=" << get_n_frags()
<< ", used_len=" << get_used_len()
<< ", total_free_len=" << get_total_free_len()
<< ", big_free_len=" << get_big_free_len() << "]";
return (out);
}
void z_frag_entry_t::purge(flst_base_node_t *used_lst,
flst_base_node_t *free_lst) {
remove(used_lst);
init();
push_front(free_lst);
}
/** Update the current fragment entry with information about
the given fragment page.
@param[in] frag_page the fragment page whose information
will be stored in current fragment entry. */
void z_frag_entry_t::update(const z_frag_page_t &frag_page) {
ut_ad(m_mtr != nullptr);
set_page_no(frag_page.get_page_no());
set_n_frags(frag_page.get_n_frags());
set_used_len(frag_page.get_total_stored_data());
set_total_free_len(frag_page.get_total_free_len());
set_big_free_len(frag_page.get_big_free_len());
}
void z_frag_entry_t::free_frag_page(mtr_t *mtr, dict_index_t *index) {
page_no_t page_no = get_page_no();
if (page_no != FIL_NULL) {
page_id_t page_id = page_id_t(index->space_id(), page_no);
page_size_t page_size = index->get_page_size();
buf_block_t *block =
buf_page_get(page_id, page_size, RW_X_LATCH, UT_LOCATION_HERE, mtr);
btr_page_free_low(index, block, ULINT_UNDEFINED, mtr);
set_page_no(FIL_NULL);
}
}
/** Insert a single zlib stream.
@param[in] index the index to which the LOB belongs.
@param[in] first the first page of the compressed LOB.
@param[in] trxid the id of the current transaction.
@param[in] blob in memory copy of the LOB.
@param[in] len the length of the LOB.
@param[in] mtr the mini-transaction context.
@param[in] bulk true if bulk operation, false otherwise.
@param[out] start_page_no the first page into which zlib stream
was written.
@param[out] frag_id the fragment id that contains last part of the
zlib stream.
@return DB_SUCCESS on success, error code on error. */
dberr_t z_insert_strm(dict_index_t *index, z_first_page_t &first,
trx_id_t trxid, byte *blob, ulint len, mtr_t *mtr,
bool bulk, page_no_t &start_page_no, frag_id_t &frag_id) {
ulint remain = len;
start_page_no = FIL_NULL;
frag_id = FRAG_ID_NULL;
page_no_t prev_page_no;
byte *lob_ptr = blob;
const page_no_t first_page_no = first.get_page_no();
#ifdef UNIV_DEBUG
ulint frag_max_payload = z_frag_page_t::max_payload(index);
#endif /* UNIV_DEBUG */
/* If the first page is empty, then make use of it. */
if (first.get_data_len() == 0) {
/* First page is unused. Use it. */
byte *ptr = first.begin_data_ptr();
ulint size = first.payload();
ulint to_copy = (remain > size) ? size : remain;
mlog_write_string(ptr, lob_ptr, to_copy, mtr);
remain -= to_copy;
lob_ptr += to_copy;
start_page_no = first.get_page_no();
prev_page_no = start_page_no;
first.set_data_len(to_copy);
first.set_trx_id(trxid);
first.set_next_page_null();
} else if (!z_frag_page_t::can_data_fit(index, remain)) {
/* Data cannot fit into a fragment page. Allocate a data
page. */
z_data_page_t data_page(mtr, index);
buf_block_t *tmp_block = data_page.alloc(first_page_no + 1, bulk);
if (tmp_block == nullptr) {
return (DB_OUT_OF_FILE_SPACE);
}
byte *ptr = data_page.begin_data_ptr();
ulint size = data_page.payload();
ulint to_copy = (remain > size) ? size : remain;
/* Copy data into the page. */
mlog_write_string(ptr, lob_ptr, to_copy, mtr);
remain -= to_copy;
lob_ptr += to_copy;
start_page_no = data_page.get_page_no();
prev_page_no = start_page_no;
data_page.set_data_len(to_copy);
data_page.set_trx_id(trxid);
} else {
/* Data can fit into a fragment page. */
z_frag_page_t frag_page(mtr, index);
z_frag_entry_t frag_entry(mtr);
frag_id = first.alloc_fragment(bulk, remain, frag_page, frag_entry);
if (frag_id == FRAG_ID_NULL) {
return (DB_OUT_OF_FILE_SPACE);
}
#ifdef UNIV_DEBUG
const ulint big_free_len_1 = frag_page.get_big_free_len();
const ulint big_free_len_2 = frag_entry.get_big_free_len();
ut_ad(big_free_len_1 == big_free_len_2);
#endif /* UNIV_DEBUG */
frag_node_t node = frag_page.get_frag_node(frag_id);
byte *ptr = node.frag_begin();
ut_ad(remain == node.payload());
/* copy data to the page. */
mlog_write_string(ptr, lob_ptr, remain, mtr);
start_page_no = frag_page.get_page_no();
/* Update the frag entry. */
frag_entry.update(frag_page);
return (DB_SUCCESS);
}
/* As long as data cannot fit into a fragment page, use a data page. */
while (remain > 0 && !z_frag_page_t::can_data_fit(index, remain)) {
z_data_page_t data_page(mtr, index);
buf_block_t *new_block = data_page.alloc(first_page_no + 1, bulk);
if (new_block == nullptr) {
return (DB_OUT_OF_FILE_SPACE);
}
byte *ptr = data_page.begin_data_ptr();
ulint size = data_page.payload();
ulint to_copy = (remain > size) ? size : remain;
mlog_write_string(ptr, lob_ptr, to_copy, mtr);
remain -= to_copy;
lob_ptr += to_copy;
data_page.set_data_len(to_copy);
data_page.set_trx_id(trxid);
/* Get the previous page and update its next page. */
buf_block_t *block = buf_page_get(
page_id_t(dict_index_get_space(index), prev_page_no),
dict_table_page_size(index->table), RW_X_LATCH, UT_LOCATION_HERE, mtr);
buf_block_set_next_page_no(block, data_page.get_page_no(), mtr);
prev_page_no = data_page.get_page_no();
}
if (remain > 0) {
ut_ad(remain <= frag_max_payload);
ut_ad(frag_id == FRAG_ID_NULL);
z_frag_page_t frag_page(mtr, index);
z_frag_entry_t frag_entry(mtr);
frag_id = first.alloc_fragment(bulk, remain, frag_page, frag_entry);
if (frag_id == FRAG_ID_NULL) {
return (DB_OUT_OF_FILE_SPACE);
}
#ifdef UNIV_DEBUG
const ulint big_free_len_1 = frag_page.get_big_free_len();
const ulint big_free_len_2 = frag_entry.get_big_free_len();
ut_ad(big_free_len_1 == big_free_len_2);
#endif /* UNIV_DEBUG */
frag_node_t node = frag_page.get_frag_node(frag_id);
byte *ptr = node.frag_begin();
#ifdef UNIV_DEBUG
{
const ulint pl = node.payload();
ut_ad(remain <= pl);
}
#endif /* UNIV_DEBUG */
mlog_write_string(ptr, lob_ptr, remain, mtr);
/* Update the frag entry. */
frag_entry.update(frag_page);
/* Get the previous page and update its next page. */
buf_block_t *block = buf_page_get(
page_id_t(dict_index_get_space(index), prev_page_no),
dict_table_page_size(index->table), RW_X_LATCH, UT_LOCATION_HERE, mtr);
buf_block_set_next_page_no(block, frag_page.get_page_no(), mtr);
}
return (DB_SUCCESS);
}
dberr_t z_insert_chunk(dict_index_t *index, z_first_page_t &first, trx_t *trx,
byte *blob, ulint len, z_index_entry_t *out_entry,
mtr_t *mtr, bool bulk) {
ut_ad(len <= Z_CHUNK_SIZE);
ut_ad(first.get_page_type() == FIL_PAGE_TYPE_ZLOB_FIRST);
dberr_t err(DB_SUCCESS);
const trx_id_t trxid = (trx == nullptr ? 0 : trx->id);
const undo_no_t undo_no = (trx == nullptr ? 0 : trx->undo_no - 1);
z_stream strm;
strm.zalloc = nullptr;
strm.zfree = nullptr;
strm.opaque = nullptr;
int ret = deflateInit(&strm, page_zip_level);
ut_a(ret == Z_OK);
strm.avail_in = static_cast<uInt>(len);
strm.next_in = blob;
/* It is possible that the compressed stream is actually bigger. So
making use of this call to find it out for sure. */
const ulint max_buf = deflateBound(&strm, static_cast<uLong>(len));
std::unique_ptr<byte[]> tmpbuf(new byte[max_buf]);
strm.avail_out = static_cast<uInt>(max_buf);
strm.next_out = tmpbuf.get();
ret = deflate(&strm, Z_FINISH);
ut_a(ret == Z_STREAM_END);
ut_a(strm.avail_in == 0);
ut_a(strm.total_out == (max_buf - strm.avail_out));
page_no_t z_page_no;
frag_id_t z_frag_id;
err = z_insert_strm(index, first, trxid, tmpbuf.get(), strm.total_out, mtr,
bulk, z_page_no, z_frag_id);
if (err != DB_SUCCESS) {
deflateEnd(&strm);
return (err);
}
z_index_entry_t entry = first.alloc_index_entry(bulk);
if (entry.is_null()) {
deflateEnd(&strm);
return (DB_OUT_OF_FILE_SPACE);
}
entry.set_trx_id(trxid);
entry.set_trx_id_modifier(trxid);
entry.set_trx_undo_no(undo_no);
entry.set_trx_undo_no_modifier(undo_no);
entry.set_z_page_no(z_page_no);
entry.set_z_frag_id(z_frag_id);
entry.set_data_len(len);
entry.set_zdata_len(strm.total_out);
deflateEnd(&strm);
if (out_entry != nullptr) {
out_entry->reset(entry);
}
ut_ad(z_validate_strm(index, entry, mtr));
return (DB_SUCCESS);
}
/** Insert a compressed large object (LOB) into the system.
@param[in] ctx the B-tree context for this LOB operation.
@param[in] trx transaction doing the insertion.
@param[in,out] ref the LOB reference.
@param[in] field the LOB field.
@param[in] field_j the LOB field index in big rec vector.
@return DB_SUCCESS on success, error code on failure.*/
dberr_t z_insert(InsertContext *ctx, trx_t *trx, ref_t &ref,
big_rec_field_t *field, ulint field_j) {
byte *blob = field->ptr();
ulint len = field->len;
ulint remain = len;
byte *ptr = blob;
dberr_t err(DB_SUCCESS);
dict_index_t *index = ctx->index();
space_id_t space_id = dict_index_get_space(index);
byte *field_ref;
mtr_t *mtr = ctx->get_mtr();
const trx_id_t trxid = (trx == nullptr ? 0 : trx->id);
const ulint commit_freq = 4;
ut_ad(remain > 0);
if (ref.length() > 0) {
ref.set_length(len, nullptr);
if (!ctx->is_bulk()) {
ctx->zblob_write_blobref(field->field_no, ctx->m_mtr);
}
}
const page_size_t page_size(dict_table_page_size(index->table));
if (!ref_t::is_big(page_size, len)) {
/* The LOB is not big enough to build LOB index. Insert the
LOB without an LOB index. */
zInserter zblob_writer(ctx);
err = zblob_writer.prepare();
if (err == DB_SUCCESS) {
zblob_writer.write_one_small_blob(field_j);
err = zblob_writer.finish(false);
}
return (err);
}
z_first_page_t first(mtr, index);
buf_block_t *first_block = first.alloc(ctx->is_bulk());
if (first_block == nullptr) {
return (DB_OUT_OF_FILE_SPACE);
}
first.init_lob_version();
first.set_last_trx_id(trxid);
const page_no_t first_page_no = first.get_page_no();
const page_id_t first_page_id(dict_index_get_space(index), first_page_no);
if (dict_index_is_online_ddl(index)) {
row_log_table_blob_alloc(index, first_page_no);
}
flst_base_node_t *idx_list = first.index_list();
ulint nth_chunk = 0;
ut_o(const) ulint chunk_size = Z_CHUNK_SIZE;
DBUG_EXECUTE_IF("zlob_reduce_chunk_size", chunk_size = 20000;);
while (remain > 0) {
ut_ad(first.get_page_type() == FIL_PAGE_TYPE_ZLOB_FIRST);
z_index_entry_t entry(mtr, index);
ulint size = (remain >= chunk_size) ? chunk_size : remain;
err = z_insert_chunk(index, first, trx, ptr, size, &entry, mtr,
ctx->is_bulk());
if (err != DB_SUCCESS) {
return (err);
}
entry.set_lob_version(1);
ptr += size;
remain -= size;
entry.push_back(idx_list);
if (++nth_chunk % commit_freq == 0) {
ctx->check_redolog();
field_ref = ctx->get_field_ref(field->field_no);
ref.set_ref(field_ref);
first.load_x(first_page_id, page_size);
/* The first page could have been re-located. Reset
the idx_list to the correct value. */
idx_list = first.index_list();
}
}
/* Must have inserted at least one chunk. */
ut_ad(nth_chunk > 0);
field_ref = ctx->get_field_ref(field->field_no);
ref.set_ref(field_ref);
ref.update(space_id, first_page_no, 1, nullptr);
ref.set_length(len, nullptr);
ctx->make_nth_extern(field->field_no);
if (!ctx->is_bulk()) {
ctx->zblob_write_blobref(field->field_no, ctx->m_mtr);
}
/* If the full LOB could not be inserted, then we report error. */
ut_ad(remain == 0);
#ifdef ZLOB_DEBUG
std::cout << "thread=" << std::this_thread::get_id()
<< ", lob::z_insert(): table=" << ctx->index()->table->name
<< ", ref=" << ref << std::endl;
first.print(std::cout);
#endif
DBUG_EXECUTE_IF("innodb_zlob_print", z_print_info(index, ref, std::cerr););
return (err);
}
/** Print information about the given compressed lob.
@param[in] index the index dictionary object.
@param[in] ref the LOB reference
@param[out] out the output stream where information is printed.
@return DB_SUCCESS on success, or an error code. */
dberr_t z_print_info(const dict_index_t *index, const lob::ref_t &ref,
std::ostream &out) {
mtr_t mtr;
mtr_start(&mtr);
z_first_page_t first(&mtr, const_cast<dict_index_t *>(index));
first.load_x(ref.page_no());
first.print(out);
mtr_commit(&mtr);
return (DB_SUCCESS);
}
buf_block_t *z_frag_page_t::alloc(z_first_page_t &first, page_no_t hint,
bool bulk) {
/* The m_block member could point to valid block. Overwriting it is
good enough. */
/* For testing purposes, pretend that the LOB page allocation failed.*/
DBUG_EXECUTE_IF("innodb_lob_alloc_z_frag_page_failed", return (nullptr););
m_block = alloc_lob_page(m_index, m_mtr, hint, bulk);
if (m_block == nullptr) {
return (nullptr);
}
/* Set page type to FIL_PAGE_TYPE_ZLOB_FRAG. */
set_page_type();
set_version_0();
/* All allocated fragment pages are linked via the next page of the first page
of LOB. */
page_no_t frag_page_no = first.get_frag_page_no();
if (frag_page_no == 0) {
/* If the frag_page_no is equal to 0, it means that this LOB was created
before storing the fragment page list in the FIL_PAGE_PREV of the first
page. So don't change that. */
} else {
if (frag_page_no != FIL_NULL) {
/* Load the first fragment page and updates its prev page. */
z_frag_page_t tmp(m_mtr, m_index);
tmp.load_x(frag_page_no);
tmp.set_page_prev(get_page_no());
}
set_page_next(frag_page_no);
set_page_prev(FIL_NULL);
first.set_frag_page_no(get_page_no());
}
set_frag_entry_null();
/* Initialize the frag free list. */
plist_base_node_t fl = free_list();
fl.init();
ut_ad(fl.validate());
/* Initialize the used frag list. */
plist_base_node_t frag_lst = frag_list();
frag_lst.init();
ut_ad(frag_lst.validate());
byte *page = frame();
/* Add the available space as free frag to free list. */
frag_node_t frag(page, page + OFFSET_FRAGS_BEGIN, payload(), m_mtr);
fl.push_front(frag.m_node);
frag.set_frag_id_null();
ut_ad(fl.validate());
return (m_block);
}
/** Determine if the given length of data can fit into a fragment page.
@param[in] index the clust index into which LOB is inserted.
@param[in] data_size The length of data to operate.
@return true if data can fit into fragment page, false otherwise. */
bool z_frag_page_t::can_data_fit(dict_index_t *index, ulint data_size) {
ulint max_size = max_payload(index);
/* Look for a fragment page only if the data to be stored is less
than a quarter of the size of the fragment page. */
return (data_size < (max_size / 4));
}
buf_block_t *z_frag_node_page_t::alloc(z_first_page_t &first, bool bulk) {
ut_ad(m_block == nullptr);
page_no_t hint = FIL_NULL;
DBUG_EXECUTE_IF("innodb_lob_alloc_z_frag_node_page_failed",
return (nullptr););
m_block = alloc_lob_page(m_index, m_mtr, hint, bulk);
if (m_block == nullptr) {
return (nullptr);
}
set_page_type();
set_version_0();
flst_base_node_t *free_lst = first.free_frag_list();
init(free_lst);
/* Link the allocated index page to the first page. */
page_no_t page_no = first.get_frag_node_page_no();
set_next_page_no(page_no);
first.set_frag_node_page_no(get_page_no());
return (m_block);
}
frag_id_t z_frag_page_t::alloc_fragment(ulint size, z_frag_entry_t &entry) {
plist_base_node_t free_lst = free_list();
ut_ad(free_lst.get_len() > 0);
const ulint big_free_len = get_big_free_len();
ut_d(bool visited_big_frag = false;);
for (plist_node_t cur = free_lst.get_first_node(); !cur.is_null();
cur = cur.get_next_node()) {
frag_node_t frag(cur, m_mtr);
const ulint total_len = frag.get_total_len();
const ulint payload = frag.payload();
const ulint overhead = frag_node_t::overhead();
/* Get the biggest free fragment available. */
if (total_len != big_free_len) {
continue;
}
ut_d(visited_big_frag = true;);
bool exact_fit = false;
if (is_last_frag(frag)) {
/* This fragment gives space for the directory
entry. */
ulint extra = frag_node_t::SIZE_OF_PAGE_DIR_ENTRY;
if (payload == (size + extra)) {
exact_fit = true;
}
} else {
/* This fragment does not give space for the
directory entry. */
if (payload == size) {
exact_fit = true;
}
}
if (exact_fit) {
/* Allocate the fragment id. */
ulint frag_id = alloc_frag_id();
ut_ad(frag_id != FRAG_ID_NULL);
/* this is the requested fragment. */
free_lst.remove(cur);
insert_into_frag_list(frag);
frag.set_frag_id(frag_id);
set_nth_dir_entry(frag_id, frag.addr());
entry.update(*this);
return (frag_id);
} else if (payload >= (size + overhead + 1)) {
/* Break the current fragment into two. At least 1 byte
payload must be there in the other node. */
split_free_frag(frag, size);
free_lst.remove(frag.m_node);
insert_into_frag_list(frag);
/* Allocate the fragment id. */
ulint frag_id = alloc_frag_id();
ut_ad(frag_id != FRAG_ID_NULL);
frag.set_frag_id(frag_id);
set_nth_dir_entry(frag_id, frag.addr());
entry.update(*this);
return (frag_id);
}
}
ut_ad(visited_big_frag);
return (FRAG_ID_NULL);
}
/** Grow the frag directory by one entry.
@return the fragment identifier that was newly added. */
ulint z_frag_page_t::alloc_dir_entry() {
plist_base_node_t free_lst = free_list();
plist_node_t last = free_lst.get_last_node();
frag_node_t frag(last, m_mtr);
ulint len = frag.payload();
/* The last free fragment must be adjacent to the directory.
Then only it can give space to one slot. */
if (frag.end_ptr() != slots_end_ptr()) {
ut_d(ut_error);
ut_o(return (FRAG_ID_NULL));
}
if (len <= SIZE_OF_PAGE_DIR_ENTRY) {
ut_d(ut_error);
ut_o(return (FRAG_ID_NULL));
}
incr_n_dir_entries();
frag.decr_length_by_2();
return (init_last_dir_entry());
}
z_frag_entry_t z_frag_page_t::get_frag_entry_x() {
fil_addr_t node_loc = get_frag_entry_addr();
flst_node_t *node = addr2ptr_x(node_loc);
z_frag_entry_t entry(node, m_mtr);
ut_ad(entry.get_page_no() == get_page_no());
return (entry);
}
z_frag_entry_t z_frag_page_t::get_frag_entry_s() {
fil_addr_t node_loc = get_frag_entry_addr();
flst_node_t *node = addr2ptr_s(node_loc);
z_frag_entry_t entry(node, m_mtr);
ut_ad(entry.get_page_no() == get_page_no());
return (entry);
}
void z_frag_page_t::dealloc_with_entry(z_first_page_t &first,
mtr_t *alloc_mtr) {
ut_ad(get_n_frags() == 0);
z_frag_entry_t entry = get_frag_entry_x();
entry.purge(first.frag_list(), first.free_frag_list());
page_no_t top_frag_page = first.get_frag_page_no();
if (top_frag_page == 0) {
/* If the first page contains 0 in FIL_PAGE_PREV, then this LOB does not use
FIL_PAGE_PREV to point to the doubly-linked list of fragment pages. In
this case, don't touch FIL_PAGE_PREV. */
} else {
page_no_t next_frag_page = get_next_page_no();
page_no_t prev_frag_page = get_prev_page_no();
if (top_frag_page == get_page_no()) {
/* The fragment page pointed to by first LOB page is being deallocated. */
ut_ad(prev_frag_page == FIL_NULL);
first.set_frag_page_no(alloc_mtr, next_frag_page);
} else {
ut_ad(prev_frag_page != FIL_NULL);
}
/* The fragment pages are doubly linked via FIL_PAGE_NEXT and
FIL_PAGE_PREV. Update the links before deallocating a fragment page. */
if (next_frag_page != FIL_NULL) {
z_frag_page_t zfp_next(alloc_mtr, m_index);
zfp_next.load_x(next_frag_page);
zfp_next.set_page_prev(prev_frag_page);
}
if (prev_frag_page != FIL_NULL) {
z_frag_page_t zfp_prev(alloc_mtr, m_index);
zfp_prev.load_x(prev_frag_page);
zfp_prev.set_page_next(next_frag_page);
}
}
btr_page_free_low(m_index, m_block, ULINT_UNDEFINED, alloc_mtr);
m_block = nullptr;
}
std::ostream &z_frag_page_t::print_frags_in_order(std::ostream &out) const {
if (m_block == nullptr) {
return (out);
}
plist_base_node_t free_lst = free_list();
plist_base_node_t frag_lst = frag_list();
out << "[Free List: " << free_lst << "]" << std::endl;
out << "[Frag List: " << frag_lst << "]" << std::endl;
frag_node_t cur_free(free_lst.get_first_node(), m_mtr);
frag_node_t cur_frag(frag_lst.get_first_node(), m_mtr);
while (!cur_free.is_null() && !cur_frag.is_null()) {
if (cur_free.is_before(cur_frag)) {
out << "F: " << cur_free << std::endl;
cur_free = cur_free.get_next_node();
} else {
out << "U: " << cur_frag << std::endl;
cur_frag = cur_frag.get_next_node();
}
}
if (cur_free.is_null()) {
while (!cur_frag.is_null()) {
out << "U: " << cur_frag << std::endl;
cur_frag = cur_frag.get_next_node();
}
}
if (cur_frag.is_null()) {
while (!cur_free.is_null()) {
out << "F: " << cur_free << std::endl;
cur_free = cur_free.get_next_node();
}
}
return (out);
}
/** Get the total amount of stored data in this page. */
ulint z_frag_page_t::get_total_stored_data() const {
ulint len = 0;
ut_ad(m_block != nullptr);
plist_base_node_t frag_lst = frag_list();
for (plist_node_t cur = frag_lst.get_first_node(); !cur.is_null();
cur = cur.get_next_node()) {
frag_node_t frag(cur, m_mtr);
len += frag.payload();
}
return (len);
}
/** Get the total cumulative free space in this page. */
ulint z_frag_page_t::get_total_free_len() const {
ulint len = 0;
ut_ad(m_block != nullptr);
plist_base_node_t free_lst = free_list();
for (plist_node_t cur = free_lst.get_first_node(); !cur.is_null();
cur = cur.get_next_node()) {
frag_node_t frag(cur, m_mtr);
len += frag.payload();
}
return (len);
}
/** Get the big free space in this page. */
ulint z_frag_page_t::get_big_free_len() const {
ulint big = 0;
ut_ad(m_block != nullptr);
plist_base_node_t free_lst = free_list();
for (plist_node_t cur = free_lst.get_first_node(); !cur.is_null();
cur = cur.get_next_node()) {
frag_node_t frag(cur, m_mtr);
/* Use the total length (including the meta data overhead) of the
fragment. */
ulint total_free = frag.get_total_len();
if (total_free > big) {
big = total_free;
}
}
return (big);
}
/** Deallocate all the free slots from the end of the page directory. */
void z_frag_page_t::dealloc_frag_id() {
plist_base_node_t free_lst = free_list();
plist_node_t last = free_lst.get_last_node();
frag_node_t frag(last, m_mtr);
/* The last free fragment must be adjacent to the directory.
Then only it can take space from one slot. */
if (frag.end_ptr() != slots_end_ptr()) {
return;
}
ulint frag_id = get_n_dir_entries() - 1;
paddr_t addr = frag_id_to_addr(frag_id);
while (addr == 0) {
frag.incr_length_by_2();
decr_n_dir_entries();
if (frag_id == 0) {
break;
}
frag_id--;
addr = frag_id_to_addr(frag_id);
}
}
/** Insert a large object (LOB) into the system.
@param[in] ctx the B-tree context for this LOB operation.
@param[in] trx transaction doing the insertion.
@param[in,out] ref the LOB reference.
@param[in] field the LOB field.
@param[in] field_j the LOB field index in big rec vector.
@return DB_SUCCESS on success, error code on failure.*/
dberr_t insert(InsertContext *ctx, trx_t *trx, ref_t &ref,
big_rec_field_t *field, ulint field_j) {
const trx_id_t trxid = (trx == nullptr ? 0 : trx->id);
const undo_no_t undo_no = (trx == nullptr ? 0 : trx->undo_no - 1);
dberr_t ret = DB_SUCCESS;
ulint total_written = 0;
const byte *ptr = field->ptr();
ulint len = field->len;
mtr_t *mtr = ctx->get_mtr();
dict_index_t *index = ctx->index();
space_id_t space_id = dict_index_get_space(index);
page_size_t page_size(dict_table_page_size(index->table));
DBUG_TRACE;
if (ref.length() > 0) {
ref.set_length(0, mtr);
}
if (!ref_t::is_big(page_size, len)) {
/* The LOB is not big enough to build LOB index. Insert the LOB without an
LOB index. */
Inserter blob_writer(ctx);
return blob_writer.write_one_small_blob(field_j);
}
ut_ad(ref_t::is_big(page_size, len));
DBUG_LOG("lob", PrintBuffer(ptr, len));
ut_ad(ref.validate(ctx->get_mtr()));
first_page_t first(mtr, index);
buf_block_t *first_block = first.alloc(mtr, ctx->is_bulk());
if (first_block == nullptr) {
/* Allocation of the first page of LOB failed. */
return DB_OUT_OF_FILE_SPACE;
}
first.set_last_trx_id(trxid);
first.init_lob_version();
page_no_t first_page_no = first.get_page_no();
if (dict_index_is_online_ddl(index)) {
row_log_table_blob_alloc(index, first_page_no);
}
page_id_t first_page_id(space_id, first_page_no);
flst_base_node_t *index_list = first.index_list();
ulint to_write = first.write(trxid, ptr, len);
total_written += to_write;
ulint remaining = len;
{
/* Insert an index entry in LOB index. */
flst_node_t *node = first.alloc_index_entry(ctx->is_bulk());
/* Here the first index entry is being allocated. Since this will be
allocated in the first page of LOB, it cannot be nullptr. */
ut_ad(node != nullptr);
index_entry_t entry(node, mtr, index);
entry.set_versions_null();
entry.set_trx_id(trxid);
entry.set_trx_id_modifier(trxid);
entry.set_trx_undo_no(undo_no);
entry.set_trx_undo_no_modifier(undo_no);
entry.set_page_no(first.get_page_no());
entry.set_data_len(to_write);
entry.set_lob_version(1);
flst_add_last(index_list, node, mtr);
first.set_trx_id(trxid);
first.set_data_len(to_write);
}
ulint nth_blob_page = 0;
const ulint commit_freq = 4;
while (remaining > 0) {
data_page_t data_page(mtr, index);
buf_block_t *block = data_page.alloc(mtr, ctx->is_bulk());
if (block == nullptr) {
ret = DB_OUT_OF_FILE_SPACE;
break;
}
to_write = data_page.write(ptr, remaining);
total_written += to_write;
data_page.set_trx_id(trxid);
/* Allocate a new index entry */
flst_node_t *node = first.alloc_index_entry(ctx->is_bulk());
if (node == nullptr) {
ret = DB_OUT_OF_FILE_SPACE;
break;
}
index_entry_t entry(node, mtr, index);
entry.set_versions_null();
entry.set_trx_id(trxid);
entry.set_trx_id_modifier(trxid);
entry.set_trx_undo_no(undo_no);
entry.set_trx_undo_no_modifier(undo_no);
entry.set_page_no(data_page.get_page_no());
entry.set_data_len(to_write);
entry.set_lob_version(1);
entry.push_back(first.index_list());
ut_ad(!entry.get_self().is_equal(entry.get_prev()));
ut_ad(!entry.get_self().is_equal(entry.get_next()));
page_type_t type = fil_page_get_type(block->frame);
ut_a(type == FIL_PAGE_TYPE_LOB_DATA);
if (++nth_blob_page % commit_freq == 0) {
ctx->check_redolog();
ref.set_ref(ctx->get_field_ref(field->field_no));
first.load_x(first_page_id, page_size);
}
}
if (ret == DB_SUCCESS) {
ref.update(space_id, first_page_no, 1, mtr);
ref.set_length(total_written, mtr);
}
DBUG_EXECUTE_IF("innodb_lob_print",
print(trx, index, std::cerr, ref, false););
DBUG_EXECUTE_IF("btr_store_big_rec_extern", ret = DB_OUT_OF_FILE_SPACE;);
return ret;
}
/** Fetch a large object (LOB) from the system.
@param[in] ctx the read context information.
@param[in] ref the LOB reference identifying the LOB.
@param[in] offset read the LOB from the given offset.
@param[in] len the length of LOB data that needs to be fetched.
@param[out] buf the output buffer (owned by caller) of minimum len bytes.
@return the amount of data (in bytes) that was actually read. */
ulint read(ReadContext *ctx, ref_t ref, ulint offset, ulint len, byte *buf) {
DBUG_TRACE;
ut_ad(offset == 0);
const uint32_t lob_version = ref.version();
ref_mem_t ref_mem;
ref.parse(ref_mem);
#ifdef LOB_DEBUG
std::cout << "thread=" << std::this_thread::get_id()
<< ", lob::read(): table=" << ctx->index()->table->name
<< ", ref=" << ref << std::endl;
#endif /* LOB_DEBUG */
/* Cache of s-latched blocks of LOB index pages.*/
BlockCache cached_blocks;
ut_ad(len > 0);
/* Obtain length of LOB available in clustered index.*/
const ulint avail_lob = ref.length();
if (avail_lob == 0) {
return 0;
}
if (ref.is_being_modified()) {
/* This should happen only for READ UNCOMMITTED transactions. */
ut_ad(ctx->assert_read_uncommitted());
return 0;
}
ut_ad(ctx->m_index->is_clustered());
ulint total_read = 0;
ulint actual_read = 0;
page_no_t page_no = ref.page_no();
const page_id_t page_id(ctx->m_space_id, page_no);
mtr_t mtr;
mtr_start(&mtr);
first_page_t first_page(&mtr, ctx->m_index);
first_page.load_s(page_id, ctx->m_page_size);
page_type_t page_type = first_page.get_page_type();
if (page_type == FIL_PAGE_TYPE_BLOB || page_type == FIL_PAGE_SDI_BLOB) {
mtr_commit(&mtr);
Reader reader(*ctx);
ulint fetch_len = reader.fetch();
return fetch_len;
}
ut_ad(page_type == FIL_PAGE_TYPE_LOB_FIRST);
cached_blocks.insert(
std::pair<page_no_t, buf_block_t *>(page_no, first_page.get_block()));
ctx->m_lob_version = first_page.get_lob_version();
page_no_t first_page_no = first_page.get_page_no();
flst_base_node_t *base_node = first_page.index_list();
fil_addr_t node_loc = flst_get_first(base_node, &mtr);
flst_node_t *node = nullptr;
/* Total bytes that have been skipped in this LOB */
ulint skipped = 0;
index_entry_t cur_entry(&mtr, ctx->m_index);
index_entry_t old_version(&mtr, ctx->m_index);
index_entry_mem_t entry_mem;
ut_ad(offset >= skipped);
ulint page_offset = offset - skipped;
ulint want = len;
byte *ptr = buf;
/* Use a different mtr for data pages. */
mtr_t data_mtr;
mtr_start(&data_mtr);
const ulint commit_freq = 10;
ulint data_pages_count = 0;
while (!fil_addr_is_null(node_loc) && want > 0) {
old_version.reset(nullptr);
node = first_page.addr2ptr_s_cache(cached_blocks, node_loc);
cur_entry.reset(node);
cur_entry.read(entry_mem);
const uint32_t entry_lob_version = cur_entry.get_lob_version();
if (entry_lob_version > lob_version) {
flst_base_node_t *ver_list = cur_entry.get_versions_list();
/* Look at older versions. */
fil_addr_t node_versions = flst_get_first(ver_list, &mtr);
while (!fil_addr_is_null(node_versions)) {
flst_node_t *node_old_version =
first_page.addr2ptr_s_cache(cached_blocks, node_versions);
old_version.reset(node_old_version);
old_version.read(entry_mem);
const uint32_t old_lob_version = old_version.get_lob_version();
if (old_lob_version <= lob_version) {
/* The current trx can see this
entry. */
break;
}
node_versions = old_version.get_next();
old_version.reset(nullptr);
}
}
page_no_t read_from_page_no = FIL_NULL;
if (old_version.is_null()) {
read_from_page_no = cur_entry.get_page_no();
} else {
read_from_page_no = old_version.get_page_no();
}
actual_read = 0;
if (read_from_page_no != FIL_NULL) {
if (read_from_page_no == first_page_no) {
actual_read = first_page.read(page_offset, ptr, want);
ptr += actual_read;
want -= actual_read;
} else {
buf_block_t *block = buf_page_get(
page_id_t(ctx->m_space_id, read_from_page_no), ctx->m_page_size,
RW_S_LATCH, UT_LOCATION_HERE, &data_mtr);
data_page_t page(block, &data_mtr);
actual_read = page.read(page_offset, ptr, want);
ptr += actual_read;
want -= actual_read;
page_type_t type = page.get_page_type();
ut_a(type == FIL_PAGE_TYPE_LOB_DATA);
if (++data_pages_count % commit_freq == 0) {
mtr_commit(&data_mtr);
mtr_start(&data_mtr);
}
}
}
total_read += actual_read;
page_offset = 0;
node_loc = cur_entry.get_next();
}
/* Assert that we have read what has been requested or what is
available. */
ut_ad(total_read == len || total_read == avail_lob);
ut_ad(total_read <= avail_lob);
mtr_commit(&mtr);
mtr_commit(&data_mtr);
return total_read;
}
buf_block_t *z_index_page_t::alloc(z_first_page_t &first, bool bulk) {
ut_ad(m_block == nullptr);
page_no_t hint = FIL_NULL;
/* For testing purposes, pretend that the LOB page allocation failed.*/
DBUG_EXECUTE_IF("innodb_lob_alloc_z_index_page_failed", return (nullptr););
m_block = alloc_lob_page(m_index, m_mtr, hint, bulk);
if (m_block == nullptr) {
return (nullptr);
}
set_page_type(m_mtr);
set_version_0();
flst_base_node_t *free_lst = first.free_list();
init(free_lst, m_mtr);
/* Link the allocated index page to the first page. */
page_no_t page_no = first.get_index_page_no();
set_next_page_no(page_no);
first.set_index_page_no(get_page_no());
return (m_block);
}
/** Allocate one data page.
@param[in] hint hint page number for allocation.
@param[in] bulk true if bulk operation (OPCODE_INSERT_BULK)
false otherwise.
@return the allocated buffer block. */
buf_block_t *z_data_page_t::alloc(page_no_t hint, bool bulk) {
ut_ad(m_block == nullptr);
/* For testing purposes, pretend that the LOB page allocation failed.*/
DBUG_EXECUTE_IF("innodb_lob_alloc_z_data_page_failed", return (nullptr););
m_block = alloc_lob_page(m_index, m_mtr, hint, bulk);
if (m_block == nullptr) {
return (nullptr);
}
init();
return (m_block);
}
void z_index_page_t::init(flst_base_node_t *free_lst, mtr_t *mtr) {
ulint n = get_n_index_entries();
for (ulint i = 0; i < n; ++i) {
byte *ptr = frame() + LOB_PAGE_DATA;
ptr += (i * z_index_entry_t::SIZE);
z_index_entry_t entry(ptr, mtr);
entry.init();
entry.push_back(free_lst);
}
}
ulint z_index_page_t::get_n_index_entries() const {
return (payload() / z_index_entry_t::SIZE);
}
ulint node_page_t::node_count() {
return (max_space_available() / index_entry_t::SIZE);
}
void node_page_t::import(trx_id_t trx_id) {
ulint nc = node_count();
byte *cur = nodes_begin();
/* Update the trx id */
for (ulint i = 0; i < nc; ++i) {
index_entry_t entry(cur, m_mtr, m_index);
entry.set_trx_id_no_redo(trx_id);
entry.set_trx_id_modifier_no_redo(trx_id);
cur += index_entry_t::SIZE;
}
}
/** Print information about the given LOB.
@param[in] trx the current transaction.
@param[in] index the clust index that contains the LOB.
@param[in] out the output stream into which LOB info is printed.
@param[in] ref the LOB reference
@param[in] fatal if true assert at end of function. */
void print(trx_t *trx, dict_index_t *index, std::ostream &out, ref_t ref,
bool fatal) {
trx_id_t trxid = (trx == nullptr ? 0 : trx->id);
out << "[lob::print: trx_id=" << trxid << ", ";
mtr_t mtr;
/* Print the lob reference object. */
space_id_t space_id = ref.space_id();
page_no_t page_no = ref.page_no();
ulint avail_lob = ref.length();
out << "avail_lob=" << avail_lob << ", ";
out << ref;
const page_id_t first_page_id(space_id, page_no);
const page_size_t page_size = dict_table_page_size(index->table);
/* Load the first page of LOB */
mtr_start(&mtr);
first_page_t first_page(&mtr, index);
first_page.load_x(first_page_id, page_size);
first_page.print_index_entries(out);
mtr_commit(&mtr);
out << "]";
if (fatal) {
ut_error;
}
}
void z_index_page_t::import(trx_id_t trx_id) {
ulint n = get_n_index_entries();
for (ulint i = 0; i < n; ++i) {
byte *ptr = frame() + LOB_PAGE_DATA;
ptr += (i * z_index_entry_t::SIZE);
z_index_entry_t entry(ptr);
entry.set_trx_id_no_redo(trx_id);
entry.set_trx_id_modifier_no_redo(trx_id);
}
}
} // namespace lob
|