ha_berkeley.cc 65.6 KB
Newer Older
unknown's avatar
unknown committed
1
/* Copyright (C) 2000 MySQL AB & MySQL Finland AB & TCX DataKonsult AB
unknown's avatar
unknown committed
2

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

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

unknown's avatar
unknown committed
13 14 15 16 17 18 19 20 21 22 23
   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 */


/*
  TODO:
  - Not compressed keys should use cmp_fix_length_key
  - Don't automaticly pack all string keys (To do this we need to modify
    CREATE TABLE so that one can use the pack_keys argument per key).
  - An argument to pack_key that we don't want compression.
unknown's avatar
unknown committed
24
  - DB_DBT_USERMEM should be used for fixed length tables
unknown's avatar
unknown committed
25 26 27
    We will need an updated Berkeley DB version for this.
  - Killing threads that has got a 'deadlock'
  - SHOW TABLE STATUS should give more information about the table.
28 29 30
  - Get a more accurate count of the number of rows (estimate_number_of_rows()).
    We could store the found number of rows when the table is scanned and
    then increment the counter for each attempted write.
unknown's avatar
unknown committed
31 32 33 34 35 36 37 38 39
  - We will need a manager thread that calls flush_logs, removes old
    logs and makes checkpoints at given intervals.
  - When not using UPDATE IGNORE, don't make a sub transaction but abort
    the main transaction on errors.
  - Handling of drop table during autocommit=0 ?
    (Should we just give an error in this case if there is a pending
    transaction ?)
  - When using ALTER TABLE IGNORE, we should not start an transaction, but do
    everything wthout transactions.
40 41
  - When we do rollback, we need to subtract the number of changed rows
    from the updated tables.
unknown's avatar
unknown committed
42 43 44

  Testing of:
  - LOCK TABLES
45 46 47
  - Mark tables that participate in a transaction so that they are not
    closed during the transaction.  We need to test what happens if
    MySQL closes a table that is updated by a not commit transaction.
unknown's avatar
unknown committed
48 49 50 51 52 53 54 55 56 57 58 59 60 61
*/


#ifdef __GNUC__
#pragma implementation				// gcc: Class implementation
#endif

#include "mysql_priv.h"
#ifdef HAVE_BERKELEY_DB
#include <m_ctype.h>
#include <myisampack.h>
#include <assert.h>
#include <hash.h>
#include "ha_berkeley.h"
62
#include "sql_manager.h"
63
#include <stdarg.h>
unknown's avatar
unknown committed
64 65

#define HA_BERKELEY_ROWS_IN_TABLE 10000 /* to get optimization right */
unknown's avatar
unknown committed
66
#define HA_BERKELEY_RANGE_COUNT   100
67
#define HA_BERKELEY_MAX_ROWS	  10000000 /* Max rows in table */
68 69 70 71 72 73 74
/* extra rows for estimate_number_of_rows() */
#define HA_BERKELEY_EXTRA_ROWS	  100

/* Bits for share->status */
#define STATUS_PRIMARY_KEY_INIT 1
#define STATUS_ROW_COUNT_INIT	2
#define STATUS_BDB_ANALYZE	4
unknown's avatar
unknown committed
75 76

const char *ha_berkeley_ext=".db";
77
bool berkeley_skip=0,berkeley_shared_data=0;
unknown's avatar
unknown committed
78 79
u_int32_t berkeley_init_flags= DB_PRIVATE | DB_RECOVER, berkeley_env_flags=0,
          berkeley_lock_type=DB_LOCK_DEFAULT;
unknown's avatar
unknown committed
80
ulong berkeley_cache_size, berkeley_log_buffer_size, berkeley_log_file_size=0;
unknown's avatar
unknown committed
81 82
char *berkeley_home, *berkeley_tmpdir, *berkeley_logdir;
long berkeley_lock_scan_time=0;
83
ulong berkeley_trans_retry=1;
84
ulong berkeley_max_lock;
unknown's avatar
unknown committed
85 86 87 88 89 90
pthread_mutex_t bdb_mutex;

static DB_ENV *db_env;
static HASH bdb_open_tables;

const char *berkeley_lock_names[] =
91
{ "DEFAULT", "OLDEST","RANDOM","YOUNGEST",0 };
unknown's avatar
unknown committed
92 93 94 95 96 97 98 99
u_int32_t berkeley_lock_types[]=
{ DB_LOCK_DEFAULT, DB_LOCK_OLDEST, DB_LOCK_RANDOM };
TYPELIB berkeley_lock_typelib= {array_elements(berkeley_lock_names),"",
				berkeley_lock_names};

static void berkeley_print_error(const char *db_errpfx, char *buffer);
static byte* bdb_get_key(BDB_SHARE *share,uint *length,
			 my_bool not_used __attribute__((unused)));
100
static BDB_SHARE *get_share(const char *table_name, TABLE *table);
unknown's avatar
unknown committed
101 102
static int free_share(BDB_SHARE *share, TABLE *table, uint hidden_primary_key,
		      bool mutex_is_locked);
unknown's avatar
unknown committed
103
static int write_status(DB *status_block, char *buff, uint length);
104
static void update_status(BDB_SHARE *share, TABLE *table);
105
static void berkeley_noticecall(DB_ENV *db_env, db_notices notice);
unknown's avatar
unknown committed
106 107


108

unknown's avatar
unknown committed
109 110 111 112 113 114 115 116 117 118
/* General functions */

bool berkeley_init(void)
{
  DBUG_ENTER("berkeley_init");

  if (!berkeley_tmpdir)
    berkeley_tmpdir=mysql_tmpdir;
  if (!berkeley_home)
    berkeley_home=mysql_real_data_home;
119 120
  DBUG_PRINT("bdb",("berkeley_home: %s",mysql_real_data_home));

unknown's avatar
unknown committed
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137
  /*
    If we don't set set_lg_bsize() we will get into trouble when
    trying to use many open BDB tables.
    If log buffer is not set, assume that the we will need 512 byte per
    open table.  This is a number that we have reached by testing.
  */
  if (!berkeley_log_buffer_size)
  {
    berkeley_log_buffer_size= max(table_cache_size*512,32*1024);
  }
  /*
    Berkeley DB require that
    berkeley_log_file_size >= berkeley_log_buffer_size*4
  */
  berkeley_log_file_size= berkeley_log_buffer_size*4;
  berkeley_log_file_size= MY_ALIGN(berkeley_log_file_size,1024*1024L);
  berkeley_log_file_size= max(berkeley_log_file_size, 10*1024*1024L);
unknown's avatar
unknown committed
138 139

  if (db_env_create(&db_env,0))
unknown's avatar
unknown committed
140
    DBUG_RETURN(1); /* purecov: inspected */
unknown's avatar
unknown committed
141 142
  db_env->set_errcall(db_env,berkeley_print_error);
  db_env->set_errpfx(db_env,"bdb");
143
  db_env->set_noticecall(db_env, berkeley_noticecall);
unknown's avatar
unknown committed
144 145
  db_env->set_tmp_dir(db_env, berkeley_tmpdir);
  db_env->set_data_dir(db_env, mysql_data_home);
unknown's avatar
unknown committed
146
  db_env->set_flags(db_env, berkeley_env_flags, 1);
unknown's avatar
unknown committed
147
  if (berkeley_logdir)
unknown's avatar
unknown committed
148
    db_env->set_lg_dir(db_env, berkeley_logdir); /* purecov: tested */
unknown's avatar
unknown committed
149 150 151 152 153

  if (opt_endinfo)
    db_env->set_verbose(db_env,
			DB_VERB_CHKPOINT | DB_VERB_DEADLOCK | DB_VERB_RECOVERY,
			1);
unknown's avatar
unknown committed
154

unknown's avatar
unknown committed
155
  db_env->set_cachesize(db_env, 0, berkeley_cache_size, 0);
unknown's avatar
unknown committed
156 157
  db_env->set_lg_max(db_env, berkeley_log_file_size);
  db_env->set_lg_bsize(db_env, berkeley_log_buffer_size);
unknown's avatar
unknown committed
158
  db_env->set_lk_detect(db_env, berkeley_lock_type);
159 160
  if (berkeley_max_lock)
    db_env->set_lk_max(db_env, berkeley_max_lock);
161

unknown's avatar
unknown committed
162 163
  if (db_env->open(db_env,
		   berkeley_home,
unknown's avatar
unknown committed
164
		   berkeley_init_flags |  DB_INIT_LOCK |
unknown's avatar
unknown committed
165
		   DB_INIT_LOG | DB_INIT_MPOOL | DB_INIT_TXN |
166
		   DB_CREATE | DB_THREAD, 0666))
unknown's avatar
unknown committed
167
  {
unknown's avatar
unknown committed
168 169
    db_env->close(db_env,0); /* purecov: inspected */
    db_env=0; /* purecov: inspected */
unknown's avatar
unknown committed
170
  }
171

unknown's avatar
unknown committed
172 173 174 175 176 177 178 179 180 181 182 183
  (void) hash_init(&bdb_open_tables,32,0,0,
		   (hash_get_key) bdb_get_key,0,0);
  pthread_mutex_init(&bdb_mutex,NULL);
  DBUG_RETURN(db_env == 0);
}


bool berkeley_end(void)
{
  int error;
  DBUG_ENTER("berkeley_end");
  if (!db_env)
unknown's avatar
unknown committed
184
    return 1; /* purecov: tested */
185
  berkeley_cleanup_log_files();
unknown's avatar
unknown committed
186 187 188 189 190 191 192 193 194 195 196 197 198 199
  error=db_env->close(db_env,0);		// Error is logged
  db_env=0;
  hash_free(&bdb_open_tables);
  pthread_mutex_destroy(&bdb_mutex);
  DBUG_RETURN(error != 0);
}

bool berkeley_flush_logs()
{
  int error;
  bool result=0;
  DBUG_ENTER("berkeley_flush_logs");
  if ((error=log_flush(db_env,0)))
  {
200 201
    my_error(ER_ERROR_DURING_FLUSH_LOGS,MYF(0),error); /* purecov: inspected */
    result=1; /* purecov: inspected */
unknown's avatar
unknown committed
202 203 204
  }
  if ((error=txn_checkpoint(db_env,0,0,0)))
  {
205 206
    my_error(ER_ERROR_DURING_CHECKPOINT,MYF(0),error); /* purecov: inspected */
    result=1; /* purecov: inspected */
unknown's avatar
unknown committed
207 208 209 210 211
  }
  DBUG_RETURN(result);
}


212
int berkeley_commit(THD *thd, void *trans)
unknown's avatar
unknown committed
213 214
{
  DBUG_ENTER("berkeley_commit");
215 216
  DBUG_PRINT("trans",("ending transaction %s",
		      trans == thd->transaction.stmt.bdb_tid ? "stmt" : "all"));
217
  int error=txn_commit((DB_TXN*) trans,0);
unknown's avatar
unknown committed
218 219
#ifndef DBUG_OFF
  if (error)
220
    DBUG_PRINT("error",("error: %d",error)); /* purecov: inspected */
unknown's avatar
unknown committed
221 222 223 224
#endif
  DBUG_RETURN(error);
}

225
int berkeley_rollback(THD *thd, void *trans)
unknown's avatar
unknown committed
226 227
{
  DBUG_ENTER("berkeley_rollback");
228 229
  DBUG_PRINT("trans",("aborting transaction %s",
		      trans == thd->transaction.stmt.bdb_tid ? "stmt" : "all"));
230
  int error=txn_abort((DB_TXN*) trans);
unknown's avatar
unknown committed
231 232 233
  DBUG_RETURN(error);
}

unknown's avatar
unknown committed
234 235 236

