-
Notifications
You must be signed in to change notification settings - Fork 4k
/
Copy pathsql_delete.cc
1318 lines (1119 loc) · 44.8 KB
/
sql_delete.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) 2000, 2024, 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 */
// Handle DELETE queries (both single- and multi-table).
#include "sql/sql_delete.h"
#include <assert.h>
#include <limits.h>
#include <sys/types.h>
#include <atomic>
#include <memory>
#include <utility>
#include "lex_string.h"
#include "mem_root_deque.h"
#include "my_alloc.h"
#include "my_base.h"
#include "my_dbug.h"
#include "my_inttypes.h"
#include "my_sys.h"
#include "my_table_map.h"
#include "mysql_com.h"
#include "mysqld_error.h"
#include "scope_guard.h"
#include "sql/auth/auth_acls.h"
#include "sql/auth/auth_common.h" // check_table_access
#include "sql/binlog.h" // mysql_bin_log
#include "sql/debug_sync.h" // DEBUG_SYNC
#include "sql/filesort.h" // Filesort
#include "sql/handler.h"
#include "sql/item.h"
#include "sql/iterators/delete_rows_iterator.h"
#include "sql/iterators/row_iterator.h"
#include "sql/join_optimizer/access_path.h"
#include "sql/join_optimizer/bit_utils.h"
#include "sql/join_optimizer/walk_access_paths.h"
#include "sql/key_spec.h"
#include "sql/mem_root_array.h"
#include "sql/mysqld.h" // stage_...
#include "sql/opt_explain.h" // Modification_plan
#include "sql/opt_explain_format.h"
#include "sql/opt_trace.h" // Opt_trace_object
#include "sql/psi_memory_key.h"
#include "sql/query_options.h"
#include "sql/query_result.h"
#include "sql/range_optimizer/partition_pruning.h"
#include "sql/range_optimizer/path_helpers.h"
#include "sql/range_optimizer/range_optimizer.h"
#include "sql/sql_base.h" // update_non_unique_table_error
#include "sql/sql_bitmap.h"
#include "sql/sql_class.h"
#include "sql/sql_const.h"
#include "sql/sql_error.h"
#include "sql/sql_executor.h"
#include "sql/sql_lex.h"
#include "sql/sql_list.h"
#include "sql/sql_opt_exec_shared.h"
#include "sql/sql_optimizer.h" // optimize_cond, substitute_gc
#include "sql/sql_resolver.h" // setup_order
#include "sql/sql_select.h"
#include "sql/sql_update.h" // switch_to_multi_table_if_subqueries
#include "sql/sql_view.h" // check_key_in_view
#include "sql/system_variables.h"
#include "sql/table.h"
#include "sql/table_trigger_dispatcher.h" // Table_trigger_dispatcher
#include "sql/thd_raii.h"
#include "sql/transaction_info.h"
#include "sql/trigger_def.h"
#include "sql/uniques.h" // Unique
struct COND_EQUAL;
class Item_exists_subselect;
class Opt_trace_context;
class Select_lex_visitor;
namespace {
class Query_result_delete final : public Query_result_interceptor {
public:
bool need_explain_interceptor() const override { return true; }
bool send_data(THD *, const mem_root_deque<Item *> &) override {
assert(false); // DELETE does not return any data.
return false;
}
bool send_eof(THD *thd) override {
my_ok(thd, thd->get_row_count_func());
return false;
}
};
bool DeleteCurrentRowAndProcessTriggers(THD *thd, TABLE *table,
bool invoke_before_triggers,
bool invoke_after_triggers,
ha_rows *deleted_rows) {
if (invoke_before_triggers) {
if (table->triggers->process_triggers(thd, TRG_EVENT_DELETE,
TRG_ACTION_BEFORE,
/*old_row_is_record1=*/false)) {
return true;
}
}
if (const int delete_error = table->file->ha_delete_row(table->record[0]);
delete_error != 0) {
myf error_flags = MYF(0);
if (table->file->is_fatal_error(delete_error)) {
error_flags |= ME_FATALERROR;
}
table->file->print_error(delete_error, error_flags);
// The IGNORE option may have downgraded the error from ha_delete_row
// to a warning, so we need to check the error flag in the THD.
return thd->is_error();
}
++*deleted_rows;
if (invoke_after_triggers) {
if (table->triggers->process_triggers(thd, TRG_EVENT_DELETE,
TRG_ACTION_AFTER,
/*old_row_is_record1=*/false)) {
return true;
}
}
return false;
}
} // namespace
bool Sql_cmd_delete::precheck(THD *thd) {
DBUG_TRACE;
Table_ref *tables = lex->query_tables;
if (!multitable) {
if (check_one_table_access(thd, DELETE_ACL, tables)) return true;
} else {
Table_ref *aux_tables = delete_tables->first;
Table_ref **save_query_tables_own_last = lex->query_tables_own_last;
if (check_table_access(thd, SELECT_ACL, tables, false, UINT_MAX, false))
return true;
/*
Since aux_tables list is not part of LEX::query_tables list we
have to juggle with LEX::query_tables_own_last value to be able
call check_table_access() safely.
*/
lex->query_tables_own_last = nullptr;
if (check_table_access(thd, DELETE_ACL, aux_tables, false, UINT_MAX,
false)) {
lex->query_tables_own_last = save_query_tables_own_last;
return true;
}
lex->query_tables_own_last = save_query_tables_own_last;
}
return false;
}
bool Sql_cmd_delete::check_privileges(THD *thd) {
DBUG_TRACE;
if (check_all_table_privileges(thd)) return true;
if (lex->query_block->check_column_privileges(thd)) return true;
return false;
}
/**
Delete a set of rows from a single table.
@param thd Thread handler
@returns false on success, true on error
@note Like implementations of other DDL/DML in MySQL, this function
relies on the caller to close the thread tables. This is done in the
end of dispatch_command().
*/
bool Sql_cmd_delete::delete_from_single_table(THD *thd) {
DBUG_TRACE;
myf error_flags = MYF(0); /**< Flag for fatal errors */
bool will_batch;
/*
Most recent handler error
= 1: Some non-handler error
= 0: Success
= -1: No more rows to process, or reached limit
*/
int error = 0;
ha_rows deleted_rows = 0;
bool reverse = false;
/// read_removal is only used by NDB storage engine
bool read_removal = false;
bool need_sort = false;
uint usable_index = MAX_KEY;
Query_block *const query_block = lex->query_block;
Query_expression *const unit = query_block->master_query_expression();
ORDER *order = query_block->order_list.first;
Table_ref *const table_list = query_block->get_table_list();
THD::killed_state killed_status = THD::NOT_KILLED;
THD::enum_binlog_query_type query_type = THD::ROW_QUERY_TYPE;
const bool safe_update = thd->variables.option_bits & OPTION_SAFE_UPDATES;
Table_ref *const delete_table_ref = table_list->updatable_base_table();
TABLE *const table = delete_table_ref->table;
const bool transactional_table = table->file->has_transactions();
const bool has_delete_triggers =
table->triggers && table->triggers->has_delete_triggers();
const bool has_before_triggers =
has_delete_triggers &&
table->triggers->has_triggers(TRG_EVENT_DELETE, TRG_ACTION_BEFORE);
const bool has_after_triggers =
has_delete_triggers &&
table->triggers->has_triggers(TRG_EVENT_DELETE, TRG_ACTION_AFTER);
unit->set_limit(thd, query_block);
AccessPath *range_scan = nullptr;
join_type type = JT_UNKNOWN;
auto cleanup = create_scope_guard([&range_scan, table] {
if (range_scan != nullptr) ::destroy_at(range_scan);
table->set_keyread(false);
table->file->ha_index_or_rnd_end();
free_io_cache(table);
filesort_free_buffers(table, true);
});
ha_rows limit = unit->select_limit_cnt;
const bool using_limit = limit != HA_POS_ERROR;
if (limit == 0 && thd->lex->is_explain()) {
const Modification_plan plan(thd, MT_DELETE, table, "LIMIT is zero", true,
0);
const bool err =
explain_single_table_modification(thd, thd, &plan, query_block);
return err;
}
assert(!(table->all_partitions_pruned_away || m_empty_query));
// Used to track whether there are no rows that need to be read
bool no_rows =
limit == 0 || is_empty_query() || table->all_partitions_pruned_away;
Item *conds = nullptr;
if (!no_rows && query_block->get_optimizable_conditions(thd, &conds, nullptr))
return true; /* purecov: inspected */
/*
See if we can substitute expressions with equivalent generated
columns in the WHERE and ORDER BY clauses of the DELETE statement.
It is unclear if this is best to do before or after the other
substitutions performed by substitute_for_best_equal_field(). Do
it here for now, to keep it consistent with how multi-table
deletes are optimized in JOIN::optimize().
*/
if (conds || order)
static_cast<void>(substitute_gc(thd, query_block, conds, nullptr, order));
const bool const_cond = conds == nullptr || conds->const_item();
const bool const_cond_result = const_cond && (!conds || conds->val_int());
if (thd->is_error()) // Error during val_int()
return true; /* purecov: inspected */
/*
We are passing HA_EXTRA_IGNORE_DUP_KEY flag here to recreate query with
IGNORE keyword within federated storage engine. If federated engine is
removed in the future, use of HA_EXTRA_IGNORE_DUP_KEY and
HA_EXTRA_NO_IGNORE_DUP_KEY flag should be removed from
delete_from_single_table(), DeleteRowsIterator::Init() and
handler::ha_reset().
*/
if (lex->is_ignore()) table->file->ha_extra(HA_EXTRA_IGNORE_DUP_KEY);
/*
Test if the user wants to delete all rows and deletion doesn't have
any side-effects (because of triggers), so we can use optimized
handler::delete_all_rows() method.
We can use delete_all_rows() if and only if:
- There is no limit clause
- The condition is constant
- The row set is not empty
- We allow new functions (not using option --skip-new)
- If there is a condition, then it it produces a non-zero value
- If the current command is DELETE FROM with no where clause, then:
- We will not be binlogging this statement in row-based, and
- there should be no delete triggers associated with the table.
*/
if (!using_limit && const_cond_result && !no_rows &&
!(specialflag & SPECIAL_NO_NEW_FUNC) &&
((!thd->is_current_stmt_binlog_format_row() || // not ROW binlog-format
thd->is_current_stmt_binlog_disabled()) && // no binlog for this
// command
!has_delete_triggers)) {
/* Update the table->file->stats.records number */
table->file->info(HA_STATUS_VARIABLE | HA_STATUS_NO_LOCK);
ha_rows const maybe_deleted = table->file->stats.records;
const Modification_plan plan(thd, MT_DELETE, table, "Deleting all rows",
false, maybe_deleted);
if (lex->is_explain()) {
const bool err =
explain_single_table_modification(thd, thd, &plan, query_block);
return err;
}
/* Do not allow deletion of all records if safe_update is set. */
if (safe_update) {
my_error(ER_UPDATE_WITHOUT_KEY_IN_SAFE_MODE, MYF(0),
thd->get_stmt_da()->get_first_condition_message());
return true;
}
DBUG_PRINT("debug", ("Trying to use delete_all_rows()"));
if (!(error = table->file->ha_delete_all_rows())) {
/*
As delete_all_rows() was used, we have to log it in statement format.
*/
query_type = THD::STMT_QUERY_TYPE;
error = -1;
deleted_rows = maybe_deleted;
goto cleanup;
}
if (error != HA_ERR_WRONG_COMMAND) {
if (table->file->is_fatal_error(error)) error_flags |= ME_FATALERROR;
table->file->print_error(error, error_flags);
goto cleanup;
}
/* Handler didn't support fast delete; Delete rows one by one */
}
if (conds != nullptr) {
COND_EQUAL *cond_equal = nullptr;
Item::cond_result result;
if (optimize_cond(thd, &conds, &cond_equal,
query_block->m_current_table_nest, &result))
return true;
if (result == Item::COND_FALSE) // Impossible where
{
no_rows = true;
if (lex->is_explain()) {
const Modification_plan plan(thd, MT_DELETE, table, "Impossible WHERE",
true, 0);
const bool err =
explain_single_table_modification(thd, thd, &plan, query_block);
return err;
}
}
if (conds) {
conds = substitute_for_best_equal_field(thd, conds, cond_equal, nullptr);
if (conds == nullptr) return true;
conds->update_used_tables();
}
}
/* Prune a second time to be able to prune on subqueries in WHERE clause. */
if (table->part_info && !no_rows) {
if (prune_partitions(thd, table, query_block, conds)) return true;
if (table->all_partitions_pruned_away) {
no_rows = true;
if (lex->is_explain()) {
const Modification_plan plan(thd, MT_DELETE, table,
"No matching rows after partition pruning",
true, 0);
const bool err =
explain_single_table_modification(thd, thd, &plan, query_block);
return err;
}
my_ok(thd, 0);
return false;
}
}
// Initialize the cost model that will be used for this table
table->init_cost_model(thd->cost_model());
/* Update the table->file->stats.records number */
table->file->info(HA_STATUS_VARIABLE | HA_STATUS_NO_LOCK);
table->covering_keys.clear_all();
if (conds &&
thd->optimizer_switch_flag(OPTIMIZER_SWITCH_ENGINE_CONDITION_PUSHDOWN)) {
table->file->cond_push(conds);
}
{ // Enter scope for optimizer trace wrapper
Opt_trace_object wrapper(&thd->opt_trace);
wrapper.add_utf8_table(delete_table_ref);
if (!no_rows && conds != nullptr) {
const Key_map keys_to_use(Key_map::ALL_BITS);
Key_map needed_reg_dummy;
MEM_ROOT temp_mem_root(key_memory_test_quick_select_exec,
thd->variables.range_alloc_block_size);
no_rows = test_quick_select(
thd, thd->mem_root, &temp_mem_root, keys_to_use, 0, 0,
limit, safe_update, ORDER_NOT_RELEVANT, table,
/*skip_records_in_range=*/false, conds, &needed_reg_dummy,
table->force_index, query_block, &range_scan) < 0;
}
if (thd->is_error()) // test_quick_select() has improper error propagation
return true;
if (no_rows) {
if (lex->is_explain()) {
const Modification_plan plan(thd, MT_DELETE, table, "Impossible WHERE",
true, 0);
const bool err =
explain_single_table_modification(thd, thd, &plan, query_block);
return err;
}
my_ok(thd, 0);
return false; // Nothing to delete
}
} // Ends scope for optimizer trace wrapper
/* If running in safe sql mode, don't allow updates without keys */
if (table->quick_keys.is_clear_all()) {
thd->server_status |= SERVER_QUERY_NO_INDEX_USED;
/*
Safe update error isn't returned if:
1) It is an EXPLAIN statement OR
2) LIMIT is present.
Append the first warning (if any) to the error message. This allows the
user to understand why index access couldn't be chosen.
*/
if (!thd->lex->is_explain() && safe_update && !using_limit) {
my_error(ER_UPDATE_WITHOUT_KEY_IN_SAFE_MODE, MYF(0),
thd->get_stmt_da()->get_first_condition_message());
return true;
}
}
if (order) {
if (conds != nullptr) table->update_const_key_parts(conds);
order = simple_remove_const(order, conds);
ORDER_with_src order_src(order, ESC_ORDER_BY, /*const_optimized=*/true);
usable_index = get_index_for_order(&order_src, table, limit, range_scan,
&need_sort, &reverse);
if (range_scan != nullptr) {
// May have been changed by get_index_for_order().
type = calc_join_type(range_scan);
}
}
// Reaching here only when table must be accessed
assert(!no_rows);
{
ha_rows rows;
if (range_scan)
rows = range_scan->num_output_rows();
else if (!conds && !need_sort && limit != HA_POS_ERROR)
rows = limit;
else {
delete_table_ref->fetch_number_of_rows();
rows = table->file->stats.records;
}
const Modification_plan plan(thd, MT_DELETE, table, type, range_scan, conds,
usable_index, limit, false, need_sort, false,
rows);
DEBUG_SYNC(thd, "planned_single_delete");
if (lex->is_explain()) {
const bool err =
explain_single_table_modification(thd, thd, &plan, query_block);
return err;
}
if (query_block->active_options() & OPTION_QUICK)
(void)table->file->ha_extra(HA_EXTRA_QUICK);
unique_ptr_destroy_only<Filesort> fsort;
JOIN join(thd, query_block); // Only for holding examined_rows.
AccessPath *path;
if (usable_index == MAX_KEY || range_scan) {
path =
create_table_access_path(thd, table, range_scan,
/*table_ref=*/nullptr, /*position=*/nullptr,
/*count_examined_rows=*/true);
} else {
empty_record(table);
path = NewIndexScanAccessPath(thd, table, usable_index,
/*use_order=*/true, reverse,
/*count_examined_rows=*/false);
}
unique_ptr_destroy_only<RowIterator> iterator;
if (need_sort) {
assert(usable_index == MAX_KEY);
if (conds != nullptr) {
path = NewFilterAccessPath(thd, path, conds);
}
fsort.reset(new (thd->mem_root) Filesort(
thd, {table}, /*keep_buffers=*/false, order, HA_POS_ERROR,
/*remove_duplicates=*/false,
/*force_sort_rowids=*/true, /*unwrap_rollup=*/false));
path = NewSortAccessPath(thd, path, fsort.get(), order,
/*count_examined_rows=*/false);
iterator = CreateIteratorFromAccessPath(thd, path, &join,
/*eligible_for_batch_mode=*/true);
// Prevent cleanup in JOIN::destroy() and in the cleanup condition guard,
// to avoid double-destroy of the SortingIterator.
table->sorting_iterator = nullptr;
if (iterator == nullptr || iterator->Init()) return true;
thd->inc_examined_row_count(join.examined_rows);
/*
Filesort has already found and selected the rows we want to delete,
so we don't need the where clause
*/
conds = nullptr;
} else {
iterator = CreateIteratorFromAccessPath(thd, path, &join,
/*eligible_for_batch_mode=*/true);
// Prevent cleanup in JOIN::destroy() and in the cleanup condition guard,
// to avoid double-destroy of the SortingIterator.
table->sorting_iterator = nullptr;
if (iterator->Init()) return true;
}
if (query_block->has_ft_funcs() && init_ftfuncs(thd, query_block))
return true; /* purecov: inspected */
THD_STAGE_INFO(thd, stage_updating);
if (has_after_triggers) {
/*
The table has AFTER DELETE triggers that might access to subject table
and therefore might need delete to be done immediately. So we turn-off
the batching.
*/
(void)table->file->ha_extra(HA_EXTRA_DELETE_CANNOT_BATCH);
will_batch = false;
} else {
// No after delete triggers, attempt to start bulk delete
will_batch = !table->file->start_bulk_delete();
}
table->mark_columns_needed_for_delete(thd);
if (thd->is_error()) return true;
if ((table->file->ha_table_flags() & HA_READ_BEFORE_WRITE_REMOVAL) &&
!using_limit && !has_delete_triggers && range_scan &&
used_index(range_scan) != MAX_KEY)
read_removal = table->check_read_removal(used_index(range_scan));
assert(limit > 0);
// The loop that reads rows and delete those that qualify
while (!(error = iterator->Read()) && !thd->killed) {
assert(!thd->is_error());
thd->inc_examined_row_count(1);
if (conds != nullptr) {
const bool skip_record = conds->val_int() == 0;
if (thd->is_error()) {
error = 1;
break;
}
if (skip_record) {
// Row failed condition check, release lock
table->file->unlock_row();
continue;
}
}
assert(!thd->is_error());
if (DeleteCurrentRowAndProcessTriggers(thd, table, has_before_triggers,
has_after_triggers,
&deleted_rows)) {
error = 1;
break;
}
if (!--limit && using_limit) {
error = -1;
break;
}
}
killed_status = thd->killed;
if (killed_status != THD::NOT_KILLED || thd->is_error())
error = 1; // Aborted
int loc_error;
if (will_batch && (loc_error = table->file->end_bulk_delete())) {
/* purecov: begin inspected */
if (error != 1) {
if (table->file->is_fatal_error(loc_error))
error_flags |= ME_FATALERROR;
table->file->print_error(loc_error, error_flags);
}
error = 1;
/* purecov: end */
}
if (read_removal) {
/* Only handler knows how many records were really written */
deleted_rows = table->file->end_read_removal();
}
if (query_block->active_options() & OPTION_QUICK)
(void)table->file->ha_extra(HA_EXTRA_NORMAL);
} // End of scope for Modification_plan
cleanup:
assert(!lex->is_explain());
if (!transactional_table && deleted_rows > 0)
thd->get_transaction()->mark_modified_non_trans_table(
Transaction_ctx::STMT);
/* See similar binlogging code in sql_update.cc, for comments */
if ((error < 0) ||
thd->get_transaction()->cannot_safely_rollback(Transaction_ctx::STMT)) {
if (mysql_bin_log.is_open()) {
int errcode = 0;
if (error < 0)
thd->clear_error();
else
errcode = query_error_code(thd, killed_status == THD::NOT_KILLED);
/*
[binlog]: As we don't allow the use of 'handler:delete_all_rows()' when
binlog_format == ROW, if 'handler::delete_all_rows()' was called
we replicate statement-based; otherwise, 'ha_delete_row()' was used to
delete specific rows which we might log row-based.
*/
const int log_result =
thd->binlog_query(query_type, thd->query().str, thd->query().length,
transactional_table, false, false, errcode);
if (log_result) {
error = 1;
}
}
}
assert(transactional_table || deleted_rows == 0 ||
thd->get_transaction()->cannot_safely_rollback(Transaction_ctx::STMT));
if (error < 0) {
my_ok(thd, deleted_rows);
DBUG_PRINT("info", ("%ld records deleted", (long)deleted_rows));
}
return error > 0;
}
/**
Prepare a DELETE statement
*/
bool Sql_cmd_delete::prepare_inner(THD *thd) {
DBUG_TRACE;
Query_block *const select = lex->query_block;
Table_ref *const table_list = select->get_table_list();
bool apply_semijoin;
Mem_root_array<Item_exists_subselect *> sj_candidates_local(thd->mem_root);
Opt_trace_context *const trace = &thd->opt_trace;
Opt_trace_object trace_wrapper(trace);
Opt_trace_object trace_prepare(trace, "delete_preparation");
trace_prepare.add_select_number(select->select_number);
const Opt_trace_array trace_steps(trace, "steps");
apply_semijoin = multitable;
if (select->setup_tables(thd, table_list, false))
return true; /* purecov: inspected */
const Access_bitmask want_privilege_saved = thd->want_privilege;
thd->want_privilege = SELECT_ACL;
const enum enum_mark_columns mark_used_columns_saved = thd->mark_used_columns;
thd->mark_used_columns = MARK_COLUMNS_READ;
if (select->derived_table_count || select->table_func_count) {
if (select->resolve_placeholder_tables(thd, apply_semijoin)) return true;
if (select->check_view_privileges(thd, DELETE_ACL, SELECT_ACL)) return true;
}
/*
Deletability test is spread across several places:
- Target table or view must be updatable (checked below)
- A view has special requirements with respect to keys
(checked in check_key_in_view)
- Target table must not be same as one selected from
(checked in unique_table)
*/
// Check the list of tables to be deleted from
for (Table_ref *table_ref = table_list; table_ref;
table_ref = table_ref->next_local) {
// Skip tables that are only selected from
if (!table_ref->updating) continue;
// Cannot delete from a non-updatable view or derived table.
if (!table_ref->is_updatable()) {
my_error(ER_NON_UPDATABLE_TABLE, MYF(0), table_ref->alias, "DELETE");
return true;
}
// DELETE does not allow deleting from multi-table views
if (table_ref->is_multiple_tables()) {
my_error(ER_VIEW_DELETE_MERGE_VIEW, MYF(0), table_ref->db,
table_ref->table_name);
return true;
}
if (check_key_in_view(thd, table_ref, table_ref->updatable_base_table())) {
my_error(ER_NON_UPDATABLE_TABLE, MYF(0), table_ref->alias, "DELETE");
return true;
}
// A view must be merged, and thus cannot have a TABLE
assert(!table_ref->is_view() || table_ref->table == nullptr);
// Cannot delete from a storage engine that does not support delete.
Table_ref *base_table = table_ref->updatable_base_table();
if (base_table->table->file->ha_table_flags() & HA_DELETE_NOT_SUPPORTED) {
my_error(ER_ILLEGAL_HA, MYF(0), base_table->table_name);
return true;
}
for (Table_ref *tr = base_table; tr != nullptr; tr = tr->referencing_view) {
tr->updating = true;
}
// Table is deleted from, used for privilege checking during execution
base_table->set_deleted();
}
// The hypergraph optimizer has a unified execution path for single-table and
// multi-table DELETE, and does not need to distinguish between the two. This
// enables it to perform optimizations like sort avoidance and semi-join
// flattening even if features specific to single-table DELETE (that is, ORDER
// BY and LIMIT) are used.
if (lex->using_hypergraph_optimizer()) {
if (!multitable) {
Table_ref *const delete_table_ref = table_list->updatable_base_table();
TABLE *const table = delete_table_ref->table;
if (select->active_options() & OPTION_QUICK)
(void)table->file->ha_extra(HA_EXTRA_QUICK);
}
multitable = true;
}
if (!multitable && select->first_inner_query_expression() != nullptr &&
should_switch_to_multi_table_if_subqueries(thd, select, table_list))
multitable = true;
if (multitable) {
if (!select->m_table_nest.empty())
propagate_nullability(&select->m_table_nest, false);
const Prepared_stmt_arena_holder ps_holder(thd);
result = new (thd->mem_root) Query_result_delete;
if (result == nullptr) return true; /* purecov: inspected */
// The former is for the pre-iterator executor; the latter is for the
// iterator executor.
// TODO(sgunders): Get rid of this when we remove Query_result.
select->set_query_result(result);
select->master_query_expression()->set_query_result(result);
select->make_active_options(SELECT_NO_JOIN_CACHE | SELECT_NO_UNLOCK,
OPTION_BUFFER_RESULT);
select->set_sj_candidates(&sj_candidates_local);
} else {
select->make_active_options(0, 0);
}
// Precompute and store the row types of NATURAL/USING joins.
if (select->leaf_table_count >= 2 &&
setup_natural_join_row_types(thd, select->m_current_table_nest,
&select->context))
return true;
// Enable the following code if allowing LIMIT with multi-table DELETE
assert(lex->sql_command == SQLCOM_DELETE || !select->has_limit());
lex->allow_sum_func = 0;
if (select->setup_conds(thd)) return true;
assert(select->having_cond() == nullptr && select->group_list.elements == 0 &&
select->offset_limit == nullptr);
if (select->resolve_limits(thd)) return true; /* purecov: inspected */
// check ORDER BY even if it can be ignored
if (select->order_list.first) {
Table_ref tables;
tables.table = table_list->table;
tables.alias = table_list->alias;
assert(!select->group_list.elements);
if (select->setup_base_ref_items(thd)) return true; /* purecov: inspected */
if (setup_order(thd, select->base_ref_items, &tables, &select->fields,
select->order_list.first))
return true;
}
thd->want_privilege = want_privilege_saved;
thd->mark_used_columns = mark_used_columns_saved;
if (select->has_ft_funcs() && setup_ftfuncs(thd, select))
return true; /* purecov: inspected */
/*
Check tables to be deleted from for duplicate entries -
must be done after conditions have been prepared.
*/
select->exclude_from_table_unique_test = true;
for (Table_ref *table_ref = table_list; table_ref;
table_ref = table_ref->next_local) {
if (!table_ref->is_deleted()) continue;
/*
Check that table from which we delete is not used somewhere
inside subqueries/view.
*/
Table_ref *duplicate = unique_table(table_ref->updatable_base_table(),
lex->query_tables, false);
if (duplicate) {
update_non_unique_table_error(table_ref, "DELETE", duplicate);
return true;
}
}
select->exclude_from_table_unique_test = false;
if (select->query_result() &&
select->query_result()->prepare(thd, select->fields, lex->unit))
return true; /* purecov: inspected */
opt_trace_print_expanded_query(thd, select, &trace_wrapper);
select->original_tables_map = select->all_tables_map();
if (select->has_sj_candidates() && select->flatten_subqueries(thd))
return true;
select->set_sj_candidates(nullptr);
if (select->apply_local_transforms(thd, true))
return true; /* purecov: inspected */
if (select->is_empty_query()) set_empty_query();
select->master_query_expression()->set_prepared();
return false;
}
/**
Execute a DELETE statement.
*/
bool Sql_cmd_delete::execute_inner(THD *thd) {
if (is_empty_query()) {
if (lex->is_explain()) {
const Modification_plan plan(thd, MT_DELETE, /*table_arg=*/nullptr,
"No matching rows after partition pruning",
true, 0);
return explain_single_table_modification(thd, thd, &plan,
lex->query_block);
}
my_ok(thd);
return false;
}
return multitable ? Sql_cmd_dml::execute_inner(thd)
: delete_from_single_table(thd);
}
/***************************************************************************
Delete multiple tables from join
***************************************************************************/
extern "C" int refpos_order_cmp(const void *arg, const void *a, const void *b) {
const handler *file = static_cast<const handler *>(arg);
return file->cmp_ref(static_cast<const uchar *>(a),
static_cast<const uchar *>(b));
}
DeleteRowsIterator::DeleteRowsIterator(
THD *thd, unique_ptr_destroy_only<RowIterator> source, JOIN *join,
table_map tables_to_delete_from, table_map immediate_tables)
: RowIterator(thd),
m_source(std::move(source)),
m_join(join),
m_tables_to_delete_from(tables_to_delete_from),
m_immediate_tables(immediate_tables),
// The old optimizer does not use hash join in DELETE statements.
m_hash_join_tables(thd->lex->using_hypergraph_optimizer()
? GetHashJoinTables(join->root_access_path())
: 0),
m_tempfiles(thd->mem_root),
m_delayed_tables(thd->mem_root) {
for (const Table_ref *tr = join->query_block->leaf_tables; tr != nullptr;
tr = tr->next_leaf) {
TABLE *const table = tr->table;
const uint tableno = tr->tableno();
if (!IsBitSet(tableno, tables_to_delete_from)) continue;
// Record transactional tables that are deleted from.
if (table->file->has_transactions()) {
m_transactional_tables |= tr->map();
}
// Record which tables have delete triggers that need to be fired.
if (table->triggers != nullptr) {
if (table->triggers->has_triggers(TRG_EVENT_DELETE, TRG_ACTION_BEFORE)) {
m_tables_with_before_triggers |= tr->map();
}
if (table->triggers->has_triggers(TRG_EVENT_DELETE, TRG_ACTION_AFTER)) {
m_tables_with_after_triggers |= tr->map();
}
}
}
}
void SetUpTablesForDelete(THD *thd, JOIN *join) {
for (const Table_ref *tr = join->query_block->leaf_tables; tr != nullptr;
tr = tr->next_leaf) {
if (!tr->is_deleted()) continue;
TABLE *table = tr->table;
table->covering_keys.clear_all();
table->prepare_for_position();
table->mark_columns_needed_for_delete(thd);
}
THD_STAGE_INFO(thd, stage_deleting_from_main_table);
}
bool CheckSqlSafeUpdate(THD *thd, const JOIN *join) {
if (!Overlaps(thd->variables.option_bits, OPTION_SAFE_UPDATES)) {
return false;
}
if (join->query_block->has_limit()) {
return false;
}
bool full_scan = false;
WalkAccessPaths(
join->root_access_path(), join, WalkAccessPathPolicy::ENTIRE_QUERY_BLOCK,
[&full_scan](const AccessPath *path, const JOIN *) {
if (path->type == AccessPath::TABLE_SCAN) {
full_scan |= path->table_scan().table->pos_in_table_list->updating;
} else if (path->type == AccessPath::INDEX_SCAN) {
full_scan |= path->index_scan().table->pos_in_table_list->updating;
}
return full_scan;
});
if (full_scan) {
// Append the first warning (if any) to the error message. The warning may
// give the user a hint as to why index access couldn't be chosen.