ha_heap.cc 18.3 KB
Newer Older
1
/* Copyright (C) 2000,2004 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
2

bk@work.mysql.com's avatar
bk@work.mysql.com committed
3 4 5 6
   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.
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
7

bk@work.mysql.com's avatar
bk@work.mysql.com committed
8 9 10 11
   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.
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
12

bk@work.mysql.com's avatar
bk@work.mysql.com committed
13 14 15 16 17
   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 */


18
#ifdef USE_PRAGMA_IMPLEMENTATION
bk@work.mysql.com's avatar
bk@work.mysql.com committed
19 20 21 22 23 24 25
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
#include <myisampack.h>
#include "ha_heap.h"

26
handlerton heap_hton= {
27
  "MEMORY",
28 29 30 31
  SHOW_OPTION_YES,
  "Hash based, stored in memory, useful for temporary tables", 
  DB_TYPE_HEAP,
  NULL,
32 33
  0,       /* slot */
  0,       /* savepoint size. */
34 35 36 37 38 39 40 41 42 43 44 45 46
  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 */
47
  HTON_CAN_RECREATE
48 49
};

bk@work.mysql.com's avatar
bk@work.mysql.com committed
50 51 52
/*****************************************************************************
** HEAP tables
*****************************************************************************/
53 54 55

ha_heap::ha_heap(TABLE *table_arg)
  :handler(&heap_hton, table_arg), file(0), records_changed(0),
konstantin@mysql.com's avatar
konstantin@mysql.com committed
56
  key_stat_version(0)
57 58 59
{}


60 61 62
static const char *ha_heap_exts[] = {
  NullS
};
bk@work.mysql.com's avatar
bk@work.mysql.com committed
63 64

