File: table_cache-t.cc

package info (click to toggle)
mysql-8.0 8.0.43-3
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 1,273,924 kB
  • sloc: cpp: 4,684,605; ansic: 412,450; pascal: 108,398; java: 83,641; perl: 30,221; cs: 27,067; sql: 26,594; sh: 24,181; python: 21,816; yacc: 17,169; php: 11,522; xml: 7,388; javascript: 7,076; makefile: 2,194; lex: 1,075; awk: 670; asm: 520; objc: 183; ruby: 97; lisp: 86
file content (974 lines) | stat: -rw-r--r-- 31,628 bytes parent folder | download
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
/* Copyright (c) 2012, 2025, Oracle and/or its affiliates.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License, version 2.0,
   as published by the Free Software Foundation.

   This program is designed to work with certain software (including
   but not limited to OpenSSL) that is licensed under separate terms,
   as designated in a particular file or component or in included license
   documentation.  The authors of MySQL hereby grant you an additional
   permission to link the program and your derivative works with the
   separately licensed software that they have either included with
   the program or referenced in the documentation.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License, version 2.0, for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA */

#include <gtest/gtest.h>
#include <sys/types.h>

#include "lex_string.h"
#include "my_inttypes.h"
#include "sql/mysqld_thd_manager.h"
#include "sql/table_cache.h"
#include "storage/example/ha_example.h"
#include "unittest/gunit/test_utils.h"

/*
  We need example_hton to be able short-cut creation of example
  handler instances for mock TABLE objects.
*/
extern handlerton *example_hton;

namespace table_cache_unittest {

using my_testing::Server_initializer;

#ifdef SAFE_MUTEX
static const char *assert_string = ".*Assertion.*count > 0.*my_thread_equal.*";
#endif

/**
  Test fixture for basic tests involving Table_cache
  and Table_cache_manager classes.

  Unlike more advanced fixture it doesn't initialize
  table cache manager, but only prepares THD objects
  necessary for testing.
*/

class TableCacheBasicTest : public ::testing::Test {
 protected:
  static const uint MAX_THREADS = 3;

  void SetUp() override {
    Global_THD_manager *thd_manager = Global_THD_manager::get_instance();
    thd_manager->set_unit_test();
    // Reset thread ID counter for each test.
    thd_manager->set_thread_id_counter(1);
    for (uint i = 0; i < MAX_THREADS; ++i) {
      initializer[i].SetUp();
    }

    ::testing::FLAGS_gtest_death_test_style = "threadsafe";
  }
  void TearDown() override {
    for (uint i = 0; i < MAX_THREADS; ++i) initializer[i].TearDown();
  }

  THD *get_thd(uint index) { return initializer[index].thd(); }

  Server_initializer initializer[MAX_THREADS];
};

/**
  A more advanced fixture that also initializes table_cache_manager
  with one Table_cache instance and TDC.
*/

class TableCacheSingleCacheTest : public TableCacheBasicTest {
 protected:
  virtual uint CachesNumber() { return 1; }
  void SetUp() override {
    TableCacheBasicTest::SetUp();

    /*
      In addition to table_cache_manager we want to have initialized
      TDC so we can use its HASH object for calculating hash values
      and be able to free TABLE objects correctly (we need LOCK_open
      initialized for this).
    */
    table_cache_instances = CachesNumber();
    table_cache_size_per_instance = 100;
    ASSERT_FALSE(table_def_init());
  }
  void TearDown() override {
    table_def_free();
    TableCacheBasicTest::TearDown();
  }
};

/**
  Another advanced fixture that also initializes table_cache_manager
  with two Table_cache instances and TDC.
*/

class TableCacheDoubleCacheTest : public TableCacheSingleCacheTest {
 protected:
  uint CachesNumber() override { return 2; }
};

/**
  Class for mock TABLE_SHARE object which also allows to create
  associated TABLE objects which are usable with Table_cache.
*/

class Mock_share : public TABLE_SHARE {
  MEM_ROOT m_mem_root;
  Table_cache_element *cache_element_arr[Table_cache_manager::MAX_TABLE_CACHES];