int berkeley_show_logs(THD *thd)
{
237
  char **all_logs, **free_logs, **a, **f;
unknown's avatar
unknown committed
238
  String *packet= &thd->packet;
239 240 241
  int error=1;
  MEM_ROOT show_logs_root;
  MEM_ROOT *old_root=my_pthread_getspecific_ptr(MEM_ROOT*,THR_MALLOC);
unknown's avatar
unknown committed
242 243 244
  DBUG_ENTER("berkeley_show_logs");

  init_alloc_root(&show_logs_root, 1024, 1024);
245 246 247
  my_pthread_setspecific_ptr(THR_MALLOC,&show_logs_root);

  if ((error= log_archive(db_env, &all_logs, DB_ARCH_ABS | DB_ARCH_LOG,
248
			  (void* (*)(size_t)) sql_alloc)) ||
249
      (error= log_archive(db_env, &free_logs, DB_ARCH_ABS, 
250
			  (void* (*)(size_t)) sql_alloc)))
unknown's avatar
unknown committed
251 252 253
  {
    DBUG_PRINT("error", ("log_archive failed (error %d)", error));
    db_env->err(db_env, error, "log_archive: DB_ARCH_ABS");
unknown's avatar
unknown committed
254 255
    if (error== DB_NOTFOUND)
      error=0;					// No log files
256
    goto err;
unknown's avatar
unknown committed
257
  }
unknown's avatar
unknown committed
258 259
  /* Error is 0 here */
  if (all_logs)
unknown's avatar
unknown committed
260
  {
unknown's avatar
unknown committed
261
    for (a = all_logs, f = free_logs; *a; ++a)
unknown's avatar
unknown committed
262
    {
unknown's avatar
unknown committed
263 264 265 266 267 268 269 270 271 272
      packet->length(0);
      net_store_data(packet,*a);
      net_store_data(packet,"BDB");
      if (f && *f && strcmp(*a, *f) == 0)
      {
	++f;
	net_store_data(packet, SHOW_LOG_STATUS_FREE);
      }
      else
	net_store_data(packet, SHOW_LOG_STATUS_INUSE);
unknown's avatar
unknown committed
273

unknown's avatar
unknown committed
274 275 276 277 278 279
      if (my_net_write(&thd->net,(char*) packet->ptr(),packet->length()))
      {
	error=1;
	goto err;
      }
    }
unknown's avatar
unknown committed
280
  }
281
err:
unknown's avatar
unknown committed
282
  free_root(&show_logs_root,MYF(0));
283 284
  my_pthread_setspecific_ptr(THR_MALLOC,old_root);
  DBUG_RETURN(error);
unknown's avatar
unknown committed
285
}
unknown's avatar
unknown committed
286 287 288

static void berkeley_print_error(const char *db_errpfx, char *buffer)
{
289
  sql_print_error("%s:  %s",db_errpfx,buffer); /* purecov: tested */
unknown's avatar
unknown committed
290 291
}

292 293 294 295
static void berkeley_noticecall(DB_ENV *db_env, db_notices notice)
{
  switch (notice)
  {
296
  case DB_NOTICE_LOGFILE_CHANGED: /* purecov: tested */
297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313
    pthread_mutex_lock(&LOCK_manager);
    manager_status |= MANAGER_BERKELEY_LOG_CLEANUP;
    pthread_mutex_unlock(&LOCK_manager);
    pthread_cond_signal(&COND_manager);
    break;
  }
}

void berkeley_cleanup_log_files(void)
{
  DBUG_ENTER("berkeley_cleanup_log_files");
  char **names;
  int error;

  /* XXX: Probably this should be done somewhere else, and
   * should be tunable by the user. */
  if ((error = txn_checkpoint(db_env, 0, 0, 0)))
314
    my_error(ER_ERROR_DURING_CHECKPOINT, MYF(0), error); /* purecov: inspected */
315 316 317

  if ((error = log_archive(db_env, &names, DB_ARCH_ABS, NULL)) != 0)
  {
318 319 320
    DBUG_PRINT("error", ("log_archive failed (error %d)", error)); /* purecov: inspected */
    db_env->err(db_env, error, "log_archive: DB_ARCH_ABS"); /* purecov: inspected */
    DBUG_VOID_RETURN; /* purecov: inspected */
321 322 323
  }

  if (names)
unknown's avatar
unknown committed
324 325 326 327
  {						/* purecov: tested */
    char **np;					/* purecov: tested */
    for (np = names; *np; ++np)			/* purecov: tested */
      my_delete(*np, MYF(MY_WME));		/* purecov: tested */
328

unknown's avatar
unknown committed
329
    free(names);				/* purecov: tested */
330 331 332 333
  }

  DBUG_VOID_RETURN;
}
unknown's avatar
unknown committed
334 335 336 337 338 339 340 341 342 343


/*****************************************************************************
** Berkeley DB tables
*****************************************************************************/

const char **ha_berkeley::bas_ext() const
{ static const char *ext[]= { ha_berkeley_ext, NullS }; return ext; }


344
static int
345
berkeley_cmp_hidden_key(DB* file, const DBT *new_key, const DBT *saved_key)
346 347 348
{
  ulonglong a=uint5korr((char*) new_key->data);
  ulonglong b=uint5korr((char*) saved_key->data);
unknown's avatar
unknown committed
349
  return  a < b ? -1 : (a > b ? 1 : 0);
350 351
}

unknown's avatar
unknown committed
352
static int
353
berkeley_cmp_packed_key(DB *file, const DBT *new_key, const DBT *saved_key)
unknown's avatar
unknown committed
354
{
unknown's avatar
unknown committed
355
  KEY *key=	      (KEY*) (file->app_private);
unknown's avatar
unknown committed
356 357 358 359 360 361 362 363 364 365
  char *new_key_ptr=  (char*) new_key->data;
  char *saved_key_ptr=(char*) saved_key->data;
  KEY_PART_INFO *key_part= key->key_part, *end=key_part+key->key_parts;
  uint key_length=new_key->size;

  for ( ; key_part != end && (int) key_length > 0; key_part++)
  {
    int cmp;
    if (key_part->null_bit)
    {
366 367 368 369 370 371 372
      if (*new_key_ptr != *saved_key_ptr++)
	return ((int) *new_key_ptr - (int) saved_key_ptr[-1]);
      if (!*new_key_ptr++)
      {
	key_length--;
	continue;
      }
unknown's avatar
unknown committed
373 374 375 376 377 378 379 380 381
    }
    if ((cmp=key_part->field->pack_cmp(new_key_ptr,saved_key_ptr,
				       key_part->length)))
      return cmp;
    uint length=key_part->field->packed_col_length(new_key_ptr);
    new_key_ptr+=length;
    key_length-=length;
    saved_key_ptr+=key_part->field->packed_col_length(saved_key_ptr);
  }
382
  return key->handler.bdb_return_if_eq;
unknown's avatar
unknown committed
383 384 385
}


386 387
/* The following is not yet used; Should be used for fixed length keys */

388
#ifdef NOT_YET
unknown's avatar
unknown committed
389
static int
390
berkeley_cmp_fix_length_key(DB *file, const DBT *new_key, const DBT *saved_key)
unknown's avatar
unknown committed
391
{
unknown's avatar
unknown committed
392
  KEY *key=(KEY*) (file->app_private);
unknown's avatar
unknown committed
393 394 395 396 397 398 399 400 401 402 403 404 405 406
  char *new_key_ptr=  (char*) new_key->data;
  char *saved_key_ptr=(char*) saved_key->data;
  KEY_PART_INFO *key_part= key->key_part, *end=key_part+key->key_parts;
  uint key_length=new_key->size;

  for ( ; key_part != end && (int) key_length > 0 ; key_part++)
  {
    int cmp;
    if ((cmp=key_part->field->pack_cmp(new_key_ptr,saved_key_ptr,0)))
      return cmp;
    new_key_ptr+=key_part->length;
    key_length-= key_part->length;
    saved_key_ptr+=key_part->length;
  }
407
  return key->handler.bdb_return_if_eq;
unknown's avatar
unknown committed
408
}
409
#endif
unknown's avatar
unknown committed
410

411 412 413 414 415 416
/* Compare key against row */

static bool
berkeley_key_cmp(TABLE *table, KEY *key_info, const char *key, uint key_length)
{
  KEY_PART_INFO *key_part= key_info->key_part,
unknown's avatar
unknown committed
417
		*end=key_part+key_info->key_parts;
418 419 420 421 422 423 424

  for ( ; key_part != end && (int) key_length > 0; key_part++)
  {
    int cmp;
    if (key_part->null_bit)
    {
      key_length--;
425 426 427 428
      /*
	With the current usage, the following case will always be FALSE,
	because NULL keys are sorted before any other key
      */
429 430 431
      if (*key != (table->record[0][key_part->null_offset] &
		   key_part->null_bit) ? 0 : 1)
	return 1;
432
      if (!*key++)				// Null value
433 434 435 436 437 438 439 440
	continue;
    }
    if ((cmp=key_part->field->pack_cmp(key,key_part->length)))
      return cmp;
    uint length=key_part->field->packed_col_length(key);
    key+=length;
    key_length-=length;
  }
441
  return 0;					// Identical keys
442 443 444
}


445
int ha_berkeley::open(const char *name, int mode, uint test_if_locked)
unknown's avatar
unknown committed
446 447 448 449 450 451
{
  char name_buff[FN_REFLEN];
  uint open_mode=(mode == O_RDONLY ? DB_RDONLY : 0) | DB_THREAD;
  int error;
  DBUG_ENTER("ha_berkeley::open");

452 453 454 455 456 457 458 459 460
  /* Open primary key */
  hidden_primary_key=0;
  if ((primary_key=table->primary_key) >= MAX_KEY)
  {						// No primary key
    primary_key=table->keys;
    ref_length=hidden_primary_key=BDB_HIDDEN_PRIMARY_KEY_LENGTH;
  }
  key_used_on_scan=primary_key;

unknown's avatar
unknown committed
461 462 463 464 465 466 467
  /* Need some extra memory in case of packed keys */
  uint max_key_length= table->max_key_length + MAX_REF_PARTS*2;
  if (!(alloc_ptr=
	my_multi_malloc(MYF(MY_WME),
			&key_buff,  max_key_length,
			&key_buff2, max_key_length,
			&primary_key_buff,
468 469
			(hidden_primary_key ? 0 :
			 table->key_info[table->primary_key].key_length),
unknown's avatar
unknown committed
470
			NullS)))
471
    DBUG_RETURN(1); /* purecov: inspected */
472
  if (!(rec_buff=my_malloc((alloced_rec_buff_length=table->rec_buff_length),
unknown's avatar
unknown committed
473 474
			   MYF(MY_WME))))
  {
475 476
    my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
    DBUG_RETURN(1); /* purecov: inspected */
unknown's avatar
unknown committed
477 478
  }

479
  /* Init shared structure */
480
  if (!(share=get_share(name,table)))
unknown's avatar
unknown committed
481
  {
482 483 484
    my_free(rec_buff,MYF(0)); /* purecov: inspected */
    my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
    DBUG_RETURN(1); /* purecov: inspected */
unknown's avatar
unknown committed
485 486
  }
  thr_lock_data_init(&share->lock,&lock,(void*) 0);
487 488
  key_file = share->key_file;
  key_type = share->key_type;
489
  bzero((char*) &current_row,sizeof(current_row));
unknown's avatar
unknown committed
490

491 492 493 494
  /* Fill in shared structure, if needed */
  pthread_mutex_lock(&share->mutex);
  file = share->file;
  if (!share->use_count++)
unknown's avatar
unknown committed
495
  {
496 497
    if ((error=db_create(&file, db_env, 0)))
    {
498 499 500 501 502
      free_share(share,table, hidden_primary_key,1); /* purecov: inspected */
      my_free(rec_buff,MYF(0)); /* purecov: inspected */
      my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
      my_errno=error; /* purecov: inspected */
      DBUG_RETURN(1); /* purecov: inspected */
503 504 505 506 507 508 509 510 511 512 513 514
    }
    share->file = file;

    file->set_bt_compare(file,
			 (hidden_primary_key ? berkeley_cmp_hidden_key :
			  berkeley_cmp_packed_key));
    if (!hidden_primary_key)
      file->app_private= (void*) (table->key_info+table->primary_key);
    if ((error=(file->open(file, fn_format(name_buff,name,"", ha_berkeley_ext,
					   2 | 4),
			   "main", DB_BTREE, open_mode,0))))
    {
515 516 517 518 519
      free_share(share,table, hidden_primary_key,1); /* purecov: inspected */
      my_free(rec_buff,MYF(0)); /* purecov: inspected */
      my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
      my_errno=error; /* purecov: inspected */
      DBUG_RETURN(1); /* purecov: inspected */
520
    }
unknown's avatar
unknown committed
521

522
    /* Open other keys;  These are part of the share structure */
523 524 525 526 527 528 529 530 531 532 533
    key_file[primary_key]=file;
    key_type[primary_key]=DB_NOOVERWRITE;

    DB **ptr=key_file;
    for (uint i=0, used_keys=0; i < table->keys ; i++, ptr++)
    {
      char part[7];
      if (i != primary_key)
      {
	if ((error=db_create(ptr, db_env, 0)))
	{
unknown's avatar
unknown committed
534 535 536
	  close();				/* purecov: inspected */
	  my_errno=error;			/* purecov: inspected */
	  DBUG_RETURN(1);			/* purecov: inspected */
537 538 539 540 541 542 543 544 545 546
	}
	sprintf(part,"key%02d",++used_keys);
	key_type[i]=table->key_info[i].flags & HA_NOSAME ? DB_NOOVERWRITE : 0;
	(*ptr)->set_bt_compare(*ptr, berkeley_cmp_packed_key);
	(*ptr)->app_private= (void*) (table->key_info+i);
	if (!(table->key_info[i].flags & HA_NOSAME))
	  (*ptr)->set_flags(*ptr, DB_DUP);
	if ((error=((*ptr)->open(*ptr, name_buff, part, DB_BTREE,
				 open_mode, 0))))
	{
unknown's avatar
unknown committed
547 548 549
	  close();				/* purecov: inspected */
	  my_errno=error;			/* purecov: inspected */
	  DBUG_RETURN(1);			/* purecov: inspected */
550 551 552 553
	}
      }
    }
    /* Calculate pack_length of primary key */
554
    share->fixed_length_primary_key=1;
555 556 557 558 559 560 561
    if (!hidden_primary_key)
    {
      ref_length=0;
      KEY_PART_INFO *key_part= table->key_info[primary_key].key_part;
      KEY_PART_INFO *end=key_part+table->key_info[primary_key].key_parts;
      for ( ; key_part != end ; key_part++)
	ref_length+= key_part->field->max_packed_col_length(key_part->length);
562
      share->fixed_length_primary_key=
563 564 565
	(ref_length == table->key_info[primary_key].key_length);
      share->status|=STATUS_PRIMARY_KEY_INIT;
    }    
566
    share->ref_length=ref_length;
unknown's avatar
unknown committed
567
  }
568
  ref_length=share->ref_length;			// If second open
569
  pthread_mutex_unlock(&share->mutex);
unknown's avatar
unknown committed
570 571 572

  transaction=0;
  cursor=0;
573
  key_read=0;
574
  share->fixed_length_row=!(table->db_create_options & HA_OPTION_PACK_RECORD);
unknown's avatar
unknown committed
575

576
  get_status();
unknown's avatar
unknown committed
577
  info(HA_STATUS_NO_LOCK | HA_STATUS_VARIABLE | HA_STATUS_CONST);
unknown's avatar
unknown committed
578 579 580 581 582 583 584 585 586 587
  DBUG_RETURN(0);
}