const char **ha_heap::bas_ext() const
65 66 67
{
  return ha_heap_exts;
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
68

69 70
/*
  Hash index statistics is updated (copied from HP_KEYDEF::hash_buckets to 
71 72 73 74 75 76 77 78
  rec_per_key) after 1/HEAP_STATS_UPDATE_THRESHOLD fraction of table records 
  have been inserted/updated/deleted. delete_all_rows() and table flush cause 
  immediate update.

  NOTE
   hash index statistics must be updated when number of table records changes
   from 0 to non-zero value and vice versa. Otherwise records_in_range may 
   erroneously return 0 and 'range' may miss records.
79 80
*/
#define HEAP_STATS_UPDATE_THRESHOLD 10
bk@work.mysql.com's avatar
bk@work.mysql.com committed
81

82
int ha_heap::open(const char *name, int mode, uint test_if_locked)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
83
{
84
  if (!(file= heap_open(name, mode)) && my_errno == ENOENT)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
85
  {
86 87 88
    HA_CREATE_INFO create_info;
    bzero(&create_info, sizeof(create_info));
    if (!create(name, table, &create_info))
monty@mysql.com's avatar
monty@mysql.com committed
89
    {
90
      file= heap_open(name, mode);
monty@mysql.com's avatar
monty@mysql.com committed
91 92
      implicit_emptied= 1;
    }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
93
  }
94
  ref_length= sizeof(HEAP_PTR);
95 96 97
  if (file)
  {
    /* Initialize variables for the opened table */
98
    set_keys_for_scanning();
99 100 101 102 103 104 105 106
    /*
      We cannot run update_key_stats() here because we do not have a
      lock on the table. The 'records' count might just be changed
      temporarily at this moment and we might get wrong statistics (Bug
      #10178). Instead we request for update. This will be done in
      ha_heap::info(), which is always called before key statistics are
      used.
    */
107
    key_stat_version= file->s->key_stat_version-1;
108
  }
109
  return (file ? 0 : 1);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
110 111 112 113 114 115 116
}

int ha_heap::close(void)
{
  return heap_close(file);
}

117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136

/*
  Compute which keys to use for scanning

  SYNOPSIS
    set_keys_for_scanning()
    no parameter

  DESCRIPTION
    Set the bitmap btree_keys, which is used when the upper layers ask
    which keys to use for scanning. For each btree index the
    corresponding bit is set.

  RETURN
    void
*/

void ha_heap::set_keys_for_scanning(void)
{
  btree_keys.clear_all();
137
  for (uint i= 0 ; i < table->s->keys ; i++)
138 139 140 141 142 143
  {
    if (table->key_info[i].algorithm == HA_KEY_ALG_BTREE)
      btree_keys.set_bit(i);
  }
}

144

145 146
void ha_heap::update_key_stats()
{
147
  for (uint i= 0; i < table->s->keys; i++)
148 149
  {
    KEY *key=table->key_info+i;
150 151
    if (!key->rec_per_key)
      continue;
152 153
    if (key->algorithm != HA_KEY_ALG_BTREE)
    {
154 155 156 157 158 159 160 161 162 163
      if (key->flags & HA_NOSAME)
        key->rec_per_key[key->key_parts-1]= 1;
      else
      {
        ha_rows hash_buckets= file->s->keydef[i].hash_buckets;
        uint no_records= hash_buckets ? file->s->records/hash_buckets : 2;
        if (no_records < 2)
          no_records= 2;
        key->rec_per_key[key->key_parts-1]= no_records;
      }
164 165 166
    }
  }
  records_changed= 0;
167
  /* At the end of update_key_stats() we can proudly claim they are OK. */
168
  key_stat_version= file->s->key_stat_version;
169 170
}

171

bk@work.mysql.com's avatar
bk@work.mysql.com committed
172 173
int ha_heap::write_row(byte * buf)
{
174
  int res;
175
  statistic_increment(table->in_use->status_var.ha_write_count,&LOCK_status);
176 177
  if (table->timestamp_field_type & TIMESTAMP_AUTO_SET_ON_INSERT)
    table->timestamp_field->set_time();
178 179
  if (table->next_number_field && buf == table->record[0])
    update_auto_increment();
180
  res= heap_write(file,buf);
monty@mysql.com's avatar
monty@mysql.com committed
181 182
  if (!res && (++records_changed*HEAP_STATS_UPDATE_THRESHOLD > 
               file->s->records))
183 184 185 186 187
  {
    /*
       We can perform this safely since only one writer at the time is
       allowed on the table.
    */
188
    file->s->key_stat_version++;
189
  }
190
  return res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
191 192 193 194
}

int ha_heap::update_row(const byte * old_data, byte * new_data)
{
195
  int res;
serg@serg.mylan's avatar
serg@serg.mylan committed
196
  statistic_increment(table->in_use->status_var.ha_update_count,&LOCK_status);
197 198
  if (table->timestamp_field_type & TIMESTAMP_AUTO_SET_ON_UPDATE)
    table->timestamp_field->set_time();
199
  res= heap_update(file,old_data,new_data);
200 201
  if (!res && ++records_changed*HEAP_STATS_UPDATE_THRESHOLD > 
              file->s->records)
202 203 204 205 206
  {
    /*
       We can perform this safely since only one writer at the time is
       allowed on the table.
    */
207
    file->s->key_stat_version++;
208
  }
209
  return res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
210 211 212 213
}

int ha_heap::delete_row(const byte * buf)
{
214
  int res;
215
  statistic_increment(table->in_use->status_var.ha_delete_count,&LOCK_status);
216
  res= heap_delete(file,buf);
217
  if (!res && table->s->tmp_table == NO_TMP_TABLE && 
218
      ++records_changed*HEAP_STATS_UPDATE_THRESHOLD > file->s->records)
219 220 221 222 223
  {
    /*
       We can perform this safely since only one writer at the time is
       allowed on the table.
    */
224
    file->s->key_stat_version++;
225
  }
226
  return res;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
227 228
}

229 230
int ha_heap::index_read(byte * buf, const byte * key, uint key_len,
			enum ha_rkey_function find_flag)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
231
{
232
  DBUG_ASSERT(inited==INDEX);
233 234
  statistic_increment(table->in_use->status_var.ha_read_key_count,
		      &LOCK_status);
235 236
  int error = heap_rkey(file,buf,active_index, key, key_len, find_flag);
  table->status = error ? STATUS_NOT_FOUND : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
237 238 239
  return error;
}

240 241
int ha_heap::index_read_last(byte *buf, const byte *key, uint key_len)
{
242
  DBUG_ASSERT(inited==INDEX);
243 244
  statistic_increment(table->in_use->status_var.ha_read_key_count,
		      &LOCK_status);
245 246 247 248 249 250
  int error= heap_rkey(file, buf, active_index, key, key_len,
		       HA_READ_PREFIX_LAST);
  table->status= error ? STATUS_NOT_FOUND : 0;
  return error;
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
251
int ha_heap::index_read_idx(byte * buf, uint index, const byte * key,
252
			    uint key_len, enum ha_rkey_function find_flag)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
253
{
254 255
  statistic_increment(table->in_use->status_var.ha_read_key_count,
		      &LOCK_status);
256 257
  int error = heap_rkey(file, buf, index, key, key_len, find_flag);
  table->status = error ? STATUS_NOT_FOUND : 0;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
258 259 260 261 262
  return error;
}

int ha_heap::index_next(byte * buf)
{
263
  DBUG_ASSERT(inited==INDEX);
264 265
  statistic_increment(table->in_use->status_var.ha_read_next_count,
		      &LOCK_status);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
266 267 268 269 270 271 272
  int error=heap_rnext(file,buf);
  table->status=error ? STATUS_NOT_FOUND: 0;
  return error;
}

int ha_heap::index_prev(byte * buf)
{
273
  DBUG_ASSERT(inited==INDEX);
274 275
  statistic_increment(table->in_use->status_var.ha_read_prev_count,
		      &LOCK_status);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
276 277 278 279
  int error=heap_rprev(file,buf);
  table->status=error ? STATUS_NOT_FOUND: 0;
  return error;
}
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
280

bk@work.mysql.com's avatar
bk@work.mysql.com committed
281 282
int ha_heap::index_first(byte * buf)
{
283
  DBUG_ASSERT(inited==INDEX);
284
  statistic_increment(table->in_use->status_var.ha_read_first_count,
285
		      &LOCK_status);
286
  int error=heap_rfirst(file, buf, active_index);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
287 288 289 290 291 292
  table->status=error ? STATUS_NOT_FOUND: 0;
  return error;
}

int ha_heap::index_last(byte * buf)
{
293
  DBUG_ASSERT(inited==INDEX);
294 295
  statistic_increment(table->in_use->status_var.ha_read_last_count,
		      &LOCK_status);
296
  int error=heap_rlast(file, buf, active_index);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
297 298 299 300 301 302 303 304 305 306 307
  table->status=error ? STATUS_NOT_FOUND: 0;
  return error;
}

int ha_heap::rnd_init(bool scan)
{
  return scan ? heap_scan_init(file) : 0;
}

int ha_heap::rnd_next(byte *buf)
{
308
  statistic_increment(table->in_use->status_var.ha_read_rnd_next_count,
309
		      &LOCK_status);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
310 311 312 313 314 315 316 317 318
  int error=heap_scan(file, buf);
  table->status=error ? STATUS_NOT_FOUND: 0;
  return error;
}

int ha_heap::rnd_pos(byte * buf, byte *pos)
{
  int error;
  HEAP_PTR position;
319 320
  statistic_increment(table->in_use->status_var.ha_read_rnd_count,
		      &LOCK_status);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344
  memcpy_fixed((char*) &position,pos,sizeof(HEAP_PTR));
  error=heap_rrnd(file, buf, position);
  table->status=error ? STATUS_NOT_FOUND: 0;
  return error;
}

void ha_heap::position(const byte *record)
{
  *(HEAP_PTR*) ref= heap_position(file);	// Ref is aligned
}

void ha_heap::info(uint flag)
{
  HEAPINFO info;
  (void) heap_info(file,&info,flag);

  records = info.records;
  deleted = info.deleted;
  errkey  = info.errkey;
  mean_rec_length=info.reclength;
  data_file_length=info.data_length;
  index_file_length=info.index_length;
  max_data_file_length= info.max_records* info.reclength;
  delete_length= info.deleted * info.reclength;
345 346
  if (flag & HA_STATUS_AUTO)
    auto_increment_value= info.auto_increment;
347 348 349 350 351
  /*
    If info() is called for the first time after open(), we will still
    have to update the key statistics. Hoping that a table lock is now
    in place.
  */
352
  if (key_stat_version != file->s->key_stat_version)
353
    update_key_stats();
bk@work.mysql.com's avatar
bk@work.mysql.com committed
354 355 356 357 358 359 360 361 362 363
}

int ha_heap::extra(enum ha_extra_function operation)
{
  return heap_extra(file,operation);
}

int ha_heap::delete_all_rows()
{
  heap_clear(file);
364
  if (table->s->tmp_table == NO_TMP_TABLE)
365 366 367 368 369
  {
    /*
       We can perform this safely since only one writer at the time is
       allowed on the table.
    */
370
    file->s->key_stat_version++;
371
  }
bk@work.mysql.com's avatar
bk@work.mysql.com committed
372 373 374 375 376 377
  return 0;
}

int ha_heap::external_lock(THD *thd, int lock_type)
{
  return 0;					// No external locking
monty@hundin.mysql.fi's avatar
monty@hundin.mysql.fi committed
378
}
bk@work.mysql.com's avatar
bk@work.mysql.com committed
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

/*
  Disable indexes.

  SYNOPSIS
    disable_indexes()
    mode        mode of operation:
                HA_KEY_SWITCH_NONUNIQ      disable all non-unique keys
                HA_KEY_SWITCH_ALL          disable all keys
                HA_KEY_SWITCH_NONUNIQ_SAVE dis. non-uni. and make persistent
                HA_KEY_SWITCH_ALL_SAVE     dis. all keys and make persistent

  DESCRIPTION
    Disable indexes and clear keys to use for scanning.

  IMPLEMENTATION
    HA_KEY_SWITCH_NONUNIQ       is not implemented.
    HA_KEY_SWITCH_NONUNIQ_SAVE  is not implemented with HEAP.
    HA_KEY_SWITCH_ALL_SAVE      is not implemented with HEAP.

  RETURN
    0  ok
    HA_ERR_WRONG_COMMAND  mode not implemented.
*/

int ha_heap::disable_indexes(uint mode)
{
  int error;

  if (mode == HA_KEY_SWITCH_ALL)
  {
    if (!(error= heap_disable_indexes(file)))
      set_keys_for_scanning();
  }
  else
  {
    /* mode not implemented */
    error= HA_ERR_WRONG_COMMAND;
  }
  return error;
}


/*
  Enable indexes.

  SYNOPSIS
    enable_indexes()
    mode        mode of operation:
                HA_KEY_SWITCH_NONUNIQ      enable all non-unique keys
                HA_KEY_SWITCH_ALL          enable all keys
                HA_KEY_SWITCH_NONUNIQ_SAVE en. non-uni. and make persistent
                HA_KEY_SWITCH_ALL_SAVE     en. all keys and make persistent

  DESCRIPTION
    Enable indexes and set keys to use for scanning.
    The indexes might have been disabled by disable_index() before.
    The function works only if both data and indexes are empty,
    since the heap storage engine cannot repair the indexes.
    To be sure, call handler::delete_all_rows() before.

  IMPLEMENTATION
    HA_KEY_SWITCH_NONUNIQ       is not implemented.
    HA_KEY_SWITCH_NONUNIQ_SAVE  is not implemented with HEAP.
    HA_KEY_SWITCH_ALL_SAVE      is not implemented with HEAP.

  RETURN
    0  ok
    HA_ERR_CRASHED  data or index is non-empty. Delete all rows and retry.
    HA_ERR_WRONG_COMMAND  mode not implemented.
*/

int ha_heap::enable_indexes(uint mode)
{
  int error;

  if (mode == HA_KEY_SWITCH_ALL)
  {
    if (!(error= heap_enable_indexes(file)))
      set_keys_for_scanning();
  }
  else
  {
    /* mode not implemented */
    error= HA_ERR_WRONG_COMMAND;
  }
  return error;
}


/*
  Test if indexes are disabled.

  SYNOPSIS
    indexes_are_disabled()
    no parameters

  RETURN
    0  indexes are not disabled
    1  all indexes are disabled
   [2  non-unique indexes are disabled - NOT YET IMPLEMENTED]
*/

int ha_heap::indexes_are_disabled(void)
{
  return heap_indexes_are_disabled(file);
}

bk@work.mysql.com's avatar
bk@work.mysql.com committed
488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504
THR_LOCK_DATA **ha_heap::store_lock(THD *thd,
				    THR_LOCK_DATA **to,
				    enum thr_lock_type lock_type)
{
  if (lock_type != TL_IGNORE && file->lock.type == TL_UNLOCK)
    file->lock.type=lock_type;
  *to++= &file->lock;
  return to;
}

/*
  We have to ignore ENOENT entries as the HEAP table is created on open and
  not when doing a CREATE on the table.
*/

int ha_heap::delete_table(const char *name)
{
505
  char buff[FN_REFLEN];
506 507
  int error= heap_delete_table(fn_format(buff,name,"","",
                                         MY_REPLACE_EXT|MY_UNPACK_FILENAME));
bk@work.mysql.com's avatar
bk@work.mysql.com committed
508 509 510 511 512 513 514 515
  return error == ENOENT ? 0 : error;
}

int ha_heap::rename_table(const char * from, const char * to)
{
  return heap_rename(from,to);
}

516 517 518

ha_rows ha_heap::records_in_range(uint inx, key_range *min_key,
                                  key_range *max_key)
519
{
520 521 522 523
  KEY *key=table->key_info+inx;
  if (key->algorithm == HA_KEY_ALG_BTREE)
    return hp_rb_records_in_range(file, inx, min_key, max_key);

524 525
  if (!min_key || !max_key ||
      min_key->length != max_key->length ||
526 527 528
      min_key->length != key->key_length ||
      min_key->flag != HA_READ_KEY_EXACT ||
      max_key->flag != HA_READ_AFTER_KEY)
serg@serg.mylan's avatar
serg@serg.mylan committed
529
    return HA_POS_ERROR;			// Can only use exact keys
530

531 532 533
  if (records <= 1)
    return records;

534
  /* Assert that info() did run. We need current statistics here. */
535
  DBUG_ASSERT(key_stat_version == file->s->key_stat_version);
536
  return key->rec_per_key[key->key_parts-1];
537 538
}

539 540

int ha_heap::create(const char *name, TABLE *table_arg,
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
541
		    HA_CREATE_INFO *create_info)
bk@work.mysql.com's avatar
bk@work.mysql.com committed
542
{
543
  uint key, parts, mem_per_row= 0, keys= table_arg->s->keys;
544
  uint auto_key= 0, auto_key_type= 0;
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
545
  ha_rows max_rows;
546 547
  HP_KEYDEF *keydef;
  HA_KEYSEG *seg;
bk@work.mysql.com's avatar
bk@work.mysql.com committed
548
  char buff[FN_REFLEN];
549
  int error;
550
  TABLE_SHARE *share= table_arg->s;
551
  bool found_real_auto_increment= 0;
552

553
  for (key= parts= 0; key < keys; key++)
554
    parts+= table_arg->key_info[key].key_parts;
555

556
  if (!(keydef= (HP_KEYDEF*) my_malloc(keys * sizeof(HP_KEYDEF) +
monty@narttu.mysql.fi's avatar
monty@narttu.mysql.fi committed
557 558
				       parts * sizeof(HA_KEYSEG),
				       MYF(MY_WME))))
559
    return my_errno;
560 561
  seg= my_reinterpret_cast(HA_KEYSEG*) (keydef + keys);
  for (key= 0; key < keys; key++)
562
  {
563
    KEY *pos= table_arg->key_info+key;
564 565 566 567 568 569
    KEY_PART_INFO *key_part=     pos->key_part;
    KEY_PART_INFO *key_part_end= key_part + pos->key_parts;

    keydef[key].keysegs=   (uint) pos->key_parts;
    keydef[key].flag=      (pos->flags & (HA_NOSAME | HA_NULL_ARE_EQUAL));
    keydef[key].seg=       seg;
570 571 572 573 574 575 576 577 578 579 580 581 582 583

    switch (pos->algorithm) {
    case HA_KEY_ALG_UNDEF:
    case HA_KEY_ALG_HASH:
      keydef[key].algorithm= HA_KEY_ALG_HASH;
      mem_per_row+= sizeof(char*) * 2; // = sizeof(HASH_INFO)
      break;
    case HA_KEY_ALG_BTREE:
      keydef[key].algorithm= HA_KEY_ALG_BTREE;
      mem_per_row+=sizeof(TREE_ELEMENT)+pos->key_length+sizeof(char*);
      break;
    default:
      DBUG_ASSERT(0); // cannot happen
    }
584 585 586 587

    for (; key_part != key_part_end; key_part++, seg++)
    {
      Field *field= key_part->field;
588

589 590 591 592
      if (pos->algorithm == HA_KEY_ALG_BTREE)
	seg->type= field->key_type();
      else
      {
593
        if ((seg->type = field->key_type()) != (int) HA_KEYTYPE_TEXT &&
594 595 596 597
            seg->type != HA_KEYTYPE_VARTEXT1 &&
            seg->type != HA_KEYTYPE_VARTEXT2 &&
            seg->type != HA_KEYTYPE_VARBINARY1 &&
            seg->type != HA_KEYTYPE_VARBINARY2)
598
          seg->type= HA_KEYTYPE_BINARY;
599 600 601
      }
      seg->start=   (uint) key_part->offset;
      seg->length=  (uint) key_part->length;
602 603
      seg->flag=    key_part->key_part_flag;

604
      seg->charset= field->charset();
605 606 607
      if (field->null_ptr)
      {
	seg->null_bit= field->null_bit;
608
	seg->null_pos= (uint) (field->null_ptr - (uchar*) table_arg->record[0]);
609 610 611 612 613 614
      }
      else
      {
	seg->null_bit= 0;
	seg->null_pos= 0;
      }
615 616
      if (field->flags & AUTO_INCREMENT_FLAG &&
          table_arg->found_next_number_field &&
gluh@gluh.mysql.r18.ru's avatar
gluh@gluh.mysql.r18.ru committed
617
          key == share->next_number_index)
618 619 620 621 622 623
      {
        /*
          Store key number and type for found auto_increment key
          We have to store type as seg->type can differ from it
        */
        auto_key= key+ 1;
624
	auto_key_type= field->key_type();
625
      }
626 627
    }
  }
628
  mem_per_row+= MY_ALIGN(share->reclength + 1, sizeof(char*));
629
  max_rows = (ha_rows) (table->in_use->variables.max_heap_table_size /
monty@mashka.mysql.fi's avatar
monty@mashka.mysql.fi committed
630
			mem_per_row);
631 632
  if (table_arg->found_next_number_field)
  {
ramil@mysql.com's avatar
ramil@mysql.com committed
633 634
    keydef[share->next_number_index].flag|= HA_AUTO_KEY;
    found_real_auto_increment= share->next_number_key_offset == 0;
635
  }
636
  HP_CREATE_INFO hp_create_info;
637
  hp_create_info.auto_key= auto_key;
638 639 640
  hp_create_info.auto_key_type= auto_key_type;
  hp_create_info.auto_increment= (create_info->auto_increment_value ?
				  create_info->auto_increment_value - 1 : 0);
641
  hp_create_info.max_table_size=current_thd->variables.max_heap_table_size;
642
  hp_create_info.with_auto_increment= found_real_auto_increment;
643
  max_rows = (ha_rows) (hp_create_info.max_table_size / mem_per_row);
644 645
  error= heap_create(fn_format(buff,name,"","",
                               MY_REPLACE_EXT|MY_UNPACK_FILENAME),
monty@mysql.com's avatar
monty@mysql.com committed
646
		     keys, keydef, share->reclength,
647 648 649 650
		     (ulong) ((share->max_rows < max_rows &&
			       share->max_rows) ? 
			      share->max_rows : max_rows),
		     (ulong) share->min_rows, &hp_create_info);
651 652 653 654
  my_free((gptr) keydef, MYF(0));
  if (file)
    info(HA_STATUS_NO_LOCK | HA_STATUS_CONST | HA_STATUS_VARIABLE);
  return (error);
bk@work.mysql.com's avatar
bk@work.mysql.com committed
655
}
656

657

658 659 660 661 662 663 664
void ha_heap::update_create_info(HA_CREATE_INFO *create_info)
{
  table->file->info(HA_STATUS_AUTO);
  if (!(create_info->used_fields & HA_CREATE_USED_AUTO))
    create_info->auto_increment_value= auto_increment_value;
}

665
ulonglong ha_heap::get_auto_increment()
666 667 668 669
{
  ha_heap::info(HA_STATUS_AUTO);
  return auto_increment_value;
}