 public:
  Mock_share(const char *key)
      :  // Assertion in some of Table_cache methods check that the
         // version of the share is up-to-date, so make sure it's set.
        TABLE_SHARE(refresh_version, false),
        // MEM_ROOT is used for constructing ha_example() instances.
        m_mem_root(PSI_NOT_INSTRUMENTED, 1024) {
    /*
      Both table_cache_key and cache_element array are used by
      Table_cache code.
    */
    table_cache_key.str = key;
    table_cache_key.length = strlen(key);
    memset(cache_element_arr, 0, sizeof(cache_element_arr));
    cache_element = cache_element_arr;
    // Ensure that share is never destroyed.
    increment_ref_count();
  }

  ~Mock_share() { m_mem_root.Clear(); }

  TABLE *create_table(THD *thd) {
    TABLE *result =
        (TABLE *)my_malloc(PSI_NOT_INSTRUMENTED, sizeof(TABLE), MYF(0));
    new (result) TABLE;

    result->s = this;
    // We create TABLE which is already marked as used
    result->in_use = thd;
    /*
      Assertions in some of Table_cache methods need non-NULL
      TABLE::file and TABLE::db_stat. Code that frees unused
      TABLE objects needs proper "handler" instance.
    */
    result->file = new (&m_mem_root) ha_example(example_hton, this);
    result->db_stat = HA_READ_ONLY;

    return result;
  }

  void destroy_table(TABLE *table) { my_free(table); }
};

// Google Test recommends DeathTest suffix for classes used in death tests.
typedef TableCacheBasicTest TableCacheBasicDeathTest;
typedef TableCacheDoubleCacheTest TableCacheDoubleCacheDeathTest;

/*
  Test initilization/destruction of Table_cache.
*/

TEST_F(TableCacheBasicDeathTest, CacheCreateAndDestroy) {
  Table_cache table_cache;

  ASSERT_FALSE(table_cache.init());

  // Cache should be empty after creation
  EXPECT_EQ(0U, table_cache.cached_tables());

  // Cache should be not locked after creation
#ifdef SAFE_MUTEX
  EXPECT_DEATH_IF_SUPPORTED(table_cache.assert_owner(), assert_string);
#endif
  table_cache.destroy();
}

/*
  Test locking for Table_cache object.
*/

TEST_F(TableCacheBasicDeathTest, CacheLockAndUnlock) {
  Table_cache table_cache;

  ASSERT_FALSE(table_cache.init());

#ifdef SAFE_MUTEX
  // Cache should not be locked after creation
  EXPECT_DEATH_IF_SUPPORTED(table_cache.assert_owner(), assert_string);
#endif

  // And get locked after we call its lock() method
  table_cache.lock();
  table_cache.assert_owner();

  // And get unlocked after we call its unlock() method
  table_cache.unlock();
#ifdef SAFE_MUTEX
  EXPECT_DEATH_IF_SUPPORTED(table_cache.assert_owner(), assert_string);
#endif

  table_cache.destroy();
}

/*
  Tests for the rest of methods of Table_cache need to use an
  object controlled by the global instance of Table_cache_manager.
  Let us start testing of Table_cache_manager with test for
  its initialization/destruction. This test also covers well
  Table_cache_manager::get_cache() method.
*/

TEST_F(TableCacheBasicDeathTest, ManagerCreateAndDestroy) {
  // Request two instances of Table_cache
  table_cache_instances = 2;

  ASSERT_FALSE(table_cache_manager.init());

  // All caches are empty after creation
  EXPECT_EQ(0U, table_cache_manager.cached_tables());

  // There should be two different caches in the manager
  Table_cache *cache_1, *cache_2, *cache_3;
  cache_1 = table_cache_manager.get_cache(get_thd(0));
  cache_2 = table_cache_manager.get_cache(get_thd(1));
  cache_3 = table_cache_manager.get_cache(get_thd(2));
  EXPECT_TRUE(cache_1 != cache_2);
  // And not three !
  EXPECT_TRUE(cache_3 == cache_1);

  // Both caches should be empty
  EXPECT_EQ(0U, cache_1->cached_tables());
  EXPECT_EQ(0U, cache_2->cached_tables());

  // And not locked
#ifdef SAFE_MUTEX
  EXPECT_DEATH_IF_SUPPORTED(cache_1->assert_owner(), assert_string);
  EXPECT_DEATH_IF_SUPPORTED(cache_2->assert_owner(), assert_string);
#endif

  table_cache_manager.destroy();
}

/**
  Add a TABLE to a table cache and increment the reference count of
  its TABLE_SHARE.
*/
void add_used_table(Table_cache *table_cache, THD *thd, TABLE *table) {
  table->s->increment_ref_count();
  EXPECT_FALSE(table_cache->add_used_table(thd, table));
}

/*
  Test addition and removal of TABLE objects to/from the table cache.
*/

TEST_F(TableCacheSingleCacheTest, CacheAddAndRemove) {
  THD *thd = get_thd(0);

  Mock_share share_1("share_1");
  TABLE *table_1 = share_1.create_table(thd);

  Table_cache *table_cache = table_cache_manager.get_cache(thd);
  table_cache->lock();
  add_used_table(table_cache, thd, table_1);

  // There should be one TABLE in the cache after we have added table_1.
  EXPECT_EQ(1U, table_cache->cached_tables());

  // There should be no unused TABLE objects for the same table in the
  // cache. OTOH it should contain info about table share of table_1.
  TABLE *table_2;
  TABLE_SHARE *share_2;
  table_2 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_2 == nullptr);
  EXPECT_TRUE(share_2 == &share_1);

