← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to plugin/innobase/row/row0mysql.c

  • Committer: Andrew Hutchings
  • Date: 2010-10-27 06:36:38 UTC
  • mto: (1883.1.2 build)
  • mto: This revision was merged to the branch mainline in revision 1884.
  • Revision ID: andrew@linuxjedi.co.uk-20101027063638-08d33sknkd691zz2
Fix min() usage for 32bit
Fix Solaris doesn't follow POSIX standard for send()

Show diffs side-by-side

added added

removed removed

Lines of Context:
plugin/innobase/row/row0mysql.c
1
1
/*****************************************************************************
2
2
 
3
 
Copyright (c) 2000, 2010, Innobase Oy. All Rights Reserved.
 
3
Copyright (c) 2000, 2009, Innobase Oy. All Rights Reserved.
4
4
 
5
5
This program is free software; you can redistribute it and/or modify it under
6
6
the terms of the GNU General Public License as published by the Free Software
249
249
}
250
250
 
251
251
/**************************************************************//**
252
 
Pad a column with spaces. */
253
 
UNIV_INTERN
254
 
void
255
 
row_mysql_pad_col(
256
 
/*==============*/
257
 
        ulint   mbminlen,       /*!< in: minimum size of a character,
258
 
                                in bytes */
259
 
        byte*   pad,            /*!< out: padded buffer */
260
 
        ulint   len)            /*!< in: number of bytes to pad */
261
 
{
262
 
        const byte*     pad_end;
263
 
 
264
 
        switch (UNIV_EXPECT(mbminlen, 1)) {
265
 
        default:
266
 
                ut_error;
267
 
        case 1:
268
 
                /* space=0x20 */
269
 
                memset(pad, 0x20, len);
270
 
                break;
271
 
        case 2:
272
 
                /* space=0x0020 */
273
 
                pad_end = pad + len;
274
 
                ut_a(!(len % 2));
275
 
                do {
276
 
                        *pad++ = 0x00;
277
 
                        *pad++ = 0x20;
278
 
                } while (pad < pad_end);
279
 
                break;
280
 
        case 4:
281
 
                /* space=0x00000020 */
282
 
                pad_end = pad + len;
283
 
                ut_a(!(len % 4));
284
 
                do {
285
 
                        *pad++ = 0x00;
286
 
                        *pad++ = 0x00;
287
 
                        *pad++ = 0x00;
288
 
                        *pad++ = 0x20;
289
 
                } while (pad < pad_end);
290
 
                break;
291
 
        }
292
 
}
293
 
 
294
 
/**************************************************************//**
295
252
Stores a non-SQL-NULL field given in the MySQL format in the InnoDB format.
296
253
The counterpart of this function is row_sel_field_store_in_mysql_format() in
297
254
row0sel.c.
383
340
                        /* Remove trailing spaces from old style VARCHAR
384
341
                        columns. */
385
342
 
386
 
                        /* Handle Unicode strings differently. */
 
343
                        /* Handle UCS2 strings differently. */
387
344
                        ulint   mbminlen        = dtype_get_mbminlen(dtype);
388
345
 
389
346
                        ptr = mysql_data;
390
347
 
