-
Notifications
You must be signed in to change notification settings - Fork 4
/
ha_keti.cc
967 lines (791 loc) · 29.7 KB
/
ha_keti.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
/* Copyright (c) 2004, 2019, 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, version 2.0,
as published by the Free Software Foundation.
This program is also distributed 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 included with MySQL.
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 */
/**
@file ha_keti.cc
@brief
The ha_keti engine is a stubbed storage engine for keti purposes only;
it does nothing at this point. Its purpose is to provide a source
code illustration of how to begin writing new storage engines; see also
/storage/keti/ha_keti.h.
@details
ha_keti will let you create/open/delete tables, but
nothing further (for keti, indexes are not supported nor can data
be stored in the table). Use this keti as a template for
implementing the same functionality in your own storage engine. You
can enable the keti storage engine in your build by doing the
following during your build process:<br> ./configure
--with-keti-storage-engine
Once this is done, MySQL will let you create tables with:<br>
CREATE TABLE \<table name\> (...) ENGINE=KETI;
The keti storage engine is set up to use table locks. It
implements an keti "SHARE" that is inserted into a hash by table
name. You can use this to store information of state that any
keti handler object will be able to see when it is using that
table.
Please read the object definition in ha_keti.h before reading the rest
of this file.
@note
When you create an KETI table, the MySQL Server creates a table .frm
(format) file in the database directory, using the table name as the file
name as is customary with MySQL. No other files are created. To get an idea
of what occurs, here is an keti select that would do a scan of an entire
table:
@code
ha_keti::store_lock
ha_keti::external_lock
ha_keti::info
ha_keti::rnd_init
ha_keti::extra
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::rnd_next
ha_keti::extra
ha_keti::external_lock
ha_keti::extra
ENUM HA_EXTRA_RESET Reset database to after open
@endcode
Here you see that the keti storage engine has 9 rows called before
rnd_next signals that it has reached the end of its data. Also note that
the table in question was already opened; had it not been open, a call to
ha_keti::open() would also have been necessary. Calls to
ha_keti::extra() are hints as to what will be occurring to the request.
A Longer Example can be found called the "Skeleton Engine" which can be
found on TangentOrg. It has both an engine and a full build environment
for building a pluggable storage engine.
Happy coding!<br>
-Brian
*/
#include "storage/keti/ha_keti.h"
#include "my_dbug.h"
#include "mysql/plugin.h"
#include "sql/sql_class.h"
#include "sql/sql_plugin.h"
#include "typelib.h"
#include <iostream>
#include <cpprest/http_client.h>
#include <cpprest/filestream.h>
#include <cpprest/http_headers.h>
using namespace std;
using namespace utility; // Common utilities like string conversions
using namespace web; // Common features like URIs.
using namespace web::http; // Common HTTP functionality
using namespace web::http::client; // HTTP client features
using namespace concurrency::streams; // Asynchronous streams
static handler *keti_create_handler(handlerton *hton, TABLE_SHARE *table,
bool partitioned, MEM_ROOT *mem_root);
handlerton *keti_hton;
/* Interface to mysqld, to check system tables supported by SE */
static bool keti_is_supported_system_table(const char *db,
const char *table_name,
bool is_sql_layer_system_table);
Example_share::Example_share() { thr_lock_init(&lock); }
static int keti_init_func(void *p) {
DBUG_TRACE;
keti_hton = (handlerton *)p;
keti_hton->state = SHOW_OPTION_YES;
keti_hton->create = keti_create_handler;
keti_hton->flags = HTON_CAN_RECREATE;
keti_hton->is_supported_system_table = keti_is_supported_system_table;
return 0;
}
/**
@brief
Example of simple lock controls. The "share" it creates is a
structure we will pass to each keti handler. Do you have to have
one of these? Well, you have pieces that are used for locking, and
they are needed to function.
*/
Example_share *ha_keti::get_share() {
Example_share *tmp_share;
DBUG_TRACE;
lock_shared_ha_data();
if (!(tmp_share = static_cast<Example_share *>(get_ha_share_ptr()))) {
tmp_share = new Example_share;
if (!tmp_share) goto err;
set_ha_share_ptr(static_cast<Handler_share *>(tmp_share));
}
err:
unlock_shared_ha_data();
return tmp_share;
}
static handler *keti_create_handler(handlerton *hton, TABLE_SHARE *table,
bool, MEM_ROOT *mem_root) {
return new (mem_root) ha_keti(hton, table);
}
ha_keti::ha_keti(handlerton *hton, TABLE_SHARE *table_arg)
: handler(hton, table_arg) {}
/*
List of all system tables specific to the SE.
Array element would look like below,
{ "<database_name>", "<system table name>" },
The last element MUST be,
{ (const char*)NULL, (const char*)NULL }
This array is optional, so every SE need not implement it.
*/
static st_handler_tablename ha_keti_system_tables[] = {
{(const char *)NULL, (const char *)NULL}};
/**
@brief Check if the given db.tablename is a system table for this SE.
@param db Database name to check.
@param table_name table name to check.
@param is_sql_layer_system_table if the supplied db.table_name is a SQL
layer system table.
@return
@retval true Given db.table_name is supported system table.
@retval false Given db.table_name is not a supported system table.
*/
static bool keti_is_supported_system_table(const char *db,
const char *table_name,
bool is_sql_layer_system_table) {
st_handler_tablename *systab;
// Does this SE support "ALL" SQL layer system tables ?
if (is_sql_layer_system_table) return false;
// Check if this is SE layer system tables
systab = ha_keti_system_tables;
while (systab && systab->db) {
if (systab->db == db && strcmp(systab->tablename, table_name) == 0)
return true;
systab++;
}
return false;
}
/**
@brief
Used for opening tables. The name will be the name of the file.
@details
A table is opened when it needs to be opened; e.g. when a request comes in
for a SELECT on the table (tables are not open and closed for each request,
they are cached).
Called from handler.cc by handler::ha_open(). The server opens all tables by
calling ha_open() which then calls the handler specific open().
@see
handler::ha_open() in handler.cc
*/
int ha_keti::open(const char *, int, uint, const dd::Table *) {
DBUG_TRACE;
if (!(share = get_share())) return 1;
thr_lock_data_init(&share->lock, &lock, NULL);
return 0;
}
/**
@brief
Closes a table.
@details
Called from sql_base.cc, sql_select.cc, and table.cc. In sql_select.cc it is
only used to close up temporary tables or during the process where a
temporary table is converted over to being a myisam table.
For sql_base.cc look at close_data_tables().
@see
sql_base.cc, sql_select.cc and table.cc
*/
int ha_keti::close(void) {
DBUG_TRACE;
return 0;
}
/**
@brief
write_row() inserts a row. No extra() hint is given currently if a bulk load
is happening. buf() is a byte array of data. You can use the field
information to extract the data from the native byte array type.
@details
Example of this would be:
@code
for (Field **field=table->field ; *field ; field++)
{
...
}
@endcode
See ha_tina.cc for an keti of extracting all of the data as strings.
ha_berekly.cc has an keti of how to store it intact by "packing" it
for ha_berkeley's own native storage type.
See the note for update_row() on auto_increments. This case also applies to
write_row().
Called from item_sum.cc, item_sum.cc, sql_acl.cc, sql_insert.cc,
sql_insert.cc, sql_select.cc, sql_table.cc, sql_udf.cc, and sql_update.cc.
@see
item_sum.cc, item_sum.cc, sql_acl.cc, sql_insert.cc,
sql_insert.cc, sql_select.cc, sql_table.cc, sql_udf.cc and sql_update.cc
*/
void GetHttp()
{
http_client client(U("http://10.0.5.101:8181"));
auto resp = client.request(U("GET")).get();
cout << U("STATUS : ") << resp.status_code() << endl;
cout << "content-type : " << resp.headers().content_type() << endl;
cout << resp.extract_string(true).get() << endl;
}
void GetHttpAsync()
{
http_client client(U("http://en.cppreference.com/w/"));
client.request(U("GET")).then([](http_response resp){
cout << U("STATUS : ") << resp.status_code() << endl;
cout << "content-type : " << resp.headers().content_type() << endl;
resp.extract_string(true).then([](string_t sBoby){
cout << sBoby << endl;
}).wait();
}).wait();
}
void GetJson()
{
http_client client(U("http://date.jsontest.com/"));
http_request req(methods::GET);
client.request(req).then([=](http_response r){
cout << U("STATUS : ") << r.status_code() << endl;
cout << "content-type : " << r.headers().content_type() << endl;
//{
// "time": "11:25:23 AM",
// "milliseconds_since_epoch" : 1423999523092,
// "date" : "02-15-2015"
//}
r.extract_json(true).then([](json::value v) {
cout << v.at(U("date")).as_string() << endl;
cout << v.at(U("time")).as_string() << endl;
}).wait();
}).wait();
}
int ha_keti::write_row(uchar *) {
DBUG_TRACE;
/*
Example of a successful write_row. We don't store the data
anywhere; they are thrown away. A real implementation will
probably need to do something with 'buf'. We report a success
here, to pretend that the insert was successful.
*/
GetHttp();
//GetHttpAsync();
//GetJson();
return 0;
}
/**
@brief
Yes, update_row() does what you expect, it updates a row. old_data will have
the previous row record in it, while new_data will have the newest data in it.
Keep in mind that the server can do updates based on ordering if an ORDER BY
clause was used. Consecutive ordering is not guaranteed.
@details
Currently new_data will not have an updated auto_increament record. You can
do this for keti by doing:
@code
if (table->next_number_field && record == table->record[0])
update_auto_increment();
@endcode
Called from sql_select.cc, sql_acl.cc, sql_update.cc, and sql_insert.cc.
@see
sql_select.cc, sql_acl.cc, sql_update.cc and sql_insert.cc
*/
int ha_keti::update_row(const uchar *, uchar *) {
DBUG_TRACE;
return HA_ERR_WRONG_COMMAND;
}
/**
@brief
This will delete a row. buf will contain a copy of the row to be deleted.
The server will call this right after the current row has been called (from
either a previous rnd_nexT() or index call).
@details
If you keep a pointer to the last row or can access a primary key it will
make doing the deletion quite a bit easier. Keep in mind that the server does
not guarantee consecutive deletions. ORDER BY clauses can be used.
Called in sql_acl.cc and sql_udf.cc to manage internal table
information. Called in sql_delete.cc, sql_insert.cc, and
sql_select.cc. In sql_select it is used for removing duplicates
while in insert it is used for REPLACE calls.
@see
sql_acl.cc, sql_udf.cc, sql_delete.cc, sql_insert.cc and sql_select.cc
*/
int ha_keti::delete_row(const uchar *) {
DBUG_TRACE;
return HA_ERR_WRONG_COMMAND;
}
/**
@brief
Positions an index cursor to the index specified in the handle. Fetches the
row if available. If the key value is null, begin at the first key of the
index.
*/
int ha_keti::index_read_map(uchar *, const uchar *, key_part_map,
enum ha_rkey_function) {
int rc;
DBUG_TRACE;
rc = HA_ERR_WRONG_COMMAND;
return rc;
}
/**
@brief
Used to read forward through the index.
*/
int ha_keti::index_next(uchar *) {
int rc;
DBUG_TRACE;
rc = HA_ERR_WRONG_COMMAND;
return rc;
}
/**
@brief
Used to read backwards through the index.
*/
int ha_keti::index_prev(uchar *) {
int rc;
DBUG_TRACE;
rc = HA_ERR_WRONG_COMMAND;
return rc;
}
/**
@brief
index_first() asks for the first key in the index.
@details
Called from opt_range.cc, opt_sum.cc, sql_handler.cc, and sql_select.cc.
@see
opt_range.cc, opt_sum.cc, sql_handler.cc and sql_select.cc
*/
int ha_keti::index_first(uchar *) {
int rc;
DBUG_TRACE;
rc = HA_ERR_WRONG_COMMAND;
return rc;
}
/**
@brief
index_last() asks for the last key in the index.
@details
Called from opt_range.cc, opt_sum.cc, sql_handler.cc, and sql_select.cc.
@see
opt_range.cc, opt_sum.cc, sql_handler.cc and sql_select.cc
*/
int ha_keti::index_last(uchar *) {
int rc;
DBUG_TRACE;
rc = HA_ERR_WRONG_COMMAND;
return rc;
}
/**
@brief
rnd_init() is called when the system wants the storage engine to do a table
scan. See the keti in the introduction at the top of this file to see when
rnd_init() is called.
@details
Called from filesort.cc, records.cc, sql_handler.cc, sql_select.cc,
sql_table.cc, and sql_update.cc.
@see
filesort.cc, records.cc, sql_handler.cc, sql_select.cc, sql_table.cc and
sql_update.cc
*/
int ha_keti::rnd_init(bool) {
DBUG_TRACE;
return 0;
}
int ha_keti::rnd_end() {
DBUG_TRACE;
return 0;
}
/**
@brief
This is called for each row of the table scan. When you run out of records
you should return HA_ERR_END_OF_FILE. Fill buff up with the row information.
The Field structure for the table is the key to getting data into buf
in a manner that will allow the server to understand it.
@details
Called from filesort.cc, records.cc, sql_handler.cc, sql_select.cc,
sql_table.cc, and sql_update.cc.
@see
filesort.cc, records.cc, sql_handler.cc, sql_select.cc, sql_table.cc and
sql_update.cc
*/
int ha_keti::rnd_next(uchar *) {
int rc;
DBUG_TRACE;
rc = HA_ERR_END_OF_FILE;
return rc;
}
/**
@brief
position() is called after each call to rnd_next() if the data needs
to be ordered. You can do something like the following to store
the position:
@code
my_store_ptr(ref, ref_length, current_position);
@endcode
@details
The server uses ref to store data. ref_length in the above case is
the size needed to store current_position. ref is just a byte array
that the server will maintain. If you are using offsets to mark rows, then
current_position should be the offset. If it is a primary key like in
BDB, then it needs to be a primary key.
Called from filesort.cc, sql_select.cc, sql_delete.cc, and sql_update.cc.
@see
filesort.cc, sql_select.cc, sql_delete.cc and sql_update.cc
*/
void ha_keti::position(const uchar *) { DBUG_TRACE; }
/**
@brief
This is like rnd_next, but you are given a position to use
to determine the row. The position will be of the type that you stored in
ref. You can use ha_get_ptr(pos,ref_length) to retrieve whatever key
or position you saved when position() was called.
@details
Called from filesort.cc, records.cc, sql_insert.cc, sql_select.cc, and
sql_update.cc.
@see
filesort.cc, records.cc, sql_insert.cc, sql_select.cc and sql_update.cc
*/
int ha_keti::rnd_pos(uchar *, uchar *) {
int rc;
DBUG_TRACE;
rc = HA_ERR_WRONG_COMMAND;
return rc;
}
/**
@brief
::info() is used to return information to the optimizer. See my_base.h for
the complete description.
@details
Currently this table handler doesn't implement most of the fields really
needed. SHOW also makes use of this data.
You will probably want to have the following in your code:
@code
if (records < 2)
records = 2;
@endcode
The reason is that the server will optimize for cases of only a single
record. If, in a table scan, you don't know the number of records, it
will probably be better to set records to two so you can return as many
records as you need. Along with records, a few more variables you may wish
to set are:
records
deleted
data_file_length
index_file_length
delete_length
check_time
Take a look at the public variables in handler.h for more information.
Called in filesort.cc, ha_heap.cc, item_sum.cc, opt_sum.cc, sql_delete.cc,
sql_delete.cc, sql_derived.cc, sql_select.cc, sql_select.cc, sql_select.cc,
sql_select.cc, sql_select.cc, sql_show.cc, sql_show.cc, sql_show.cc,
sql_show.cc, sql_table.cc, sql_union.cc, and sql_update.cc.
@see
filesort.cc, ha_heap.cc, item_sum.cc, opt_sum.cc, sql_delete.cc,
sql_delete.cc, sql_derived.cc, sql_select.cc, sql_select.cc, sql_select.cc,
sql_select.cc, sql_select.cc, sql_show.cc, sql_show.cc, sql_show.cc,
sql_show.cc, sql_table.cc, sql_union.cc and sql_update.cc
*/
int ha_keti::info(uint) {
DBUG_TRACE;
return 0;
}
/**
@brief
extra() is called whenever the server wishes to send a hint to
the storage engine. The myisam engine implements the most hints.
ha_innodb.cc has the most exhaustive list of these hints.
@see
ha_innodb.cc
*/
int ha_keti::extra(enum ha_extra_function) {
DBUG_TRACE;
return 0;
}
/**
@brief
Used to delete all rows in a table, including cases of truncate and cases
where the optimizer realizes that all rows will be removed as a result of an
SQL statement.
@details
Called from item_sum.cc by Item_func_group_concat::clear(),
Item_sum_count_distinct::clear(), and Item_func_group_concat::clear().
Called from sql_delete.cc by mysql_delete().
Called from sql_select.cc by JOIN::reinit().
Called from sql_union.cc by st_select_lex_unit::exec().
@see
Item_func_group_concat::clear(), Item_sum_count_distinct::clear() and
Item_func_group_concat::clear() in item_sum.cc;
mysql_delete() in sql_delete.cc;
JOIN::reinit() in sql_select.cc and
st_select_lex_unit::exec() in sql_union.cc.
*/
int ha_keti::delete_all_rows() {
DBUG_TRACE;
return HA_ERR_WRONG_COMMAND;
}
/**
@brief
This create a lock on the table. If you are implementing a storage engine
that can handle transacations look at ha_berkely.cc to see how you will
want to go about doing this. Otherwise you should consider calling flock()
here. Hint: Read the section "locking functions for mysql" in lock.cc to
understand this.
@details
Called from lock.cc by lock_external() and unlock_external(). Also called
from sql_table.cc by copy_data_between_tables().
@see
lock.cc by lock_external() and unlock_external() in lock.cc;
the section "locking functions for mysql" in lock.cc;
copy_data_between_tables() in sql_table.cc.
*/
int ha_keti::external_lock(THD *, int) {
DBUG_TRACE;
return 0;
}
/**
@brief
The idea with handler::store_lock() is: The statement decides which locks
should be needed for the table. For updates/deletes/inserts we get WRITE
locks, for SELECT... we get read locks.
@details
Before adding the lock into the table lock handler (see thr_lock.c),
mysqld calls store lock with the requested locks. Store lock can now
modify a write lock to a read lock (or some other lock), ignore the
lock (if we don't want to use MySQL table locks at all), or add locks
for many tables (like we do when we are using a MERGE handler).
Berkeley DB, for keti, changes all WRITE locks to TL_WRITE_ALLOW_WRITE
(which signals that we are doing WRITES, but are still allowing other
readers and writers).
When releasing locks, store_lock() is also called. In this case one
usually doesn't have to do anything.
In some exceptional cases MySQL may send a request for a TL_IGNORE;
This means that we are requesting the same lock as last time and this
should also be ignored. (This may happen when someone does a flush
table when we have opened a part of the tables, in which case mysqld
closes and reopens the tables and tries to get the same locks at last
time). In the future we will probably try to remove this.
Called from lock.cc by get_lock_data().
@note
In this method one should NEVER rely on table->in_use, it may, in fact,
refer to a different thread! (this happens if get_lock_data() is called
from mysql_lock_abort_for_thread() function)
@see
get_lock_data() in lock.cc
*/
THR_LOCK_DATA **ha_keti::store_lock(THD *, THR_LOCK_DATA **to,
enum thr_lock_type lock_type) {
if (lock_type != TL_IGNORE && lock.type == TL_UNLOCK) lock.type = lock_type;
*to++ = &lock;
return to;
}
/**
@brief
Used to delete a table. By the time delete_table() has been called all
opened references to this table will have been closed (and your globally
shared references released). The variable name will just be the name of
the table. You will need to remove any files you have created at this point.
@details
If you do not implement this, the default delete_table() is called from
handler.cc and it will delete all files with the file extensions from
handlerton::file_extensions.
Called from handler.cc by delete_table and ha_create_table(). Only used
during create if the table_flag HA_DROP_BEFORE_CREATE was specified for
the storage engine.
@see
delete_table and ha_create_table() in handler.cc
*/
int ha_keti::delete_table(const char *, const dd::Table *) {
DBUG_TRACE;
/* This is not implemented but we want someone to be able that it works. */
return 0;
}
/**
@brief
Renames a table from one name to another via an alter table call.
@details
If you do not implement this, the default rename_table() is called from
handler.cc and it will delete all files with the file extensions from
handlerton::file_extensions.
Called from sql_table.cc by mysql_rename_table().
@see
mysql_rename_table() in sql_table.cc
*/
int ha_keti::rename_table(const char *, const char *, const dd::Table *,
dd::Table *) {
DBUG_TRACE;
return HA_ERR_WRONG_COMMAND;
}
/**
@brief
Given a starting key and an ending key, estimate the number of rows that
will exist between the two keys.
@details
end_key may be empty, in which case determine if start_key matches any rows.
Called from opt_range.cc by check_quick_keys().
@see
check_quick_keys() in opt_range.cc
*/
ha_rows ha_keti::records_in_range(uint, key_range *, key_range *) {
DBUG_TRACE;
return 10; // low number to force index usage
}
static MYSQL_THDVAR_STR(last_create_thdvar, PLUGIN_VAR_MEMALLOC, NULL, NULL,
NULL, NULL);
static MYSQL_THDVAR_UINT(create_count_thdvar, 0, NULL, NULL, NULL, 0, 0, 1000,
0);
/**
@brief
create() is called to create a database. The variable name will have the name
of the table.
@details
When create() is called you do not need to worry about
opening the table. Also, the .frm file will have already been
created so adjusting create_info is not necessary. You can overwrite
the .frm file at this point if you wish to change the table
definition, but there are no methods currently provided for doing
so.
Called from handle.cc by ha_create_table().
@see
ha_create_table() in handle.cc
*/
int ha_keti::create(const char *name, TABLE *, HA_CREATE_INFO *,
dd::Table *) {
DBUG_TRACE;
/*
This is not implemented but we want someone to be able to see that it
works.
*/
/*
It's just an keti of THDVAR_SET() usage below.
*/
THD *thd = ha_thd();
char *buf = (char *)my_malloc(PSI_NOT_INSTRUMENTED, SHOW_VAR_FUNC_BUFF_SIZE,
MYF(MY_FAE));
snprintf(buf, SHOW_VAR_FUNC_BUFF_SIZE, "Last creation '%s'", name);
THDVAR_SET(thd, last_create_thdvar, buf);
my_free(buf);
uint count = THDVAR(thd, create_count_thdvar) + 1;
THDVAR_SET(thd, create_count_thdvar, &count);
return 0;
}
struct st_mysql_storage_engine keti_storage_engine = {
MYSQL_HANDLERTON_INTERFACE_VERSION};
static ulong srv_enum_var = 0;
static ulong srv_ulong_var = 0;
static double srv_double_var = 0;
static int srv_signed_int_var = 0;
static long srv_signed_long_var = 0;
static longlong srv_signed_longlong_var = 0;
const char *enum_var_names[] = {"e1", "e2", NullS};
TYPELIB enum_var_typelib = {array_elements(enum_var_names) - 1,
"enum_var_typelib", enum_var_names, NULL};
static MYSQL_SYSVAR_ENUM(enum_var, // name
srv_enum_var, // varname
PLUGIN_VAR_RQCMDARG, // opt
"Sample ENUM system variable.", // comment
NULL, // check
NULL, // update
0, // def
&enum_var_typelib); // typelib
static MYSQL_SYSVAR_ULONG(ulong_var, srv_ulong_var, PLUGIN_VAR_RQCMDARG,
"0..1000", NULL, NULL, 8, 0, 1000, 0);
static MYSQL_SYSVAR_DOUBLE(double_var, srv_double_var, PLUGIN_VAR_RQCMDARG,
"0.500000..1000.500000", NULL, NULL, 8.5, 0.5,
1000.5,
0); // reserved always 0
static MYSQL_THDVAR_DOUBLE(double_thdvar, PLUGIN_VAR_RQCMDARG,
"0.500000..1000.500000", NULL, NULL, 8.5, 0.5,
1000.5, 0);
static MYSQL_SYSVAR_INT(signed_int_var, srv_signed_int_var, PLUGIN_VAR_RQCMDARG,
"INT_MIN..INT_MAX", NULL, NULL, -10, INT_MIN, INT_MAX,
0);
static MYSQL_THDVAR_INT(signed_int_thdvar, PLUGIN_VAR_RQCMDARG,
"INT_MIN..INT_MAX", NULL, NULL, -10, INT_MIN, INT_MAX,
0);
static MYSQL_SYSVAR_LONG(signed_long_var, srv_signed_long_var,
PLUGIN_VAR_RQCMDARG, "LONG_MIN..LONG_MAX", NULL, NULL,
-10, LONG_MIN, LONG_MAX, 0);
static MYSQL_THDVAR_LONG(signed_long_thdvar, PLUGIN_VAR_RQCMDARG,
"LONG_MIN..LONG_MAX", NULL, NULL, -10, LONG_MIN,
LONG_MAX, 0);
static MYSQL_SYSVAR_LONGLONG(signed_longlong_var, srv_signed_longlong_var,
PLUGIN_VAR_RQCMDARG, "LLONG_MIN..LLONG_MAX", NULL,
NULL, -10, LLONG_MIN, LLONG_MAX, 0);
static MYSQL_THDVAR_LONGLONG(signed_longlong_thdvar, PLUGIN_VAR_RQCMDARG,
"LLONG_MIN..LLONG_MAX", NULL, NULL, -10, LLONG_MIN,
LLONG_MAX, 0);
static SYS_VAR *keti_system_variables[] = {
MYSQL_SYSVAR(enum_var),
MYSQL_SYSVAR(ulong_var),
MYSQL_SYSVAR(double_var),
MYSQL_SYSVAR(double_thdvar),
MYSQL_SYSVAR(last_create_thdvar),
MYSQL_SYSVAR(create_count_thdvar),
MYSQL_SYSVAR(signed_int_var),
MYSQL_SYSVAR(signed_int_thdvar),
MYSQL_SYSVAR(signed_long_var),
MYSQL_SYSVAR(signed_long_thdvar),
MYSQL_SYSVAR(signed_longlong_var),
MYSQL_SYSVAR(signed_longlong_thdvar),
NULL};
// this is an keti of SHOW_FUNC
static int show_func_keti(MYSQL_THD, SHOW_VAR *var, char *buf) {
var->type = SHOW_CHAR;
var->value = buf; // it's of SHOW_VAR_FUNC_BUFF_SIZE bytes
snprintf(buf, SHOW_VAR_FUNC_BUFF_SIZE,
"enum_var is %lu, ulong_var is %lu, "
"double_var is %f, signed_int_var is %d, "
"signed_long_var is %ld, signed_longlong_var is %lld",
srv_enum_var, srv_ulong_var, srv_double_var, srv_signed_int_var,
srv_signed_long_var, srv_signed_longlong_var);
return 0;
}
struct keti_vars_t {
ulong var1;
double var2;
char var3[64];
bool var4;
bool var5;
ulong var6;
};
keti_vars_t keti_vars = {100, 20.01, "three hundred", true, false, 8250};
static SHOW_VAR show_status_keti[] = {
{"var1", (char *)&keti_vars.var1, SHOW_LONG, SHOW_SCOPE_GLOBAL},
{"var2", (char *)&keti_vars.var2, SHOW_DOUBLE, SHOW_SCOPE_GLOBAL},
{0, 0, SHOW_UNDEF, SHOW_SCOPE_UNDEF} // null terminator required
};
static SHOW_VAR show_array_keti[] = {
{"array", (char *)show_status_keti, SHOW_ARRAY, SHOW_SCOPE_GLOBAL},
{"var3", (char *)&keti_vars.var3, SHOW_CHAR, SHOW_SCOPE_GLOBAL},
{"var4", (char *)&keti_vars.var4, SHOW_BOOL, SHOW_SCOPE_GLOBAL},
{0, 0, SHOW_UNDEF, SHOW_SCOPE_UNDEF}};
static SHOW_VAR func_status[] = {
{"keti_func_keti", (char *)show_func_keti, SHOW_FUNC,
SHOW_SCOPE_GLOBAL},
{"keti_status_var5", (char *)&keti_vars.var5, SHOW_BOOL,
SHOW_SCOPE_GLOBAL},
{"keti_status_var6", (char *)&keti_vars.var6, SHOW_LONG,
SHOW_SCOPE_GLOBAL},
{"keti_status", (char *)show_array_keti, SHOW_ARRAY,
SHOW_SCOPE_GLOBAL},
{0, 0, SHOW_UNDEF, SHOW_SCOPE_UNDEF}};
mysql_declare_plugin(keti){
MYSQL_STORAGE_ENGINE_PLUGIN,
&keti_storage_engine,
"KETI",
"Brian Aker, MySQL AB",
"Example storage engine",
PLUGIN_LICENSE_GPL,
keti_init_func, /* Plugin Init */
NULL, /* Plugin check uninstall */
NULL, /* Plugin Deinit */
0x0001 /* 0.1 */,
func_status, /* status variables */
keti_system_variables, /* system variables */
NULL, /* config options */
0, /* flags */
} mysql_declare_plugin_end;