  // Table_cache_iterator should be able to find only one TABLE instance
  // in all caches. And this instance should be table_1.
  Table_cache_iterator it(&share_1);
  EXPECT_TRUE(it++ == table_1);
  EXPECT_TRUE(it++ == nullptr);

  // We must be able to release TABLE into table cache and reuse it after
  // this.
  table_cache->release_table(thd, table_1);
  table_2 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_2 == table_1);
  EXPECT_TRUE(share_2 == &share_1);

  table_cache->remove_table(table_1);

  // Once TABLE is removed from the cache the latter should become empty.
  EXPECT_EQ(0U, table_cache->cached_tables());

  table_2 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_2 == nullptr);
  EXPECT_TRUE(share_2 == nullptr);

  it.rewind();
  EXPECT_TRUE(it++ == nullptr);

  // Also it should be possible to remove unused TABLE from the cache
  // Add TABLE instance and mark it as unused
  add_used_table(table_cache, thd, table_1);
  table_cache->release_table(thd, table_1);

  table_cache->remove_table(table_1);

  // Once TABLE is removed from cache the latter should become empty.
  EXPECT_EQ(0U, table_cache->cached_tables());

  table_2 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_2 == nullptr);
  EXPECT_TRUE(share_2 == nullptr);

  table_cache->unlock();

  share_1.destroy_table(table_1);
}

/*
  Now let us test how Table_cache handles overflows.
*/

TEST_F(TableCacheSingleCacheTest, CacheOverflow) {
  THD *thd = get_thd(0);

  // Set cache size low so it will overflow quickly.
  table_cache_size_per_instance = 2;

  Mock_share share_1("share_1");
  Mock_share share_2("share_2");
  TABLE *table_1 = share_1.create_table(thd);
  TABLE *table_2 = share_1.create_table(thd);
  TABLE *table_3 = share_2.create_table(thd);

  Table_cache *table_cache = table_cache_manager.get_cache(thd);

  table_cache->lock();
  add_used_table(table_cache, thd, table_1);
  add_used_table(table_cache, thd, table_2);

  // There should be two TABLE instances in the cache.
  EXPECT_EQ(2U, table_cache->cached_tables());

  table_cache->release_table(thd, table_1);
  table_cache->release_table(thd, table_2);

  // Still there should be two TABLE instances in the cache.
  EXPECT_EQ(2U, table_cache->cached_tables());

  add_used_table(table_cache, thd, table_3);

  // One TABLE was added and one expelled (table_1), so still two TABLE objects.
  EXPECT_EQ(2U, table_cache->cached_tables());

  // Old value of table_1 points to garbage thanks to expelling
  table_1 = share_1.create_table(thd);
  add_used_table(table_cache, thd, table_1);

  // Still two TABLE instances (table_2 was expelled).
  EXPECT_EQ(2U, table_cache->cached_tables());

  // Old value of table_2 points to garbage thanks to expelling
  table_2 = share_1.create_table(thd);
  add_used_table(table_cache, thd, table_2);

  /*
    Now we should have three TABLE instances in cache since all
    of them are used.
  */
  EXPECT_EQ(3U, table_cache->cached_tables());

  table_cache->release_table(thd, table_2);

  // The first table that gets released is expelled.
  EXPECT_EQ(2U, table_cache->cached_tables());

  table_cache->remove_table(table_1);
  table_cache->remove_table(table_3);

  // Cache should be empty after that
  EXPECT_EQ(0U, table_cache->cached_tables());

  table_cache->unlock();

  share_1.destroy_table(table_1);
  share_1.destroy_table(table_3);
}