391
 
                        switch (mbminlen) {
392
 
                        default:
393
 
                                ut_error;
394
 
                        case 4:
395
 
                                /* space=0x00000020 */
396
 
                                /* Trim "half-chars", just in case. */
397
 
                                col_len &= ~3;
398
 
 
399
 
                                while (col_len >= 4
400
 
                                       && ptr[col_len - 4] == 0x00
401
 
                                       && ptr[col_len - 3] == 0x00
402
 
                                       && ptr[col_len - 2] == 0x00
403
 
                                       && ptr[col_len - 1] == 0x20) {
404
 
                                        col_len -= 4;
405
 
                                }
406
 
                                break;
407
 
                        case 2:
 
348
                        if (mbminlen == 2) {
408
349
                                /* space=0x0020 */
409
350
                                /* Trim "half-chars", just in case. */
410
351
                                col_len &= ~1;
413
354
                                       && ptr[col_len - 1] == 0x20) {
414
355
                                        col_len -= 2;
415
356
                                }
416
 
                                break;
417
 
                        case 1:
 
357
                        } else {
 
358
                                ut_a(mbminlen == 1);
418
359
                                /* space=0x20 */
419
360
                                while (col_len > 0
420
361
                                       && ptr[col_len - 1] == 0x20) {
527
468
/****************************************************************//**
528
469
Handles user errors and lock waits detected by the database engine.
529
470
@return TRUE if it was a lock wait and we should continue running the
530
 
query thread and in that case the thr is ALREADY in the running state. */
 
471
query thread */
531
472
UNIV_INTERN
532
473
ibool
533
474
row_mysql_handle_errors(
564
505
        case DB_CANNOT_ADD_CONSTRAINT:
565
506
        case DB_TOO_MANY_CONCURRENT_TRXS:
566
507
        case DB_OUT_OF_FILE_SPACE:
567
 
        case DB_INTERRUPTED:
568
508
                if (savept) {
569
509
                        /* Roll back the latest, possibly incomplete
570
510
                        insertion or update */
618
558
                      "InnoDB: " REFMAN "forcing-recovery.html"
619
559
                      " for help.\n", stderr);
620
560
                break;
621
 
        case DB_FOREIGN_EXCEED_MAX_CASCADE:
622
 
                fprintf(stderr, "InnoDB: Cannot delete/update rows with"
623
 
                        " cascading foreign key constraints that exceed max"
624
 
                        " depth of %lu\n"
625
 
                        "Please drop excessive foreign constraints"
626
 
                        " and try again\n", (ulong) DICT_FK_MAX_RECURSIVE_LOAD);
627
 
                break;
628
561
        default:
629
562
                fprintf(stderr, "InnoDB: unknown error code %lu\n",
630
563
                        (ulong) err);
674
607
 
675
608
        prebuilt->select_lock_type = LOCK_NONE;
676
609
        prebuilt->stored_select_lock_type = 99999999;
677
 
        UNIV_MEM_INVALID(&prebuilt->stored_select_lock_type,
678
 
                         sizeof prebuilt->stored_select_lock_type);
679
610
 
680
611
        prebuilt->search_tuple = dtuple_create(
681
612
                heap, 2 * dict_table_get_n_cols(table));
840
771
        }
841
772
}
842
773
 
843
 
dtuple_t* row_get_prebuilt_insert_row(row_prebuilt_t*   prebuilt);
844
 
 
845
774
/*********************************************************************//**
846
775
Gets pointer to a prebuilt dtuple used in insertions. If the insert graph
847
776
has not yet been built in the prebuilt struct, then this function first
848
777
builds it.
849
778
@return prebuilt dtuple; the column type information is also set in it */
 
779
static
850
780
dtuple_t*
851
781
row_get_prebuilt_insert_row(
852
782
/*========================*/
1431
1361
run_again:
1432
1362
        thr->run_node = node;
1433
1363
        thr->prev_node = node;
1434
 
        thr->fk_cascade_depth = 0;
1435
1364
 
1436
1365
        row_upd_step(thr);
1437
1366
 
1438
 
        /* The recursive call for cascading update/delete happens
1439
 
        in above row_upd_step(), reset the counter once we come
1440
 
        out of the recursive call, so it does not accumulate for
1441
 
        different row deletes */
1442
 
        thr->fk_cascade_depth = 0;
1443
 
 
1444
1367
        err = trx->error_state;
1445
1368
 
1446
 
        /* Reset fk_cascade_depth back to 0 */
1447
 
        thr->fk_cascade_depth = 0;
1448
 
 
1449
1369
        if (err != DB_SUCCESS) {
1450
1370
                que_thr_stop_for_mysql(thr);
1451
1371
 
1482
1402
                srv_n_rows_updated++;
1483
1403
        }
1484
1404
 
1485
 
        /* We update table statistics only if it is a DELETE or UPDATE
1486
 
        that changes indexed columns, UPDATEs that change only non-indexed
1487
 
        columns would not affect statistics. */
1488
 
        if (node->is_delete || !(node->cmpl_info & UPD_NODE_NO_ORD_CHANGE)) {
1489
 
                row_update_statistics_if_needed(prebuilt->table);
1490
 
        }
 
1405
        row_update_statistics_if_needed(prebuilt->table);
1491
1406
 
1492
1407
        trx->op_info = "";
1493
1408
 
1495
1410
}
1496
1411
 
1497
1412
/*********************************************************************//**
1498
 
This can only be used when srv_locks_unsafe_for_binlog is TRUE or this
1499
 
session is using a READ COMMITTED or READ UNCOMMITTED isolation level.
1500
 
Before calling this function row_search_for_mysql() must have
1501
 
initialized prebuilt->new_rec_locks to store the information which new
1502
 
record locks really were set. This function removes a newly set
1503
 
clustered index record lock under prebuilt->pcur or
1504
 
prebuilt->clust_pcur.  Thus, this implements a 'mini-rollback' that
1505
 
releases the latest clustered index record lock we set.
1506
 
@return error code or DB_SUCCESS */
 
1413
This can only be used when srv_locks_unsafe_for_binlog is TRUE or
 
1414
this session is using a READ COMMITTED isolation level. Before
 
1415
calling this function we must use trx_reset_new_rec_lock_info() and
 
1416
trx_register_new_rec_lock() to store the information which new record locks
 
1417
really were set. This function removes a newly set lock under prebuilt->pcur,
 
1418
and also under prebuilt->clust_pcur. Currently, this is only used and tested
 
1419
in the case of an UPDATE or a DELETE statement, where the row lock is of the
 
1420
LOCK_X type.
 
1421
Thus, this implements a 'mini-rollback' that releases the latest record
 
1422
locks we set.
 
1423
@return error code or DB_SUCCESS */
1507
1424
UNIV_INTERN
1508
1425
int
1509
1426
row_unlock_for_mysql(
1510
1427
/*=================*/
1511
 
        row_prebuilt_t* prebuilt,       /*!< in/out: prebuilt struct in MySQL
 
1428
        row_prebuilt_t* prebuilt,       /*!< in: prebuilt struct in MySQL
1512
1429
                                        handle */
1513
 
        ibool           has_latches_on_recs)/*!< in: TRUE if called so
1514
 
                                        that we have the latches on
1515
 
                                        the records under pcur and
1516
 
                                        clust_pcur, and we do not need
1517
 
                                        to reposition the cursors. */
 
1430
        ibool           has_latches_on_recs)/*!< TRUE if called so that we have
 
1431
                                        the latches on the records under pcur
 
1432
                                        and clust_pcur, and we do not need to
 
1433
                                        reposition the cursors. */
