/
row0umod.cc
1330 lines (1102 loc) · 43.5 KB
/
row0umod.cc
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
/*****************************************************************************
Copyright (c) 1997, 2022, 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 also distributed 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
included with MySQL.
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
*****************************************************************************/
/** @file row/row0umod.cc
Undo modify of a row
Created 2/27/1997 Heikki Tuuri
*******************************************************/
#include <stddef.h>
#include "btr0btr.h"
#include "dict0boot.h"
#include "dict0dd.h"
#include "dict0dict.h"
#include "ha_prototypes.h"
#include "log0chkp.h"
#include "mach0data.h"
#include "que0que.h"
#include "row0log.h"
#include "row0row.h"
#include "row0umod.h"
#include "row0undo.h"
#include "row0upd.h"
#include "row0vers.h"
#include "trx0rec.h"
#include "trx0roll.h"
#include "trx0trx.h"
#include "trx0undo.h"
#include "current_thd.h"
#include "debug_sync.h"
/* Considerations on undoing a modify operation.
(1) Undoing a delete marking: all index records should be found. Some of
them may have delete mark already false, if the delete mark operation was
stopped underway, or if the undo operation ended prematurely because of a
system crash.
(2) Undoing an update of a delete unmarked record: the newer version of
an updated secondary index entry should be removed if no prior version
of the clustered index record requires its existence. Otherwise, it should
be delete marked.
(3) Undoing an update of a delete marked record. In this kind of update a
delete marked clustered index record was delete unmarked and possibly also
some of its fields were changed. Now, it is possible that the delete marked
version has become obsolete at the time the undo is started. */
/*************************************************************************
IMPORTANT NOTE: Any operation that generates redo MUST check that there
is enough space in the redo log before for that operation. This is
done by calling log_free_check(). The reason for checking the
availability of the redo log space before the start of the operation is
that we MUST not hold any synchronization objects when performing the
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. */
/** Undoes a modify in a clustered index record.
@return DB_SUCCESS, DB_FAIL, or error code: we may run out of file space */
[[nodiscard]] static dberr_t row_undo_mod_clust_low(
undo_node_t *node, /*!< in: row undo node */
ulint **offsets, /*!< out: rec_get_offsets() on the record */
mem_heap_t **offsets_heap,
/*!< in/out: memory heap that can be emptied */
mem_heap_t *heap, /*!< in/out: memory heap */
const dtuple_t **rebuilt_old_pk,
/*!< out: row_log_table_get_pk()
before the update, or NULL if
the table is not being rebuilt online or
the PRIMARY KEY definition does not change */
byte *sys, /*!< out: DB_TRX_ID, DB_ROLL_PTR
for row_log_table_delete() */
que_thr_t *thr, /*!< in: query thread */
mtr_t *mtr, /*!< in: mtr; must be committed before
latching any further pages */
ulint mode) /*!< in: BTR_MODIFY_LEAF or BTR_MODIFY_TREE */
{
DBUG_TRACE;
DBUG_LOG("undo", "undo_no=" << node->undo_no);
btr_pcur_t *pcur;
btr_cur_t *btr_cur;
dberr_t err;
trx_t *trx = thr_get_trx(thr);
pcur = &node->pcur;
btr_cur = pcur->get_btr_cur();
#ifdef UNIV_DEBUG
auto success =
#endif /* UNIV_DEBUG */
pcur->restore_position(mode, mtr, UT_LOCATION_HERE);
ut_ad(success);
ut_ad(rec_get_trx_id(btr_cur_get_rec(btr_cur), btr_cur->index) ==
thr_get_trx(thr)->id);
if (mode != BTR_MODIFY_LEAF && dict_index_is_online_ddl(btr_cur->index)) {
*rebuilt_old_pk = row_log_table_get_pk(btr_cur_get_rec(btr_cur),
btr_cur->index, nullptr, sys, &heap);
} else {
*rebuilt_old_pk = nullptr;
}
/* Update would release the implicit lock. Must convert to
explicit lock before applying update undo.*/
row_convert_impl_to_expl_if_needed(btr_cur, node);
node->update->table = node->table;
if (mode != BTR_MODIFY_TREE) {
ut_ad((mode & ~BTR_ALREADY_S_LATCHED) == BTR_MODIFY_LEAF);
err = btr_cur_optimistic_update(BTR_NO_LOCKING_FLAG | BTR_NO_UNDO_LOG_FLAG |
BTR_KEEP_SYS_FLAG | BTR_KEEP_POS_FLAG,
btr_cur, offsets, offsets_heap,
node->update, node->cmpl_info, thr,
thr_get_trx(thr)->id, mtr);
} else {
big_rec_t *dummy_big_rec;
err = btr_cur_pessimistic_update(
BTR_NO_LOCKING_FLAG | BTR_NO_UNDO_LOG_FLAG | BTR_KEEP_SYS_FLAG |
BTR_KEEP_POS_FLAG,
btr_cur, offsets, offsets_heap, heap, &dummy_big_rec, node->update,
node->cmpl_info, thr, thr_get_trx(thr)->id, node->undo_no, mtr, pcur);
const rec_t *rec = btr_cur_get_rec(btr_cur);
ut_a(!dummy_big_rec || materialize_instant_default(btr_cur->index, rec));
if (dummy_big_rec) {
ut_a(err == DB_SUCCESS);
DEBUG_SYNC_C("before_row_upd_extern");
err = lob::btr_store_big_rec_extern_fields(trx, pcur, node->update,
*offsets, dummy_big_rec, mtr,
lob::OPCODE_UPDATE);
DEBUG_SYNC_C("after_row_upd_extern");
mem_heap_free(dummy_big_rec->heap);
}
}
return err;
}
/** Purges a clustered index record after undo if possible.
This is attempted when the record was inserted by updating a
delete-marked record and there no longer exist transactions
that would see the delete-marked record.
@return DB_SUCCESS, DB_FAIL, or error code: we may run out of file space
*/
[[nodiscard]] static dberr_t row_undo_mod_remove_clust_low(
undo_node_t *node, /*!< in: row undo node */
mtr_t *mtr, /*!< in/out: mini-transaction */
ulint mode) /*!< in: BTR_MODIFY_LEAF or BTR_MODIFY_TREE */
{
btr_cur_t *btr_cur;
dberr_t err;
ulint trx_id_offset;
ut_ad(node->rec_type == TRX_UNDO_UPD_DEL_REC);
/* Find out if the record has been purged already
or if we can remove it. */
if (!node->pcur.restore_position(mode, mtr, UT_LOCATION_HERE) ||
row_vers_must_preserve_del_marked(node->new_trx_id, node->table->name,
mtr)) {
return (DB_SUCCESS);
}
btr_cur = node->pcur.get_btr_cur();
trx_id_offset = btr_cur->index->trx_id_offset;
if (!trx_id_offset) {
mem_heap_t *heap = nullptr;
ulint trx_id_col;
const ulint *offsets;
ulint len;
trx_id_col = btr_cur->index->get_sys_col_pos(DATA_TRX_ID);
ut_ad(trx_id_col > 0);
ut_ad(trx_id_col != ULINT_UNDEFINED);
offsets = rec_get_offsets(btr_cur_get_rec(btr_cur), btr_cur->index, nullptr,
trx_id_col + 1, UT_LOCATION_HERE, &heap);
/* nullptr for index as trx_id_col is physical here */
trx_id_offset = rec_get_nth_field_offs(nullptr, offsets, trx_id_col, &len);
ut_ad(len == DATA_TRX_ID_LEN);
mem_heap_free(heap);
}
if (trx_read_trx_id(btr_cur_get_rec(btr_cur) + trx_id_offset) !=
node->new_trx_id) {
/* The record must have been purged and then replaced
with a different one. */
return (DB_SUCCESS);
}
/* We are about to remove an old, delete-marked version of the
record that may have been delete-marked by a different transaction
than the rolling-back one. */
ut_ad(rec_get_deleted_flag(btr_cur_get_rec(btr_cur),
dict_table_is_comp(node->table)));
if (mode == BTR_MODIFY_LEAF) {
err = btr_cur_optimistic_delete(btr_cur, 0, mtr) ? DB_SUCCESS : DB_FAIL;
} else {
ut_ad(mode == (BTR_MODIFY_TREE | BTR_LATCH_FOR_DELETE));
/* This operation is analogous to purge, we can free also
inherited externally stored fields.
We can also assume that the record was complete
(including BLOBs), because it had been delete-marked
after it had been completely inserted. Therefore, we
are passing rollback=false, just like purge does. */
btr_cur_pessimistic_delete(&err, false, btr_cur, 0, false, node->trx->id,
node->undo_no, node->rec_type, mtr, &node->pcur,
nullptr);
/* The delete operation may fail if we have little
file space left: TODO: easiest to crash the database
and restart with more file space */
}
return (err);
}
/** Undoes a modify in a clustered index record. Sets also the node state for
the next round of undo.
@return DB_SUCCESS or error code: we may run out of file space */
[[nodiscard]] static dberr_t row_undo_mod_clust(
undo_node_t *node, /*!< in: row undo node */
que_thr_t *thr) /*!< in: query thread */
{
btr_pcur_t *pcur;
mtr_t mtr;
dberr_t err;
dict_index_t *index;
bool online;
ut_ad(thr_get_trx(thr) == node->trx);
ut_ad(node->trx->in_rollback);
log_free_check();
pcur = &node->pcur;
index = pcur->get_btr_cur()->index;
mtr_start(&mtr);
dict_disable_redo_if_temporary(index->table, &mtr);
online = dict_index_is_online_ddl(index);
DEBUG_SYNC(current_thd, "row_undo_mod_clust");
if (online) {
mtr_s_lock(dict_index_get_lock(index), &mtr, UT_LOCATION_HERE);
}
mem_heap_t *heap = mem_heap_create(1024, UT_LOCATION_HERE);
mem_heap_t *offsets_heap = nullptr;
ulint *offsets = nullptr;
const dtuple_t *rebuilt_old_pk;
byte sys[DATA_TRX_ID_LEN + DATA_ROLL_PTR_LEN];
/* Try optimistic processing of the record, keeping changes within
the index page */
err = row_undo_mod_clust_low(
node, &offsets, &offsets_heap, heap, &rebuilt_old_pk, sys, thr, &mtr,
online ? BTR_MODIFY_LEAF | BTR_ALREADY_S_LATCHED : BTR_MODIFY_LEAF);
if (err != DB_SUCCESS) {
pcur->commit_specify_mtr(&mtr);
/* We may have to modify tree structure: do a pessimistic
descent down the index tree */
mtr_start(&mtr);
dict_disable_redo_if_temporary(index->table, &mtr);
err = row_undo_mod_clust_low(node, &offsets, &offsets_heap, heap,
&rebuilt_old_pk, sys, thr, &mtr,
BTR_MODIFY_TREE);
ut_ad(err == DB_SUCCESS || err == DB_OUT_OF_FILE_SPACE);
}
/* Online rebuild cannot be initiated while we are holding
dict_operation_lock and index->lock. (It can be aborted.) */
ut_ad(online || !dict_index_is_online_ddl(index));
if (err == DB_SUCCESS && online) {
ut_ad(rw_lock_own_flagged(
&index->lock, RW_LOCK_FLAG_S | RW_LOCK_FLAG_X | RW_LOCK_FLAG_SX));
switch (node->rec_type) {
case TRX_UNDO_DEL_MARK_REC:
row_log_table_insert(pcur->get_rec(), node->row, index, offsets);
break;
case TRX_UNDO_UPD_EXIST_REC:
row_log_table_update(pcur->get_rec(), index, offsets, rebuilt_old_pk,
node->undo_row, node->row);
break;
case TRX_UNDO_UPD_DEL_REC:
row_log_table_delete(pcur->get_rec(), node->row, index, offsets, sys);
break;
default:
ut_d(ut_error);
ut_o(break);
}
}
ut_ad(rec_get_trx_id(pcur->get_rec(), index) == node->new_trx_id);
pcur->commit_specify_mtr(&mtr);
DEBUG_SYNC_C("ib_undo_mod_before_remove_clust");
if (err == DB_SUCCESS && node->rec_type == TRX_UNDO_UPD_DEL_REC) {
mtr_start(&mtr);
dict_disable_redo_if_temporary(index->table, &mtr);
/* It is not necessary to call row_log_table,
because the record is delete-marked and would thus
be omitted from the rebuilt copy of the table. */
err = row_undo_mod_remove_clust_low(node, &mtr, BTR_MODIFY_LEAF);
if (err != DB_SUCCESS) {
pcur->commit_specify_mtr(&mtr);
/* We may have to modify tree structure: do a
pessimistic descent down the index tree */
mtr_start(&mtr);
dict_disable_redo_if_temporary(index->table, &mtr);
err = row_undo_mod_remove_clust_low(
node, &mtr, BTR_MODIFY_TREE | BTR_LATCH_FOR_DELETE);
ut_ad(err == DB_SUCCESS || err == DB_OUT_OF_FILE_SPACE);
}
pcur->commit_specify_mtr(&mtr);
}
node->state = UNDO_NODE_FETCH_NEXT;
if (offsets_heap) {
mem_heap_free(offsets_heap);
}
mem_heap_free(heap);
return (err);
}
/** Delete marks or removes a secondary index entry if found.
@return DB_SUCCESS, DB_FAIL, or DB_OUT_OF_FILE_SPACE */
[[nodiscard]] static dberr_t row_undo_mod_del_mark_or_remove_sec_low(
undo_node_t *node, /*!< in: row undo node */
que_thr_t *thr, /*!< in: query thread */
dict_index_t *index, /*!< in: index */
dtuple_t *entry, /*!< in: index entry */
ulint mode) /*!< in: latch mode BTR_MODIFY_LEAF or
BTR_MODIFY_TREE */
{
btr_pcur_t pcur;
btr_cur_t *btr_cur;
dberr_t err = DB_SUCCESS;
mtr_t mtr;
mtr_t mtr_vers;
row_search_result search_result;
bool modify_leaf = false;
ulint rec_deleted;
bool success;
bool old_has;
log_free_check();
mtr_start(&mtr);
dict_disable_redo_if_temporary(index->table, &mtr);
if (mode == BTR_MODIFY_LEAF) {
modify_leaf = true;
}
if (!index->is_committed()) {
/* The index->online_status may change if the index is
or was being created online, but not committed yet. It
is protected by index->lock. */
if (mode == BTR_MODIFY_LEAF) {
mode = BTR_MODIFY_LEAF | BTR_ALREADY_S_LATCHED;
mtr_s_lock(dict_index_get_lock(index), &mtr, UT_LOCATION_HERE);
} else {
ut_ad(mode == (BTR_MODIFY_TREE | BTR_LATCH_FOR_DELETE));
mtr_sx_lock(dict_index_get_lock(index), &mtr, UT_LOCATION_HERE);
}
if (row_log_online_op_try(index, entry, 0)) {
goto func_exit_no_pcur;
}
} else {
/* For secondary indexes,
index->online_status==ONLINE_INDEX_COMPLETE if
index->is_committed(). */
ut_ad(!dict_index_is_online_ddl(index));
}
btr_cur = pcur.get_btr_cur();
if (dict_index_is_spatial(index)) {
if (mode & BTR_MODIFY_LEAF) {
btr_cur->thr = thr;
mode |= BTR_RTREE_DELETE_MARK;
}
mode |= BTR_RTREE_UNDO_INS;
}
search_result = row_search_index_entry(index, entry, mode, &pcur, &mtr);
switch (UNIV_EXPECT(search_result, ROW_FOUND)) {
case ROW_NOT_FOUND:
/* In crash recovery, the secondary index record may
be missing if the UPDATE did not have time to insert
the secondary index records before the crash. When we
are undoing that UPDATE in crash recovery, the record
may be missing.
In normal processing, if an update ends in a deadlock
before it has inserted all updated secondary index
records, then the undo will not find those records. */
goto func_exit;
case ROW_FOUND:
break;
case ROW_BUFFERED:
case ROW_NOT_DELETED_REF:
/* These are invalid outcomes, because the mode passed
to row_search_index_entry() did not include any of the
flags BTR_INSERT, BTR_DELETE, or BTR_DELETE_MARK. */
ut_error;
}
/* If the key is delete marked then the statement could not modify the
key yet and the transaction has no implicit lock on it. We must convert
to explicit lock if and only if we are the transaction which has implicit
lock on it.Note that it is still ok to purge the delete mark key if it
is purgeable.*/
rec_deleted =
rec_get_deleted_flag(pcur.get_rec(), dict_table_is_comp(index->table));
if (rec_deleted == 0) {
row_convert_impl_to_expl_if_needed(btr_cur, node);
}
/* We should remove the index record if no prior version of the row,
which cannot be purged yet, requires its existence. If some requires,
we should delete mark the record. */
mtr_start(&mtr_vers);
success =
node->pcur.restore_position(BTR_SEARCH_LEAF, &mtr_vers, UT_LOCATION_HERE);
ut_a(success);
old_has = row_vers_old_has_index_entry(false, node->pcur.get_rec(), &mtr_vers,
index, entry, 0, 0);
if (old_has) {
err = btr_cur_del_mark_set_sec_rec(BTR_NO_LOCKING_FLAG, btr_cur, true, thr,
&mtr);
ut_ad(err == DB_SUCCESS);
} else {
/* Remove the index record */
if (dict_index_is_spatial(index)) {
if (rec_deleted) {
ib::error(ER_IB_MSG_1038) << "Record found in index " << index->name
<< " is deleted marked"
" on rollback update.";
}
}
if (modify_leaf) {
success = btr_cur_optimistic_delete(btr_cur, 0, &mtr);
if (success) {
err = DB_SUCCESS;
} else {
err = DB_FAIL;
}
} else {
/* Passing rollback=false,
because we are deleting a secondary index record:
the distinction only matters when deleting a
record that contains externally stored columns. */
ut_ad(!index->is_clustered());
btr_cur_pessimistic_delete(&err, false, btr_cur, 0, false, node->trx->id,
node->undo_no, node->rec_type, &mtr,
&node->pcur, nullptr);
/* The delete operation may fail if we have little
file space left: TODO: easiest to crash the database
and restart with more file space */
}
}
node->pcur.commit_specify_mtr(&mtr_vers);
func_exit:
pcur.close();
func_exit_no_pcur:
mtr_commit(&mtr);
return (err);
}
/** Delete marks or removes a secondary index entry if found.
NOTE that if we updated the fields of a delete-marked secondary index record
so that alphabetically they stayed the same, e.g., 'abc' -> 'aBc', we cannot
return to the original values because we do not know them. But this should
not cause problems because in row0sel.cc, in queries we always retrieve the
clustered index record or an earlier version of it, if the secondary index
record through which we do the search is delete-marked.
@return DB_SUCCESS or DB_OUT_OF_FILE_SPACE */
[[nodiscard]] static dberr_t row_undo_mod_del_mark_or_remove_sec(
undo_node_t *node, /*!< in: row undo node */
que_thr_t *thr, /*!< in: query thread */
dict_index_t *index, /*!< in: index */
dtuple_t *entry) /*!< in: index entry */
{
dberr_t err;
err = row_undo_mod_del_mark_or_remove_sec_low(node, thr, index, entry,
BTR_MODIFY_LEAF);
if (err == DB_SUCCESS) {
return (err);
}
err = row_undo_mod_del_mark_or_remove_sec_low(
node, thr, index, entry, BTR_MODIFY_TREE | BTR_LATCH_FOR_DELETE);
return (err);
}
/** Delete unmarks a secondary index entry which must be found. It might not be
delete-marked at the moment, but it does not harm to unmark it anyway. We also
need to update the fields of the secondary index record if we updated its
fields but alphabetically they stayed the same, e.g., 'abc' -> 'aBc'.
@retval DB_SUCCESS on success
@retval DB_FAIL if BTR_MODIFY_TREE should be tried
@retval DB_OUT_OF_FILE_SPACE when running out of tablespace
@retval DB_DUPLICATE_KEY if the value was missing
and an insert would lead to a duplicate exists */
[[nodiscard]] static dberr_t row_undo_mod_del_unmark_sec_and_undo_update(
ulint mode, /*!< in: search mode: BTR_MODIFY_LEAF or
BTR_MODIFY_TREE */
que_thr_t *thr, /*!< in: query thread */
dict_index_t *index, /*!< in: index */
dtuple_t *entry, /*!< in: index entry */
undo_no_t undo_no)
/*!< in: undo number up to which to rollback.*/
{
btr_pcur_t pcur;
btr_cur_t *btr_cur = pcur.get_btr_cur();
upd_t *update;
dberr_t err = DB_SUCCESS;
big_rec_t *dummy_big_rec;
mtr_t mtr;
trx_t *trx = thr_get_trx(thr);
const ulint flags = BTR_KEEP_SYS_FLAG | BTR_NO_LOCKING_FLAG;
row_search_result search_result;
ulint orig_mode = mode;
ut_ad(trx->id != 0);
/* FIXME: Currently we do a 2-pass search for the undo due to
avoid undel-mark a wrong rec in rolling back in partial update.
Later, we could log some info in secondary index updates to avoid
this. */
if (dict_index_is_spatial(index)) {
ut_ad(mode & BTR_MODIFY_LEAF);
mode |= BTR_RTREE_DELETE_MARK;
}
try_again:
log_free_check();
mtr_start(&mtr);
dict_disable_redo_if_temporary(index->table, &mtr);
if (!index->is_committed()) {
/* The index->online_status may change if the index is
or was being created online, but not committed yet. It
is protected by index->lock. */
if (mode == BTR_MODIFY_LEAF) {
mode = BTR_MODIFY_LEAF | BTR_ALREADY_S_LATCHED;
mtr_s_lock(dict_index_get_lock(index), &mtr, UT_LOCATION_HERE);
} else {
ut_ad(mode == BTR_MODIFY_TREE);
mtr_sx_lock(dict_index_get_lock(index), &mtr, UT_LOCATION_HERE);
}
if (row_log_online_op_try(index, entry, trx->id)) {
goto func_exit_no_pcur;
}
} else {
/* For secondary indexes,
index->online_status==ONLINE_INDEX_COMPLETE if
index->is_committed(). */
ut_ad(!dict_index_is_online_ddl(index));
}
btr_cur->thr = thr;
search_result = row_search_index_entry(index, entry, mode, &pcur, &mtr);
switch (search_result) {
mem_heap_t *heap;
mem_heap_t *offsets_heap;
ulint *offsets;
case ROW_BUFFERED:
case ROW_NOT_DELETED_REF:
/* These are invalid outcomes, because the mode passed
to row_search_index_entry() did not include any of the
flags BTR_INSERT, BTR_DELETE, or BTR_DELETE_MARK. */
ut_error;
case ROW_NOT_FOUND:
/* For spatial index, if first search didn't find an
undel-marked rec, try to find a del-marked rec. */
if (dict_index_is_spatial(index) && btr_cur->rtr_info->fd_del) {
if (mode != orig_mode) {
mode = orig_mode;
pcur.close();
mtr_commit(&mtr);
goto try_again;
}
}
if (index->is_committed()) {
/* During online secondary index creation, it
is possible that MySQL is waiting for a
meta-data lock upgrade before invoking
ha_innobase::commit_inplace_alter_table()
while this ROLLBACK is executing. InnoDB has
finished building the index, but it does not
yet exist in MySQL. In this case, we suppress
the printout to the error log. */
ib::warn(ER_IB_MSG_1039)
<< "Record in index " << index->name << " of table "
<< index->table->name
<< " was not found on rollback, trying to"
" insert: "
<< *entry
<< " at: " << rec_index_print(btr_cur_get_rec(btr_cur), index);
}
if (btr_cur->up_match >= dict_index_get_n_unique(index) ||
btr_cur->low_match >= dict_index_get_n_unique(index)) {
if (index->is_committed()) {
ib::warn(ER_IB_MSG_1040) << "Record in index " << index->name
<< " was not found on rollback, and"
" a duplicate exists";
}
err = DB_DUPLICATE_KEY;
break;
}
/* Insert the missing record that we were trying to
delete-unmark. */
big_rec_t *big_rec;
rec_t *insert_rec;
offsets = nullptr;
offsets_heap = nullptr;
err = btr_cur_optimistic_insert(flags, btr_cur, &offsets, &offsets_heap,
entry, &insert_rec, &big_rec, thr, &mtr);
ut_ad(!big_rec);
if (err == DB_FAIL && mode == BTR_MODIFY_TREE) {
err =
btr_cur_pessimistic_insert(flags, btr_cur, &offsets, &offsets_heap,
entry, &insert_rec, &big_rec, thr, &mtr);
/* There are no off-page columns in
secondary indexes. */
ut_ad(!big_rec);
}
if (err == DB_SUCCESS) {
page_update_max_trx_id(btr_cur_get_block(btr_cur),
btr_cur_get_page_zip(btr_cur), trx->id, &mtr);
}
if (offsets_heap) {
mem_heap_free(offsets_heap);
}
break;
case ROW_FOUND:
err = btr_cur_del_mark_set_sec_rec(BTR_NO_LOCKING_FLAG, btr_cur, false,
thr, &mtr);
ut_a(err == DB_SUCCESS);
heap = mem_heap_create(
sizeof(upd_t) + dtuple_get_n_fields(entry) * sizeof(upd_field_t),
UT_LOCATION_HERE);
offsets_heap = nullptr;
offsets =
rec_get_offsets(btr_cur_get_rec(btr_cur), index, nullptr,
ULINT_UNDEFINED, UT_LOCATION_HERE, &offsets_heap);
update = row_upd_build_sec_rec_difference_binary(
btr_cur_get_rec(btr_cur), index, offsets, entry, heap);
if (upd_get_n_fields(update) == 0) {
/* Do nothing */
} else if (mode != BTR_MODIFY_TREE) {
/* Try an optimistic updating of the record, keeping
changes within the page */
/* TODO: pass offsets, not &offsets */
err = btr_cur_optimistic_update(flags, btr_cur, &offsets, &offsets_heap,
update, 0, thr, thr_get_trx(thr)->id,
&mtr);
switch (err) {
case DB_OVERFLOW:
case DB_UNDERFLOW:
case DB_ZIP_OVERFLOW:
err = DB_FAIL;
default:
break;
}
} else {
err = btr_cur_pessimistic_update(
flags, btr_cur, &offsets, &offsets_heap, heap, &dummy_big_rec,
update, 0, thr, thr_get_trx(thr)->id, undo_no, &mtr);
ut_a(!dummy_big_rec);
}
mem_heap_free(heap);
mem_heap_free(offsets_heap);
}
pcur.close();
func_exit_no_pcur:
mtr_commit(&mtr);
return (err);
}
/** Flags a secondary index corrupted. */
static void row_undo_mod_sec_flag_corrupted(
trx_t *trx, /*!< in/out: transaction */
dict_index_t *index) /*!< in: secondary index */
{
ut_ad(!index->is_clustered());
switch (trx->dict_operation_lock_mode) {
case RW_S_LATCH:
/* This should be the normal rollback */
dict_set_corrupted(index);
break;
default:
[[fallthrough]];
case RW_X_LATCH:
/* This should be the rollback of a data dictionary
transaction. */
dict_set_corrupted(index);
}
}
/** Undoes a modify in secondary indexes when undo record type is UPD_DEL.
This is the specific function to handle the modify on multi-value indexes.
@param[in,out] node row undo node
@param[in,out] thr query thread
@param[in] index the multi-value index
@param[in,out] heap memory heap
@return DB_SUCCESS or DB_OUT_OF_FILE_SPACE */
[[nodiscard]] static dberr_t row_undo_mod_upd_del_multi_sec(undo_node_t *node,
que_thr_t *thr,
dict_index_t *index,
mem_heap_t *heap) {
dberr_t err = DB_SUCCESS;
Multi_value_entry_builder_normal mv_entry_builder(node->row, node->ext, index,
heap, true, false);
ut_ad(index->is_multi_value());
for (dtuple_t *entry = mv_entry_builder.begin(); entry != nullptr;
entry = mv_entry_builder.next()) {
err = row_undo_mod_del_mark_or_remove_sec(node, thr, index, entry);
if (UNIV_UNLIKELY(err != DB_SUCCESS)) {
break;
}
}
return (err);
}
/** Undoes a modify in secondary indexes when undo record type is UPD_DEL.
@return DB_SUCCESS or DB_OUT_OF_FILE_SPACE */
[[nodiscard]] static dberr_t row_undo_mod_upd_del_sec(
undo_node_t *node, /*!< in: row undo node */
que_thr_t *thr) /*!< in: query thread */
{
mem_heap_t *heap;
dberr_t err = DB_SUCCESS;
ut_ad(node->rec_type == TRX_UNDO_UPD_DEL_REC);
ut_ad(!node->undo_row);
heap = mem_heap_create(1024, UT_LOCATION_HERE);
while (node->index != nullptr) {
dict_index_t *index = node->index;
dtuple_t *entry;
if (index->type & DICT_FTS) {
dict_table_next_uncorrupted_index(node->index);
continue;
}
if (index->is_multi_value()) {
err = row_undo_mod_upd_del_multi_sec(node, thr, index, heap);
if (err != DB_SUCCESS) {
break;
}
mem_heap_empty(heap);
dict_table_next_uncorrupted_index(node->index);
continue;
}
/* During online index creation,
HA_ALTER_INPLACE_NO_LOCK_AFTER_PREPARE should
guarantee that any active transaction has not modified
indexed columns such that col->ord_part was 0 at the
time when the undo log record was written. When we get
to roll back an undo log entry TRX_UNDO_DEL_MARK_REC,
it should always cover all affected indexes. */
entry = row_build_index_entry(node->row, node->ext, index, heap);
if (UNIV_UNLIKELY(!entry)) {
/* The database must have crashed after
inserting a clustered index record but before
writing all the externally stored columns of
that record. Because secondary index entries
are inserted after the clustered index record,
we may assume that the secondary index record
does not exist. However, this situation may
only occur during the rollback of incomplete
transactions. */
ut_a(thr_is_recv(thr));
} else {
err = row_undo_mod_del_mark_or_remove_sec(node, thr, index, entry);
if (UNIV_UNLIKELY(err != DB_SUCCESS)) {
break;
}
}
mem_heap_empty(heap);
dict_table_next_uncorrupted_index(node->index);
}
mem_heap_free(heap);
return (err);
}
/** Undoes a modify in secondary indexes when undo record type is DEL_MARK.
This is the specific function to handle the modify on multi-value indexes.
@param[in,out] node row undo node
@param[in,out] thr query thread
@param[in] index the multi-value index
@param[in,out] heap memory heap
@return DB_SUCCESS or DB_OUT_OF_FILE_SPACE */
[[nodiscard]] static dberr_t row_undo_mod_del_mark_multi_sec(
undo_node_t *node, que_thr_t *thr, dict_index_t *index, mem_heap_t *heap) {
dberr_t err = DB_SUCCESS;
Multi_value_entry_builder_normal mv_entry_builder(node->row, node->ext, index,
heap, true, false);
ut_ad(index->is_multi_value());
for (dtuple_t *entry = mv_entry_builder.begin(); entry != nullptr;
entry = mv_entry_builder.next()) {
err = row_undo_mod_del_unmark_sec_and_undo_update(
BTR_MODIFY_LEAF, thr, index, entry, node->undo_no);
if (err == DB_FAIL) {
err = row_undo_mod_del_unmark_sec_and_undo_update(
BTR_MODIFY_TREE, thr, index, entry, node->undo_no);
}
if (err == DB_DUPLICATE_KEY) {
row_undo_mod_sec_flag_corrupted(thr_get_trx(thr), index);
err = DB_SUCCESS;
/* Do not return any error to the caller. The
duplicate will be reported by ALTER TABLE or
CREATE UNIQUE INDEX. Unfortunately we cannot
report the duplicate key value to the DDL
thread, because the altered_table object is
private to its call stack. */
} else if (err != DB_SUCCESS) {
break;
}
}
return (err);
}
/** Undoes a modify in secondary indexes when undo record type is DEL_MARK.
@return DB_SUCCESS or DB_OUT_OF_FILE_SPACE */
[[nodiscard]] static dberr_t row_undo_mod_del_mark_sec(
undo_node_t *node, /*!< in: row undo node */
que_thr_t *thr) /*!< in: query thread */
{
mem_heap_t *heap;
dberr_t err = DB_SUCCESS;
ut_ad(!node->undo_row);
heap = mem_heap_create(1024, UT_LOCATION_HERE);
while (node->index != nullptr) {
dict_index_t *index = node->index;
dtuple_t *entry;
if (index->type == DICT_FTS) {
dict_table_next_uncorrupted_index(node->index);
continue;
}
if (index->is_multi_value()) {
err = row_undo_mod_del_mark_multi_sec(node, thr, index, heap);
if (err != DB_SUCCESS) {
break;
}
mem_heap_empty(heap);
dict_table_next_uncorrupted_index(node->index);
continue;
}
/* During online index creation,
HA_ALTER_INPLACE_NO_LOCK_AFTER_PREPARE should
guarantee that any active transaction has not modified
indexed columns such that col->ord_part was 0 at the
time when the undo log record was written. When we get
to roll back an undo log entry TRX_UNDO_DEL_MARK_REC,
it should always cover all affected indexes. */
entry = row_build_index_entry(node->row, node->ext, index, heap);
ut_a(entry);
err = row_undo_mod_del_unmark_sec_and_undo_update(
BTR_MODIFY_LEAF, thr, index, entry, node->undo_no);
if (err == DB_FAIL) {
err = row_undo_mod_del_unmark_sec_and_undo_update(
BTR_MODIFY_TREE, thr, index, entry, node->undo_no);
}
if (err == DB_DUPLICATE_KEY) {
row_undo_mod_sec_flag_corrupted(thr_get_trx(thr), index);
err = DB_SUCCESS;
/* Do not return any error to the caller. The
duplicate will be reported by ALTER TABLE or
CREATE UNIQUE INDEX. Unfortunately we cannot
report the duplicate key value to the DDL
thread, because the altered_table object is
private to its call stack. */
} else if (err != DB_SUCCESS) {
break;
}
mem_heap_empty(heap);