TEST_F(TableCacheSingleCacheTest, CacheGetAndRelease) {
  THD *thd = get_thd(0);

  Table_cache *table_cache = table_cache_manager.get_cache(thd);

  table_cache->lock();

  TABLE *table_1, *table_2, *table_3;
  Mock_share share_1("share_1"), share_0("share_0");
  TABLE_SHARE *share_2;

  // There should be no TABLE in cache, nor information about share.
  table_1 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_1 == nullptr);
  EXPECT_TRUE(share_2 == nullptr);

  table_1 = share_1.create_table(thd);
  add_used_table(table_cache, thd, table_1);

  // There should be no unused TABLE in cache, but there should be
  // information about the share.
  table_2 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_2 == nullptr);
  EXPECT_TRUE(share_2 == &share_1);

  // There should be even no information about the share for which
  // TABLE was not added to cache.
  table_2 = table_cache->get_table(thd, share_0.table_cache_key.str,
                                   share_0.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_2 == nullptr);
  EXPECT_TRUE(share_2 == nullptr);

  table_2 = share_1.create_table(thd);
  add_used_table(table_cache, thd, table_2);

  // Still there should be no unused TABLE in cache, but there should
  // be information about the share.
  table_3 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 == nullptr);
  EXPECT_TRUE(share_2 == &share_1);

  table_cache->release_table(thd, table_1);

  // After releasing one of TABLE objects it should be possible to get
  // unused TABLE from cache.
  table_3 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 == table_1);
  EXPECT_TRUE(share_2 == &share_1);

  // But only once!
  table_3 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 == nullptr);
  EXPECT_TRUE(share_2 == &share_1);

  // After releasing of both TABLE objects it should be possible to
  // get two unused TABLE objects from cache (for 'share_1').
  // There should be nothing for 'share_0'.
  table_cache->release_table(thd, table_1);
  table_cache->release_table(thd, table_2);

  table_3 = table_cache->get_table(thd, share_0.table_cache_key.str,
                                   share_0.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 == nullptr);
  EXPECT_TRUE(share_2 == nullptr);

  table_3 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 != nullptr);
  EXPECT_TRUE(share_2 == &share_1);
  table_3 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 != nullptr);
  EXPECT_TRUE(share_2 == &share_1);
  table_3 = table_cache->get_table(thd, share_1.table_cache_key.str,
                                   share_1.table_cache_key.length, &share_2);
  EXPECT_TRUE(table_3 == nullptr);
  EXPECT_TRUE(share_2 == &share_1);

  // Clean-up
  table_cache->remove_table(table_1);
  table_cache->remove_table(table_2);

  share_1.destroy_table(table_1);
  share_1.destroy_table(table_2);

  table_cache->unlock();
}

/*
  Test for Table_cache_manager/Table_cache::free_all_unused_tables().
*/

