ha_tina.cc 37 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
/* Copyright (C) 2003 MySQL AB

  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; either version 2 of the License, or
  (at your option) any later version.

  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, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */

/*
  Make sure to look at ha_tina.h for more details.

20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35
  First off, this is a play thing for me, there are a number of things
  wrong with it:
    *) It was designed for csv and therefore its performance is highly
       questionable.
    *) Indexes have not been implemented. This is because the files can
       be traded in and out of the table directory without having to worry
       about rebuilding anything.
    *) NULLs and "" are treated equally (like a spreadsheet).
    *) There was in the beginning no point to anyone seeing this other
       then me, so there is a good chance that I haven't quite documented
       it well.
    *) Less design, more "make it work"

  Now there are a few cool things with it:
    *) Errors can result in corrupted data files.
    *) Data files can be read by spreadsheets directly.
36 37 38 39 40 41 42 43 44

TODO:
 *) Move to a block system for larger files
 *) Error recovery, its all there, just need to finish it
 *) Document how the chains work.

 -Brian
*/

unknown's avatar
unknown committed
45
#ifdef USE_PRAGMA_IMPLEMENTATION
46 47 48 49
#pragma implementation        // gcc: Class implementation
#endif

#include "mysql_priv.h"
unknown's avatar
unknown committed
50

51 52 53
#include "ha_tina.h"
#include <sys/mman.h>

54
#include <mysql/plugin.h>
unknown's avatar
unknown committed
55

56 57 58 59 60 61 62 63 64 65 66 67 68
/*
  uchar + uchar + ulonglong + ulonglong + ulonglong + ulonglong + uchar
*/
#define META_BUFFER_SIZE sizeof(uchar) + sizeof(uchar) + sizeof(ulonglong) \
  + sizeof(ulonglong) + sizeof(ulonglong) + sizeof(ulonglong) + sizeof(uchar)
#define TINA_CHECK_HEADER 254 // The number we use to determine corruption

/* The file extension */
#define CSV_EXT ".CSV"               // The data file
#define CSN_EXT ".CSN"               // Files used during repair
#define CSM_EXT ".CSM"               // Meta file


69 70 71 72
static TINA_SHARE *get_share(const char *table_name, TABLE *table);
static int free_share(TINA_SHARE *share);
static int read_meta_file(File meta_file, ha_rows *rows);
static int write_meta_file(File meta_file, ha_rows rows, bool dirty);
73

74 75 76 77
/* Stuff for shares */
pthread_mutex_t tina_mutex;
static HASH tina_open_tables;
static int tina_init= 0;
unknown's avatar
unknown committed
78
static handler *tina_create_handler(TABLE_SHARE *table);
unknown's avatar
unknown committed
79
static int tina_init_func();
80

81
handlerton tina_hton= {
unknown's avatar
unknown committed
82
  MYSQL_HANDLERTON_INTERFACE_VERSION,
83
  "CSV",
84 85 86
  SHOW_OPTION_YES,
  "CSV storage engine", 
  DB_TYPE_CSV_DB,
unknown's avatar
unknown committed
87
  (bool (*)()) tina_init_func,
88 89
  0,       /* slot */
  0,       /* savepoint size. */
90 91 92 93 94 95 96 97 98 99 100 101 102
  NULL,    /* close_connection */
  NULL,    /* savepoint */
  NULL,    /* rollback to savepoint */
  NULL,    /* release savepoint */
  NULL,    /* commit */
  NULL,    /* rollback */
  NULL,    /* prepare */
  NULL,    /* recover */
  NULL,    /* commit_by_xid */
  NULL,    /* rollback_by_xid */
  NULL,    /* create_cursor_read_view */
  NULL,    /* set_cursor_read_view */
  NULL,    /* close_cursor_read_view */
103 104 105 106 107 108
  tina_create_handler,    /* Create a new handler */
  NULL,    /* Drop a database */
  tina_end,    /* Panic call */
  NULL,    /* Start Consistent Snapshot */
  NULL,    /* Flush logs */
  NULL,    /* Show status */
unknown's avatar
unknown committed
109 110
  NULL,    /* Partition flags */
  NULL,    /* Alter table flags */
unknown's avatar
unknown committed
111
  NULL,    /* Alter Tablespace */
112
  NULL,    /* Fill FILES Table */
113 114 115
  HTON_CAN_RECREATE,
  NULL, /* binlog_func */
  NULL /* binlog_log_query */
116 117
};

118 119 120 121
/*****************************************************************************
 ** TINA tables
 *****************************************************************************/

122
/*
123
  Used for sorting chains with qsort().
124 125 126
*/
int sort_set (tina_set *a, tina_set *b)
{
127 128 129 130 131
  /*
    We assume that intervals do not intersect. So, it is enought to compare
    any two points. Here we take start of intervals for comparison.
  */
  return ( a->begin > b->begin ? -1 : ( a->begin < b->begin ? 1 : 0 ) );
132 133 134 135 136 137 138 139 140 141 142 143 144 145 146
}

static byte* tina_get_key(TINA_SHARE *share,uint *length,
                          my_bool not_used __attribute__((unused)))
{
  *length=share->table_name_length;
  return (byte*) share->table_name;
}