int ha_berkeley::close(void)
{
  DBUG_ENTER("ha_berkeley::close");

  my_free(rec_buff,MYF(MY_ALLOW_ZERO_PTR));
  my_free(alloc_ptr,MYF(MY_ALLOW_ZERO_PTR));
unknown's avatar
unknown committed
588
  ha_berkeley::extra(HA_EXTRA_RESET);		// current_row buffer
unknown's avatar
unknown committed
589
  DBUG_RETURN(free_share(share,table, hidden_primary_key,0));
unknown's avatar
unknown committed
590 591 592 593 594 595 596 597 598 599 600 601
}


/* Reallocate buffer if needed */

bool ha_berkeley::fix_rec_buff_for_blob(ulong length)
{
  if (! rec_buff || length > alloced_rec_buff_length)
  {
    byte *newptr;
    if (!(newptr=(byte*) my_realloc((gptr) rec_buff, length,
				    MYF(MY_ALLOW_ZERO_PTR))))
602
      return 1; /* purecov: inspected */
unknown's avatar
unknown committed
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
    rec_buff=newptr;
    alloced_rec_buff_length=length;
  }
  return 0;
}


/* Calculate max length needed for row */

ulong ha_berkeley::max_row_length(const byte *buf)
{
  ulong length=table->reclength + table->fields*2;
  for (Field_blob **ptr=table->blob_field ; *ptr ; ptr++)
    length+= (*ptr)->get_length(buf+(*ptr)->offset())+2;
  return length;
}


/*
  Pack a row for storage.  If the row is of fixed length, just store the
  row 'as is'.
  If not, we will generate a packed row suitable for storage.
  This will only fail if we don't have enough memory to pack the row, which;
  may only happen in rows with blobs,  as the default row length is
  pre-allocated.
*/

630
int ha_berkeley::pack_row(DBT *row, const byte *record, bool new_row)
unknown's avatar
unknown committed
631 632
{
  bzero((char*) row,sizeof(*row));
633
  if (share->fixed_length_row)
unknown's avatar
unknown committed
634 635
  {
    row->data=(void*) record;
636 637 638 639 640 641 642 643
    row->size=table->reclength+hidden_primary_key;
    if (hidden_primary_key)
    {
      if (new_row)
	get_auto_primary_key(current_ident);
      memcpy_fixed((char*) record+table->reclength, (char*) current_ident,
		   BDB_HIDDEN_PRIMARY_KEY_LENGTH);
    }
unknown's avatar
unknown committed
644 645 646 647 648
    return 0;
  }
  if (table->blob_fields)
  {
    if (fix_rec_buff_for_blob(max_row_length(record)))
649
      return HA_ERR_OUT_OF_MEM; /* purecov: inspected */
unknown's avatar
unknown committed
650 651 652 653 654 655 656 657
  }

  /* Copy null bits */
  memcpy(rec_buff, record, table->null_bytes);
  byte *ptr=rec_buff + table->null_bytes;

  for (Field **field=table->field ; *field ; field++)
    ptr=(byte*) (*field)->pack((char*) ptr,record + (*field)->offset());
658 659 660 661 662 663 664 665 666

  if (hidden_primary_key)
  {
    if (new_row)
      get_auto_primary_key(current_ident);
    memcpy_fixed((char*) ptr, (char*) current_ident,
		 BDB_HIDDEN_PRIMARY_KEY_LENGTH);
    ptr+=BDB_HIDDEN_PRIMARY_KEY_LENGTH;
  }
unknown's avatar
unknown committed
667 668 669 670 671 672 673 674
  row->data=rec_buff;
  row->size= (size_t) (ptr - rec_buff);
  return 0;
}


void ha_berkeley::unpack_row(char *record, DBT *row)
{
675
  if (share->fixed_length_row)
676
    memcpy(record,(char*) row->data,table->reclength+hidden_primary_key);
unknown's avatar
unknown committed
677 678 679 680 681 682 683 684 685 686 687 688
  else
  {
    /* Copy null bits */
    const char *ptr= (const char*) row->data;
    memcpy(record, ptr, table->null_bytes);
    ptr+=table->null_bytes;
    for (Field **field=table->field ; *field ; field++)
      ptr= (*field)->unpack(record + (*field)->offset(), ptr);
  }
}


689 690 691 692 693 694
/* Store the key and the primary key into the row */

void ha_berkeley::unpack_key(char *record, DBT *key, uint index)
{
  KEY *key_info=table->key_info+index;
  KEY_PART_INFO *key_part= key_info->key_part,
unknown's avatar
unknown committed
695
		*end=key_part+key_info->key_parts;
696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719

  char *pos=(char*) key->data;
  for ( ; key_part != end; key_part++)
  {
    if (key_part->null_bit)
    {
      if (!*pos++)				// Null value
      {
	/*
	  We don't need to reset the record data as we will not access it
	  if the null data is set
	*/

	record[key_part->null_offset]|=key_part->null_bit;
	continue;
      }
      record[key_part->null_offset]&= ~key_part->null_bit;
    }
    pos= (char*) key_part->field->unpack(record + key_part->field->offset(),
					 pos);
  }
}


unknown's avatar
unknown committed
720 721 722 723 724
/*
  Create a packed key from from a row
  This will never fail as the key buffer is pre allocated.
*/

725 726
DBT *ha_berkeley::create_key(DBT *key, uint keynr, char *buff,
			     const byte *record, int key_length)
unknown's avatar
unknown committed
727
{
728 729 730 731 732 733 734 735 736
  bzero((char*) key,sizeof(*key));

  if (hidden_primary_key && keynr == primary_key)
  {
    key->data=current_ident;
    key->size=BDB_HIDDEN_PRIMARY_KEY_LENGTH;
    return key;
  }

unknown's avatar
unknown committed
737 738 739
  KEY *key_info=table->key_info+keynr;
  KEY_PART_INFO *key_part=key_info->key_part;
  KEY_PART_INFO *end=key_part+key_info->key_parts;
740
  DBUG_ENTER("create_key");
unknown's avatar
unknown committed
741 742

  key->data=buff;
743
  for ( ; key_part != end && key_length > 0; key_part++)
unknown's avatar
unknown committed
744 745 746 747 748 749 750 751 752 753 754 755
  {
    if (key_part->null_bit)
    {
      /* Store 0 if the key part is a NULL part */
      if (record[key_part->null_offset] & key_part->null_bit)
      {
	*buff++ =0;
	key->flags|=DB_DBT_DUPOK;
	continue;
      }
      *buff++ = 1;				// Store NOT NULL marker
    }
756 757
    buff=key_part->field->pack_key(buff,record + key_part->offset,
				   key_part->length);
758
    key_length-=key_part->length;
unknown's avatar
unknown committed
759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782
  }
  key->size= (buff  - (char*) key->data);
  DBUG_DUMP("key",(char*) key->data, key->size);
  DBUG_RETURN(key);
}


/*
  Create a packed key from from a MySQL unpacked key
*/

DBT *ha_berkeley::pack_key(DBT *key, uint keynr, char *buff,
			   const byte *key_ptr, uint key_length)
{
  KEY *key_info=table->key_info+keynr;
  KEY_PART_INFO *key_part=key_info->key_part;
  KEY_PART_INFO *end=key_part+key_info->key_parts;
  DBUG_ENTER("pack_key2");

  bzero((char*) key,sizeof(*key));
  key->data=buff;

  for (; key_part != end && (int) key_length > 0 ; key_part++)
  {
783
    uint offset=0;
unknown's avatar
unknown committed
784 785 786 787 788 789 790 791 792
    if (key_part->null_bit)
    {
      if (!(*buff++ = (*key_ptr == 0)))		// Store 0 if NULL
      {
	key_length-= key_part->store_length;
	key_ptr+=   key_part->store_length;
	key->flags|=DB_DBT_DUPOK;
	continue;
      }
793
      offset=1;					// Data is at key_ptr+1
unknown's avatar
unknown committed
794
    }
795
    buff=key_part->field->pack_key_from_key_image(buff,key_ptr+offset,
796
						  key_part->length);
unknown's avatar
unknown committed
797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816
    key_ptr+=key_part->store_length;
    key_length-=key_part->store_length;
  }
  key->size= (buff  - (char*) key->data);
  DBUG_DUMP("key",(char*) key->data, key->size);
  DBUG_RETURN(key);
}