TEST_F(TableCacheDoubleCacheTest, ManagerFreeAllUnused) {
  THD *thd_1 = get_thd(0);
  THD *thd_2 = get_thd(1);

  Table_cache *table_cache_1 = table_cache_manager.get_cache(thd_1);
  Table_cache *table_cache_2 = table_cache_manager.get_cache(thd_2);

  // There should be no TABLE instances in all cachea.
  EXPECT_EQ(0U, table_cache_manager.cached_tables());

  Mock_share share_1("share_1");
  Mock_share share_2("share_2");
  Mock_share share_3("share_2");
  TABLE *table_1 = share_1.create_table(thd_1);
  TABLE *table_2 = share_1.create_table(thd_1);
  TABLE *table_3 = share_2.create_table(thd_1);
  TABLE *table_4 = share_2.create_table(thd_1);
  TABLE *table_5 = share_1.create_table(thd_2);
  TABLE *table_6 = share_3.create_table(thd_2);

  table_cache_manager.lock_all_and_tdc();

  add_used_table(table_cache_1, thd_1, table_1);
  add_used_table(table_cache_1, thd_1, table_2);
  add_used_table(table_cache_1, thd_1, table_3);
  add_used_table(table_cache_1, thd_1, table_4);
  add_used_table(table_cache_2, thd_2, table_5);
  add_used_table(table_cache_2, thd_2, table_6);

  EXPECT_EQ(4U, table_cache_1->cached_tables());
  EXPECT_EQ(2U, table_cache_2->cached_tables());
  EXPECT_EQ(6U, table_cache_manager.cached_tables());

  table_cache_manager.free_all_unused_tables();

  // All TABLE instances should stay around in caches as
  // all of them are used.
  EXPECT_EQ(4U, table_cache_1->cached_tables());
  EXPECT_EQ(2U, table_cache_2->cached_tables());
  EXPECT_EQ(6U, table_cache_manager.cached_tables());

  table_cache_1->release_table(thd_1, table_1);

  table_cache_manager.free_all_unused_tables();

  // One table should be freed. So there should be 3 + 2 TABLE instances.
  EXPECT_EQ(3U, table_cache_1->cached_tables());
  EXPECT_EQ(2U, table_cache_2->cached_tables());
  EXPECT_EQ(5U, table_cache_manager.cached_tables());

  table_cache_1->release_table(thd_1, table_2);
  table_cache_1->release_table(thd_1, table_3);
  table_cache_2->release_table(thd_2, table_5);

  table_cache_manager.free_all_unused_tables();

  // Now there should be 1 + 1 used TABLE instances left.
  EXPECT_EQ(1U, table_cache_1->cached_tables());
  EXPECT_EQ(1U, table_cache_2->cached_tables());
  EXPECT_EQ(2U, table_cache_manager.cached_tables());

  table_cache_1->release_table(thd_1, table_4);

  table_cache_manager.free_all_unused_tables();

  // There should be 0 + 1 TABLE instances around.
  EXPECT_EQ(0U, table_cache_1->cached_tables());
  EXPECT_EQ(1U, table_cache_2->cached_tables());
  EXPECT_EQ(1U, table_cache_manager.cached_tables());

  table_cache_2->release_table(thd_2, table_6);

  table_cache_manager.free_all_unused_tables();

  // All caches should become empty.
  EXPECT_EQ(0U, table_cache_1->cached_tables());
  EXPECT_EQ(0U, table_cache_2->cached_tables());
  EXPECT_EQ(0U, table_cache_manager.cached_tables());

  table_cache_manager.unlock_all_and_tdc();
}

/*
  Test for Table_cache_manager/Table_cache::cached_tables().
*/