/*
  Reloads the mmap file.
*/
int get_mmap(TINA_SHARE *share, int write)
{
  DBUG_ENTER("ha_tina::get_mmap");
147 148
  if (share->mapped_file && my_munmap(share->mapped_file,
                                      share->file_stat.st_size))
149 150 151 152 153
    DBUG_RETURN(1);

  if (my_fstat(share->data_file, &share->file_stat, MYF(MY_WME)) == -1)
    DBUG_RETURN(1);

154
  if (share->file_stat.st_size)
155 156
  {
    if (write)
157 158 159
      share->mapped_file= (byte *)my_mmap(NULL, share->file_stat.st_size,
                                          PROT_READ|PROT_WRITE, MAP_SHARED,
                                          share->data_file, 0);
160
    else
161 162 163
      share->mapped_file= (byte *)my_mmap(NULL, share->file_stat.st_size,
                                          PROT_READ, MAP_PRIVATE,
                                          share->data_file, 0);
164
    if ((share->mapped_file ==(caddr_t)-1))
165 166 167 168 169 170 171 172 173 174 175 176
    {
      /*
        Bad idea you think? See the problem is that nothing actually checks
        the return value of ::rnd_init(), so tossing an error is about
        it for us.
        Never going to happen right? :)
      */
      my_message(errno, "Woops, blew up opening a mapped file", 0);
      DBUG_ASSERT(0);
      DBUG_RETURN(1);
    }
  }
177
  else
178 179 180 181 182
    share->mapped_file= NULL;

  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
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

static int tina_init_func()
{
  if (!tina_init)
  {
    tina_init++;
    VOID(pthread_mutex_init(&tina_mutex,MY_MUTEX_INIT_FAST));
    (void) hash_init(&tina_open_tables,system_charset_info,32,0,0,
                     (hash_get_key) tina_get_key,0,0);
  }
  return 0;
}

static int tina_done_func()
{
  if (tina_init)
  {
    if (tina_open_tables.records)
    {
      return 1;
    }
    hash_free(&tina_open_tables);
    pthread_mutex_destroy(&tina_mutex);
    tina_init--;
  }
  return 0;
}
	

212 213 214
/*
  Simple lock controls.
*/
215
static TINA_SHARE *get_share(const char *table_name, TABLE *table)
216 217
{
  TINA_SHARE *share;
218
  char meta_file_name[FN_REFLEN];
219 220 221
  char *tmp_name;
  uint length;

222 223 224
  if (!tina_init)
     tina_init_func();

225 226
  pthread_mutex_lock(&tina_mutex);
  length=(uint) strlen(table_name);
227 228 229 230 231

  /*
    If share is not present in the hash, create a new share and
    initialize its members.
  */
232 233
  if (!(share=(TINA_SHARE*) hash_search(&tina_open_tables,
                                        (byte*) table_name,
234
                                       length)))
235 236
  {
    if (!my_multi_malloc(MYF(MY_WME | MY_ZEROFILL),
237 238
                         &share, sizeof(*share),
                         &tmp_name, length+1,
239
                         NullS))
240 241 242 243 244
    {
      pthread_mutex_unlock(&tina_mutex);
      return NULL;
    }

245
    share->use_count= 0;
246
    share->is_log_table= FALSE;
247 248
    share->table_name_length= length;
    share->table_name= tmp_name;
249 250
    share->crashed= FALSE;
    share->rows_recorded= 0;
251
    strmov(share->table_name, table_name);
252 253 254
    fn_format(share->data_file_name, table_name, "", CSV_EXT,
              MY_REPLACE_EXT|MY_UNPACK_FILENAME);
    fn_format(meta_file_name, table_name, "", CSM_EXT,
255
              MY_REPLACE_EXT|MY_UNPACK_FILENAME);
256 257 258 259 260
    if (my_hash_insert(&tina_open_tables, (byte*) share))
      goto error;
    thr_lock_init(&share->lock);
    pthread_mutex_init(&share->mutex,MY_MUTEX_INIT_FAST);

261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281
    /*
      Open or create the meta file. In the latter case, we'll get
      an error during read_meta_file and mark the table as crashed.
      Usually this will result in auto-repair, and we will get a good
      meta-file in the end.
    */
    if ((share->meta_file= my_open(meta_file_name,
                                   O_RDWR|O_CREAT, MYF(0))) == -1)
      share->crashed= TRUE;

    /*
      After we read, we set the file to dirty. When we close, we will do the
      opposite. If the meta file will not open we assume it is crashed and
      mark it as such.
    */
    if (read_meta_file(share->meta_file, &share->rows_recorded))
      share->crashed= TRUE;
    else
      (void)write_meta_file(share->meta_file, share->rows_recorded, TRUE);

    if ((share->data_file= my_open(share->data_file_name, O_RDWR|O_APPEND,
unknown's avatar
unknown committed
282
                                   MYF(0))) == -1)
283 284
      goto error2;

285 286 287 288
    /*
      We only use share->data_file for writing, so we scan to
      the end to append
    */
289 290 291
    if (my_seek(share->data_file, 0, SEEK_END, MYF(0)) == MY_FILEPOS_ERROR)
      goto error2;

292
    share->mapped_file= NULL; // We don't know the state as we just allocated it
293 294
    if (get_mmap(share, 0) > 0)
      goto error3;
295 296 297

    /* init file length value used by readers */
    share->saved_data_file_length= share->file_stat.st_size;
298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
  }
  share->use_count++;
  pthread_mutex_unlock(&tina_mutex);

  return share;

error3:
  my_close(share->data_file,MYF(0));
error2:
  thr_lock_delete(&share->lock);
  pthread_mutex_destroy(&share->mutex);
error:
  pthread_mutex_unlock(&tina_mutex);
  my_free((gptr) share, MYF(0));

  return NULL;
}


317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332
/*
  Read CSV meta-file

  SYNOPSIS
    read_meta_file()
    meta_file   The meta-file filedes
    ha_rows     Pointer to the var we use to store rows count.
                These are read from the meta-file.

  DESCRIPTION

    Read the meta-file info. For now we are only interested in
    rows counf, crashed bit and magic number.

  RETURN
    0 - OK
333
    non-zero - error occurred
334 335
*/

336
static int read_meta_file(File meta_file, ha_rows *rows)
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
{
  uchar meta_buffer[META_BUFFER_SIZE];
  uchar *ptr= meta_buffer;

  DBUG_ENTER("ha_tina::read_meta_file");

  VOID(my_seek(meta_file, 0, MY_SEEK_SET, MYF(0)));
  if (my_read(meta_file, (byte*)meta_buffer, META_BUFFER_SIZE, 0)
      != META_BUFFER_SIZE)
    DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);

  /*
    Parse out the meta data, we ignore version at the moment
  */

  ptr+= sizeof(uchar)*2; // Move past header
  *rows= (ha_rows)uint8korr(ptr);
  ptr+= sizeof(ulonglong); // Move past rows
  /*
    Move past check_point, auto_increment and forced_flushes fields.
    They are present in the format, but we do not use them yet.
  */
  ptr+= 3*sizeof(ulonglong);

  /* check crashed bit and magic number */
  if ((meta_buffer[0] != (uchar)TINA_CHECK_HEADER) ||
      ((bool)(*ptr)== TRUE))
    DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);

  my_sync(meta_file, MYF(MY_WME));

  DBUG_RETURN(0);
}