int ha_berkeley::write_row(byte * record)
{
  DBT row,prim_key,key;
  int error;
  DBUG_ENTER("write_row");

  statistic_increment(ha_write_count,&LOCK_status);
  if (table->time_stamp)
    update_timestamp(record+table->time_stamp-1);
  if (table->next_number_field && record == table->record[0])
    update_auto_increment();
817
  if ((error=pack_row(&row, record,1)))
818
    DBUG_RETURN(error); /* purecov: inspected */
unknown's avatar
unknown committed
819

820
  if (table->keys + test(hidden_primary_key) == 1)
unknown's avatar
unknown committed
821
  {
822 823
    error=file->put(file, transaction, create_key(&prim_key, primary_key,
						  key_buff, record),
unknown's avatar
unknown committed
824
		    &row, key_type[primary_key]);
unknown's avatar
unknown committed
825
    last_dup_key=primary_key;
unknown's avatar
unknown committed
826 827 828
  }
  else
  {
829
    DB_TXN *sub_trans = transaction;
unknown's avatar
unknown committed
830 831
    /* Don't use sub transactions in temporary tables (in_use == 0) */
    ulong thd_options = table->in_use ? table->in_use->options : 0;
unknown's avatar
unknown committed
832 833
    for (uint retry=0 ; retry < berkeley_trans_retry ; retry++)
    {
834 835 836
      key_map changed_keys = 0;
      if (using_ignore && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
      {
837 838 839
	if ((error=txn_begin(db_env, transaction, &sub_trans, 0))) /* purecov: deadcode */
	  break; /* purecov: deadcode */
	DBUG_PRINT("trans",("starting subtransaction")); /* purecov: deadcode */
840
      }
841 842
      if (!(error=file->put(file, sub_trans, create_key(&prim_key, primary_key,
							key_buff, record),
unknown's avatar
unknown committed
843 844
			    &row, key_type[primary_key])))
      {
845 846
	changed_keys |= (key_map) 1 << primary_key;
	for (uint keynr=0 ; keynr < table->keys ; keynr++)
unknown's avatar
unknown committed
847 848 849 850
	{
	  if (keynr == primary_key)
	    continue;
	  if ((error=key_file[keynr]->put(key_file[keynr], sub_trans,
851 852
					  create_key(&key, keynr, key_buff2,
						     record),
unknown's avatar
unknown committed
853 854 855 856 857
					  &prim_key, key_type[keynr])))
	  {
	    last_dup_key=keynr;
	    break;
	  }
858
	  changed_keys |= (key_map) 1 << keynr;
unknown's avatar
unknown committed
859 860
	}
      }
unknown's avatar
unknown committed
861 862
      else
	last_dup_key=primary_key;
863
      if (error)
unknown's avatar
unknown committed
864 865 866
      {
	/* Remove inserted row */
	DBUG_PRINT("error",("Got error %d",error));
867
	if (using_ignore)
unknown's avatar
unknown committed
868
	{
869 870 871
	  int new_error = 0;
	  if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
	  {
872 873
	    DBUG_PRINT("trans",("aborting subtransaction")); /* purecov: deadcode */
	    new_error=txn_abort(sub_trans); /* purecov: deadcode */
874 875 876 877 878 879 880 881 882 883
	  }
	  else if (changed_keys)
	  {
	    new_error = 0;
	    for (uint keynr=0; changed_keys; keynr++, changed_keys >>= 1)
	    {
	      if (changed_keys & 1)
	      {
		if ((new_error = remove_key(sub_trans, keynr, record,
					    (DBT*) 0, &prim_key)))
884
		  break; /* purecov: inspected */
885 886 887 888 889
	      }
	    }
	  }
	  if (new_error)
	  {
890 891
	    error=new_error;			// This shouldn't happen /* purecov: inspected */
	    break; /* purecov: inspected */
892
	  }
unknown's avatar
unknown committed
893 894
	}
      }
895 896
      else if (using_ignore && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
      {
897 898
	DBUG_PRINT("trans",("committing subtransaction")); /* purecov: deadcode */
	error=txn_commit(sub_trans, 0); /* purecov: deadcode */
899
      }
unknown's avatar
unknown committed
900 901 902 903 904 905
      if (error != DB_LOCK_DEADLOCK)
	break;
    }
  }
  if (error == DB_KEYEXIST)
    error=HA_ERR_FOUND_DUPP_KEY;
906 907
  else if (!error)
    changed_rows++;
unknown's avatar
unknown committed
908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929
  DBUG_RETURN(error);
}


/* Compare if a key in a row has changed */

int ha_berkeley::key_cmp(uint keynr, const byte * old_row,
			 const byte * new_row)
{
  KEY_PART_INFO *key_part=table->key_info[keynr].key_part;
  KEY_PART_INFO *end=key_part+table->key_info[keynr].key_parts;

  for ( ; key_part != end ; key_part++)
  {
    if (key_part->null_bit)
    {
      if ((old_row[key_part->null_offset] & key_part->null_bit) !=
	  (new_row[key_part->null_offset] & key_part->null_bit))
	return 1;
    }
    if (key_part->key_part_flag & (HA_BLOB_PART | HA_VAR_LENGTH))
    {
unknown's avatar
unknown committed
930

unknown's avatar
unknown committed
931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948
      if (key_part->field->cmp_binary(old_row + key_part->offset,
				      new_row + key_part->offset,
				      (ulong) key_part->length))
	return 1;
    }
    else
    {
      if (memcmp(old_row+key_part->offset, new_row+key_part->offset,
		 key_part->length))
	return 1;
    }
  }
  return 0;
}


/*
  Update a row from one value to another.
949
  Clobbers key_buff2
unknown's avatar
unknown committed
950 951 952
*/

int ha_berkeley::update_primary_key(DB_TXN *trans, bool primary_key_changed,
953 954 955
				    const byte * old_row, DBT *old_key,
				    const byte * new_row, DBT *new_key,
				    ulong thd_options, bool local_using_ignore)
unknown's avatar
unknown committed
956
{
957
  DBT row;
958
  int error;
unknown's avatar
unknown committed
959 960 961 962 963 964
  DBUG_ENTER("update_primary_key");

  if (primary_key_changed)
  {
    // Primary key changed or we are updating a key that can have duplicates.
    // Delete the old row and add a new one
965
    if (!(error=remove_key(trans, primary_key, old_row, (DBT *) 0, old_key)))
unknown's avatar
unknown committed
966
    {
967 968 969 970 971 972 973 974 975 976 977 978 979 980
      if (!(error=pack_row(&row, new_row, 0)))
      {
	if ((error=file->put(file, trans, new_key, &row,
			     key_type[primary_key])))
	{
	  // Probably a duplicated key; restore old key and row if needed
	  last_dup_key=primary_key;
	  if (local_using_ignore &&
	      !(thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
	  {
	    int new_error;
	    if ((new_error=pack_row(&row, old_row, 0)) ||
		(new_error=file->put(file, trans, old_key, &row,
				     key_type[primary_key])))
981
	      error=new_error;                  // fatal error /* purecov: inspected */
982 983 984
	  }
	}
      }
unknown's avatar
unknown committed
985 986 987 988 989
    }
  }
  else
  {
    // Primary key didn't change;  just update the row data
990 991
    if (!(error=pack_row(&row, new_row, 0)))
      error=file->put(file, trans, new_key, &row, 0);
unknown's avatar
unknown committed
992
  }
993
  DBUG_RETURN(error);
unknown's avatar
unknown committed
994 995
}

996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015
/*
  Restore changed keys, when a non-fatal error aborts the insert/update
  of one row.
  Clobbers keybuff2
*/

int ha_berkeley::restore_keys(DB_TXN *trans, key_map changed_keys,
			      uint primary_key,
			      const byte *old_row, DBT *old_key,
			      const byte *new_row, DBT *new_key,
			      ulong thd_options)
{
  int error;
  DBT tmp_key;
  DBUG_ENTER("restore_keys");

  /* Restore the old primary key, and the old row, but don't ignore
     duplicate key failure */
  if ((error=update_primary_key(trans, TRUE, new_row, new_key,
				old_row, old_key, thd_options, FALSE)))
1016
    goto err; /* purecov: inspected */
1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028

  /* Remove the new key, and put back the old key
     changed_keys is a map of all non-primary keys that need to be
     rolled back.  The last key set in changed_keys is the one that
     triggered the duplicate key error (it wasn't inserted), so for
     that one just put back the old value. */
  for (uint keynr=0; changed_keys; keynr++, changed_keys >>= 1)
  {
    if (changed_keys & 1)
    {
      if (changed_keys != 1 &&
	  (error = remove_key(trans, keynr, new_row, (DBT*) 0, new_key)))
1029
	break; /* purecov: inspected */
1030 1031 1032 1033
      if ((error = key_file[keynr]->put(key_file[keynr], trans,
					create_key(&tmp_key, keynr, key_buff2,
						   old_row),
					old_key, key_type[keynr])))
1034
	break; /* purecov: inspected */
1035 1036 1037 1038 1039 1040 1041
    }
  }
  
err:
  dbug_assert(error != DB_KEYEXIST);
  DBUG_RETURN(error);
}
unknown's avatar
unknown committed
1042 1043 1044 1045


int ha_berkeley::update_row(const byte * old_row, byte * new_row)
{
1046
  DBT prim_key, key, old_prim_key;
unknown's avatar
unknown committed
1047 1048
  int error;
  DB_TXN *sub_trans;
unknown's avatar
unknown committed
1049
  ulong thd_options = table->in_use ? table->in_use->options : 0;
unknown's avatar
unknown committed
1050 1051
  bool primary_key_changed;
  DBUG_ENTER("update_row");
unknown's avatar
unknown committed
1052
  LINT_INIT(error);
unknown's avatar
unknown committed
1053 1054 1055 1056

  statistic_increment(ha_update_count,&LOCK_status);
  if (table->time_stamp)
    update_timestamp(new_row+table->time_stamp-1);
1057 1058 1059 1060 1061 1062 1063

  if (hidden_primary_key)
  {
    primary_key_changed=0;
    bzero((char*) &prim_key,sizeof(prim_key));
    prim_key.data= (void*) current_ident;
    prim_key.size=BDB_HIDDEN_PRIMARY_KEY_LENGTH;
unknown's avatar
unknown committed
1064
    old_prim_key=prim_key;
1065 1066 1067
  }
  else
  {
1068
    create_key(&prim_key, primary_key, key_buff, new_row);
unknown's avatar
unknown committed
1069

1070
    if ((primary_key_changed=key_cmp(primary_key, old_row, new_row)))
1071
      create_key(&old_prim_key, primary_key, primary_key_buff, old_row);
1072 1073 1074
    else
      old_prim_key=prim_key;
  }
unknown's avatar
unknown committed
1075

1076
  sub_trans = transaction;
unknown's avatar
unknown committed
1077 1078
  for (uint retry=0 ; retry < berkeley_trans_retry ; retry++)
  {
1079 1080 1081
    key_map changed_keys = 0;
    if (using_ignore &&	(thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
    {
1082 1083 1084
      if ((error=txn_begin(db_env, transaction, &sub_trans, 0))) /* purecov: deadcode */
	break; /* purecov: deadcode */
      DBUG_PRINT("trans",("starting subtransaction")); /* purecov: deadcode */
1085
    }
unknown's avatar
unknown committed
1086 1087
    /* Start by updating the primary key */
    if (!(error=update_primary_key(sub_trans, primary_key_changed,
1088 1089 1090
				   old_row, &old_prim_key,
				   new_row, &prim_key,
				   thd_options, using_ignore)))
unknown's avatar
unknown committed
1091 1092 1093 1094 1095 1096 1097 1098 1099
    {
      // Update all other keys
      for (uint keynr=0 ; keynr < table->keys ; keynr++)
      {
	if (keynr == primary_key)
	  continue;
	if (key_cmp(keynr, old_row, new_row) || primary_key_changed)
	{
	  if ((error=remove_key(sub_trans, keynr, old_row, (DBT*) 0,
1100 1101
				&old_prim_key)))
	  {
1102
	    if (using_ignore && /* purecov: inspected */
1103 1104 1105 1106 1107 1108 1109 1110
		(thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
            {
	      int new_error;
	      DBUG_PRINT("trans",("aborting subtransaction"));
	      new_error=txn_abort(sub_trans);
	      if (new_error)
		error = new_error;
	    }
1111
	    DBUG_RETURN(error);			// Fatal error /* purecov: inspected */
1112 1113 1114
	  }
	  changed_keys |= (key_map)1 << keynr;
	  if ((error=key_file[keynr]->put(key_file[keynr], sub_trans,
1115
					  create_key(&key, keynr, key_buff2,
1116
						     new_row),
unknown's avatar
unknown committed
1117 1118 1119 1120 1121 1122 1123 1124
					  &prim_key, key_type[keynr])))
	  {
	    last_dup_key=keynr;
	    break;
	  }
	}
      }
    }
1125
    if (error)
unknown's avatar
unknown committed
1126 1127
    {
      /* Remove inserted row */
1128 1129 1130 1131 1132 1133
      DBUG_PRINT("error",("Got error %d",error));
      if (using_ignore)
      {
	int new_error = 0;
	if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
	{
1134 1135
	  DBUG_PRINT("trans",("aborting subtransaction")); /* purecov: deadcode */
	  new_error=txn_abort(sub_trans); /* purecov: deadcode */
1136 1137 1138 1139 1140 1141 1142
	}
	else if (changed_keys)
	  new_error=restore_keys(transaction, changed_keys, primary_key,
				 old_row, &old_prim_key, new_row, &prim_key,
				 thd_options);
	if (new_error)
	{
1143 1144
	  error=new_error;			// This shouldn't happen /* purecov: inspected */
	  break; /* purecov: inspected */
1145 1146 1147 1148 1149
	}
      }
    }
    else if (using_ignore && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
    {
1150 1151
      DBUG_PRINT("trans",("committing subtransaction")); /* purecov: deadcode */
      error=txn_commit(sub_trans, 0); /* purecov: deadcode */
unknown's avatar
unknown committed
1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168
    }
    if (error != DB_LOCK_DEADLOCK)
      break;
  }
  if (error == DB_KEYEXIST)
    error=HA_ERR_FOUND_DUPP_KEY;
  DBUG_RETURN(error);
}


/*
  Delete one key
  This uses key_buff2, when keynr != primary key, so it's important that
  a function that calls this doesn't use this buffer for anything else.
  packed_record may be NULL if the key is unique
*/

1169
int ha_berkeley::remove_key(DB_TXN *trans, uint keynr, const byte *record,
unknown's avatar
unknown committed
1170 1171 1172 1173 1174 1175 1176 1177
			    DBT *packed_record,
			    DBT *prim_key)
{
  int error;
  DBT key;
  DBUG_ENTER("remove_key");
  DBUG_PRINT("enter",("index: %d",keynr));

unknown's avatar
unknown committed
1178 1179 1180
  if (keynr == primary_key ||
      ((table->key_info[keynr].flags & (HA_NOSAME | HA_NULL_PART_KEY)) ==
       HA_NOSAME))
unknown's avatar
unknown committed
1181 1182
  {						// Unique key
    dbug_assert(keynr == primary_key || prim_key->data != key_buff2);
1183
    error=key_file[keynr]->del(key_file[keynr], trans,
unknown's avatar
unknown committed
1184 1185
			       keynr == primary_key ?
			       prim_key :
1186
			       create_key(&key, keynr, key_buff2, record),
unknown's avatar
unknown committed
1187 1188 1189 1190 1191 1192 1193 1194 1195 1196
			       0);
  }
  else
  {
    /*
      To delete the not duplicated key, we need to open an cursor on the
      row to find the key to be delete and delete it.
      We will never come here with keynr = primary_key
    */
    dbug_assert(keynr != primary_key && prim_key->data != key_buff2);
unknown's avatar
unknown committed
1197
    DBC *tmp_cursor;
1198 1199
    if (!(error=key_file[keynr]->cursor(key_file[keynr], trans,
					&tmp_cursor, 0)))
unknown's avatar
unknown committed
1200
    {
unknown's avatar
unknown committed
1201
      if (!(error=cursor->c_get(tmp_cursor,
unknown's avatar
unknown committed
1202
			       (keynr == primary_key ?
unknown's avatar
unknown committed
1203
				prim_key :
1204
				create_key(&key, keynr, key_buff2, record)),
unknown's avatar
unknown committed
1205
			       (keynr == primary_key ?
unknown's avatar
unknown committed
1206
				packed_record :  prim_key),
1207
				DB_GET_BOTH | DB_RMW)))
unknown's avatar
unknown committed
1208
      {					// This shouldn't happen
unknown's avatar
unknown committed
1209
	error=tmp_cursor->c_del(tmp_cursor,0);
unknown's avatar
unknown committed
1210
      }
unknown's avatar
unknown committed
1211
      int result=tmp_cursor->c_close(tmp_cursor);
unknown's avatar
unknown committed
1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222
      if (!error)
	error=result;
    }
  }
  DBUG_RETURN(error);
}


/* Delete all keys for new_record */

int ha_berkeley::remove_keys(DB_TXN *trans, const byte *record,
1223
			     DBT *new_record, DBT *prim_key, key_map keys)
unknown's avatar
unknown committed
1224
{
1225 1226
  int result = 0;
  for (uint keynr=0; keys; keynr++, keys>>=1)
unknown's avatar
unknown committed
1227 1228 1229 1230 1231 1232
  {
    if (keys & 1)
    {
      int new_error=remove_key(trans, keynr, record, new_record, prim_key);
      if (new_error)
      {
1233 1234
	result=new_error;			// Return last error /* purecov: inspected */
	break;					// Let rollback correct things /* purecov: inspected */
unknown's avatar
unknown committed
1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246
      }
    }
  }
  return result;
}


int ha_berkeley::delete_row(const byte * record)
{
  int error;
  DBT row, prim_key;
  key_map keys=table->keys_in_use;
unknown's avatar
unknown committed
1247
  ulong thd_options = table->in_use ? table->in_use->options : 0;
unknown's avatar
unknown committed
1248 1249
  DBUG_ENTER("delete_row");
  statistic_increment(ha_delete_count,&LOCK_status);
unknown's avatar
unknown committed
1250

1251
  if ((error=pack_row(&row, record, 0)))
1252
    DBUG_RETURN((error)); /* purecov: inspected */
1253
  create_key(&prim_key, primary_key, key_buff, record);
1254 1255 1256
  if (hidden_primary_key)
    keys|= (key_map) 1 << primary_key;

1257 1258 1259
  /* Subtransactions may be used in order to retry the delete in
     case we get a DB_LOCK_DEADLOCK error. */
  DB_TXN *sub_trans = transaction;
unknown's avatar
unknown committed
1260 1261
  for (uint retry=0 ; retry < berkeley_trans_retry ; retry++)
  {
1262 1263
    if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
    {
1264 1265 1266
      if ((error=txn_begin(db_env, transaction, &sub_trans, 0))) /* purecov: deadcode */
	break; /* purecov: deadcode */
      DBUG_PRINT("trans",("starting sub transaction")); /* purecov: deadcode */
1267 1268 1269
    }
    error=remove_keys(sub_trans, record, &row, &prim_key, keys);
    if (!error && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
unknown's avatar
unknown committed
1270
    {
1271 1272
      DBUG_PRINT("trans",("ending sub transaction")); /* purecov: deadcode */
      error=txn_commit(sub_trans, 0); /* purecov: deadcode */
unknown's avatar
unknown committed
1273 1274
    }
    if (error)
1275
    { /* purecov: inspected */
unknown's avatar
unknown committed
1276
      DBUG_PRINT("error",("Got error %d",error));
1277
      if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
unknown's avatar
unknown committed
1278
      {
1279 1280 1281 1282 1283 1284 1285 1286
	/* retry */
	int new_error;
	DBUG_PRINT("trans",("aborting subtransaction"));
	if ((new_error=txn_abort(sub_trans)))
	{
	  error=new_error;			// This shouldn't happen
	  break;
	}
unknown's avatar
unknown committed
1287
      }
1288 1289
      else
	break;					// No retry - return error
unknown's avatar
unknown committed
1290 1291 1292 1293
    }
    if (error != DB_LOCK_DEADLOCK)
      break;
  }
unknown's avatar
unknown committed
1294
#ifdef CANT_COUNT_DELETED_ROWS
1295 1296
  if (!error)
    changed_rows--;
unknown's avatar
unknown committed
1297
#endif
1298
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1299 1300 1301 1302 1303 1304 1305 1306 1307
}


int ha_berkeley::index_init(uint keynr)
{
  int error;
  DBUG_ENTER("index_init");
  active_index=keynr;
  dbug_assert(cursor == 0);
1308 1309 1310 1311
  if ((error=key_file[keynr]->cursor(key_file[keynr], transaction, &cursor,
				     table->reginfo.lock_type >
				     TL_WRITE_ALLOW_READ ?
				     0 : 0)))
1312
    cursor=0;					// Safety /* purecov: inspected */
unknown's avatar
unknown committed
1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332
  bzero((char*) &last_key,sizeof(last_key));
  DBUG_RETURN(error);
}

int ha_berkeley::index_end()
{
  int error=0;
  DBUG_ENTER("index_end");
  if (cursor)
  {
    error=cursor->c_close(cursor);
    cursor=0;
  }
  DBUG_RETURN(error);
}


/* What to do after we have read a row based on an index */

int ha_berkeley::read_row(int error, char *buf, uint keynr, DBT *row,
1333
			  DBT *found_key, bool read_next)
unknown's avatar
unknown committed
1334 1335 1336 1337 1338 1339 1340 1341 1342
{
  DBUG_ENTER("read_row");
  if (error)
  {
    if (error == DB_NOTFOUND || error == DB_KEYEMPTY)
      error=read_next ? HA_ERR_END_OF_FILE : HA_ERR_KEY_NOT_FOUND;
    table->status=STATUS_NOT_FOUND;
    DBUG_RETURN(error);
  }
1343 1344 1345 1346 1347
  if (hidden_primary_key)
    memcpy_fixed(current_ident,
		 (char*) row->data+row->size-BDB_HIDDEN_PRIMARY_KEY_LENGTH,
		 BDB_HIDDEN_PRIMARY_KEY_LENGTH);
  table->status=0;
unknown's avatar
unknown committed
1348 1349
  if (keynr != primary_key)
  {
1350 1351 1352 1353 1354 1355 1356 1357 1358
    /* We only found the primary key.  Now we have to use this to find
       the row data */
    if (key_read && found_key)
    {
      unpack_key(buf,found_key,keynr);
      if (!hidden_primary_key)
	unpack_key(buf,row,primary_key);
      DBUG_RETURN(0);
    }
unknown's avatar
unknown committed
1359 1360
    DBT key;
    bzero((char*) &key,sizeof(key));
1361
    key.data=key_buff;
unknown's avatar
unknown committed
1362
    key.size=row->size;
1363
    memcpy(key_buff,row->data,row->size);
unknown's avatar
unknown committed
1364 1365 1366 1367
    /* Read the data into current_row */
    current_row.flags=DB_DBT_REALLOC;
    if ((error=file->get(file, transaction, &key, &current_row, 0)))
    {
1368 1369
      table->status=STATUS_NOT_FOUND; /* purecov: inspected */
      DBUG_RETURN(error == DB_NOTFOUND ? HA_ERR_CRASHED : error); /* purecov: inspected */
unknown's avatar
unknown committed
1370 1371 1372 1373 1374 1375 1376 1377
    }
    row= &current_row;
  }
  unpack_row(buf,row);
  DBUG_RETURN(0);
}


1378 1379
/* This is only used to read whole keys */

unknown's avatar
unknown committed
1380 1381 1382 1383 1384 1385
int ha_berkeley::index_read_idx(byte * buf, uint keynr, const byte * key,
				uint key_len, enum ha_rkey_function find_flag)
{
  statistic_increment(ha_read_key_count,&LOCK_status);
  DBUG_ENTER("index_read_idx");
  current_row.flags=DB_DBT_REALLOC;
1386
  DBUG_RETURN(read_row(key_file[keynr]->get(key_file[keynr], transaction,
unknown's avatar
unknown committed
1387 1388 1389
				 pack_key(&last_key, keynr, key_buff, key,
					  key_len),
				 &current_row,0),
1390
		       buf, keynr, &current_row, &last_key, 0));
unknown's avatar
unknown committed
1391 1392 1393 1394 1395 1396 1397
}


int ha_berkeley::index_read(byte * buf, const byte * key,
			    uint key_len, enum ha_rkey_function find_flag)
{
  DBT row;
1398
  int error;
1399
  KEY *key_info= &table->key_info[active_index];
unknown's avatar
unknown committed
1400
  DBUG_ENTER("index_read");
1401

unknown's avatar
unknown committed
1402 1403
  statistic_increment(ha_read_key_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
1404
  if (key_len == key_info->key_length + key_info->extra_length)
1405 1406 1407 1408 1409
  {
    error=read_row(cursor->c_get(cursor, pack_key(&last_key,
						  active_index,
						  key_buff,
						  key, key_len),
1410 1411 1412
				 &row,
				 (find_flag == HA_READ_KEY_EXACT ?
				  DB_SET : DB_SET_RANGE)),
1413
		   buf, active_index, &row, (DBT*) 0, 0);
1414 1415 1416 1417 1418 1419
  }
  else
  {
    /* read of partial key */
    pack_key(&last_key, active_index, key_buff, key, key_len);
    /* Store for compare */
1420
    memcpy(key_buff2, key_buff, (key_len=last_key.size));
1421
    key_info->handler.bdb_return_if_eq= -1;
1422
    error=read_row(cursor->c_get(cursor, &last_key, &row, DB_SET_RANGE),
1423
		   buf, active_index, &row, (DBT*) 0, 0);
1424
    key_info->handler.bdb_return_if_eq= 0;
1425 1426
    if (!error && find_flag == HA_READ_KEY_EXACT)
    {
1427 1428
      /* Ensure that we found a key that is equal to the current one */
      if (!error && berkeley_key_cmp(table, key_info, key_buff2, key_len))
1429 1430 1431 1432
	error=HA_ERR_KEY_NOT_FOUND;
    }
  }
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1433 1434 1435 1436 1437 1438 1439 1440 1441 1442
}


int ha_berkeley::index_next(byte * buf)
{
  DBT row;
  DBUG_ENTER("index_next");
  statistic_increment(ha_read_next_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
  DBUG_RETURN(read_row(cursor->c_get(cursor, &last_key, &row, DB_NEXT),
1443
		       buf, active_index, &row, &last_key, 1));
unknown's avatar
unknown committed
1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454
}

int ha_berkeley::index_next_same(byte * buf, const byte *key, uint keylen)
{
  DBT row;
  int error;
  DBUG_ENTER("index_next_same");
  statistic_increment(ha_read_next_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
  if (keylen == table->key_info[active_index].key_length)
    error=read_row(cursor->c_get(cursor, &last_key, &row, DB_NEXT_DUP),
1455
		   buf, active_index, &row, &last_key, 1);
unknown's avatar
unknown committed
1456 1457 1458
  else
  {
    error=read_row(cursor->c_get(cursor, &last_key, &row, DB_NEXT),
1459
		   buf, active_index, &row, &last_key, 1);
unknown's avatar
unknown committed
1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473
    if (!error && ::key_cmp(table, key, active_index, keylen))
      error=HA_ERR_END_OF_FILE;
  }
  DBUG_RETURN(error);
}


int ha_berkeley::index_prev(byte * buf)
{
  DBT row;
  DBUG_ENTER("index_prev");
  statistic_increment(ha_read_prev_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
  DBUG_RETURN(read_row(cursor->c_get(cursor, &last_key, &row, DB_PREV),
1474
		       buf, active_index, &row, &last_key, 1));
unknown's avatar
unknown committed
1475
}
unknown's avatar
unknown committed
1476

unknown's avatar
unknown committed
1477 1478 1479 1480 1481 1482 1483 1484

int ha_berkeley::index_first(byte * buf)
{
  DBT row;
  DBUG_ENTER("index_first");
  statistic_increment(ha_read_first_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
  DBUG_RETURN(read_row(cursor->c_get(cursor, &last_key, &row, DB_FIRST),
1485
		       buf, active_index, &row, &last_key, 0));
unknown's avatar
unknown committed
1486 1487 1488 1489 1490 1491 1492 1493 1494
}

int ha_berkeley::index_last(byte * buf)
{
  DBT row;
  DBUG_ENTER("index_last");
  statistic_increment(ha_read_last_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
  DBUG_RETURN(read_row(cursor->c_get(cursor, &last_key, &row, DB_LAST),
1495
		       buf, active_index, &row, &last_key, 0));
unknown's avatar
unknown committed
1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515
}

int ha_berkeley::rnd_init(bool scan)
{
  current_row.flags=DB_DBT_REALLOC;
  return index_init(primary_key);
}

int ha_berkeley::rnd_end()
{
  return index_end();
}

int ha_berkeley::rnd_next(byte *buf)
{
  DBT row;
  DBUG_ENTER("rnd_next");
  statistic_increment(ha_read_rnd_next_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
  DBUG_RETURN(read_row(cursor->c_get(cursor, &last_key, &row, DB_NEXT),
1516
		       buf, active_index, &row, &last_key, 1));
unknown's avatar
unknown committed
1517 1518 1519 1520 1521 1522 1523 1524
}


DBT *ha_berkeley::get_pos(DBT *to, byte *pos)
{
  bzero((char*) to,sizeof(*to));

  to->data=pos;
1525
  if (share->fixed_length_primary_key)
unknown's avatar
unknown committed
1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547
    to->size=ref_length;
  else
  {
    KEY_PART_INFO *key_part=table->key_info[primary_key].key_part;
    KEY_PART_INFO *end=key_part+table->key_info[primary_key].key_parts;

    for ( ; key_part != end ; key_part++)
      pos+=key_part->field->packed_col_length(pos);
    to->size= (uint) (pos- (byte*) to->data);
  }
  return to;
}


int ha_berkeley::rnd_pos(byte * buf, byte *pos)
{
  DBT db_pos;
  statistic_increment(ha_read_rnd_count,&LOCK_status);

  return read_row(file->get(file, transaction,
			    get_pos(&db_pos, pos),
			    &current_row, 0),
1548
		  buf, active_index, &current_row, (DBT*) 0, 0);
unknown's avatar
unknown committed
1549 1550 1551 1552 1553
}

void ha_berkeley::position(const byte *record)
{
  DBT key;
1554 1555 1556
  if (hidden_primary_key)
    memcpy_fixed(ref, (char*) current_ident, BDB_HIDDEN_PRIMARY_KEY_LENGTH);
  else
1557
    create_key(&key, primary_key, ref, record);
unknown's avatar
unknown committed
1558 1559 1560 1561 1562 1563 1564 1565
}


void ha_berkeley::info(uint flag)
{
  DBUG_ENTER("info");
  if (flag & HA_STATUS_VARIABLE)
  {
1566
    records = share->rows;		// Just to get optimisations right
unknown's avatar
unknown committed
1567 1568
    deleted = 0;
  }
1569 1570 1571 1572 1573 1574 1575 1576 1577
  if ((flag & HA_STATUS_CONST) || version != share->version)
  {
    version=share->version;
    for (uint i=0 ; i < table->keys ; i++)
    {
      table->key_info[i].rec_per_key[table->key_info[i].key_parts-1]=
	share->rec_per_key[i];
    }
  }
unknown's avatar
unknown committed
1578 1579 1580 1581 1582 1583 1584 1585
  else if (flag & HA_STATUS_ERRKEY)
    errkey=last_dup_key;
  DBUG_VOID_RETURN;
}


int ha_berkeley::extra(enum ha_extra_function operation)
{
1586 1587 1588 1589
  switch (operation) {
  case HA_EXTRA_RESET:
  case HA_EXTRA_RESET_STATE:
    key_read=0;
1590
    using_ignore=0;
unknown's avatar
unknown committed
1591 1592 1593 1594 1595 1596 1597 1598 1599
    if (current_row.flags & (DB_DBT_MALLOC | DB_DBT_REALLOC))
    {
      current_row.flags=0;
      if (current_row.data)
      {
	free(current_row.data);
	current_row.data=0;
      }
    }
1600 1601 1602 1603 1604 1605 1606
    break;
  case HA_EXTRA_KEYREAD:
    key_read=1;					// Query satisfied with key
    break;
  case HA_EXTRA_NO_KEYREAD:
    key_read=0;
    break;
1607 1608 1609 1610 1611 1612
  case HA_EXTRA_IGNORE_DUP_KEY:
    using_ignore=1;
    break;
  case HA_EXTRA_NO_IGNORE_DUP_KEY:
    using_ignore=0;
    break;
1613 1614 1615
  default:
    break;
  }
unknown's avatar
unknown committed
1616 1617 1618
  return 0;
}

1619

unknown's avatar
unknown committed
1620 1621
int ha_berkeley::reset(void)
{
1622
  key_read=0;					// Reset to state after open
unknown's avatar
unknown committed
1623 1624 1625 1626 1627 1628 1629
  return 0;
}


/*
  As MySQL will execute an external lock for every new table it uses
  we can use this to start the transactions.
1630 1631 1632 1633
  If we are in auto_commit mode we just need to start a transaction
  for the statement to be able to rollback the statement.
  If not, we have to start a master transaction if there doesn't exist
  one from before.
unknown's avatar
unknown committed
1634 1635 1636 1637 1638 1639 1640 1641
*/

int ha_berkeley::external_lock(THD *thd, int lock_type)
{
  int error=0;
  DBUG_ENTER("ha_berkeley::external_lock");
  if (lock_type != F_UNLCK)
  {
1642
    if (!thd->transaction.bdb_lock_count++)
unknown's avatar
unknown committed
1643
    {
1644
      /* First table lock, start transaction */
1645
      if ((thd->options & (OPTION_NOT_AUTO_COMMIT | OPTION_BEGIN)) &&
1646 1647 1648 1649 1650 1651 1652 1653
	  !thd->transaction.all.bdb_tid)
      {
	/* We have to start a master transaction */
	DBUG_PRINT("trans",("starting transaction"));
	if ((error=txn_begin(db_env, 0,
			     (DB_TXN**) &thd->transaction.all.bdb_tid,
			     0)))
	{
1654 1655
	  thd->transaction.bdb_lock_count--;	// We didn't get the lock /* purecov: inspected */
	  DBUG_RETURN(error); /* purecov: inspected */
1656 1657 1658 1659 1660 1661
	}
      }
      DBUG_PRINT("trans",("starting transaction for statement"));
      if ((error=txn_begin(db_env,
			   (DB_TXN*) thd->transaction.all.bdb_tid,
			   (DB_TXN**) &thd->transaction.stmt.bdb_tid,
unknown's avatar
unknown committed
1662
			   0)))
1663 1664
      {
	/* We leave the possible master transaction open */
1665 1666
	thd->transaction.bdb_lock_count--;	// We didn't get the lock /* purecov: inspected */
	DBUG_RETURN(error); /* purecov: inspected */
1667
      }
unknown's avatar
unknown committed
1668
    }
1669
    transaction= (DB_TXN*) thd->transaction.stmt.bdb_tid;
1670
    changed_rows=0;
unknown's avatar
unknown committed
1671 1672 1673 1674
  }
  else
  {
    lock.type=TL_UNLOCK;			// Unlocked
1675
    thread_safe_add(share->rows, changed_rows, &share->mutex);
unknown's avatar
unknown committed
1676 1677
    if (!--thd->transaction.bdb_lock_count)
    {
1678
      if (thd->transaction.stmt.bdb_tid)
unknown's avatar
unknown committed
1679
      {
unknown's avatar
unknown committed
1680
	/*
1681
	   F_UNLOCK is done without a transaction commit / rollback.
1682 1683
	   This happens if the thread didn't update any rows
	   We must in this case commit the work to keep the row locks
unknown's avatar
unknown committed
1684
	*/
1685 1686 1687
	DBUG_PRINT("trans",("commiting non-updating transaction"));
	error=txn_commit((DB_TXN*) thd->transaction.stmt.bdb_tid,0);
	thd->transaction.stmt.bdb_tid=0;
unknown's avatar
unknown committed
1688 1689 1690 1691
      }
    }
  }
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1692
}
unknown's avatar
unknown committed
1693

1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721
/*
  The idea with handler::store_lock() is the following:

  The statement decided which locks we should need for the table
  for updates/deletes/inserts we get WRITE locks, for SELECT... we get
  read locks.

  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 changes all WRITE locks to TL_WRITE_ALLOW_WRITE (which
  signals that we are doing WRITES, but we are still allowing other
  reader's and writer's.

  When releasing locks, store_lock() are 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.
*/

unknown's avatar
unknown committed
1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733

THR_LOCK_DATA **ha_berkeley::store_lock(THD *thd, THR_LOCK_DATA **to,
					enum thr_lock_type lock_type)
{
  if (lock_type != TL_IGNORE && lock.type == TL_UNLOCK)
  {
    /* If we are not doing a LOCK TABLE, then allow multiple writers */
    if ((lock_type >= TL_WRITE_CONCURRENT_INSERT &&
	 lock_type <= TL_WRITE) &&
	!thd->in_lock_tables)
      lock_type = TL_WRITE_ALLOW_WRITE;
    lock.type=lock_type;
1734 1735
    lock_on_read= ((table->reginfo.lock_type > TL_WRITE_ALLOW_READ) ? DB_RMW :
		   0);
unknown's avatar
unknown committed
1736 1737 1738 1739 1740 1741 1742 1743 1744
  }
  *to++= &lock;
  return to;
}


static int create_sub_table(const char *table_name, const char *sub_name,
			    DBTYPE type, int flags)
{
1745
  int error;
unknown's avatar
unknown committed
1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756
  DB *file;
  DBUG_ENTER("create_sub_table");
  DBUG_PRINT("enter",("sub_name: %s",sub_name));

  if (!(error=db_create(&file, db_env, 0)))
  {
    file->set_flags(file, flags);
    error=(file->open(file, table_name, sub_name, type,
		      DB_THREAD | DB_CREATE, my_umask));
    if (error)
    {
1757 1758 1759
      DBUG_PRINT("error",("Got error: %d when opening table '%s'",error, /* purecov: inspected */
			  table_name)); /* purecov: inspected */
      (void) file->remove(file,table_name,NULL,0); /* purecov: inspected */
unknown's avatar
unknown committed
1760 1761 1762 1763 1764 1765
    }
    else
      (void) file->close(file,0);
  }
  else
  {
1766
    DBUG_PRINT("error",("Got error: %d when creting table",error)); /* purecov: inspected */
unknown's avatar
unknown committed
1767 1768
  }
  if (error)
1769
    my_errno=error; /* purecov: inspected */
unknown's avatar
unknown committed
1770 1771 1772 1773 1774 1775 1776 1777 1778
  DBUG_RETURN(error);
}


int ha_berkeley::create(const char *name, register TABLE *form,
			HA_CREATE_INFO *create_info)
{
  char name_buff[FN_REFLEN];
  char part[7];
1779
  uint index=1;
unknown's avatar
unknown committed
1780
  int error=1;
unknown's avatar
unknown committed
1781 1782 1783 1784 1785 1786
  DBUG_ENTER("ha_berkeley::create");

  fn_format(name_buff,name,"", ha_berkeley_ext,2 | 4);

  /* Create the main table that will hold the real rows */
  if (create_sub_table(name_buff,"main",DB_BTREE,0))
1787
    DBUG_RETURN(1); /* purecov: inspected */
unknown's avatar
unknown committed
1788

1789
  primary_key=table->primary_key;
unknown's avatar
unknown committed
1790
  /* Create the keys */
1791
  for (uint i=0; i < form->keys; i++)
unknown's avatar
unknown committed
1792
  {
1793 1794 1795 1796 1797 1798
    if (i != primary_key)
    {
      sprintf(part,"key%02d",index++);
      if (create_sub_table(name_buff, part, DB_BTREE,
			   (table->key_info[i].flags & HA_NOSAME) ? 0 :
			   DB_DUP))
1799
	DBUG_RETURN(1); /* purecov: inspected */
1800
    }
unknown's avatar
unknown committed
1801 1802 1803 1804
  }

  /* Create the status block to save information from last status command */
  /* Is DB_BTREE the best option here ? (QUEUE can't be used in sub tables) */
unknown's avatar
unknown committed
1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820

  DB *status_block;
  if (!db_create(&status_block, db_env, 0))
  {
    if (!status_block->open(status_block, name_buff,
			    "status", DB_BTREE, DB_CREATE, 0))
    {
      char rec_buff[4+MAX_KEY*4];
      uint length= 4+ table->keys*4;
      bzero(rec_buff, length);
      if (!write_status(status_block, rec_buff, length))
	error=0;
      status_block->close(status_block,0);
    }
  }
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1821 1822 1823 1824 1825 1826 1827 1828
}


int ha_berkeley::delete_table(const char *name)
{
  int error;
  char name_buff[FN_REFLEN];
  if ((error=db_create(&file, db_env, 0)))
1829
    my_errno=error; /* purecov: inspected */
unknown's avatar
unknown committed
1830 1831 1832
  else
    error=file->remove(file,fn_format(name_buff,name,"",ha_berkeley_ext,2 | 4),
		       NULL,0);
unknown's avatar
unknown committed
1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845
  file=0;					// Safety
  return error;
}

/*
  How many seeks it will take to read through the table
  This is to be comparable to the number returned by records_in_range so
  that we can decide if we should scan the table or use keys.
*/

double ha_berkeley::scan_time()
{
  return records/3;
1846
}
unknown's avatar
unknown committed
1847 1848 1849 1850 1851 1852 1853 1854 1855

ha_rows ha_berkeley::records_in_range(int keynr,
				      const byte *start_key,uint start_key_len,
				      enum ha_rkey_function start_search_flag,
				      const byte *end_key,uint end_key_len,
				      enum ha_rkey_function end_search_flag)
{
  DBT key;
  DB_KEY_RANGE start_range, end_range;
1856
  DB *kfile=key_file[keynr];
unknown's avatar
unknown committed
1857 1858
  double start_pos,end_pos,rows;
  DBUG_ENTER("records_in_range");
1859 1860 1861 1862 1863 1864 1865 1866 1867

  if ((start_key && kfile->key_range(kfile,transaction,
				     pack_key(&key, keynr, key_buff, start_key,
					      start_key_len),
				     &start_range,0)) ||
      (end_key && kfile->key_range(kfile,transaction,
				   pack_key(&key, keynr, key_buff, end_key,
					    end_key_len),
				   &end_range,0)))
1868
    DBUG_RETURN(HA_BERKELEY_RANGE_COUNT); // Better than returning an error /* purecov: inspected */
unknown's avatar
unknown committed
1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887

  if (!start_key)
    start_pos=0.0;
  else if (start_search_flag == HA_READ_KEY_EXACT)
    start_pos=start_range.less;
  else
    start_pos=start_range.less+start_range.equal;

  if (!end_key)
    end_pos=1.0;
  else if (end_search_flag == HA_READ_BEFORE_KEY)
    end_pos=end_range.less;
  else
    end_pos=end_range.less+end_range.equal;
  rows=(end_pos-start_pos)*records;
  DBUG_PRINT("exit",("rows: %g",rows));
  DBUG_RETURN(rows <= 1.0 ? (ha_rows) 1 : (ha_rows) rows);
}

1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901

longlong ha_berkeley::get_auto_increment()
{
  longlong nr=1;				// Default if error or new key
  int error;
  (void) ha_berkeley::extra(HA_EXTRA_KEYREAD);
  ha_berkeley::index_init(table->next_number_index);

  if (!table->next_number_key_offset)
  {						// Autoincrement at key-start
    error=ha_berkeley::index_last(table->record[1]);
  }
  else
  {
1902
    DBT row,old_key;
1903 1904 1905 1906 1907 1908 1909 1910
    bzero((char*) &row,sizeof(row));
    KEY *key_info= &table->key_info[active_index];

    /* Reading next available number for a sub key */
    ha_berkeley::create_key(&last_key, active_index,
			    key_buff, table->record[0],
			    table->next_number_key_offset);
    /* Store for compare */
1911 1912
    memcpy(old_key.data=key_buff2, key_buff, (old_key.size=last_key.size));
    error=1;
1913
    {
1914 1915 1916
      /* Modify the compare so that we will find the next key */
      key_info->handler.bdb_return_if_eq= 1;
      /* We lock the next key as the new key will probl. be on the same page */
unknown's avatar
unknown committed
1917
      error=cursor->c_get(cursor, &last_key, &row, DB_SET_RANGE | DB_RMW);
1918 1919 1920 1921 1922 1923 1924 1925
      key_info->handler.bdb_return_if_eq= 0;
      if (!error || error == DB_NOTFOUND)
      {
	/*
	  Now search go one step back and then we should have found the
	  biggest key with the given prefix
	  */
	error=1;
unknown's avatar
unknown committed
1926 1927 1928
	if (!cursor->c_get(cursor, &last_key, &row, DB_PREV | DB_RMW) &&
	    !berkeley_cmp_packed_key(key_file[active_index], &old_key,
				     &last_key))
1929 1930 1931 1932 1933
	{
	  error=0;				// Found value
	  unpack_key(table->record[1], &last_key, active_index);
	}
      }
1934 1935
    }
  }
1936 1937 1938
  if (!error)
    nr=(longlong)
      table->next_number_field->val_int_offset(table->rec_buff_length)+1;
1939 1940 1941 1942 1943 1944 1945 1946 1947 1948
  ha_berkeley::index_end();
  (void) ha_berkeley::extra(HA_EXTRA_NO_KEYREAD);
  return nr;
}


/****************************************************************************
	 Analyzing, checking, and optimizing tables
****************************************************************************/

1949
#ifdef NOT_YET
1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972
static void print_msg(THD *thd, const char *table_name, const char *op_name,
		      const char *msg_type, const char *fmt, ...)
{
  String* packet = &thd->packet;
  packet->length(0);
  char msgbuf[256];
  msgbuf[0] = 0;
  va_list args;
  va_start(args,fmt);

  my_vsnprintf(msgbuf, sizeof(msgbuf), fmt, args);
  msgbuf[sizeof(msgbuf) - 1] = 0; // healthy paranoia

  DBUG_PRINT(msg_type,("message: %s",msgbuf));

  net_store_data(packet, table_name);
  net_store_data(packet, op_name);
  net_store_data(packet, msg_type);
  net_store_data(packet, msgbuf);
  if (my_net_write(&thd->net, (char*)thd->packet.ptr(),
		   thd->packet.length()))
    thd->killed=1;
}
1973
#endif
1974 1975 1976

int ha_berkeley::analyze(THD* thd, HA_CHECK_OPT* check_opt)
{
unknown's avatar
unknown committed
1977
  DB_BTREE_STAT *stat=0;
1978 1979 1980 1981
  uint i;

  for (i=0 ; i < table->keys ; i++)
  {
unknown's avatar
unknown committed
1982 1983 1984 1985 1986
    if (stat)
    {
      free(stat);
      stat=0;
    }
1987 1988
    if (key_file[i]->stat(key_file[i], (void*) &stat, 0, 0))
      goto err; /* purecov: inspected */
unknown's avatar
unknown committed
1989 1990
    share->rec_per_key[i]= (stat->bt_ndata /
			    (stat->bt_nkeys ? stat->bt_nkeys : 1));
1991
  }
unknown's avatar
unknown committed
1992
  /* A hidden primary key is not in key_file[] */
1993
  if (hidden_primary_key)
unknown's avatar
unknown committed
1994 1995 1996 1997 1998 1999 2000
  {
    if (stat)
    {
      free(stat);
      stat=0;
    }
    if (file->stat(file, (void*) &stat, 0, 0))
2001
      goto err; /* purecov: inspected */
unknown's avatar
unknown committed
2002
  }
2003
  pthread_mutex_lock(&share->mutex);
unknown's avatar
unknown committed
2004
  share->rows=stat->bt_ndata;
2005 2006 2007
  share->status|=STATUS_BDB_ANALYZE;		// Save status on close
  share->version++;				// Update stat in table
  pthread_mutex_unlock(&share->mutex);
unknown's avatar
unknown committed
2008 2009 2010
  update_status(share,table);			// Write status to file
  if (stat)
    free(stat);
2011 2012
  return ((share->status & STATUS_BDB_ANALYZE) ? HA_ADMIN_FAILED :
	  HA_ADMIN_OK);
unknown's avatar
unknown committed
2013 2014

err:
2015 2016 2017
  if (stat) /* purecov: inspected */
    free(stat); /* purecov: inspected */
  return HA_ADMIN_FAILED; /* purecov: inspected */
2018 2019 2020 2021 2022 2023 2024 2025 2026 2027
}

int ha_berkeley::optimize(THD* thd, HA_CHECK_OPT* check_opt)
{
  return ha_berkeley::analyze(thd,check_opt);
}


int ha_berkeley::check(THD* thd, HA_CHECK_OPT* check_opt)
{
unknown's avatar
unknown committed
2028 2029 2030 2031 2032
  DBUG_ENTER("ha_berkeley::check");

  DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED);

#ifdef NOT_YET
2033 2034 2035
  char name_buff[FN_REFLEN];
  int error;
  DB *tmp_file;
unknown's avatar
unknown committed
2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053
  /*
    To get this to work we need to ensure that no running transaction is
    using the table. We also need to create a new environment without
    locking for this.
  */

  /* We must open the file again to be able to check it! */
  if ((error=db_create(&tmp_file, db_env, 0)))
  {
    print_msg(thd, table->real_name, "check", "error",
	      "Got error %d creating environment",error);
    DBUG_RETURN(HA_ADMIN_FAILED);
  }

  /* Compare the overall structure */
  tmp_file->set_bt_compare(tmp_file,
			   (hidden_primary_key ? berkeley_cmp_hidden_key :
			    berkeley_cmp_packed_key));
2054
  tmp_file->app_private= (void*) (table->key_info+table->primary_key);
2055
  fn_format(name_buff,share->table_name,"", ha_berkeley_ext, 2 | 4);
unknown's avatar
unknown committed
2056 2057
  if ((error=tmp_file->verify(tmp_file, name_buff, NullS, (FILE*) 0,
			      hidden_primary_key ? 0 : DB_NOORDERCHK)))
2058 2059 2060
  {
    print_msg(thd, table->real_name, "check", "error",
	      "Got error %d checking file structure",error);
unknown's avatar
unknown committed
2061 2062
    tmp_file->close(tmp_file,0);
    DBUG_RETURN(HA_ADMIN_CORRUPT);
2063
  }
unknown's avatar
unknown committed
2064 2065 2066 2067

  /* Check each index */
  tmp_file->set_bt_compare(tmp_file, berkeley_cmp_packed_key);
  for (uint index=0,i=0 ; i < table->keys ; i++)
2068
  {
unknown's avatar
unknown committed
2069 2070 2071 2072 2073 2074 2075 2076
    char part[7];
    if (i == primary_key)
      strmov(part,"main");
    else
      sprintf(part,"key%02d",++index);
    tmp_file->app_private= (void*) (table->key_info+i);
    if ((error=tmp_file->verify(tmp_file, name_buff, part, (FILE*) 0,
				DB_ORDERCHKONLY)))
2077 2078
    {
      print_msg(thd, table->real_name, "check", "error",
unknown's avatar
unknown committed
2079 2080 2081 2082 2083
		"Key %d was not in order (Error: %d)",
		index+ test(i >= primary_key),
		error);
      tmp_file->close(tmp_file,0);
      DBUG_RETURN(HA_ADMIN_CORRUPT);
2084 2085
    }
  }
unknown's avatar
unknown committed
2086 2087 2088
  tmp_file->close(tmp_file,0);
  DBUG_RETURN(HA_ADMIN_OK);
#endif
2089 2090
}

unknown's avatar
unknown committed
2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102
/****************************************************************************
 Handling the shared BDB_SHARE structure that is needed to provide table
 locking.
****************************************************************************/

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

2103
static BDB_SHARE *get_share(const char *table_name, TABLE *table)
unknown's avatar
unknown committed
2104 2105 2106
{
  BDB_SHARE *share;
  pthread_mutex_lock(&bdb_mutex);
unknown's avatar
unknown committed
2107
  uint length=(uint) strlen(table_name);
unknown's avatar
unknown committed
2108 2109
  if (!(share=(BDB_SHARE*) hash_search(&bdb_open_tables, table_name, length)))
  {
2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122
    ha_rows *rec_per_key;
    char *tmp_name;
    DB **key_file;
    u_int32_t *key_type;
    
    if ((share=(BDB_SHARE *)
	 my_multi_malloc(MYF(MY_WME | MY_ZEROFILL),
			 &share, sizeof(*share),
			 &rec_per_key, table->keys * sizeof(ha_rows),
			 &tmp_name, length+1,
			 &key_file, (table->keys+1) * sizeof(*key_file),
			 &key_type, (table->keys+1) * sizeof(u_int32_t),
			 NullS)))
unknown's avatar
unknown committed
2123
    {
2124 2125
      share->rec_per_key = rec_per_key;
      share->table_name = tmp_name;
unknown's avatar
unknown committed
2126 2127
      share->table_name_length=length;
      strmov(share->table_name,table_name);
2128 2129
      share->key_file = key_file;
      share->key_type = key_type;
unknown's avatar
unknown committed
2130 2131
      if (hash_insert(&bdb_open_tables, (char*) share))
      {
2132 2133 2134
	pthread_mutex_unlock(&bdb_mutex); /* purecov: inspected */
	my_free((gptr) share,0); /* purecov: inspected */
	return 0; /* purecov: inspected */
unknown's avatar
unknown committed
2135 2136
      }
      thr_lock_init(&share->lock);
2137
      pthread_mutex_init(&share->mutex,NULL);
unknown's avatar
unknown committed
2138 2139 2140 2141 2142 2143
    }
  }
  pthread_mutex_unlock(&bdb_mutex);
  return share;
}

unknown's avatar
unknown committed
2144 2145
static int free_share(BDB_SHARE *share, TABLE *table, uint hidden_primary_key,
		      bool mutex_is_locked)
unknown's avatar
unknown committed
2146
{
2147
  int error, result = 0;
2148
  uint keys=table->keys + test(hidden_primary_key);
unknown's avatar
unknown committed
2149
  pthread_mutex_lock(&bdb_mutex);
unknown's avatar
unknown committed
2150
  if (mutex_is_locked)
2151
    pthread_mutex_unlock(&share->mutex); /* purecov: inspected */
unknown's avatar
unknown committed
2152 2153
  if (!--share->use_count)
  {
2154
    DB **key_file = share->key_file;
2155
    update_status(share,table);
2156
    /* this does share->file->close() implicitly */
2157
    for (uint i=0; i < keys; i++)
2158 2159
    {
      if (key_file[i] && (error=key_file[i]->close(key_file[i],0)))
2160
	result=error; /* purecov: inspected */
2161 2162 2163
    }
    if (share->status_block &&
	(error = share->status_block->close(share->status_block,0)))
2164
      result = error; /* purecov: inspected */
unknown's avatar
unknown committed
2165 2166
    hash_delete(&bdb_open_tables, (gptr) share);
    thr_lock_delete(&share->lock);
2167
    pthread_mutex_destroy(&share->mutex);
unknown's avatar
unknown committed
2168 2169 2170
    my_free((gptr) share, MYF(0));
  }
  pthread_mutex_unlock(&bdb_mutex);
2171
  return result;
unknown's avatar
unknown committed
2172 2173
}

2174 2175 2176 2177
/*
  Get status information that is stored in the 'status' sub database
  and the max used value for the hidden primary key.
*/
2178

2179
void ha_berkeley::get_status()
2180
{
2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201
  if (!test_all_bits(share->status,(STATUS_PRIMARY_KEY_INIT |
				    STATUS_ROW_COUNT_INIT)))
  {
    pthread_mutex_lock(&share->mutex);
    if (!(share->status & STATUS_PRIMARY_KEY_INIT))
    {
      (void) extra(HA_EXTRA_KEYREAD);
      index_init(primary_key);
      if (!index_last(table->record[1]))
	share->auto_ident=uint5korr(current_ident);
      index_end();
      (void) extra(HA_EXTRA_NO_KEYREAD);
    }
    if (! share->status_block)
    {
      char name_buff[FN_REFLEN];
      uint open_mode= (((table->db_stat & HA_READ_ONLY) ? DB_RDONLY : 0)
		       | DB_THREAD);
      fn_format(name_buff, share->table_name,"", ha_berkeley_ext, 2 | 4);
      if (!db_create(&share->status_block, db_env, 0))
      {
unknown's avatar
unknown committed
2202 2203
	if (share->status_block->open(share->status_block, name_buff,
				      "status", DB_BTREE, open_mode, 0))
2204
	{
2205 2206
	  share->status_block->close(share->status_block, 0); /* purecov: inspected */
	  share->status_block=0; /* purecov: inspected */
2207 2208 2209 2210 2211 2212 2213
	}
      }
    }
    if (!(share->status & STATUS_ROW_COUNT_INIT) && share->status_block)
    {
      share->org_rows=share->rows=
	table->max_rows ? table->max_rows : HA_BERKELEY_MAX_ROWS;
2214
      if (!share->status_block->cursor(share->status_block, 0, &cursor, 0))
2215 2216
      {
	DBT row;
unknown's avatar
unknown committed
2217
	char rec_buff[64];
2218 2219 2220
	bzero((char*) &row,sizeof(row));
	bzero((char*) &last_key,sizeof(last_key));
	row.data=rec_buff;
unknown's avatar
unknown committed
2221
	row.ulen=sizeof(rec_buff);
2222 2223 2224 2225
	row.flags=DB_DBT_USERMEM;
	if (!cursor->c_get(cursor, &last_key, &row, DB_FIRST))
	{
	  uint i;
unknown's avatar
unknown committed
2226
	  uchar *pos=(uchar*) row.data;
2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242
	  share->org_rows=share->rows=uint4korr(pos); pos+=4;
	  for (i=0 ; i < table->keys ; i++)
	  {
	    share->rec_per_key[i]=uint4korr(pos); pos+=4;
	  }
	}
	cursor->c_close(cursor);
      }
      cursor=0;					// Safety
    }
    share->status|= STATUS_PRIMARY_KEY_INIT | STATUS_ROW_COUNT_INIT;
    pthread_mutex_unlock(&share->mutex);
  }
}


unknown's avatar
unknown committed
2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259
static int write_status(DB *status_block, char *buff, uint length)
{
  DBT row,key;
  int error;
  const char *key_buff="status";

  bzero((char*) &row,sizeof(row));
  bzero((char*) &key,sizeof(key));
  row.data=buff;
  key.data=(void*) key_buff;
  key.size=sizeof(key_buff);
  row.size=length;
  error=status_block->put(status_block, 0, &key, &row, 0);
  return error;
}


2260 2261 2262 2263 2264
static void update_status(BDB_SHARE *share, TABLE *table)
{
  DBUG_ENTER("update_status");
  if (share->rows != share->org_rows ||
      (share->status & STATUS_BDB_ANALYZE))
2265
  {
2266 2267 2268 2269 2270 2271 2272 2273
    pthread_mutex_lock(&share->mutex);
    if (!share->status_block)
    {
      /*
	Create sub database 'status' if it doesn't exist from before
	(This '*should*' always exist for table created with MySQL)
      */

2274 2275 2276 2277
      char name_buff[FN_REFLEN]; /* purecov: inspected */
      if (db_create(&share->status_block, db_env, 0)) /* purecov: inspected */
	goto end; /* purecov: inspected */
      share->status_block->set_flags(share->status_block,0); /* purecov: inspected */
2278 2279 2280 2281
      if (share->status_block->open(share->status_block,
				    fn_format(name_buff,share->table_name,"",
					      ha_berkeley_ext,2 | 4),
				    "status", DB_BTREE,
2282 2283
				    DB_THREAD | DB_CREATE, my_umask)) /* purecov: inspected */
	goto end; /* purecov: inspected */
2284 2285
    }
    {
unknown's avatar
unknown committed
2286
      char rec_buff[4+MAX_KEY*4], *pos=rec_buff;
2287
      int4store(pos,share->rows); pos+=4;
unknown's avatar
unknown committed
2288
      for (uint i=0 ; i < table->keys ; i++)
2289 2290 2291
      {
	int4store(pos,share->rec_per_key[i]); pos+=4;
      }
unknown's avatar
unknown committed
2292 2293 2294
      DBUG_PRINT("info",("updating status for %s",share->table_name));
      (void) write_status(share->status_block, rec_buff,
			  (uint) (pos-rec_buff));
2295
      share->status&= ~STATUS_BDB_ANALYZE;
unknown's avatar
unknown committed
2296
      share->org_rows=share->rows;
2297 2298 2299
    }
end:
    pthread_mutex_unlock(&share->mutex);
2300
  }
2301
  DBUG_VOID_RETURN;
2302 2303
}

2304 2305 2306 2307 2308 2309 2310
/*
  Return an estimated of the number of rows in the table.
  Used when sorting to allocate buffers and by the optimizer.
*/

ha_rows ha_berkeley::estimate_number_of_rows()
{
2311
  return share->rows + HA_BERKELEY_EXTRA_ROWS;
2312 2313
}

unknown's avatar
unknown committed
2314
#endif /* HAVE_BERKELEY_DB */