TEST_F(TableCacheDoubleCacheTest, ManagerCachedTables) {
  THD *thd_1 = get_thd(0);
  THD *thd_2 = get_thd(1);

  Table_cache *table_cache_1 = table_cache_manager.get_cache(thd_1);
  Table_cache *table_cache_2 = table_cache_manager.get_cache(thd_2);

  // There should be no TABLE instances in all cachea.
  EXPECT_EQ(0U, table_cache_1->cached_tables());
  EXPECT_EQ(0U, table_cache_2->cached_tables());
  EXPECT_EQ(0U, table_cache_manager.cached_tables());

  Mock_share share_1("share_1");
  Mock_share share_2("share_2");
  TABLE *table_1 = share_1.create_table(thd_1);
  TABLE *table_2 = share_1.create_table(thd_1);
  TABLE *table_3 = share_2.create_table(thd_1);
  TABLE *table_4 = share_1.create_table(thd_2);
  TABLE *table_5 = share_2.create_table(thd_2);

  table_cache_manager.lock_all_and_tdc();

  add_used_table(table_cache_1, thd_1, table_1);
  add_used_table(table_cache_1, thd_1, table_2);
  add_used_table(table_cache_1, thd_1, table_3);

  // There should be 3 + 0 TABLE objects in cache
  EXPECT_EQ(3U, table_cache_1->cached_tables());
  EXPECT_EQ(0U, table_cache_2->cached_tables());
  EXPECT_EQ(3U, table_cache_manager.cached_tables());

  add_used_table(table_cache_2, thd_2, table_4);
  add_used_table(table_cache_2, thd_2, table_5);

  // There should be 3 + 2 TABLE objects in cache
  EXPECT_EQ(3U, table_cache_1->cached_tables());
  EXPECT_EQ(2U, table_cache_2->cached_tables());
  EXPECT_EQ(5U, table_cache_manager.cached_tables());

  table_cache_1->release_table(thd_1, table_1);
  table_cache_2->release_table(thd_2, table_4);

  // There should be the same number of TABLE objects - 3 + 2
  EXPECT_EQ(3U, table_cache_1->cached_tables());
  EXPECT_EQ(2U, table_cache_2->cached_tables());
  EXPECT_EQ(5U, table_cache_manager.cached_tables());

  table_cache_2->remove_table(table_5);

  // There should be 3 + 1 TABLE objects in cache
  EXPECT_EQ(3U, table_cache_1->cached_tables());
  EXPECT_EQ(1U, table_cache_2->cached_tables());
  EXPECT_EQ(4U, table_cache_manager.cached_tables());

  table_cache_1->remove_table(table_1);
  table_cache_2->remove_table(table_4);

  // There should be 2 + 0 TABLE objects in cache
  EXPECT_EQ(2U, table_cache_1->cached_tables());
  EXPECT_EQ(0U, table_cache_2->cached_tables());
  EXPECT_EQ(2U, table_cache_manager.cached_tables());

  table_cache_1->remove_table(table_2);
  table_cache_1->remove_table(table_3);

  // Caches should be empty
  EXPECT_EQ(0U, table_cache_1->cached_tables());
  EXPECT_EQ(0U, table_cache_2->cached_tables());
  EXPECT_EQ(0U, table_cache_manager.cached_tables());

  table_cache_manager.unlock_all_and_tdc();

  share_1.destroy_table(table_1);
  share_1.destroy_table(table_2);
  share_2.destroy_table(table_3);
  share_1.destroy_table(table_4);
  share_2.destroy_table(table_5);
}

/*
  Coverage for lock and unlock methods of Table_cache_manager class.
*/

TEST_F(TableCacheDoubleCacheDeathTest, ManagerLockAndUnlock) {
// Nor caches nor LOCK_open should not be locked after initialization
#ifdef SAFE_MUTEX
  EXPECT_DEATH_IF_SUPPORTED(table_cache_manager.assert_owner_all(),
                            assert_string);
  EXPECT_DEATH_IF_SUPPORTED(table_cache_manager.assert_owner_all_and_tdc(),
                            assert_string);
#endif

  // And get locked after we call its lock_all_and_tdc() method.
  table_cache_manager.lock_all_and_tdc();
  table_cache_manager.assert_owner_all();
  table_cache_manager.assert_owner_all_and_tdc();

  // In addition to Table_cache_manager method we check this by
  // calling Table_cache methods and asserting state of LOCK_open.
  Table_cache *cache_1 = table_cache_manager.get_cache(get_thd(0));
  Table_cache *cache_2 = table_cache_manager.get_cache(get_thd(1));

  cache_1->assert_owner();
  cache_2->assert_owner();
  mysql_mutex_assert_owner(&LOCK_open);

  // Locks should be unlocked after we call unlock method
  table_cache_manager.unlock_all_and_tdc();

#ifdef SAFE_MUTEX
  EXPECT_DEATH_IF_SUPPORTED(table_cache_manager.assert_owner_all(),
                            assert_string);
  EXPECT_DEATH_IF_SUPPORTED(table_cache_manager.assert_owner_all_and_tdc(),
                            assert_string);
#endif
}

/*
  Coverage for Table_cache_manager::free_table();
*/