/*
  Write CSV meta-file

  SYNOPSIS
    write_meta_file()
    meta_file   The meta-file filedes
    ha_rows     The number of rows we have in the datafile.
    dirty       A flag, which marks whether we have a corrupt table

  DESCRIPTION

    Write meta-info the the file. Only rows count, crashed bit and
    magic number matter now.

  RETURN
    0 - OK
388
    non-zero - error occurred
389 390
*/

391
static int write_meta_file(File meta_file, ha_rows rows, bool dirty)
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
{
  uchar meta_buffer[META_BUFFER_SIZE];
  uchar *ptr= meta_buffer;

  DBUG_ENTER("ha_tina::write_meta_file");

  *ptr= (uchar)TINA_CHECK_HEADER;
  ptr+= sizeof(uchar);
  *ptr= (uchar)TINA_VERSION;
  ptr+= sizeof(uchar);
  int8store(ptr, (ulonglong)rows);
  ptr+= sizeof(ulonglong);
  memset(ptr, 0, 3*sizeof(ulonglong));
  /*
     Skip over checkpoint, autoincrement and forced_flushes fields.
     We'll need them later.
  */
  ptr+= 3*sizeof(ulonglong);
  *ptr= (uchar)dirty;

  VOID(my_seek(meta_file, 0, MY_SEEK_SET, MYF(0)));
  if (my_write(meta_file, (byte *)meta_buffer, META_BUFFER_SIZE, 0)
      != META_BUFFER_SIZE)
    DBUG_RETURN(-1);

  my_sync(meta_file, MYF(MY_WME));

  DBUG_RETURN(0);
}

bool ha_tina::check_and_repair(THD *thd)
{
  HA_CHECK_OPT check_opt;
  DBUG_ENTER("ha_tina::check_and_repair");

  check_opt.init();

  DBUG_RETURN(repair(thd, &check_opt));
}


bool ha_tina::is_crashed() const
{
  DBUG_ENTER("ha_tina::is_crashed");
  DBUG_RETURN(share->crashed);
}

439
/*
440 441
  Free lock controls.
*/
442
static int free_share(TINA_SHARE *share)
443 444 445 446 447
{
  DBUG_ENTER("ha_tina::free_share");
  pthread_mutex_lock(&tina_mutex);
  int result_code= 0;
  if (!--share->use_count){
448 449 450 451 452
    /* Write the meta file. Mark it as crashed if needed. */
    (void)write_meta_file(share->meta_file, share->rows_recorded,
                          share->crashed ? TRUE :FALSE);
    if (my_close(share->meta_file, MYF(0)))
      result_code= 1;
453
    if (share->mapped_file)
454
      my_munmap(share->mapped_file, share->file_stat.st_size);
455 456 457 458 459 460 461 462 463 464 465
    result_code= my_close(share->data_file,MYF(0));
    hash_delete(&tina_open_tables, (byte*) share);
    thr_lock_delete(&share->lock);
    pthread_mutex_destroy(&share->mutex);
    my_free((gptr) share, MYF(0));
  }
  pthread_mutex_unlock(&tina_mutex);

  DBUG_RETURN(result_code);
}

466
int tina_end(ha_panic_function type)
unknown's avatar
unknown committed
467
{
unknown's avatar
unknown committed
468
  return tina_done_func();
unknown's avatar
unknown committed
469
}
470

471
/*
472 473 474
  Finds the end of a line.
  Currently only supports files written on a UNIX OS.
*/
475
byte * find_eoln(byte *data, off_t begin, off_t end)
476
{
477
  for (off_t x= begin; x < end; x++)
478 479 480 481 482 483
    if (data[x] == '\n')
      return data + x;

  return 0;
}

484

unknown's avatar
unknown committed
485
static handler *tina_create_handler(TABLE_SHARE *table)
486 487 488 489 490
{
  return new ha_tina(table);
}


unknown's avatar
unknown committed
491
ha_tina::ha_tina(TABLE_SHARE *table_arg)
492 493
  :handler(&tina_hton, table_arg),
  /*
unknown's avatar
unknown committed
494 495
    These definitions are found in handler.h
    They are not probably completely right.
496
  */
497 498 499
  current_position(0), next_position(0), local_saved_data_file_length(0),
  chain_alloced(0), chain_size(DEFAULT_CHAIN_LENGTH),
  records_is_known(0)
500 501 502 503 504 505
{
  /* Set our original buffers from pre-allocated memory */
  buffer.set(byte_buffer, IO_SIZE, system_charset_info);
  chain= chain_buffer;
}

506

507 508 509
/*
  Encode a buffer into the quoted format.
*/
unknown's avatar
unknown committed
510