1518
1434
{
1519
1435
        btr_pcur_t*     pcur            = prebuilt->pcur;
1520
1436
        btr_pcur_t*     clust_pcur      = prebuilt->clust_pcur;
1525
1441
 
1526
1442
        if (UNIV_UNLIKELY
1527
1443
            (!srv_locks_unsafe_for_binlog
1528
 
             && trx->isolation_level > TRX_ISO_READ_COMMITTED)) {
 
1444
             && trx->isolation_level != TRX_ISO_READ_COMMITTED)) {
1529
1445
 
1530
1446
                fprintf(stderr,
1531
1447
                        "InnoDB: Error: calling row_unlock_for_mysql though\n"
1597
1513
                        }
1598
1514
                }
1599
1515
 
1600
 
                if (rec_trx_id != trx->id) {
 
1516
                if (ut_dulint_cmp(rec_trx_id, trx->id) != 0) {
1601
1517
                        /* We did not update the record: unlock it */
1602
1518
 
1603
1519
                        rec = btr_pcur_get_rec(pcur);
1641
1557
        trx_t*  trx;
1642
1558
 
1643
1559
        trx = thr_get_trx(thr);
1644
 
 
1645
 
        /* Increment fk_cascade_depth to record the recursive call depth on
1646
 
        a single update/delete that affects multiple tables chained
1647
 
        together with foreign key relations. */
1648
 
        thr->fk_cascade_depth++;
1649
 
 
1650
 
        if (thr->fk_cascade_depth > FK_MAX_CASCADE_DEL) {
1651
 
                return (DB_FOREIGN_EXCEED_MAX_CASCADE);
1652
 
        }
1653
1560
run_again:
1654
1561
        thr->run_node = node;
1655
1562
        thr->prev_node = node;
1656
1563
 
1657
1564
        row_upd_step(thr);
1658
1565
 
1659
 
        /* The recursive call for cascading update/delete happens
1660
 
        in above row_upd_step(), reset the counter once we come
1661
 
        out of the recursive call, so it does not accumulate for
1662
 
        different row deletes */
1663
 
        thr->fk_cascade_depth = 0;
1664
 
 
1665
1566
        err = trx->error_state;
1666
1567
 
1667
1568
        /* Note that the cascade node is a subnode of another InnoDB
1727
1628
}
1728
1629
 
1729
1630
/*********************************************************************//**
 
1631
Calculates the key number used inside MySQL for an Innobase index. We have
 
1632
to take into account if we generated a default clustered index for the table
 
1633
@return the key number used inside MySQL */
 
1634
UNIV_INTERN
 
1635
ulint
 
1636
row_get_mysql_key_number_for_index(
 
1637
/*===============================*/
 
1638
        const dict_index_t*     index)  /*!< in: index */
 
1639
{
 
1640
        const dict_index_t*     ind;
 
1641
        ulint                   i;
 
1642
 
 
1643
        ut_a(index);
 
1644
 
 
1645
        i = 0;
 
1646
        ind = dict_table_get_first_index(index->table);
 
1647
 
 
1648
        while (index != ind) {
 
1649
                ind = dict_table_get_next_index(ind);
 
1650
                i++;
 
1651
        }
 
1652
 
 
1653
        if (row_table_got_default_clust_index(index->table)) {
 
1654
                ut_a(i > 0);
 
1655
                i--;
 
1656
        }
 
1657
 
 
1658
        return(i);
 
1659
}
 
1660
 
 
1661
/*********************************************************************//**
1730
1662
Locks the data dictionary in shared mode from modifications, for performing
1731
1663
foreign key check, rollback, or other operation invisible to MySQL. */
1732
1664
UNIV_INTERN
2098
2030
                                FOREIGN KEY (a, b) REFERENCES table2(c, d),
2099
2031
                                        table2 can be written also with the
2100
2032
                                        database name before it: test.table2 */
2101
 
        size_t          sql_length,     /*!< in: length of sql_string */
2102
2033
        const char*     name,           /*!< in: table full name in the
2103
2034
                                        normalized form
2104
2035
                                        database_name/table_name */
2120
2051
 
2121
2052
        trx_set_dict_operation(trx, TRX_DICT_OP_TABLE);
2122
2053
 
2123
 
        err = dict_create_foreign_constraints(trx, sql_string, sql_length,
2124
 
                                              name, reject_fks);
 
2054
        err = dict_create_foreign_constraints(trx, sql_string, name,
 
2055
                                              reject_fks);
2125
2056
        if (err == DB_SUCCESS) {
2126
2057
                /* Check that also referencing constraints are ok */
2127
 
                err = dict_load_foreigns(name, FALSE, TRUE);
 
2058
                err = dict_load_foreigns(name, TRUE);
2128
2059
        }
2129
2060
 
2130
2061
        if (err != DB_SUCCESS) {
2351
2282
        trx_t*          trx)    /*!< in: transaction handle */
2352
2283
{
2353
2284
        dict_foreign_t* foreign;
2354
 
        table_id_t      new_id;
 
2285
        dulint          new_id;
2355
2286
        dict_table_t*   table;
2356
2287
        ibool           success;
2357
2288
        ulint           err;
2465
2396
                goto funct_exit;
2466
2397
        }
2467
2398
 
2468
 
        dict_hdr_get_new_id(&new_id, NULL, NULL);
 
2399
        new_id = dict_hdr_get_new_id(DICT_HDR_TABLE_ID);
2469
2400
 
2470
2401
        /* Remove all locks except the table-level S and X locks. */
2471
2402
        lock_remove_all_on_table(table, FALSE);
2473
2404
        info = pars_info_create();
2474
2405
 
2475
2406
        pars_info_add_str_literal(info, "table_name", name);
2476
 
        pars_info_add_ull_literal(info, "new_id", new_id);
 
2407
        pars_info_add_dulint_literal(info, "new_id", new_id);
2477
2408
 
2478
2409
        err = que_eval_sql(info,
2479
2410
                           "PROCEDURE DISCARD_TABLESPACE_PROC () IS\n"
2687
2618
        dict_index_t*   sys_index;
2688
2619
        btr_pcur_t      pcur;
2689
2620
        mtr_t           mtr;
2690
 
        table_id_t      new_id;
 
2621
        dulint          new_id;
2691
2622
        ulint           recreate_space = 0;
2692
2623
        pars_info_t*    info = NULL;
2693
2624
 
2817
2748
 
2818
2749
        trx->table_id = table->id;
2819
2750
 
2820
 
        /* Lock all index trees for this table, as we will
2821
 
        truncate the table/index and possibly change their metadata.
2822
 
        All DML/DDL are blocked by table level lock, with
2823
 
        a few exceptions such as queries into information schema
2824
 
        about the table, MySQL could try to access index stats
2825
 
        for this kind of query, we need to use index locks to
2826
 
        sync up */
2827
 
        dict_table_x_lock_indexes(table);
2828
 
 
2829
2751
        if (table->space && !table->dir_path_of_temp_table) {
2830
2752
                /* Discard and create the single-table tablespace. */
2831
2753
                ulint   space   = table->space;
2836
2758
 
2837
2759
                        dict_index_t*   index;
2838
2760
 
2839
 
                        dict_hdr_get_new_id(NULL, NULL, &space);
 
2761
                        space = 0;
2840
2762
 
2841
 
                        if (space == ULINT_UNDEFINED
2842
 
                            || fil_create_new_single_table_tablespace(
2843
 
                                    space, table->name, FALSE, flags,
 
2763
                        if (fil_create_new_single_table_tablespace(
 
2764
                                    &space, table->name, FALSE, flags,
2844
2765
                                    FIL_IBD_FILE_INITIAL_SIZE) != DB_SUCCESS) {
2845
 
                                dict_table_x_unlock_indexes(table);
2846
2766
                                ut_print_timestamp(stderr);
2847
2767
                                fprintf(stderr,
2848
2768
                                        "  InnoDB: TRUNCATE TABLE %s failed to"
2946
2866
 
2947
2867
        mem_heap_free(heap);
2948
2868
 
2949
 
        /* Done with index truncation, release index tree locks,
2950
 
        subsequent work relates to table level metadata change */
2951
 
        dict_table_x_unlock_indexes(table);
2952
 
 
2953
 
        dict_hdr_get_new_id(&new_id, NULL, NULL);
 
2869
        new_id = dict_hdr_get_new_id(DICT_HDR_TABLE_ID);
2954
2870
 
2955
2871
        info = pars_info_create();
2956
2872
 
2957
2873
        pars_info_add_int4_literal(info, "space", (lint) table->space);
2958
 
        pars_info_add_ull_literal(info, "old_id", table->id);
2959
 
        pars_info_add_ull_literal(info, "new_id", new_id);
 
2874
        pars_info_add_dulint_literal(info, "old_id", table->id);
 
2875
        pars_info_add_dulint_literal(info, "new_id", new_id);
2960
2876
 
2961
2877
        err = que_eval_sql(info,
2962
2878
                           "PROCEDURE RENUMBER_TABLESPACE_PROC () IS\n"
3316
3232
                           "END;\n"
3317
3233
                           , FALSE, trx);
3318
3234
 
3319
 
        switch (err) {
 
3235
        if (err != DB_SUCCESS) {
 
3236
                ut_a(err == DB_OUT_OF_FILE_SPACE);
 
3237
 
 
3238
                err = DB_MUST_GET_MORE_FILE_SPACE;
 
3239
 
 
3240
                row_mysql_handle_errors(&err, trx, NULL, NULL);
 
3241
 
 
3242
                ut_error;
 
3243
        } else {
3320
3244
                ibool           is_temp;
3321
3245
                const char*     name_or_path;
3322
3246
                mem_heap_t*     heap;
3323
3247
 
3324
 
        case DB_SUCCESS:
3325
 
 
3326
3248
                heap = mem_heap_create(200);
3327
3249
 
3328
3250
                /* Clone the name, in case it has been allocated
3343
3265
 
3344
3266
                dict_table_remove_from_cache(table);
3345
3267
 
3346
 
                if (dict_load_table(name, TRUE) != NULL) {
 
3268
                if (dict_load_table(name) != NULL) {
3347
3269
                        ut_print_timestamp(stderr);
3348
3270
                        fputs("  InnoDB: Error: not able to remove table ",
3349
3271
                              stderr);
3388
3310
                }
3389
3311
 
3390
3312
                mem_heap_free(heap);
3391
 
                break;
3392
 
 
3393
 
        case DB_TOO_MANY_CONCURRENT_TRXS:
3394
 
                /* Cannot even find a free slot for the
3395
 
                the undo log. We can directly exit here
3396
 
                and return the DB_TOO_MANY_CONCURRENT_TRXS
3397
 
                error. */
3398
 
                break;
3399
 
 
3400
 
        case DB_OUT_OF_FILE_SPACE:
3401
 
                err = DB_MUST_GET_MORE_FILE_SPACE;
3402
 
 
3403
 
                row_mysql_handle_errors(&err, trx, NULL, NULL);
3404
 
 
3405
 
                /* Fall through to raise error */
3406
 
 
3407
 
        default:
3408
 
                /* No other possible error returns */
3409
 
                ut_error;
3410
3313
        }
3411
 
 
3412
3314
funct_exit:
3413
3315
 
3414
3316
        if (locked_dictionary) {
3424
3326
        return((int) err);
3425
3327
}
3426
3328
 
3427
 
/*********************************************************************//**
3428
 
Drop all temporary tables during crash recovery. */
3429
 
UNIV_INTERN
3430
 
void
3431
 
row_mysql_drop_temp_tables(void)
3432
 
/*============================*/
3433
 
{
3434
 
        trx_t*          trx;
3435
 
        btr_pcur_t      pcur;
3436
 
        mtr_t           mtr;
3437
 
        mem_heap_t*     heap;
3438
 
 
3439
 
        trx = trx_allocate_for_background();
3440
 
        trx->op_info = "dropping temporary tables";
3441
 
        row_mysql_lock_data_dictionary(trx);
3442
 
 
3443
 
        heap = mem_heap_create(200);
3444
 
 
3445
 
        mtr_start(&mtr);
3446
 
 
3447
 
        btr_pcur_open_at_index_side(
3448
 
                TRUE,
3449
 
                dict_table_get_first_index(dict_sys->sys_tables),
3450
 
                BTR_SEARCH_LEAF, &pcur, TRUE, &mtr);
3451
 
 
3452
 
        for (;;) {
3453
 
                const rec_t*    rec;
3454
 
                const byte*     field;
3455
 
                ulint           len;
3456
 
                const char*     table_name;
3457
 
                dict_table_t*   table;
3458
 
 
3459
 
                btr_pcur_move_to_next_user_rec(&pcur, &mtr);
3460
 
 
3461
 
                if (!btr_pcur_is_on_user_rec(&pcur)) {
3462
 
                        break;
3463
 
                }
3464
 
 
3465
 
                rec = btr_pcur_get_rec(&pcur);
3466
 
                field = rec_get_nth_field_old(rec, 4/*N_COLS*/, &len);
3467
 
                if (len != 4 || !(mach_read_from_4(field) & 0x80000000UL)) {
3468
 
                        continue;
3469
 
                }
3470
 
 
3471
 
                /* Because this is not a ROW_FORMAT=REDUNDANT table,
3472
 
                the is_temp flag is valid.  Examine it. */
3473
 
 
3474
 
                field = rec_get_nth_field_old(rec, 7/*MIX_LEN*/, &len);
3475
 
                if (len != 4
3476
 
                    || !(mach_read_from_4(field) & DICT_TF2_TEMPORARY)) {
3477
 
                        continue;
3478
 
                }
3479
 
 
3480
 
                /* This is a temporary table. */
3481
 
                field = rec_get_nth_field_old(rec, 0/*NAME*/, &len);
3482
 
                if (len == UNIV_SQL_NULL || len == 0) {
3483
 
                        /* Corrupted SYS_TABLES.NAME */
3484
 
                        continue;
3485
 
                }
3486
 
 
3487
 
                table_name = mem_heap_strdupl(heap, (const char*) field, len);
3488
 
 
3489
 
                btr_pcur_store_position(&pcur, &mtr);
3490
 
                btr_pcur_commit_specify_mtr(&pcur, &mtr);
3491
 
 
3492
 
                table = dict_load_table(table_name, TRUE);
3493
 
 
3494
 
                if (table) {
3495
 
                        row_drop_table_for_mysql(table_name, trx, FALSE);
3496
 
                        trx_commit_for_mysql(trx);
3497
 
                }
3498
 
 
3499
 
                mtr_start(&mtr);
3500
 
                btr_pcur_restore_position(BTR_SEARCH_LEAF,
3501
 
                                          &pcur, &mtr);
3502
 
        }
3503
 
 
3504
 
        btr_pcur_close(&pcur);
3505
 
        mtr_commit(&mtr);
3506
 
        mem_heap_free(heap);
3507
 
        row_mysql_unlock_data_dictionary(trx);
3508
 
        trx_free_for_background(trx);
3509
 
}
3510
 
 
3511
3329
/*******************************************************************//**
3512
3330
Drop all foreign keys in a database, see Bug#18942.
3513
3331
Called at the end of row_drop_database_for_mysql().
4001
3819
                an ALTER, not in a RENAME. */
4002
3820
 
4003
3821
                err = dict_load_foreigns(
4004
 
                        new_name, FALSE, !old_is_tmp || trx->check_foreigns);
 
3822
                        new_name, !old_is_tmp || trx->check_foreigns);
4005
3823
 
4006
3824
                if (err != DB_SUCCESS) {
4007
3825
                        ut_print_timestamp(stderr);
4057
3875
constraint is not broken, and calculates the number of index entries
4058
3876
in the read view of the current transaction.
4059
3877
@return TRUE if ok */
4060
 
UNIV_INTERN
 
3878
static
4061
3879
ibool
4062
 
row_check_index_for_mysql(
4063
 
/*======================*/
4064
 
        row_prebuilt_t*         prebuilt,       /*!< in: prebuilt struct
4065
 
                                                in MySQL handle */
4066
 
        const dict_index_t*     index,          /*!< in: index */
4067
 
        ulint*                  n_rows)         /*!< out: number of entries
4068
 
                                                seen in the consistent read */
 
3880
row_scan_and_check_index(
 
3881
/*=====================*/
 
3882
        row_prebuilt_t* prebuilt,       /*!< in: prebuilt struct in MySQL */
 
3883
        dict_index_t*   index,          /*!< in: index */
 
3884
        ulint*          n_rows)         /*!< out: number of entries seen in the
 
3885
                                        current consistent read */
4069
3886
{
4070
3887
        dtuple_t*       prev_entry      = NULL;
4071
3888
        ulint           matched_fields;
4086
3903
 
4087
3904
        *n_rows = 0;
4088
3905
 
 
3906
        if (!row_merge_is_index_usable(prebuilt->trx, index)) {
 
3907
                /* A newly created index may lack some delete-marked
 
3908
                records that may exist in the read view of
 
3909
                prebuilt->trx.  Thus, such indexes must not be
 
3910
                accessed by consistent read. */
 
3911
                return(is_ok);
 
3912
        }
 
3913
 
4089
3914
        buf = mem_alloc(UNIV_PAGE_SIZE);
4090
3915
        heap = mem_heap_create(100);
4091
3916
 
 
3917
        /* Make a dummy template in prebuilt, which we will use
 
3918
        in scanning the index entries */
 
3919
 
 
3920
        prebuilt->index = index;
 
3921
        /* row_merge_is_index_usable() was already checked above. */
 
3922
        prebuilt->index_usable = TRUE;
 
3923
        prebuilt->sql_stat_start = TRUE;
 
3924
        prebuilt->template_type = ROW_MYSQL_DUMMY_TEMPLATE;
 
3925
        prebuilt->n_template = 0;
 
3926
        prebuilt->need_to_access_clustered = FALSE;
 
3927
 
 
3928
        dtuple_set_n_fields(prebuilt->search_tuple, 0);
 
3929
 
 
3930
        prebuilt->select_lock_type = LOCK_NONE;
4092
3931
        cnt = 1000;
4093
3932
 
4094
3933
        ret = row_search_for_mysql(buf, PAGE_CUR_G, prebuilt, 0, 0);
4207
4046
}
4208
4047
 
4209
4048
/*********************************************************************//**
 
4049
Checks a table for corruption.
 
4050
@return DB_ERROR or DB_SUCCESS */
 
4051
UNIV_INTERN
 
4052
ulint
 
4053
row_check_table_for_mysql(
 
4054
/*======================*/
 
4055
        row_prebuilt_t* prebuilt)       /*!< in: prebuilt struct in MySQL
 
4056
                                        handle */
 
4057
{
 
4058
        dict_table_t*   table           = prebuilt->table;
 
4059
        dict_index_t*   index;
 
4060
        ulint           n_rows;
 
4061
        ulint           n_rows_in_table = ULINT_UNDEFINED;
 
4062
        ulint           ret             = DB_SUCCESS;
 
4063
        ulint           old_isolation_level;
 
4064
 
 
4065
        if (table->ibd_file_missing) {
 
4066
                ut_print_timestamp(stderr);
 
4067
                fprintf(stderr, "  InnoDB: Error:\n"
 
4068
                        "InnoDB: MySQL is trying to use a table handle"
 
4069
                        " but the .ibd file for\n"
 
4070
                        "InnoDB: table %s does not exist.\n"
 
4071
                        "InnoDB: Have you deleted the .ibd file"
 
4072
                        " from the database directory under\n"
 
4073
                        "InnoDB: the MySQL datadir, or have you"
 
4074
                        " used DISCARD TABLESPACE?\n"
 
4075
                        "InnoDB: Look from\n"
 
4076
                        "InnoDB: " REFMAN "innodb-troubleshooting.html\n"
 
4077
                        "InnoDB: how you can resolve the problem.\n",
 
4078
                        table->name);
 
4079
                return(DB_ERROR);
 
4080
        }
 
4081
 
 
4082
        prebuilt->trx->op_info = "checking table";
 
4083
 
 
4084
        old_isolation_level = prebuilt->trx->isolation_level;
 
4085
 
 
4086
        /* We must run the index record counts at an isolation level
 
4087
        >= READ COMMITTED, because a dirty read can see a wrong number
 
4088
        of records in some index; to play safe, we use always
 
4089
        REPEATABLE READ here */
 
4090
 
 
4091
        prebuilt->trx->isolation_level = TRX_ISO_REPEATABLE_READ;
 
4092
 
 
4093
        /* Enlarge the fatal lock wait timeout during CHECK TABLE. */
 
4094
        mutex_enter(&kernel_mutex);
 
4095
        srv_fatal_semaphore_wait_threshold += 7200; /* 2 hours */
 
4096
        mutex_exit(&kernel_mutex);
 
4097
 
 
4098
        index = dict_table_get_first_index(table);
 
4099
 
 
4100
        while (index != NULL) {
 
4101
                /* fputs("Validating index ", stderr);
 
4102
                ut_print_name(stderr, trx, FALSE, index->name);
 
4103
                putc('\n', stderr); */
 
4104
 
 
4105
                if (!btr_validate_index(index, prebuilt->trx)) {
 
4106
                        ret = DB_ERROR;
 
4107
                } else {
 
4108
                        if (!row_scan_and_check_index(prebuilt,index, &n_rows)){
 
4109
                                ret = DB_ERROR;
 
4110
                        }
 
4111
 
 
4112
                        if (trx_is_interrupted(prebuilt->trx)) {
 
4113
                                ret = DB_INTERRUPTED;
 
4114
                                break;
 
4115
                        }
 
4116
 
 
4117
                        /* fprintf(stderr, "%lu entries in index %s\n", n_rows,
 
4118
                        index->name); */
 
4119
 
 
4120
                        if (index == dict_table_get_first_index(table)) {
 
4121
                                n_rows_in_table = n_rows;
 
4122
                        } else if (n_rows != n_rows_in_table) {
 
4123
 
 
4124
                                ret = DB_ERROR;
 
4125
 
 
4126
                                fputs("Error: ", stderr);
 
4127
                                dict_index_name_print(stderr,
 
4128
                                                      prebuilt->trx, index);
 
4129
                                fprintf(stderr,
 
4130
                                        " contains %lu entries,"
 
4131
                                        " should be %lu\n",
 
4132
                                        (ulong) n_rows,
 
4133
                                        (ulong) n_rows_in_table);
 
4134
                        }
 
4135
                }
 
4136
 
 
4137
                index = dict_table_get_next_index(index);
 
4138
        }
 
4139
 
 
4140
        /* Restore the original isolation level */
 
4141
        prebuilt->trx->isolation_level = old_isolation_level;
 
4142
 
 
4143
        /* We validate also the whole adaptive hash index for all tables
 
4144
        at every CHECK TABLE */
 
4145
 
 
4146
        if (!btr_search_validate()) {
 
4147
 
 
4148
                ret = DB_ERROR;
 
4149
        }
 
4150
 
 
4151
        /* Restore the fatal lock wait timeout after CHECK TABLE. */
 
4152
        mutex_enter(&kernel_mutex);
 
4153
        srv_fatal_semaphore_wait_threshold -= 7200; /* 2 hours */
 
4154
        mutex_exit(&kernel_mutex);
 
4155
 
 
4156
        prebuilt->trx->op_info = "";
 
4157
 
 
4158
        return(ret);
 
4159
}
 
4160
 
 
4161
/*********************************************************************//**
4210
4162
Determines if a table is a magic monitor table.
4211
4163
@return TRUE if monitor table */
4212
4164
UNIV_INTERN