TEST_F(TableCacheDoubleCacheDeathTest, ManagerFreeTable) {
  THD *thd_1 = get_thd(0);
  THD *thd_2 = get_thd(1);

  Table_cache *table_cache_1 = table_cache_manager.get_cache(thd_1);
  Table_cache *table_cache_2 = table_cache_manager.get_cache(thd_2);

  Mock_share share_1("share_1");
  Mock_share share_2("share_2");
  TABLE *table_1 = share_1.create_table(thd_1);
  TABLE *table_2 = share_1.create_table(thd_1);
  TABLE *table_3 = share_2.create_table(thd_1);
  TABLE *table_4 = share_1.create_table(thd_2);
  TABLE *table_5 = share_2.create_table(thd_2);

  table_cache_manager.lock_all_and_tdc();

  /*
    Coverage for TDC_RT_REMOVE_ALL case.
  */
  add_used_table(table_cache_1, thd_1, table_1);
  add_used_table(table_cache_1, thd_1, table_2);
  table_cache_1->release_table(thd_1, table_2);
  add_used_table(table_cache_1, thd_1, table_3);
  add_used_table(table_cache_2, thd_2, table_4);
  add_used_table(table_cache_2, thd_2, table_5);

  EXPECT_EQ(5U, table_cache_manager.cached_tables());

  // Added three tables for share_1 and two tables for share_2. The
  // reference count should be one higher due to Mock_share's
  // constructor setting it to 1.
  EXPECT_EQ(4U, share_1.ref_count());
  EXPECT_EQ(3U, share_2.ref_count());

  // There should be assert failure since we are trying
  // to free all tables for share_1, while some tables
  // are in use.
#ifndef NDEBUG
  EXPECT_DEATH_IF_SUPPORTED(
      table_cache_manager.free_table(thd_1, TDC_RT_REMOVE_ALL, &share_1),
      ".*Assertion.*is_empty.*");
#endif

  table_cache_1->release_table(thd_1, table_1);
  table_cache_2->release_table(thd_2, table_4);

  // After all tables for share_1 marked as unused freeing
  // all tables should succeed.
  table_cache_manager.free_table(thd_1, TDC_RT_REMOVE_ALL, &share_1);

  // After all the tables for share_1 are freed, the reference count
  // should go down to 1. Not to 0, since Mock_share sets it to 1 in
  // its constructor.
  EXPECT_EQ(1U, share_1.ref_count());

  // We still should have 2 TABLE objects for share_2.
  EXPECT_EQ(2U, table_cache_manager.cached_tables());

  /*
    Coverage for TDC_RT_REMOVE_NOT_OWN case.
  */
  table_1 = share_1.create_table(thd_1);
  table_2 = share_1.create_table(thd_1);
  table_4 = share_1.create_table(thd_2);

  add_used_table(table_cache_1, thd_1, table_1);
  add_used_table(table_cache_1, thd_1, table_2);
  table_cache_1->release_table(thd_1, table_2);
  add_used_table(table_cache_2, thd_2, table_4);

  EXPECT_EQ(5U, table_cache_manager.cached_tables());

  // There should be assert failure since we are trying
  // to free all not own TABLEs for share_1, while thd_2
  // has a TABLE object for it in used
#ifndef NDEBUG
  EXPECT_DEATH_IF_SUPPORTED(
      table_cache_manager.free_table(thd_1, TDC_RT_REMOVE_NOT_OWN, &share_1),
      ".*Assertion.*0.*");
#endif

  table_cache_2->release_table(thd_2, table_4);

  // After TABLE owned by thd_2 is marked as unused, the below
  // call should succeed.
  table_cache_manager.free_table(thd_1, TDC_RT_REMOVE_NOT_OWN, &share_1);

  // We still have 1 TABLE object for share_1 in thd_1 and
  // 2 TABLE objects for share_2.
  EXPECT_EQ(3U, table_cache_manager.cached_tables());

  /*
    Coverage for TDC_RT_REMOVE_UNUSED case.
  */
  table_2 = share_1.create_table(thd_1);
  table_4 = share_1.create_table(thd_2);

  add_used_table(table_cache_1, thd_1, table_2);
  table_cache_1->release_table(thd_1, table_2);
  add_used_table(table_cache_2, thd_2, table_4);

  EXPECT_EQ(5U, table_cache_manager.cached_tables());

  table_cache_manager.free_table(thd_1, TDC_RT_REMOVE_UNUSED, &share_1);

  // The above call should have been freed only 1 table.
  EXPECT_EQ(4U, table_cache_manager.cached_tables());

  // Mark all remaining TABLE objects for share_1 as unused
  table_cache_1->release_table(thd_1, table_1);
  table_cache_2->release_table(thd_2, table_4);

  table_cache_manager.free_table(thd_1, TDC_RT_REMOVE_UNUSED, &share_1);

  // The above call should free all unused TABLE objects for share_1.
  // Therefore only 2 objects for share_2 should be remaining
  EXPECT_EQ(2U, table_cache_manager.cached_tables());

  // Clean-up.
  table_cache_1->remove_table(table_3);
  table_cache_2->remove_table(table_5);

  share_2.destroy_table(table_3);
  share_2.destroy_table(table_5);

  table_cache_manager.unlock_all_and_tdc();
}