511
int ha_tina::encode_quote(byte *buf)
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
{
  char attribute_buffer[1024];
  String attribute(attribute_buffer, sizeof(attribute_buffer), &my_charset_bin);

  buffer.length(0);
  for (Field **field=table->field ; *field ; field++)
  {
    const char *ptr;
    const char *end_ptr;

    (*field)->val_str(&attribute,&attribute);
    ptr= attribute.ptr();
    end_ptr= attribute.length() + ptr;

    buffer.append('"');

    while (ptr < end_ptr) 
    {
      if (*ptr == '"')
      {
        buffer.append('\\');
        buffer.append('"');
        *ptr++;
      }
      else if (*ptr == '\r')
      {
        buffer.append('\\');
        buffer.append('r');
        *ptr++;
      }
      else if (*ptr == '\\')
      {
        buffer.append('\\');
        buffer.append('\\');
        *ptr++;
      }
      else if (*ptr == '\n')
      {
        buffer.append('\\');
        buffer.append('n');
        *ptr++;
      }
      else
        buffer.append(*ptr++);
    }
    buffer.append('"');
    buffer.append(',');
  }
  // Remove the comma, add a line feed
  buffer.length(buffer.length() - 1);
  buffer.append('\n');
  //buffer.replace(buffer.length(), 0, "\n", 1);

  return (buffer.length());
}

/*
569
  chain_append() adds delete positions to the chain that we use to keep
570
  track of space. Then the chain will be used to cleanup "holes", occurred
571
  due to deletes and updates.
572 573 574 575 576
*/
int ha_tina::chain_append()
{
  if ( chain_ptr != chain && (chain_ptr -1)->end == current_position)
    (chain_ptr -1)->end= next_position;
577
  else
578 579 580 581 582 583 584 585 586
  {
    /* We set up for the next position */
    if ((off_t)(chain_ptr - chain) == (chain_size -1))
    {
      off_t location= chain_ptr - chain;
      chain_size += DEFAULT_CHAIN_LENGTH;
      if (chain_alloced)
      {
        /* Must cast since my_malloc unlike malloc doesn't have a void ptr */
587 588
        if ((chain= (tina_set *) my_realloc((gptr)chain,
                                            chain_size, MYF(MY_WME))) == NULL)
589 590 591 592
          return -1;
      }
      else
      {
593 594
        tina_set *ptr= (tina_set *) my_malloc(chain_size * sizeof(tina_set),
                                              MYF(MY_WME));
595 596 597 598 599 600 601 602 603 604 605 606 607 608 609
        memcpy(ptr, chain, DEFAULT_CHAIN_LENGTH * sizeof(tina_set));
        chain= ptr;
        chain_alloced++;
      }
      chain_ptr= chain + location;
    }
    chain_ptr->begin= current_position;
    chain_ptr->end= next_position;
    chain_ptr++;
  }

  return 0;
}


610
/*
611 612 613 614
  Scans for a row.
*/
int ha_tina::find_current_row(byte *buf)
{
615
  byte *mapped_ptr;
616 617 618
  byte *end_ptr;
  DBUG_ENTER("ha_tina::find_current_row");

619 620 621 622 623 624
  mapped_ptr= (byte *)share->mapped_file + current_position;

  /*
    We do not read further then local_saved_data_file_length in order
    not to conflict with undergoing concurrent insert.
  */
625
  if ((end_ptr=  find_eoln(share->mapped_file, current_position,
626
                           local_saved_data_file_length)) == 0)
627 628 629 630 631
    DBUG_RETURN(HA_ERR_END_OF_FILE);

  for (Field **field=table->field ; *field ; field++)
  {
    buffer.length(0);
632 633 634 635
    if (*mapped_ptr == '"')
      mapped_ptr++; // Increment past the first quote
    else
      DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);
636 637
    for(;mapped_ptr != end_ptr; mapped_ptr++)
    {
638 639 640 641
      // Need to convert line feeds!
      if (*mapped_ptr == '"' &&
          (((mapped_ptr[1] == ',') && (mapped_ptr[2] == '"')) ||
           (mapped_ptr == end_ptr -1 )))
642 643 644
      {
        mapped_ptr += 2; // Move past the , and the "
        break;
645 646
      }
      if (*mapped_ptr == '\\' && mapped_ptr != (end_ptr - 1))
647 648 649 650 651 652 653 654 655 656 657 658 659
      {
        mapped_ptr++;
        if (*mapped_ptr == 'r')
          buffer.append('\r');
        else if (*mapped_ptr == 'n' )
          buffer.append('\n');
        else if ((*mapped_ptr == '\\') || (*mapped_ptr == '"'))
          buffer.append(*mapped_ptr);
        else  /* This could only happed with an externally created file */
        {
          buffer.append('\\');
          buffer.append(*mapped_ptr);
        }
660
      }
661 662 663 664 665 666 667 668
      else // ordinary symbol
      {
        /*
          We are at final symbol and no last quote was found =>
          we are working with a damaged file.
        */
        if (mapped_ptr == end_ptr -1)
          DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);
669
        buffer.append(*mapped_ptr);
670
      }
671 672 673 674 675
    }
    (*field)->store(buffer.ptr(), buffer.length(), system_charset_info);
  }
  next_position= (end_ptr - share->mapped_file)+1;
  /* Maybe use \N for null? */
676
  memset(buf, 0, table->s->null_bytes); /* We do not implement nulls! */
677 678 679 680 681 682 683 684

  DBUG_RETURN(0);
}

/*
  If frm_error() is called in table.cc this is called to find out what file
  extensions exist for this handler.
*/
unknown's avatar
unknown committed
685
static const char *ha_tina_exts[] = {
686 687
  CSV_EXT,
  CSM_EXT,
unknown's avatar
unknown committed
688 689 690
  NullS
};

691
const char **ha_tina::bas_ext() const
unknown's avatar
unknown committed
692 693 694
{
  return ha_tina_exts;
}
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
/*
  Three functions below are needed to enable concurrent insert functionality
  for CSV engine. For more details see mysys/thr_lock.c
*/

void tina_get_status(void* param, int concurrent_insert)
{
  ha_tina *tina= (ha_tina*) param;
  tina->get_status();
}

