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
/* 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/table_events_waits.cc
Table EVENTS_WAITS_xxx (implementation).
*/
#include "my_global.h"
#include "my_pthread.h"
#include "table_events_waits.h"
#include "pfs_instr_class.h"
#include "pfs_instr.h"
#include "pfs_events_waits.h"
THR_LOCK table_events_waits_current::m_table_lock;
static const TABLE_FIELD_TYPE field_types[]=
{
{
{ C_STRING_WITH_LEN("THREAD_ID") },
{ C_STRING_WITH_LEN("int(11)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("EVENT_ID") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("EVENT_NAME") },
{ C_STRING_WITH_LEN("varchar(128)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("SOURCE") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("TIMER_START") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("TIMER_END") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("TIMER_WAIT") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("SPINS") },
{ C_STRING_WITH_LEN("int(10)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_SCHEMA") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_NAME") },
{ C_STRING_WITH_LEN("varchar(512)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_TYPE") },
{ C_STRING_WITH_LEN("varchar(64)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OBJECT_INSTANCE_BEGIN") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("NESTING_EVENT_ID") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("OPERATION") },
{ C_STRING_WITH_LEN("varchar(16)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("NUMBER_OF_BYTES") },
{ C_STRING_WITH_LEN("bigint(20)") },
{ NULL, 0}
},
{
{ C_STRING_WITH_LEN("FLAGS") },
{ C_STRING_WITH_LEN("int(10)") },
{ NULL, 0}
}
};
TABLE_FIELD_DEF
table_events_waits_current::m_field_def=
{ 16, field_types };
PFS_engine_table_share
table_events_waits_current::m_share=
{
{ C_STRING_WITH_LEN("EVENTS_WAITS_CURRENT") },
&pfs_truncatable_acl,
&table_events_waits_current::create,
NULL, /* write_row */
&table_events_waits_current::delete_all_rows,
1000, /* records */
sizeof(pos_events_waits_current), /* ref length */
&m_table_lock,
&m_field_def,
false /* checked */
};
THR_LOCK table_events_waits_history::m_table_lock;
PFS_engine_table_share
table_events_waits_history::m_share=
{
{ C_STRING_WITH_LEN("EVENTS_WAITS_HISTORY") },
&pfs_truncatable_acl,
&table_events_waits_history::create,
NULL, /* write_row */
&table_events_waits_history::delete_all_rows,
1000, /* records */
sizeof(pos_events_waits_history), /* ref length */
&m_table_lock,
&table_events_waits_current::m_field_def,
false /* checked */
};
THR_LOCK table_events_waits_history_long::m_table_lock;
PFS_engine_table_share
table_events_waits_history_long::m_share=
{
{ C_STRING_WITH_LEN("EVENTS_WAITS_HISTORY_LONG") },
&pfs_truncatable_acl,
&table_events_waits_history_long::create,
NULL, /* write_row */
&table_events_waits_history_long::delete_all_rows,
10000, /* records */
sizeof(PFS_simple_index), /* ref length */
&m_table_lock,
&table_events_waits_current::m_field_def,
false /* checked */
};
table_events_waits_common::table_events_waits_common
(const PFS_engine_table_share *share, void *pos)
: PFS_engine_table(share, pos),
m_row_exists(false)
{}
void table_events_waits_common::clear_object_columns()
{
m_row.m_object_type= NULL;
m_row.m_object_type_length= 0;
m_row.m_object_schema_length= 0;
m_row.m_object_name_length= 0;
}
/**
Build a row.
@param thread_own_wait True if the memory for the wait
is owned by pfs_thread
@param pfs_thread the thread the cursor is reading
@param wait the wait the cursor is reading
*/
void table_events_waits_common::make_row(bool thread_own_wait,
PFS_thread *pfs_thread,
PFS_events_waits *wait)
{
pfs_lock lock;
PFS_thread *safe_thread;
PFS_instr_class *safe_class;
const char *base;
const char *safe_source_file;
m_row_exists= false;
safe_thread= sanitize_thread(pfs_thread);
if (unlikely(safe_thread == NULL))
return;
/* Protect this reader against a thread termination */
if (thread_own_wait)
safe_thread->m_lock.begin_optimistic_lock(&lock);
/*
Design choice:
We could have used a pfs_lock in PFS_events_waits here,
to protect the reader from concurrent event generation,
but this leads to too many pfs_lock atomic operations
each time an event is recorded:
- 1 dirty() + 1 allocated() per event start, for EVENTS_WAITS_CURRENT
- 1 dirty() + 1 allocated() per event end, for EVENTS_WAITS_CURRENT
- 1 dirty() + 1 allocated() per copy to EVENTS_WAITS_HISTORY
- 1 dirty() + 1 allocated() per copy to EVENTS_WAITS_HISTORY_LONG
or 8 atomics per recorded event.
The problem is that we record a *lot* of events ...
Instead, a *dirty* marking is done using m_wait_class.
Using m_wait_class alone does not guarantee anything, it just filters
out most of the bad data.
This is acceptable because this code is garbage-proof,
and won't crash on bad data, only display it,
very rarely (which is accepted).
If a bad record is displayed, it's a very transient failure:
the next select * from EVENTS_WAITS_CURRENT/_HISTORY/_HISTORY_LONG will
show clean data again.
*/
m_row.m_thread_internal_id= safe_thread->m_thread_internal_id;
m_row.m_event_id= wait->m_event_id;
m_row.m_timer_state= wait->m_timer_state;
m_row.m_timer_start= wait->m_timer_start;
m_row.m_timer_end= wait->m_timer_end;
m_row.m_object_instance_addr= (intptr) wait->m_object_instance_addr;
/*
PFS_events_waits::m_class needs to be sanitized,
for race conditions when this code:
- reads a new value in m_wait_class,
- reads an old value in m_class.
*/
switch (wait->m_wait_class)
{
case WAIT_CLASS_MUTEX:
clear_object_columns();
safe_class= sanitize_mutex_class((PFS_mutex_class*) wait->m_class);
break;
case WAIT_CLASS_RWLOCK:
clear_object_columns();
safe_class= sanitize_rwlock_class((PFS_rwlock_class*) wait->m_class);
break;
case WAIT_CLASS_COND:
clear_object_columns();
safe_class= sanitize_cond_class((PFS_cond_class*) wait->m_class);
break;
case WAIT_CLASS_TABLE:
m_row.m_object_type= "TABLE";
m_row.m_object_type_length= 5;
memcpy(m_row.m_object_schema, wait->m_schema_name,
wait->m_schema_name_length);
m_row.m_object_schema_length= wait->m_schema_name_length;
memcpy(m_row.m_object_name, wait->m_object_name,
wait->m_object_name_length);
m_row.m_object_name_length= wait->m_object_name_length;
safe_class= &global_table_class;
break;
case WAIT_CLASS_FILE:
m_row.m_object_type= "FILE";
m_row.m_object_type_length= 4;
m_row.m_object_schema_length= 0;
memcpy(m_row.m_object_name, wait->m_object_name,
wait->m_object_name_length);
m_row.m_object_name_length= wait->m_object_name_length;
safe_class= sanitize_file_class((PFS_file_class*) wait->m_class);
break;
case NO_WAIT_CLASS:
default:
return;
}
if (unlikely(safe_class == NULL))
return;
m_row.m_name= safe_class->m_name;
m_row.m_name_length= safe_class->m_name_length;
/*
We are assuming this pointer is sane,
since it comes from __FILE__.
*/
safe_source_file= wait->m_source_file;
if (unlikely(safe_source_file == NULL))
return;
base= base_name(wait->m_source_file);
m_row.m_source_length= my_snprintf(m_row.m_source, sizeof(m_row.m_source),
"%s:%d", base, wait->m_source_line);
if (m_row.m_source_length > sizeof(m_row.m_source))
m_row.m_source_length= sizeof(m_row.m_source);
m_row.m_operation= wait->m_operation;
m_row.m_number_of_bytes= wait->m_number_of_bytes;
m_row.m_flags= 0;
if (thread_own_wait)
{
if (safe_thread->m_lock.end_optimistic_lock(&lock))
m_row_exists= true;
}
else
{
/*
For EVENTS_WAITS_HISTORY_LONG (thread_own_wait is false),
the wait record is always valid, because it is not stored
in memory owned by pfs_thread.
Even when the thread terminated, the record is mostly readable,
so this record is displayed.
*/
m_row_exists= true;
}
}
/**
Operations names map, as displayed in the 'OPERATION' column.
Indexed by enum_operation_type - 1.
Note: enum_operation_type contains a more precise definition,
since more details are needed internally by the instrumentation.
Different similar operations (CLOSE vs STREAMCLOSE) are displayed
with the same name 'close'.
*/
static const LEX_STRING operation_names_map[]=
{
/* Mutex operations */
{ C_STRING_WITH_LEN("lock") },
{ C_STRING_WITH_LEN("try_lock") },
/* RWLock operations */
{ C_STRING_WITH_LEN("read_lock") },
{ C_STRING_WITH_LEN("write_lock") },
{ C_STRING_WITH_LEN("try_read_lock") },
{ C_STRING_WITH_LEN("try_write_lock") },
/* Condition operations */
{ C_STRING_WITH_LEN("wait") },
{ C_STRING_WITH_LEN("timed_wait") },
/* File operations */
{ C_STRING_WITH_LEN("create") },
{ C_STRING_WITH_LEN("create") }, /* create tmp */
{ C_STRING_WITH_LEN("open") },
{ C_STRING_WITH_LEN("open") }, /* stream open */
{ C_STRING_WITH_LEN("close") },
{ C_STRING_WITH_LEN("close") }, /* stream close */
{ C_STRING_WITH_LEN("read") },
{ C_STRING_WITH_LEN("write") },
{ C_STRING_WITH_LEN("seek") },
{ C_STRING_WITH_LEN("tell") },
{ C_STRING_WITH_LEN("flush") },
{ C_STRING_WITH_LEN("stat") },
{ C_STRING_WITH_LEN("stat") }, /* fstat */
{ C_STRING_WITH_LEN("chsize") },
{ C_STRING_WITH_LEN("delete") },
{ C_STRING_WITH_LEN("rename") },
{ C_STRING_WITH_LEN("sync") }
};
int table_events_waits_common::read_row_values(TABLE *table,
unsigned char *buf,
Field **fields,
bool read_all)
{
Field *f;
const LEX_STRING *operation;
compile_time_assert(COUNT_OPERATION_TYPE ==
array_elements(operation_names_map));
if (unlikely(! m_row_exists))
return HA_ERR_RECORD_DELETED;
/* Set the null bits */
DBUG_ASSERT(table->s->null_bytes == 2);
buf[0]= 0;
buf[1]= 0;
/*
Some columns are unreliable, because they are joined with other buffers,
which could have changed and been reused for something else.
These columns are:
- THREAD_ID (m_thread joins with PFS_thread),
- SCHEMA_NAME (m_schema_name joins with PFS_table_share)
- OBJECT_NAME (m_object_name joins with PFS_table_share)
*/
for (; (f= *fields) ; fields++)
{
if (read_all || bitmap_is_set(table->read_set, f->field_index))
{
switch(f->field_index)
{
case 0: /* THREAD_ID */
set_field_ulong(f, m_row.m_thread_internal_id);
break;
case 1: /* EVENT_ID */
set_field_ulonglong(f, m_row.m_event_id);
break;
case 2: /* EVENT_NAME */
set_field_varchar_utf8(f, m_row.m_name, m_row.m_name_length);
break;
case 3: /* SOURCE */
set_field_varchar_utf8(f, m_row.m_source, m_row.m_source_length);
break;
case 4: /* TIMER_START */
if ((m_row.m_timer_state == TIMER_STATE_STARTED) ||
(m_row.m_timer_state == TIMER_STATE_TIMED))
set_field_ulonglong(f, m_row.m_timer_start);
else
f->set_null();
break;
case 5: /* TIMER_END */
if (m_row.m_timer_state == TIMER_STATE_TIMED)
set_field_ulonglong(f, m_row.m_timer_end);
else
f->set_null();
break;
case 6: /* TIMER_WAIT */
if (m_row.m_timer_state == TIMER_STATE_TIMED)
set_field_ulonglong(f, m_row.m_timer_end - m_row.m_timer_start);
else
f->set_null();
break;
case 7: /* SPINS */
f->set_null();
break;
case 8: /* OBJECT_SCHEMA */
if (m_row.m_object_schema_length > 0)
{
set_field_varchar_utf8(f, m_row.m_object_schema,
m_row.m_object_schema_length);
}
else
f->set_null();
break;
case 9: /* OBJECT_NAME */
if (m_row.m_object_name_length > 0)
{
set_field_varchar_utf8(f, m_row.m_object_name,
m_row.m_object_name_length);
}
else
f->set_null();
break;
case 10: /* OBJECT_TYPE */
if (m_row.m_object_type)
{
set_field_varchar_utf8(f, m_row.m_object_type,
m_row.m_object_type_length);
}
else
f->set_null();
break;
case 11: /* OBJECT_INSTANCE */
set_field_ulonglong(f, m_row.m_object_instance_addr);
break;
case 12: /* NESTING_EVENT_ID */
f->set_null();
break;
case 13: /* OPERATION */
operation= &operation_names_map[(int) m_row.m_operation - 1];
set_field_varchar_utf8(f, operation->str, operation->length);
break;
case 14: /* NUMBER_OF_BYTES */
if ((m_row.m_operation == OPERATION_TYPE_FILEREAD) ||
(m_row.m_operation == OPERATION_TYPE_FILEWRITE) ||
(m_row.m_operation == OPERATION_TYPE_FILECHSIZE))
set_field_ulonglong(f, m_row.m_number_of_bytes);
else
f->set_null();
break;
case 15: /* FLAGS */
set_field_ulong(f, m_row.m_flags);
break;
default:
DBUG_ASSERT(false);
}
}
}
return 0;
}
PFS_engine_table* table_events_waits_current::create(void)
{
return new table_events_waits_current();
}
table_events_waits_current::table_events_waits_current()
: table_events_waits_common(&m_share, &m_pos),
m_pos(), m_next_pos()
{}
void table_events_waits_current::reset_position(void)
{
m_pos.reset();
m_next_pos.reset();
}
int table_events_waits_current::rnd_next(void)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
for (m_pos.set_at(&m_next_pos);
m_pos.m_index_1 < thread_max;
m_pos.next_thread())
{
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
{
/* This thread does not exist */
continue;
}
/*
We do not show nested events for now,
this will be revised with TABLE io
*/
#define ONLY_SHOW_ONE_WAIT
#ifdef ONLY_SHOW_ONE_WAIT
if (m_pos.m_index_2 >= 1)
continue;
#else
if (m_pos.m_index_2 >= pfs_thread->m_wait_locker_count)
continue;
#endif
wait= &pfs_thread->m_wait_locker_stack[m_pos.m_index_2].m_waits_current;
if (wait->m_wait_class == NO_WAIT_CLASS)
{
/*
This locker does not exist.
There can not be more lockers in the stack, skip to the next thread
*/
continue;
}
make_row(true, pfs_thread, wait);
/* Next iteration, look for the next locker in this thread */
m_next_pos.set_after(&m_pos);
return 0;
}
return HA_ERR_END_OF_FILE;
}
int table_events_waits_current::rnd_pos(const void *pos)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
set_position(pos);
DBUG_ASSERT(m_pos.m_index_1 < thread_max);
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
return HA_ERR_RECORD_DELETED;
#ifdef ONLY_SHOW_CURRENT_WAITS
if (m_pos.m_index_2 >= pfs_thread->m_wait_locker_count)
return HA_ERR_RECORD_DELETED;
#endif
DBUG_ASSERT(m_pos.m_index_2 < LOCKER_STACK_SIZE);
wait= &pfs_thread->m_wait_locker_stack[m_pos.m_index_2].m_waits_current;
if (wait->m_wait_class == NO_WAIT_CLASS)
return HA_ERR_RECORD_DELETED;
make_row(true, pfs_thread, wait);
return 0;
}
int table_events_waits_current::delete_all_rows(void)
{
reset_events_waits_current();
return 0;
}
PFS_engine_table* table_events_waits_history::create(void)
{
return new table_events_waits_history();
}
table_events_waits_history::table_events_waits_history()
: table_events_waits_common(&m_share, &m_pos),
m_pos(), m_next_pos()
{}
void table_events_waits_history::reset_position(void)
{
m_pos.reset();
m_next_pos.reset();
}
int table_events_waits_history::rnd_next(void)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
if (events_waits_history_per_thread == 0)
return HA_ERR_END_OF_FILE;
for (m_pos.set_at(&m_next_pos);
m_pos.m_index_1 < thread_max;
m_pos.next_thread())
{
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
{
/* This thread does not exist */
continue;
}
if (m_pos.m_index_2 >= events_waits_history_per_thread)
{
/* This thread does not have more (full) history */
continue;
}
if ( ! pfs_thread->m_waits_history_full &&
(m_pos.m_index_2 >= pfs_thread->m_waits_history_index))
{
/* This thread does not have more (not full) history */
continue;
}
if (pfs_thread->m_waits_history[m_pos.m_index_2].m_wait_class
== NO_WAIT_CLASS)
{
/*
This locker does not exist.
There can not be more lockers in the stack, skip to the next thread
*/
continue;
}
wait= &pfs_thread->m_waits_history[m_pos.m_index_2];
make_row(true, pfs_thread, wait);
/* Next iteration, look for the next history in this thread */
m_next_pos.set_after(&m_pos);
return 0;
}
return HA_ERR_END_OF_FILE;
}
int table_events_waits_history::rnd_pos(const void *pos)
{
PFS_thread *pfs_thread;
PFS_events_waits *wait;
DBUG_ASSERT(events_waits_history_per_thread != 0);
set_position(pos);
DBUG_ASSERT(m_pos.m_index_1 < thread_max);
pfs_thread= &thread_array[m_pos.m_index_1];
if (! pfs_thread->m_lock.is_populated())
return HA_ERR_RECORD_DELETED;
DBUG_ASSERT(m_pos.m_index_2 < events_waits_history_per_thread);
if ( ! pfs_thread->m_waits_history_full &&
(m_pos.m_index_2 >= pfs_thread->m_waits_history_index))
return HA_ERR_RECORD_DELETED;
if (pfs_thread->m_waits_history[m_pos.m_index_2].m_wait_class
== NO_WAIT_CLASS)
return HA_ERR_RECORD_DELETED;
wait= &pfs_thread->m_waits_history[m_pos.m_index_2];
make_row(true, pfs_thread, wait);
return 0;
}
int table_events_waits_history::delete_all_rows(void)
{
reset_events_waits_history();
return 0;
}
PFS_engine_table* table_events_waits_history_long::create(void)
{
return new table_events_waits_history_long();
}
table_events_waits_history_long::table_events_waits_history_long()
: table_events_waits_common(&m_share, &m_pos),
m_pos(0), m_next_pos(0)
{}
void table_events_waits_history_long::reset_position(void)
{
m_pos.m_index= 0;
m_next_pos.m_index= 0;
}
int table_events_waits_history_long::rnd_next(void)
{
PFS_events_waits *wait;
uint limit;
if (events_waits_history_long_size == 0)
return HA_ERR_END_OF_FILE;
if (events_waits_history_long_full)
limit= events_waits_history_long_size;
else
limit= events_waits_history_long_index % events_waits_history_long_size;
for (m_pos.set_at(&m_next_pos); m_pos.m_index < limit; m_pos.next())
{
wait= &events_waits_history_long_array[m_pos.m_index];
if (wait->m_wait_class != NO_WAIT_CLASS)
{
make_row(false, wait->m_thread, wait);
/* Next iteration, look for the next entry */
m_next_pos.set_after(&m_pos);
return 0;
}
}
return HA_ERR_END_OF_FILE;
}
int table_events_waits_history_long::rnd_pos(const void *pos)
{
PFS_events_waits *wait;
uint limit;
if (events_waits_history_long_size == 0)
return HA_ERR_RECORD_DELETED;
set_position(pos);
if (events_waits_history_long_full)
limit= events_waits_history_long_size;
else
limit= events_waits_history_long_index % events_waits_history_long_size;
if (m_pos.m_index >= limit)
return HA_ERR_RECORD_DELETED;
wait= &events_waits_history_long_array[m_pos.m_index];
if (wait->m_wait_class == NO_WAIT_CLASS)
return HA_ERR_RECORD_DELETED;
make_row(false, wait->m_thread, wait);
return 0;
}
int table_events_waits_history_long::delete_all_rows(void)
{
reset_events_waits_history_long();
return 0;
}