/*
  Coverage for Table_cache_iterator
*/

TEST_F(TableCacheDoubleCacheTest, Iterator) {
  THD *thd_1 = get_thd(0);
  THD *thd_2 = get_thd(1);

  table_cache_manager.lock_all_and_tdc();

  Mock_share share_1("share_1");
  Mock_share share_2("share_2");

  // There is no TABLE objects for share_1 so the below iterator
  // should not find anything.
  Table_cache_iterator it(&share_1);
  EXPECT_TRUE(it++ == nullptr);
  // Attempt to iterate behind the end should not give anything.
  EXPECT_TRUE(it++ == nullptr);

  Table_cache *table_cache_1 = table_cache_manager.get_cache(thd_1);
  Table_cache *table_cache_2 = table_cache_manager.get_cache(thd_2);
  TABLE *table_1 = share_1.create_table(thd_1);
  TABLE *table_2 = share_1.create_table(thd_1);
  TABLE *table_3 = share_2.create_table(thd_1);
  TABLE *table_4 = share_1.create_table(thd_2);
  TABLE *table_5 = share_2.create_table(thd_2);

  add_used_table(table_cache_2, thd_2, table_4);

  // Now the iterato should see table_4.
  it.rewind();
  TABLE *table_r1 = it++;
  EXPECT_TRUE(table_r1 == table_4);
  // But only it.
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  add_used_table(table_cache_1, thd_1, table_1);

  // Now we should see two tables:
  it.rewind();
  table_r1 = it++;
  EXPECT_TRUE(table_r1 != nullptr);
  TABLE *table_r2 = it++;
  EXPECT_TRUE(table_r2 != nullptr);
  EXPECT_TRUE(table_r1 != table_r2);
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  add_used_table(table_cache_1, thd_1, table_2);

  // And now three !
  it.rewind();
  table_r1 = it++;
  EXPECT_TRUE(table_r1 != nullptr);
  table_r2 = it++;
  EXPECT_TRUE(table_r2 != nullptr);
  TABLE *table_r3 = it++;
  EXPECT_TRUE(table_r3 != nullptr);
  EXPECT_TRUE(table_r1 != table_r2 && table_r1 != table_r3 &&
              table_r2 != table_r3);
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  table_cache_1->release_table(thd_1, table_1);

  // We should be seeing only used TABLE objects, so two tables now
  it.rewind();
  table_r1 = it++;
  EXPECT_TRUE(table_r1 != nullptr);
  table_r2 = it++;
  EXPECT_TRUE(table_r2 != nullptr);
  EXPECT_TRUE(table_r1 != table_r2);
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  add_used_table(table_cache_1, thd_1, table_3);
  add_used_table(table_cache_2, thd_2, table_5);

  // We also should not be seeing TABLE objects for share_2
  it.rewind();
  table_r1 = it++;
  EXPECT_TRUE(table_r1 != nullptr);
  table_r2 = it++;
  EXPECT_TRUE(table_r2 != nullptr);
  EXPECT_TRUE(table_r1 != table_r2);
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  table_cache_1->remove_table(table_2);

  // Now we should se only one used TABLE
  it.rewind();
  table_r1 = it++;
  EXPECT_TRUE(table_r1 == table_4);
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  table_cache_1->remove_table(table_4);

  // And now no used TABLE objects for share_1 at all
  it.rewind();
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  table_cache_1->remove_table(table_1);

  // Still the same
  it.rewind();
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  table_cache_1->remove_table(table_3);
  table_cache_2->remove_table(table_5);

  // Cache is empty so iterator should not show any TABLE objects.
  it.rewind();
  EXPECT_TRUE(it++ == nullptr);
  EXPECT_TRUE(it++ == nullptr);

  table_cache_manager.unlock_all_and_tdc();

  share_1.destroy_table(table_1);
  share_1.destroy_table(table_2);
  share_2.destroy_table(table_3);
  share_1.destroy_table(table_4);
  share_2.destroy_table(table_5);
}

}  // namespace table_cache_unittest