void tina_update_status(void* param)
{
  ha_tina *tina= (ha_tina*) param;
  tina->update_status();
}

/* this should exist and return 0 for concurrent insert to work */
my_bool tina_check_status(void* param)
{
  return 0;
}

/*
  Save the state of the table

  SYNOPSIS
    get_status()

  DESCRIPTION
    This function is used to retrieve the file length. During the lock
    phase of concurrent insert. For more details see comment to
    ha_tina::update_status below.
*/

void ha_tina::get_status()
{
  if (share->is_log_table)
  {
    /*
      We have to use mutex to follow pthreads memory visibility
      rules for share->saved_data_file_length
    */
    pthread_mutex_lock(&share->mutex);
    local_saved_data_file_length= share->saved_data_file_length;
    pthread_mutex_unlock(&share->mutex);
    return;
  }
  local_saved_data_file_length= share->saved_data_file_length;
}


/*
  Correct the state of the table. Called by unlock routines
  before the write lock is released.

  SYNOPSIS
    update_status()

  DESCRIPTION
    When we employ concurrent insert lock, we save current length of the file
    during the lock phase. We do not read further saved value, as we don't
    want to interfere with undergoing concurrent insert. Writers update file
    length info during unlock with update_status().

  NOTE
    For log tables concurrent insert works different. The reason is that
    log tables are always opened and locked. And as they do not unlock
    tables, the file length after writes should be updated in a different
    way. For this purpose we need is_log_table flag. When this flag is set
    we call update_status() explicitly after each row write.
*/

void ha_tina::update_status()
{
  /* correct local_saved_data_file_length for writers */
  share->saved_data_file_length= share->file_stat.st_size;
}


776 777 778 779
bool ha_tina::check_if_locking_is_allowed(uint sql_command,
                                          ulong type, TABLE *table,
                                          uint count,
                                          bool called_by_logger_thread)
780 781 782 783 784 785 786
{
  /*
    Deny locking of the log tables, which is incompatible with
    concurrent insert. Unless called from a logger THD:
    general_log_thd or slow_log_thd.
  */
  if (table->s->log_table &&
787 788 789 790
      sql_command != SQLCOM_TRUNCATE &&
      !(sql_command == SQLCOM_FLUSH &&
        type & REFRESH_LOG) &&
      !called_by_logger_thread &&
791 792 793 794 795 796 797 798 799 800 801 802 803
      (table->reginfo.lock_type >= TL_READ_NO_INSERT))
  {
    /*
      The check  >= TL_READ_NO_INSERT denies all write locks
      plus the only read lock (TL_READ_NO_INSERT itself)
    */
    table->reginfo.lock_type == TL_READ_NO_INSERT ?
      my_error(ER_CANT_READ_LOCK_LOG_TABLE, MYF(0)) :
        my_error(ER_CANT_WRITE_LOCK_LOG_TABLE, MYF(0));
    return FALSE;
  }
  return TRUE;
}
804

805
/*
806 807 808 809
  Open a database file. Keep in mind that tables are caches, so
  this will not be called for every request. Any sort of positions
  that need to be reset should be kept in the ::extra() call.
*/
810
int ha_tina::open(const char *name, int mode, uint open_options)
811 812 813
{
  DBUG_ENTER("ha_tina::open");

814 815
  if (!(share= get_share(name, table)))
    DBUG_RETURN(HA_ERR_OUT_OF_MEM);
816

817
  if (share->crashed && !(open_options & HA_OPEN_FOR_REPAIR))
818 819
  {
    free_share(share);
820
    DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);
821
  }
822 823 824 825 826 827 828

  /*
    Init locking. Pass handler object to the locking routines,
    so that they could save/update local_saved_data_file_length value
    during locking. This is needed to enable concurrent inserts.
  */
  thr_lock_data_init(&share->lock, &lock, (void*) this);
829 830
  ref_length=sizeof(off_t);

831 832 833 834
  share->lock.get_status= tina_get_status;
  share->lock.update_status= tina_update_status;
  share->lock.check_status= tina_check_status;

835 836 837 838 839 840 841 842 843 844 845 846 847 848
  DBUG_RETURN(0);
}


/*
  Close a database file. We remove ourselves from the shared strucutre.
  If it is empty we destroy it and free the mapped file.
*/
int ha_tina::close(void)
{
  DBUG_ENTER("ha_tina::close");
  DBUG_RETURN(free_share(share));
}

849
/*
850 851 852 853 854 855 856 857 858
  This is an INSERT. At the moment this handler just seeks to the end
  of the file and appends the data. In an error case it really should
  just truncate to the original position (this is not done yet).
*/
int ha_tina::write_row(byte * buf)
{
  int size;
  DBUG_ENTER("ha_tina::write_row");

859 860 861
  if (share->crashed)
      DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);

862
  ha_statistic_increment(&SSV::ha_write_count);
863

864 865
  if (table->timestamp_field_type & TIMESTAMP_AUTO_SET_ON_INSERT)
    table->timestamp_field->set_time();
866 867 868 869 870 871

  size= encode_quote(buf);

  if (my_write(share->data_file, buffer.ptr(), size, MYF(MY_WME | MY_NABP)))
    DBUG_RETURN(-1);

872 873
  /*
    Ok, this is means that we will be doing potentially bad things
874 875 876 877 878
    during a bulk insert on some OS'es. What we need is a cleanup
    call for ::write_row that would let us fix up everything after the bulk
    insert. The archive handler does this with an extra mutx call, which
    might be a solution for this.
  */
879
  if (get_mmap(share, 0) > 0)
880
    DBUG_RETURN(-1);
881 882 883 884

  /* update local copy of the max position to see our own changes */
  local_saved_data_file_length= share->file_stat.st_size;

885 886 887
  /* update shared info */
  pthread_mutex_lock(&share->mutex);
  share->rows_recorded++;
