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
|
/* Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
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 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,
51 Franklin Street, Suite 500, Boston, MA 02110-1335 USA */
/**
@file storage/perfschema/pfs_instr_class.cc
Performance schema instruments meta data (implementation).
*/
#include "my_global.h"
#include "my_sys.h"
#include "pfs_instr_class.h"
#include "pfs_instr.h"
#include "pfs_global.h"
#include "pfs_events_waits.h"
#include "pfs_atomic.h"
#include "mysql/psi/mysql_thread.h"
#include "lf.h"
#include <string.h>
/**
@defgroup Performance_schema_buffers Performance Schema Buffers
@ingroup Performance_schema_implementation
@{
*/
/**
Global performance schema flag.
Indicate if the performance schema is enabled.
This flag is set at startup, and never changes.
*/
my_bool pfs_enabled= TRUE;
/**
Current number of elements in mutex_class_array.
This global variable is written to during:
- the performance schema initialization
- a plugin initialization
*/
static volatile uint32 mutex_class_dirty_count= 0;
static volatile uint32 mutex_class_allocated_count= 0;
static volatile uint32 rwlock_class_dirty_count= 0;
static volatile uint32 rwlock_class_allocated_count= 0;
static volatile uint32 cond_class_dirty_count= 0;
static volatile uint32 cond_class_allocated_count= 0;
/** Size of the mutex class array. @sa mutex_class_array */
ulong mutex_class_max= 0;
/** Number of mutex class lost. @sa mutex_class_array */
ulong mutex_class_lost= 0;
/** Size of the rwlock class array. @sa rwlock_class_array */
ulong rwlock_class_max= 0;
/** Number of rwlock class lost. @sa rwlock_class_array */
ulong rwlock_class_lost= 0;
/** Size of the condition class array. @sa cond_class_array */
ulong cond_class_max= 0;
/** Number of condition class lost. @sa cond_class_array */
ulong cond_class_lost= 0;
/** Size of the thread class array. @sa thread_class_array */
ulong thread_class_max= 0;
/** Number of thread class lost. @sa thread_class_array */
ulong thread_class_lost= 0;
/** Size of the file class array. @sa file_class_array */
ulong file_class_max= 0;
/** Number of file class lost. @sa file_class_array */
ulong file_class_lost= 0;
/** Size of the table share array. @sa table_share_array */
ulong table_share_max= 0;
/** Number of table share lost. @sa table_share_array */
ulong table_share_lost= 0;
static PFS_mutex_class *mutex_class_array= NULL;
static PFS_rwlock_class *rwlock_class_array= NULL;
static PFS_cond_class *cond_class_array= NULL;
/**
Current number or elements in thread_class_array.
This global variable is written to during:
- the performance schema initialization
- a plugin initialization
*/
static volatile uint32 thread_class_dirty_count= 0;
static volatile uint32 thread_class_allocated_count= 0;
static PFS_thread_class *thread_class_array= NULL;
/**
Table instance array.
@sa table_share_max
@sa table_share_lost
@sa table_share_hash
*/
PFS_table_share *table_share_array= NULL;
PFS_instr_class global_table_class=
{
"wait/table", /* name */
10, /* name length */
0, /* flags */
true, /* enabled */
true, /* timed */
{ &flag_events_waits_current, NULL, 0, 0, 0, 0} /* wait stat chain */
};
/** Hash table for instrumented tables. */
static LF_HASH table_share_hash;
/** True if table_share_hash is initialized. */
static bool table_share_hash_inited= false;
C_MODE_START
/** Get hash table key for instrumented tables. */
static uchar *table_share_hash_get_key(const uchar *, size_t *, my_bool);
C_MODE_END
static volatile uint32 file_class_dirty_count= 0;
static volatile uint32 file_class_allocated_count= 0;
static PFS_file_class *file_class_array= NULL;
/**
Initialize the instrument synch class buffers.
@param mutex_class_sizing max number of mutex class
@param rwlock_class_sizing max number of rwlock class
@param cond_class_sizing max number of condition class
@return 0 on success
*/
int init_sync_class(uint mutex_class_sizing,
uint rwlock_class_sizing,
uint cond_class_sizing)
{
mutex_class_dirty_count= mutex_class_allocated_count= 0;
rwlock_class_dirty_count= rwlock_class_allocated_count= 0;
cond_class_dirty_count= cond_class_allocated_count= 0;
mutex_class_max= mutex_class_sizing;
rwlock_class_max= rwlock_class_sizing;
cond_class_max= cond_class_sizing;
mutex_class_lost= rwlock_class_lost= cond_class_lost= 0;
mutex_class_array= NULL;
rwlock_class_array= NULL;
cond_class_array= NULL;
if (mutex_class_max > 0)
{
mutex_class_array= PFS_MALLOC_ARRAY(mutex_class_max, PFS_mutex_class,
MYF(MY_ZEROFILL));
if (unlikely(mutex_class_array == NULL))
return 1;
}
if (rwlock_class_max > 0)
{
rwlock_class_array= PFS_MALLOC_ARRAY(rwlock_class_max, PFS_rwlock_class,
MYF(MY_ZEROFILL));
if (unlikely(rwlock_class_array == NULL))
return 1;
}
if (cond_class_max > 0)
{
cond_class_array= PFS_MALLOC_ARRAY(cond_class_max, PFS_cond_class,
MYF(MY_ZEROFILL));
if (unlikely(cond_class_array == NULL))
return 1;
}
return 0;
}
/** Cleanup the instrument synch class buffers. */
void cleanup_sync_class(void)
{
pfs_free(mutex_class_array);
mutex_class_array= NULL;
mutex_class_dirty_count= mutex_class_allocated_count= mutex_class_max= 0;
pfs_free(rwlock_class_array);
rwlock_class_array= NULL;
rwlock_class_dirty_count= rwlock_class_allocated_count= rwlock_class_max= 0;
pfs_free(cond_class_array);
cond_class_array= NULL;
cond_class_dirty_count= cond_class_allocated_count= cond_class_max= 0;
}
/**
Initialize the thread class buffer.
@param thread_class_sizing max number of thread class
@return 0 on success
*/
int init_thread_class(uint thread_class_sizing)
{
int result= 0;
thread_class_dirty_count= thread_class_allocated_count= 0;
thread_class_max= thread_class_sizing;
thread_class_lost= 0;
if (thread_class_max > 0)
{
thread_class_array= PFS_MALLOC_ARRAY(thread_class_max, PFS_thread_class,
MYF(MY_ZEROFILL));
if (unlikely(thread_class_array == NULL))
result= 1;
}
else
thread_class_array= NULL;
return result;
}
/** Cleanup the thread class buffers. */
void cleanup_thread_class(void)
{
pfs_free(thread_class_array);
thread_class_array= NULL;
thread_class_dirty_count= thread_class_allocated_count= 0;
thread_class_max= 0;
}
/**
Initialize the table share buffer.
@param table_share_sizing max number of table share
@return 0 on success
*/
int init_table_share(uint table_share_sizing)
{
int result= 0;
table_share_max= table_share_sizing;
table_share_lost= 0;
if (table_share_max > 0)
{
table_share_array= PFS_MALLOC_ARRAY(table_share_max, PFS_table_share,
MYF(MY_ZEROFILL));
if (unlikely(table_share_array == NULL))
result= 1;
}
else
table_share_array= NULL;
return result;
}
/** Cleanup the table share buffers. */
void cleanup_table_share(void)
{
pfs_free(table_share_array);
table_share_array= NULL;
table_share_max= 0;
}
static uchar *table_share_hash_get_key(const uchar *entry, size_t *length,
my_bool)
{
const PFS_table_share * const *typed_entry;
const PFS_table_share *share;
const void *result;
typed_entry= reinterpret_cast<const PFS_table_share* const *> (entry);
DBUG_ASSERT(typed_entry != NULL);
share= *typed_entry;
DBUG_ASSERT(share != NULL);
*length= share->m_key.m_key_length;
result= &share->m_key.m_hash_key[0];
return const_cast<uchar*> (reinterpret_cast<const uchar*> (result));
}
/** Initialize the table share hash table. */
int init_table_share_hash(void)
{
if ((! table_share_hash_inited) && (table_share_max > 0))
{
lf_hash_init(&table_share_hash, sizeof(PFS_table_share*), LF_HASH_UNIQUE,
0, 0, table_share_hash_get_key, &my_charset_bin);
table_share_hash_inited= true;
}
return 0;
}
/** Cleanup the table share hash table. */
void cleanup_table_share_hash(void)
{
if (table_share_hash_inited)
{
lf_hash_destroy(&table_share_hash);
table_share_hash_inited= false;
}
}
/**
Initialize the file class buffer.
@param file_class_sizing max number of file class
@return 0 on success
*/
int init_file_class(uint file_class_sizing)
{
int result= 0;
file_class_dirty_count= file_class_allocated_count= 0;
file_class_max= file_class_sizing;
file_class_lost= 0;
if (file_class_max > 0)
{
file_class_array= PFS_MALLOC_ARRAY(file_class_max, PFS_file_class,
MYF(MY_ZEROFILL));
if (unlikely(file_class_array == NULL))
return 1;
}
else
file_class_array= NULL;
return result;
}
/** Cleanup the file class buffers. */
void cleanup_file_class(void)
{
pfs_free(file_class_array);
file_class_array= NULL;
file_class_dirty_count= file_class_allocated_count= 0;
file_class_max= 0;
}
static void init_instr_class(PFS_instr_class *klass,
const char *name,
uint name_length,
int flags)
{
DBUG_ASSERT(name_length <= PFS_MAX_INFO_NAME_LENGTH);
memset(klass, 0, sizeof(PFS_instr_class));
strncpy(klass->m_name, name, name_length);
klass->m_name_length= name_length;
klass->m_flags= flags;
klass->m_enabled= true;
klass->m_timed= true;
}
#define REGISTER_CLASS_BODY_PART(INDEX, ARRAY, MAX, NAME, NAME_LENGTH) \
for (INDEX= 0; INDEX < MAX; INDEX++) \
{ \
entry= &ARRAY[INDEX]; \
if ((entry->m_name_length == NAME_LENGTH) && \
(strncmp(entry->m_name, NAME, NAME_LENGTH) == 0)) \
{ \
DBUG_ASSERT(entry->m_flags == flags); \
return (INDEX + 1); \
} \
}
/**
Register a mutex instrumentation metadata.
@param name the instrumented name
@param name_length length in bytes of name
@param flags the instrumentation flags
@return a mutex instrumentation key
*/
PFS_sync_key register_mutex_class(const char *name, uint name_length,
int flags)
{
uint32 index;
PFS_mutex_class *entry;
/*
This is a full array scan, which is not optimal.
This is acceptable since this code is only used at startup,
or when a plugin is loaded.
*/
REGISTER_CLASS_BODY_PART(index, mutex_class_array, mutex_class_max,
name, name_length)
/*
Note that:
mutex_class_dirty_count is incremented *before* an entry is added
mutex_class_allocated_count is incremented *after* an entry is added
*/
index= PFS_atomic::add_u32(&mutex_class_dirty_count, 1);
if (index < mutex_class_max)
{
/*
The instrument was not found (from a possible previous
load / unload of a plugin), allocate it.
This code is safe when 2 threads execute in parallel
for different mutex classes:
- thread 1 registering class A
- thread 2 registering class B
will not collide in the same mutex_class_array[index] entry.
This code does not protect against 2 threads registering
in parallel the same class:
- thread 1 registering class A
- thread 2 registering class A
could lead to a duplicate class A entry.
This is ok, since this case can not happen in the caller:
- classes names are derived from a plugin name
('wait/synch/mutex/<plugin>/xxx')
- 2 threads can not register concurrently the same plugin
in INSTALL PLUGIN.
*/
entry= &mutex_class_array[index];
init_instr_class(entry, name, name_length, flags);
entry->m_wait_stat.m_control_flag=
&flag_events_waits_summary_by_event_name;
entry->m_wait_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_wait_stat);
entry->m_lock_stat.m_control_flag=
&flag_events_locks_summary_by_event_name;
entry->m_lock_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_lock_stat);
entry->m_index= index;
/*
Now that this entry is populated, advertise it
Technically, there is a small race condition here:
T0:
mutex_class_dirty_count= 10
mutex_class_allocated_count= 10
T1: Thread A increment mutex_class_dirty_count to 11
T2: Thread B increment mutex_class_dirty_count to 12
T3: Thread A populate entry 11
T4: Thread B populate entry 12
T5: Thread B increment mutex_class_allocated_count to 11,
advertise thread A incomplete record 11,
but does not advertise thread B complete record 12
T6: Thread A increment mutex_class_allocated_count to 12
This has no impact, and is acceptable.
A reader will not see record 12 for a short time.
A reader will see an incomplete record 11 for a short time,
which is ok: the mutex name / statistics will be temporarily
empty/NULL/zero, but this won't cause a crash
(mutex_class_array is initialized with MY_ZEROFILL).
*/
PFS_atomic::add_u32(&mutex_class_allocated_count, 1);
return (index + 1);
}
/*
Out of space, report to SHOW STATUS that
the allocated memory was too small.
*/
mutex_class_lost++;
return 0;
}
/**
Register a rwlock instrumentation metadata.
@param name the instrumented name
@param name_length length in bytes of name
@param flags the instrumentation flags
@return a rwlock instrumentation key
*/
PFS_sync_key register_rwlock_class(const char *name, uint name_length,
int flags)
{
/* See comments in register_mutex_class */
uint32 index;
PFS_rwlock_class *entry;
REGISTER_CLASS_BODY_PART(index, rwlock_class_array, rwlock_class_max,
name, name_length)
index= PFS_atomic::add_u32(&rwlock_class_dirty_count, 1);
if (index < rwlock_class_max)
{
entry= &rwlock_class_array[index];
init_instr_class(entry, name, name_length, flags);
entry->m_wait_stat.m_control_flag=
&flag_events_waits_summary_by_event_name;
entry->m_wait_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_wait_stat);
entry->m_read_lock_stat.m_control_flag=
&flag_events_locks_summary_by_event_name;
entry->m_read_lock_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_read_lock_stat);
entry->m_write_lock_stat.m_control_flag=
&flag_events_locks_summary_by_event_name;
entry->m_write_lock_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_write_lock_stat);
entry->m_index= index;
PFS_atomic::add_u32(&rwlock_class_allocated_count, 1);
return (index + 1);
}
rwlock_class_lost++;
return 0;
}
/**
Register a condition instrumentation metadata.
@param name the instrumented name
@param name_length length in bytes of name
@param flags the instrumentation flags
@return a condition instrumentation key
*/
PFS_sync_key register_cond_class(const char *name, uint name_length,
int flags)
{
/* See comments in register_mutex_class */
uint32 index;
PFS_cond_class *entry;
REGISTER_CLASS_BODY_PART(index, cond_class_array, cond_class_max,
name, name_length)
index= PFS_atomic::add_u32(&cond_class_dirty_count, 1);
if (index < cond_class_max)
{
entry= &cond_class_array[index];
init_instr_class(entry, name, name_length, flags);
entry->m_wait_stat.m_control_flag=
&flag_events_waits_summary_by_event_name;
entry->m_wait_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_wait_stat);
entry->m_index= index;
PFS_atomic::add_u32(&cond_class_allocated_count, 1);
return (index + 1);
}
cond_class_lost++;
return 0;
}
#define FIND_CLASS_BODY(KEY, COUNT, ARRAY) \
if ((KEY == 0) || (KEY > COUNT)) \
return NULL; \
return &ARRAY[KEY - 1]
/**
Find a mutex instrumentation class by key.
@param key the instrument key
@return the instrument class, or NULL
*/
PFS_mutex_class *find_mutex_class(PFS_sync_key key)
{
FIND_CLASS_BODY(key, mutex_class_allocated_count, mutex_class_array);
}
PFS_mutex_class *sanitize_mutex_class(PFS_mutex_class *unsafe)
{
SANITIZE_ARRAY_BODY(PFS_mutex_class, mutex_class_array, mutex_class_max, unsafe);
}
/**
Find a rwlock instrumentation class by key.
@param key the instrument key
@return the instrument class, or NULL
*/
PFS_rwlock_class *find_rwlock_class(PFS_sync_key key)
{
FIND_CLASS_BODY(key, rwlock_class_allocated_count, rwlock_class_array);
}
PFS_rwlock_class *sanitize_rwlock_class(PFS_rwlock_class *unsafe)
{
SANITIZE_ARRAY_BODY(PFS_rwlock_class, rwlock_class_array, rwlock_class_max, unsafe);
}
/**
Find a condition instrumentation class by key.
@param key the instrument key
@return the instrument class, or NULL
*/
PFS_cond_class *find_cond_class(PFS_sync_key key)
{
FIND_CLASS_BODY(key, cond_class_allocated_count, cond_class_array);
}
PFS_cond_class *sanitize_cond_class(PFS_cond_class *unsafe)
{
SANITIZE_ARRAY_BODY(PFS_cond_class, cond_class_array, cond_class_max, unsafe);
}
/**
Register a thread instrumentation metadata.
@param name the instrumented name
@param name_length length in bytes of name
@param flags the instrumentation flags
@return a thread instrumentation key
*/
PFS_thread_key register_thread_class(const char *name, uint name_length,
int flags)
{
/* See comments in register_mutex_class */
uint32 index;
PFS_thread_class *entry;
for (index= 0; index < thread_class_max; index++)
{
entry= &thread_class_array[index];
if ((entry->m_name_length == name_length) &&
(strncmp(entry->m_name, name, name_length) == 0))
return (index + 1);
}
index= PFS_atomic::add_u32(&thread_class_dirty_count, 1);
if (index < thread_class_max)
{
entry= &thread_class_array[index];
DBUG_ASSERT(name_length <= PFS_MAX_INFO_NAME_LENGTH);
strncpy(entry->m_name, name, name_length);
entry->m_name_length= name_length;
entry->m_enabled= true;
PFS_atomic::add_u32(&thread_class_allocated_count, 1);
return (index + 1);
}
thread_class_lost++;
return 0;
}
/**
Find a thread instrumentation class by key.
@param key the instrument key
@return the instrument class, or NULL
*/
PFS_thread_class *find_thread_class(PFS_sync_key key)
{
FIND_CLASS_BODY(key, thread_class_allocated_count, thread_class_array);
}
PFS_thread_class *sanitize_thread_class(PFS_thread_class *unsafe)
{
SANITIZE_ARRAY_BODY(PFS_thread_class, thread_class_array, thread_class_max, unsafe);
}
/**
Register a file instrumentation metadata.
@param name the instrumented name
@param name_length length in bytes of name
@param flags the instrumentation flags
@return a file instrumentation key
*/
PFS_file_key register_file_class(const char *name, uint name_length,
int flags)
{
/* See comments in register_mutex_class */
uint32 index;
PFS_file_class *entry;
REGISTER_CLASS_BODY_PART(index, file_class_array, file_class_max,
name, name_length)
index= PFS_atomic::add_u32(&file_class_dirty_count, 1);
if (index < file_class_max)
{
entry= &file_class_array[index];
init_instr_class(entry, name, name_length, flags);
entry->m_wait_stat.m_control_flag=
&flag_events_waits_summary_by_event_name;
entry->m_wait_stat.m_parent= NULL;
reset_single_stat_link(&entry->m_wait_stat);
entry->m_index= index;
PFS_atomic::add_u32(&file_class_allocated_count, 1);
return (index + 1);
}
file_class_lost++;
return 0;
}
/**
Find a file instrumentation class by key.
@param key the instrument key
@return the instrument class, or NULL
*/
PFS_file_class *find_file_class(PFS_file_key key)
{
FIND_CLASS_BODY(key, file_class_allocated_count, file_class_array);
}
PFS_file_class *sanitize_file_class(PFS_file_class *unsafe)
{
SANITIZE_ARRAY_BODY(PFS_file_class, file_class_array, file_class_max, unsafe);
}
/**
Find or create a table instance by name.
@param thread the executing instrumented thread
@param schema_name the table schema name
@param schema_name_length the table schema name length
@param table_name the table name
@param table_name_length the table name length
@return a table instance, or NULL
*/
PFS_table_share* find_or_create_table_share(PFS_thread *thread,
const char *schema_name,
uint schema_name_length,
const char *table_name,
uint table_name_length)
{
/* See comments in register_mutex_class */
int pass;
PFS_table_share_key key;
if (! table_share_hash_inited)
{
/* Table instrumentation can be turned off. */
table_share_lost++;
return NULL;
}
if (unlikely(thread->m_table_share_hash_pins == NULL))
{
thread->m_table_share_hash_pins= lf_hash_get_pins(&table_share_hash);
if (unlikely(thread->m_table_share_hash_pins == NULL))
{
table_share_lost++;
return NULL;
}
}
DBUG_ASSERT(schema_name_length <= NAME_LEN);
DBUG_ASSERT(table_name_length <= NAME_LEN);
char *ptr= &key.m_hash_key[0];
memcpy(ptr, schema_name, schema_name_length);
ptr+= schema_name_length;
ptr[0]= 0; ptr++;
memcpy(ptr, table_name, table_name_length);
ptr+= table_name_length;
ptr[0]= 0; ptr++;
key.m_key_length= ptr - &key.m_hash_key[0];
PFS_table_share **entry;
uint retry_count= 0;
const uint retry_max= 3;
search:
entry= reinterpret_cast<PFS_table_share**>
(lf_hash_search(&table_share_hash, thread->m_table_share_hash_pins,
&key.m_hash_key[0], key.m_key_length));
if (entry && (entry != MY_ERRPTR))
{
PFS_table_share *pfs;
pfs= *entry;
lf_hash_search_unpin(thread->m_table_share_hash_pins);
return pfs;
}
/* table_name is not constant, just using it for noise on create */
uint i= randomized_index(table_name, table_share_max);
/*
Pass 1: [random, table_share_max - 1]
Pass 2: [0, table_share_max - 1]
*/
for (pass= 1; pass <= 2; i=0, pass++)
{
PFS_table_share *pfs= table_share_array + i;
PFS_table_share *pfs_last= table_share_array + table_share_max;
for ( ; pfs < pfs_last; pfs++)
{
if (pfs->m_lock.is_free())
{
if (pfs->m_lock.free_to_dirty())
{
pfs->m_key= key;
pfs->m_schema_name= &pfs->m_key.m_hash_key[0];
pfs->m_schema_name_length= schema_name_length;
pfs->m_table_name= &pfs->m_key.m_hash_key[schema_name_length + 1];
pfs->m_table_name_length= table_name_length;
pfs->m_wait_stat.m_control_flag=
&flag_events_waits_summary_by_instance;
pfs->m_wait_stat.m_parent= NULL;
reset_single_stat_link(&pfs->m_wait_stat);
pfs->m_enabled= true;
pfs->m_timed= true;
pfs->m_aggregated= false;
int res;
res= lf_hash_insert(&table_share_hash,
thread->m_table_share_hash_pins, &pfs);
if (likely(res == 0))
{
pfs->m_lock.dirty_to_allocated();
return pfs;
}
pfs->m_lock.dirty_to_free();
if (res > 0)
{
/* Duplicate insert by another thread */
if (++retry_count > retry_max)
{
/* Avoid infinite loops */
table_share_lost++;
return NULL;
}
goto search;
}
/* OOM in lf_hash_insert */
table_share_lost++;
return NULL;
}
}
}
}
table_share_lost++;
return NULL;
}
PFS_table_share *sanitize_table_share(PFS_table_share *unsafe)
{
SANITIZE_ARRAY_BODY(PFS_table_share, table_share_array, table_share_max, unsafe);
}
const char *sanitize_table_schema_name(const char *unsafe)
{
intptr ptr= (intptr) unsafe;
intptr first= (intptr) &table_share_array[0];
intptr last= (intptr) &table_share_array[table_share_max];
PFS_table_share dummy;
/* Check if unsafe points inside table_share_array[] */
if (likely((first <= ptr) && (ptr < last)))
{
intptr offset= (ptr - first) % sizeof(PFS_table_share);
intptr from= my_offsetof(PFS_table_share, m_key.m_hash_key);
intptr len= sizeof(dummy.m_key.m_hash_key);
/* Check if unsafe points inside PFS_table_share::m_key::m_hash_key */
if (likely((from <= offset) && (offset < from + len)))
{
PFS_table_share *base= (PFS_table_share*) (ptr - offset);
/* Check if unsafe really is the schema name */
if (likely(base->m_schema_name == unsafe))
return unsafe;
}
}
return NULL;
}
const char *sanitize_table_object_name(const char *unsafe)
{
intptr ptr= (intptr) unsafe;
intptr first= (intptr) &table_share_array[0];
intptr last= (intptr) &table_share_array[table_share_max];
PFS_table_share dummy;
/* Check if unsafe points inside table_share_array[] */
if (likely((first <= ptr) && (ptr < last)))
{
intptr offset= (ptr - first) % sizeof(PFS_table_share);
intptr from= my_offsetof(PFS_table_share, m_key.m_hash_key);
intptr len= sizeof(dummy.m_key.m_hash_key);
/* Check if unsafe points inside PFS_table_share::m_key::m_hash_key */
if (likely((from <= offset) && (offset < from + len)))
{
PFS_table_share *base= (PFS_table_share*) (ptr - offset);
/* Check if unsafe really is the table name */
if (likely(base->m_table_name == unsafe))
return unsafe;
}
}
return NULL;
}
static void reset_mutex_class_waits(void)
{
PFS_mutex_class *pfs= mutex_class_array;
PFS_mutex_class *pfs_last= mutex_class_array + mutex_class_max;
for ( ; pfs < pfs_last; pfs++)
reset_single_stat_link(&pfs->m_wait_stat);
}
static void reset_rwlock_class_waits(void)
{
PFS_rwlock_class *pfs= rwlock_class_array;
PFS_rwlock_class *pfs_last= rwlock_class_array + rwlock_class_max;
for ( ; pfs < pfs_last; pfs++)
reset_single_stat_link(&pfs->m_wait_stat);
}
static void reset_cond_class_waits(void)
{
PFS_cond_class *pfs= cond_class_array;
PFS_cond_class *pfs_last= cond_class_array + cond_class_max;
for ( ; pfs < pfs_last; pfs++)
reset_single_stat_link(&pfs->m_wait_stat);
}
static void reset_file_class_waits(void)
{
PFS_file_class *pfs= file_class_array;
PFS_file_class *pfs_last= file_class_array + file_class_max;
for ( ; pfs < pfs_last; pfs++)
reset_single_stat_link(&pfs->m_wait_stat);
}
/** Reset the wait statistics for every instrument class. */
void reset_instrument_class_waits(void)
{
reset_mutex_class_waits();
reset_rwlock_class_waits();
reset_cond_class_waits();
reset_file_class_waits();
}
/** Reset the io statistics per file class. */
void reset_file_class_io(void)
{
PFS_file_class *pfs= file_class_array;
PFS_file_class *pfs_last= file_class_array + file_class_max;
for ( ; pfs < pfs_last; pfs++)
reset_file_stat(&pfs->m_file_stat);
}
/** @} */
|