888 889 890
  /* update status for the log tables */
  if (share->is_log_table)
    update_status();
891
  pthread_mutex_unlock(&share->mutex);
892

893
  records++;
894 895 896 897
  DBUG_RETURN(0);
}


898
/*
899
  This is called for an update.
900
  Make sure you put in code to increment the auto increment, also
901 902 903 904 905 906 907 908 909 910
  update any timestamp data. Currently auto increment is not being
  fixed since autoincrements have yet to be added to this table handler.
  This will be called in a table scan right before the previous ::rnd_next()
  call.
*/
int ha_tina::update_row(const byte * old_data, byte * new_data)
{
  int size;
  DBUG_ENTER("ha_tina::update_row");

911
  ha_statistic_increment(&SSV::ha_read_rnd_next_count);
912

913 914
  if (table->timestamp_field_type & TIMESTAMP_AUTO_SET_ON_UPDATE)
    table->timestamp_field->set_time();
915 916 917 918 919 920 921 922

  size= encode_quote(new_data);

  if (chain_append())
    DBUG_RETURN(-1);

  if (my_write(share->data_file, buffer.ptr(), size, MYF(MY_WME | MY_NABP)))
    DBUG_RETURN(-1);
923 924 925 926 927 928 929

  /* UPDATE should never happen on the log tables */
  DBUG_ASSERT(!share->is_log_table);

  /* update local copy of the max position to see our own changes */
  local_saved_data_file_length= share->file_stat.st_size;

930 931 932 933
  DBUG_RETURN(0);
}


934 935 936 937 938 939 940 941
/*
  Deletes a row. First the database will find the row, and then call this
  method. In the case of a table scan, the previous call to this will be
  the ::rnd_next() that found this row.
  The exception to this is an ORDER BY. This will cause the table handler
  to walk the table noting the positions of all rows that match a query.
  The table will then be deleted/positioned based on the ORDER (so RANDOM,
  DESC, ASC).
942 943 944 945
*/
int ha_tina::delete_row(const byte * buf)
{
  DBUG_ENTER("ha_tina::delete_row");
946
  ha_statistic_increment(&SSV::ha_delete_count);
947 948 949 950 951 952

  if (chain_append())
    DBUG_RETURN(-1);

  --records;

953 954 955
  /* DELETE should never happen on the log table */
  DBUG_ASSERT(!share->is_log_table);

956 957 958 959
  DBUG_RETURN(0);
}


960 961
/*
  All table scans call this first.
962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984
  The order of a table scan is:

  ha_tina::store_lock
  ha_tina::external_lock
  ha_tina::info
  ha_tina::rnd_init
  ha_tina::extra
  ENUM HA_EXTRA_CACHE   Cash record in HA_rrnd()
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::rnd_next
  ha_tina::extra
  ENUM HA_EXTRA_NO_CACHE   End cacheing of records (def)
  ha_tina::external_lock
  ha_tina::extra
  ENUM HA_EXTRA_RESET   Reset database to after open

985 986
  Each call to ::rnd_next() represents a row returned in the can. When no more
  rows can be returned, rnd_next() returns a value of HA_ERR_END_OF_FILE.
987 988 989 990 991 992 993 994
  The ::info() call is just for the optimizer.

*/

int ha_tina::rnd_init(bool scan)
{
  DBUG_ENTER("ha_tina::rnd_init");

995 996 997
  if (share->crashed)
      DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);

998 999
  current_position= next_position= 0;
  records= 0;
1000
  records_is_known= 0;
1001
  chain_ptr= chain;
1002
#ifdef HAVE_MADVISE
1003
  if (scan)
1004 1005
    (void) madvise(share->mapped_file, share->file_stat.st_size,
                   MADV_SEQUENTIAL);
unknown's avatar
unknown committed
1006
#endif
1007 1008 1009 1010 1011

  DBUG_RETURN(0);
}

/*
1012 1013 1014 1015
  ::rnd_next() does all the heavy lifting for a table scan. You will need to
  populate *buf with the correct field data. You can walk the field to
  determine at what position you should store the data (take a look at how
  ::find_current_row() works). The structure is something like:
1016
  0Foo  Dog  Friend
1017 1018 1019 1020 1021 1022 1023
  The first offset is for the first attribute. All space before that is
  reserved for null count.
  Basically this works as a mask for which rows are nulled (compared to just
  empty).
  This table handler doesn't do nulls and does not know the difference between
  NULL and "". This is ok since this table handler is for spreadsheets and
  they don't know about them either :)
1024 1025 1026
*/
int ha_tina::rnd_next(byte *buf)
{
1027
  int rc;
1028 1029
  DBUG_ENTER("ha_tina::rnd_next");

1030 1031 1032
  if (share->crashed)
      DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);

1033
  ha_statistic_increment(&SSV::ha_read_rnd_next_count);
1034 1035

  current_position= next_position;
1036
  if (!share->mapped_file)
1037
    DBUG_RETURN(HA_ERR_END_OF_FILE);
1038 1039
  if ((rc= find_current_row(buf)))
    DBUG_RETURN(rc);
1040 1041 1042 1043 1044 1045 1046

  records++;
  DBUG_RETURN(0);
}

/*
  In the case of an order by rows will need to be sorted.
1047
  ::position() is called after each call to ::rnd_next(),
1048
  the data it stores is to a byte array. You can store this
1049 1050 1051
  data via my_store_ptr(). ref_length is a variable defined to the
  class that is the sizeof() of position being stored. In our case
  its just a position. Look at the bdb code if you want to see a case
1052 1053 1054 1055 1056
  where something other then a number is stored.
*/
void ha_tina::position(const byte *record)
{
  DBUG_ENTER("ha_tina::position");
unknown's avatar
unknown committed
1057
  my_store_ptr(ref, ref_length, current_position);
1058 1059 1060 1061
  DBUG_VOID_RETURN;
}


1062 1063
/*
  Used to fetch a row from a posiion stored with ::position().
unknown's avatar
unknown committed
1064
  my_get_ptr() retrieves the data for you.
1065 1066 1067 1068 1069
*/

int ha_tina::rnd_pos(byte * buf, byte *pos)
{
  DBUG_ENTER("ha_tina::rnd_pos");
1070
  ha_statistic_increment(&SSV::ha_read_rnd_next_count);
unknown's avatar
unknown committed
1071
  current_position= my_get_ptr(pos,ref_length);
1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083
  DBUG_RETURN(find_current_row(buf));
}

/*
  ::info() is used to return information to the optimizer.
  Currently this table handler doesn't implement most of the fields
  really needed. SHOW also makes use of this data
*/
void ha_tina::info(uint flag)
{
  DBUG_ENTER("ha_tina::info");
  /* This is a lie, but you don't want the optimizer to see zero or 1 */
1084
  if (!records_is_known && records < 2) 
1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096
    records= 2;
  DBUG_VOID_RETURN;
}

/*
  Grab bag of flags that are sent to the able handler every so often.
  HA_EXTRA_RESET and HA_EXTRA_RESET_STATE are the most frequently called.
  You are not required to implement any of these.
*/
int ha_tina::extra(enum ha_extra_function operation)
{
  DBUG_ENTER("ha_tina::extra");
1097 1098 1099 1100 1101 1102
 if (operation == HA_EXTRA_MARK_AS_LOG_TABLE)
 {
   pthread_mutex_lock(&share->mutex);
   share->is_log_table= TRUE;
   pthread_mutex_unlock(&share->mutex);
 }
1103 1104 1105 1106
  DBUG_RETURN(0);
}

/*
1107 1108 1109 1110
  Called after each table scan. In particular after deletes,
  and updates. In the last case we employ chain of deleted
  slots to clean up all of the dead space we have collected while
  performing deletes/updates.
1111 1112 1113 1114 1115
*/
int ha_tina::rnd_end()
{
  DBUG_ENTER("ha_tina::rnd_end");

1116 1117
  records_is_known= 1;

1118 1119 1120 1121 1122 1123
  /* First position will be truncate position, second will be increment */
  if ((chain_ptr - chain)  > 0)
  {
    tina_set *ptr;
    off_t length;

1124
    /*
1125 1126 1127
      Setting up writable map, this will contain all of the data after the
      get_mmap call that we have added to the file.
    */
1128
    if (get_mmap(share, 1) > 0)
1129 1130 1131 1132 1133 1134 1135 1136
      DBUG_RETURN(-1);
    length= share->file_stat.st_size;

    /*
      The sort handles updates/deletes with random orders.
      It also sorts so that we move the final blocks to the
      beginning so that we move the smallest amount of data possible.
    */
1137 1138
    qsort(chain, (size_t)(chain_ptr - chain), sizeof(tina_set),
          (qsort_cmp)sort_set);
1139 1140
    for (ptr= chain; ptr < chain_ptr; ptr++)
    {
1141 1142
      memmove(share->mapped_file + ptr->begin, share->mapped_file + ptr->end,
              length - (size_t)ptr->end);
1143 1144 1145 1146 1147 1148 1149
      length= length - (size_t)(ptr->end - ptr->begin);
    }

    /* Truncate the file to the new size */
    if (my_chsize(share->data_file, length, 0, MYF(MY_WME)))
      DBUG_RETURN(-1);

1150
    if (my_munmap(share->mapped_file, length))
1151 1152 1153 1154
      DBUG_RETURN(-1);

    /* We set it to null so that get_mmap() won't try to unmap it */
    share->mapped_file= NULL;
1155
    if (get_mmap(share, 0) > 0)
1156 1157 1158 1159 1160 1161
      DBUG_RETURN(-1);
  }

  DBUG_RETURN(0);
}

unknown's avatar
unknown committed
1162

1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180
/*
  Repair CSV table in the case, it is crashed.

  SYNOPSIS
    repair()
    thd         The thread, performing repair
    check_opt   The options for repair. We do not use it currently.

  DESCRIPTION
    If the file is empty, change # of rows in the file and complete recovery.
    Otherwise, scan the table looking for bad rows. If none were found,
    we mark file as a good one and return. If a bad row was encountered,
    we truncate the datafile up to the last good row.

   TODO: Make repair more clever - it should try to recover subsequent
         rows (after the first bad one) as well.
*/

1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205
int ha_tina::repair(THD* thd, HA_CHECK_OPT* check_opt)
{
  char repaired_fname[FN_REFLEN];
  byte *buf;
  File repair_file;
  int rc;
  ha_rows rows_repaired= 0;
  DBUG_ENTER("ha_tina::repair");

  /* empty file */
  if (!share->mapped_file)
  {
    share->rows_recorded= 0;
    goto end;
  }

  if (!(buf= (byte*) my_malloc(table->s->reclength, MYF(MY_WME))))
    DBUG_RETURN(HA_ERR_OUT_OF_MEM);

  /*
    Local_saved_data_file_length is initialized during the lock phase.
    Sometimes this is not getting executed before ::repair (e.g. for
    the log tables). We set it manually here.
  */
  local_saved_data_file_length= share->file_stat.st_size;
1206 1207 1208
  /* set current position to the beginning of the file */
  current_position= next_position= 0;

1209 1210 1211 1212 1213 1214 1215 1216 1217
  /* Read the file row-by-row. If everything is ok, repair is not needed. */
  while (!(rc= find_current_row(buf)))
  {
    rows_repaired++;
    current_position= next_position;
  }

  my_free((char*)buf, MYF(0));

1218 1219 1220 1221 1222 1223 1224 1225
  /* The file is ok */
  if (rc == HA_ERR_END_OF_FILE)
  {
    /*
      If rows_recorded != rows_repaired, we should update
      rows_recorded value to the current amount of rows.
    */
    share->rows_recorded= rows_repaired;
1226
    goto end;
1227
  }
1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242

  /*
    Otherwise we've encountered a bad row => repair is needed.
    Let us create a temporary file.
  */
  if ((repair_file= my_create(fn_format(repaired_fname, share->table_name,
                                        "", CSN_EXT,
                                        MY_REPLACE_EXT|MY_UNPACK_FILENAME),
                           0, O_RDWR | O_TRUNC,MYF(MY_WME))) < 0)
    DBUG_RETURN(HA_ERR_CRASHED_ON_REPAIR);

  if (my_write(repair_file, (byte*)share->mapped_file, current_position,
               MYF(MY_NABP)))
    DBUG_RETURN(HA_ERR_CRASHED_ON_USAGE);
  my_close(repair_file, MYF(0));
1243
  /* we just truncated the file up to the first bad row. update rows count. */
1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261
  share->rows_recorded= rows_repaired;

  if (my_munmap(share->mapped_file, share->file_stat.st_size))
    DBUG_RETURN(-1);

  my_rename(repaired_fname, share->data_file_name, MYF(0));

  /* We set it to null so that get_mmap() won't try to unmap it */
  share->mapped_file= NULL;
  if (get_mmap(share, 0) > 0)
    DBUG_RETURN(-1);

end:
  share->crashed= FALSE;
  DBUG_RETURN(HA_ADMIN_OK);
}

/*
unknown's avatar
unknown committed
1262
  DELETE without WHERE calls this
1263
*/
unknown's avatar
unknown committed
1264

1265 1266 1267 1268
int ha_tina::delete_all_rows()
{
  DBUG_ENTER("ha_tina::delete_all_rows");

1269 1270 1271
  if (!records_is_known)
    return (my_errno=HA_ERR_WRONG_COMMAND);

1272 1273
  int rc= my_chsize(share->data_file, 0, 0, MYF(MY_WME));

1274
  if (get_mmap(share, 0) > 0)
1275 1276
    DBUG_RETURN(-1);

1277
  records=0;
1278 1279 1280
  DBUG_RETURN(rc);
}

1281
/*
1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299
  Called by the database to lock the table. Keep in mind that this
  is an internal lock.
*/
THR_LOCK_DATA **ha_tina::store_lock(THD *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;
}

/* 
  Create a table. You do not want to leave the table open after a call to
  this (the database will call ::open() if it needs to).
*/

1300 1301
int ha_tina::create(const char *name, TABLE *table_arg,
                    HA_CREATE_INFO *create_info)
1302 1303 1304 1305 1306
{
  char name_buff[FN_REFLEN];
  File create_file;
  DBUG_ENTER("ha_tina::create");

1307 1308 1309 1310 1311 1312 1313 1314 1315
  if ((create_file= my_create(fn_format(name_buff, name, "", CSM_EXT,
                                        MY_REPLACE_EXT|MY_UNPACK_FILENAME), 0,
                              O_RDWR | O_TRUNC,MYF(MY_WME))) < 0)
    DBUG_RETURN(-1);

  write_meta_file(create_file, 0, FALSE);
  my_close(create_file, MYF(0));

  if ((create_file= my_create(fn_format(name_buff, name, "", CSV_EXT,
1316
                                        MY_REPLACE_EXT|MY_UNPACK_FILENAME),0,
1317
                              O_RDWR | O_TRUNC,MYF(MY_WME))) < 0)
1318 1319
    DBUG_RETURN(-1);

1320
  my_close(create_file, MYF(0));
1321 1322 1323

  DBUG_RETURN(0);
}
unknown's avatar
unknown committed
1324

1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356
int ha_tina::check(THD* thd, HA_CHECK_OPT* check_opt)
{
  int rc= 0;
  byte *buf;
  const char *old_proc_info;
  ha_rows count= share->rows_recorded;
  DBUG_ENTER("ha_tina::check");

  old_proc_info= thd_proc_info(thd, "Checking table");
  if (!(buf= (byte*) my_malloc(table->s->reclength, MYF(MY_WME))))
    DBUG_RETURN(HA_ERR_OUT_OF_MEM);

  /*
    Local_saved_data_file_length is initialized during the lock phase.
    Check does not use store_lock in certain cases. So, we set it
    manually here.
  */
  local_saved_data_file_length= share->file_stat.st_size;
  /* set current position to the beginning of the file */
  current_position= next_position= 0;
  /* Read the file row-by-row. If everything is ok, repair is not needed. */
  while (!(rc= find_current_row(buf)))
  {
    count--;
    current_position= next_position;
  }

  my_free((char*)buf, MYF(0));
  thd_proc_info(thd, old_proc_info);

  if ((rc != HA_ERR_END_OF_FILE) || count)
  {
1357
    share->crashed= TRUE;
1358 1359 1360 1361 1362 1363 1364
    DBUG_RETURN(HA_ADMIN_CORRUPT);
  }
  else
    DBUG_RETURN(HA_ADMIN_OK);
}


1365 1366 1367 1368 1369 1370
bool ha_tina::check_if_incompatible_data(HA_CREATE_INFO *info,
					   uint table_changes)
{
  return COMPATIBLE_DATA_YES;
}

unknown's avatar
unknown committed
1371 1372 1373 1374 1375 1376 1377 1378
mysql_declare_plugin
{
  MYSQL_STORAGE_ENGINE_PLUGIN,
  &tina_hton,
  tina_hton.name,
  "Brian Aker, MySQL AB",
  "CSV Storage Engine",
  tina_init_func, /* Plugin Init */
unknown's avatar
unknown committed
1379 1380
  tina_done_func, /* Plugin Deinit */
  0x0100 /* 1.0 */,
unknown's avatar
unknown committed
1381 1382 1383
}
mysql_declare_plugin_end;