ha_berkeley.cc 74.2 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.
unknown's avatar
unknown committed
28
  - Get a more accurate count of the number of rows (estimate_rows_upper_bound()).
29 30
    We could store the found number of rows when the table is scanned and
    then increment the counter for each attempted write.
31 32
  - We will need to extend the manager thread to makes checkpoints at
     given intervals.
unknown's avatar
unknown committed
33 34 35 36 37 38 39
  - 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

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


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

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

#define HA_BERKELEY_ROWS_IN_TABLE 10000 /* to get optimization right */
unknown's avatar
unknown committed
64
#define HA_BERKELEY_RANGE_COUNT   100
65
#define HA_BERKELEY_MAX_ROWS	  10000000 /* Max rows in table */
unknown's avatar
unknown committed
66
/* extra rows for estimate_rows_upper_bound() */
67 68 69 70 71 72
#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
73 74

const char *ha_berkeley_ext=".db";
75
bool berkeley_shared_data=0;
unknown's avatar
unknown committed
76 77
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
78
ulong berkeley_cache_size, berkeley_log_buffer_size, berkeley_log_file_size=0;
unknown's avatar
unknown committed
79 80
char *berkeley_home, *berkeley_tmpdir, *berkeley_logdir;
long berkeley_lock_scan_time=0;
81
ulong berkeley_trans_retry=1;
82
ulong berkeley_max_lock;
unknown's avatar
unknown committed
83 84 85 86 87 88
pthread_mutex_t bdb_mutex;

static DB_ENV *db_env;
static HASH bdb_open_tables;

const char *berkeley_lock_names[] =
89
{ "DEFAULT", "OLDEST","RANDOM","YOUNGEST",0 };
unknown's avatar
unknown committed
90 91
u_int32_t berkeley_lock_types[]=
{ DB_LOCK_DEFAULT, DB_LOCK_OLDEST, DB_LOCK_RANDOM };
92
TYPELIB berkeley_lock_typelib= {array_elements(berkeley_lock_names)-1,"",
unknown's avatar
unknown committed
93 94 95 96 97
				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)));
98
static BDB_SHARE *get_share(const char *table_name, TABLE *table);
unknown's avatar
unknown committed
99 100
static int free_share(BDB_SHARE *share, TABLE *table, uint hidden_primary_key,
		      bool mutex_is_locked);
unknown's avatar
unknown committed
101
static int write_status(DB *status_block, char *buff, uint length);
102
static void update_status(BDB_SHARE *share, TABLE *table);
103
static void berkeley_noticecall(DB_ENV *db_env, db_notices notice);
unknown's avatar
unknown committed
104 105


106

unknown's avatar
unknown committed
107 108 109 110 111 112 113 114 115 116
/* 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;
117 118
  DBUG_PRINT("bdb",("berkeley_home: %s",mysql_real_data_home));

unknown's avatar
unknown committed
119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135
  /*
    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
136 137

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

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

unknown's avatar
unknown committed
153
  db_env->set_cachesize(db_env, 0, berkeley_cache_size, 0);
unknown's avatar
unknown committed
154 155
  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
156
  db_env->set_lk_detect(db_env, berkeley_lock_type);
157 158
  if (berkeley_max_lock)
    db_env->set_lk_max(db_env, berkeley_max_lock);
159

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

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


bool berkeley_end(void)
{
  int error;
  DBUG_ENTER("berkeley_end");
  if (!db_env)
unknown's avatar
unknown committed
182
    return 1; /* purecov: tested */
183
  berkeley_cleanup_log_files();
unknown's avatar
unknown committed
184 185 186 187 188 189 190 191 192 193 194 195
  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");
unknown's avatar
unknown committed
196
  if ((error=db_env->log_flush(db_env,0)))
unknown's avatar
unknown committed
197
  {
198 199
    my_error(ER_ERROR_DURING_FLUSH_LOGS,MYF(0),error); /* purecov: inspected */
    result=1; /* purecov: inspected */
unknown's avatar
unknown committed
200
  }
unknown's avatar
unknown committed
201
  if ((error=db_env->txn_checkpoint(db_env,0,0,0)))
unknown's avatar
unknown committed
202
  {
203 204
    my_error(ER_ERROR_DURING_CHECKPOINT,MYF(0),error); /* purecov: inspected */
    result=1; /* purecov: inspected */
unknown's avatar
unknown committed
205 206 207 208 209
  }
  DBUG_RETURN(result);
}


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

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

unknown's avatar
unknown committed
232

233
int berkeley_show_logs(Protocol *protocol)
unknown's avatar
unknown committed
234
{
235 236 237 238
  char **all_logs, **free_logs, **a, **f;
  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
239 240
  DBUG_ENTER("berkeley_show_logs");

unknown's avatar
unknown committed
241 242
  init_sql_alloc(&show_logs_root, BDB_LOG_ALLOC_BLOCK_SIZE,
		 BDB_LOG_ALLOC_BLOCK_SIZE);
243 244
  my_pthread_setspecific_ptr(THR_MALLOC,&show_logs_root);

245 246 247
  if ((error= db_env->log_archive(db_env, &all_logs,
				  DB_ARCH_ABS | DB_ARCH_LOG)) ||
      (error= db_env->log_archive(db_env, &free_logs, DB_ARCH_ABS)))
unknown's avatar
unknown committed
248 249 250
  {
    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
251 252
    if (error== DB_NOTFOUND)
      error=0;					// No log files
253
    goto err;
unknown's avatar
unknown committed
254
  }
unknown's avatar
unknown committed
255 256
  /* Error is 0 here */
  if (all_logs)
unknown's avatar
unknown committed
257
  {
unknown's avatar
unknown committed
258
    for (a = all_logs, f = free_logs; *a; ++a)
unknown's avatar
unknown committed
259
    {
260
      protocol->prepare_for_resend();
261 262
      protocol->store(*a, system_charset_info);
      protocol->store("BDB", 3, system_charset_info);
unknown's avatar
unknown committed
263 264
      if (f && *f && strcmp(*a, *f) == 0)
      {
265
	f++;
266
	protocol->store(SHOW_LOG_STATUS_FREE, system_charset_info);
unknown's avatar
unknown committed
267 268
      }
      else
269
	protocol->store(SHOW_LOG_STATUS_INUSE, system_charset_info);
unknown's avatar
unknown committed
270

271
      if (protocol->write())
unknown's avatar
unknown committed
272 273 274 275 276
      {
	error=1;
	goto err;
      }
    }
unknown's avatar
unknown committed
277
  }
278
err:
unknown's avatar
unknown committed
279
  free_root(&show_logs_root,MYF(0));
280 281
  my_pthread_setspecific_ptr(THR_MALLOC,old_root);
  DBUG_RETURN(error);
unknown's avatar
unknown committed
282
}
unknown's avatar
unknown committed
283 284 285

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

289 290 291 292
static void berkeley_noticecall(DB_ENV *db_env, db_notices notice)
{
  switch (notice)
  {
293
  case DB_NOTICE_LOGFILE_CHANGED: /* purecov: tested */
294 295 296 297 298 299 300 301 302 303 304 305 306 307
    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;

unknown's avatar
unknown committed
308 309
// by HF. Sometimes it crashes. TODO - find out why
#ifndef EMBEDDED_LIBRARY
310 311
  /* XXX: Probably this should be done somewhere else, and
   * should be tunable by the user. */
unknown's avatar
unknown committed
312
  if ((error = db_env->txn_checkpoint(db_env, 0, 0, 0)))
313
    my_error(ER_ERROR_DURING_CHECKPOINT, MYF(0), error); /* purecov: inspected */
unknown's avatar
unknown committed
314
#endif
unknown's avatar
unknown committed
315
  if ((error = db_env->log_archive(db_env, &names, DB_ARCH_ABS)) != 0)
316
  {
317 318 319
    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 */
320 321 322
  }

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

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

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


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

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


343 344 345 346
ulong ha_berkeley::index_flags(uint idx, uint part, bool all_parts) const
{
  ulong flags= (HA_READ_NEXT | HA_READ_PREV | HA_READ_ORDER | HA_KEYREAD_ONLY
                | HA_READ_RANGE);
unknown's avatar
unknown committed
347
  for (uint i= all_parts ? 0 : part ; i <= part ; i++)
348
  {
unknown's avatar
unknown committed
349
    if (table->key_info[idx].key_part[i].field->type() == FIELD_TYPE_BLOB)
350 351
    {
      /* We can't use BLOBS to shortcut sorts */
unknown's avatar
unknown committed
352 353 354 355 356 357 358 359
      flags&= ~(HA_READ_ORDER | HA_KEYREAD_ONLY | HA_READ_RANGE);
      break;
    }
    switch (table->key_info[idx].key_part[i].field->key_type()) {
    case HA_KEYTYPE_TEXT:
    case HA_KEYTYPE_VARTEXT:
      /*
        As BDB stores only one copy of equal strings, we can't use key read
360
        on these. Binary collations do support key read though.
unknown's avatar
unknown committed
361
      */
362 363 364
      if (!(table->key_info[idx].key_part[i].field->charset()->state
           & MY_CS_BINSORT))
        flags&= ~HA_KEYREAD_ONLY;
unknown's avatar
unknown committed
365 366
      break;
    default:                                    // Keep compiler happy
367 368 369 370 371 372 373
      break;
    }
  }
  return flags;
}


374
static int
375
berkeley_cmp_hidden_key(DB* file, const DBT *new_key, const DBT *saved_key)
376 377 378
{
  ulonglong a=uint5korr((char*) new_key->data);
  ulonglong b=uint5korr((char*) saved_key->data);
unknown's avatar
unknown committed
379
  return  a < b ? -1 : (a > b ? 1 : 0);
380 381
}

unknown's avatar
unknown committed
382
static int
383
berkeley_cmp_packed_key(DB *file, const DBT *new_key, const DBT *saved_key)
unknown's avatar
unknown committed
384
{
385 386
  KEY *key=	      (new_key->app_private ? (KEY*) new_key->app_private :
		       (KEY*) (file->app_private));
unknown's avatar
unknown committed
387 388 389 390 391
  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;

392
  for (; key_part != end && (int) key_length > 0; key_part++)
unknown's avatar
unknown committed
393 394 395 396
  {
    int cmp;
    if (key_part->null_bit)
    {
397 398
      if (*new_key_ptr != *saved_key_ptr++)
	return ((int) *new_key_ptr - (int) saved_key_ptr[-1]);
399
      key_length--;
400 401
      if (!*new_key_ptr++)
	continue;
unknown's avatar
unknown committed
402 403 404 405
    }
    if ((cmp=key_part->field->pack_cmp(new_key_ptr,saved_key_ptr,
				       key_part->length)))
      return cmp;
406 407
    uint length=key_part->field->packed_col_length(new_key_ptr,
						   key_part->length);
unknown's avatar
unknown committed
408 409
    new_key_ptr+=length;
    key_length-=length;
410 411
    saved_key_ptr+=key_part->field->packed_col_length(saved_key_ptr,
						      key_part->length);
unknown's avatar
unknown committed
412
  }
413
  return key->handler.bdb_return_if_eq;
unknown's avatar
unknown committed
414 415 416
}


417 418
/* The following is not yet used; Should be used for fixed length keys */

419
#ifdef NOT_YET
unknown's avatar
unknown committed
420
static int
421
berkeley_cmp_fix_length_key(DB *file, const DBT *new_key, const DBT *saved_key)
unknown's avatar
unknown committed
422
{
423 424
  KEY *key=	      (new_key->app_private ? (KEY*) new_key->app_private :
		       (KEY*) (file->app_private));
unknown's avatar
unknown committed
425 426 427 428 429
  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;

430
  for (; key_part != end && (int) key_length > 0 ; key_part++)
unknown's avatar
unknown committed
431 432 433 434 435 436 437 438
  {
    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;
  }
439
  return key->handler.bdb_return_if_eq;
unknown's avatar
unknown committed
440
}
441
#endif
unknown's avatar
unknown committed
442

443 444 445 446 447 448
/* 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
449
		*end=key_part+key_info->key_parts;
450

451
  for (; key_part != end && (int) key_length > 0; key_part++)
452 453 454 455 456
  {
    int cmp;
    if (key_part->null_bit)
    {
      key_length--;
457 458 459 460
      /*
	With the current usage, the following case will always be FALSE,
	because NULL keys are sorted before any other key
      */
461 462 463
      if (*key != (table->record[0][key_part->null_offset] &
		   key_part->null_bit) ? 0 : 1)
	return 1;
464
      if (!*key++)				// Null value
465 466 467 468
	continue;
    }
    if ((cmp=key_part->field->pack_cmp(key,key_part->length)))
      return cmp;
469
    uint length=key_part->field->packed_col_length(key,key_part->length);
470 471 472
    key+=length;
    key_length-=length;
  }
473
  return 0;					// Identical keys
474 475
}

476
int ha_berkeley::open(const char *name, int mode, uint test_if_locked)
unknown's avatar
unknown committed
477 478 479 480 481 482
{
  char name_buff[FN_REFLEN];
  uint open_mode=(mode == O_RDONLY ? DB_RDONLY : 0) | DB_THREAD;
  int error;
  DBUG_ENTER("ha_berkeley::open");

483 484 485 486 487
  /* Open primary key */
  hidden_primary_key=0;
  if ((primary_key=table->primary_key) >= MAX_KEY)
  {						// No primary key
    primary_key=table->keys;
488
    key_used_on_scan=MAX_KEY;
489 490
    ref_length=hidden_primary_key=BDB_HIDDEN_PRIMARY_KEY_LENGTH;
  }
491 492
  else
    key_used_on_scan=primary_key;
493

unknown's avatar
unknown committed
494
  /* Need some extra memory in case of packed keys */
495
  uint max_key_length= table->max_key_length + MAX_REF_PARTS*3;
unknown's avatar
unknown committed
496 497 498 499 500
  if (!(alloc_ptr=
	my_multi_malloc(MYF(MY_WME),
			&key_buff,  max_key_length,
			&key_buff2, max_key_length,
			&primary_key_buff,
501 502
			(hidden_primary_key ? 0 :
			 table->key_info[table->primary_key].key_length),
unknown's avatar
unknown committed
503
			NullS)))
504
    DBUG_RETURN(1); /* purecov: inspected */
505 506 507
  if (!(rec_buff= (byte*) my_malloc((alloced_rec_buff_length=
				     table->rec_buff_length),
				    MYF(MY_WME))))
unknown's avatar
unknown committed
508
  {
509 510
    my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
    DBUG_RETURN(1); /* purecov: inspected */
unknown's avatar
unknown committed
511 512
  }

513
  /* Init shared structure */
514
  if (!(share=get_share(name,table)))
unknown's avatar
unknown committed
515
  {
516
    my_free((char*) rec_buff,MYF(0)); /* purecov: inspected */
517 518
    my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
    DBUG_RETURN(1); /* purecov: inspected */
unknown's avatar
unknown committed
519 520
  }
  thr_lock_data_init(&share->lock,&lock,(void*) 0);
521 522
  key_file = share->key_file;
  key_type = share->key_type;
523
  bzero((char*) &current_row,sizeof(current_row));
unknown's avatar
unknown committed
524

525 526 527 528
  /* Fill in shared structure, if needed */
  pthread_mutex_lock(&share->mutex);
  file = share->file;
  if (!share->use_count++)
unknown's avatar
unknown committed
529
  {
530 531
    if ((error=db_create(&file, db_env, 0)))
    {
532
      free_share(share,table, hidden_primary_key,1); /* purecov: inspected */
533
      my_free((char*) rec_buff,MYF(0)); /* purecov: inspected */
534 535 536
      my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
      my_errno=error; /* purecov: inspected */
      DBUG_RETURN(1); /* purecov: inspected */
537 538 539 540 541 542 543 544
    }
    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);
unknown's avatar
unknown committed
545 546
    if ((error= txn_begin(db_env, 0, (DB_TXN**) &transaction, 0)) ||
	(error= (file->open(file, transaction,
547 548
			    fn_format(name_buff, name, "", ha_berkeley_ext,
				      2 | 4),
unknown's avatar
unknown committed
549 550
			    "main", DB_BTREE, open_mode, 0))) ||
	(error= transaction->commit(transaction, 0)))
551
    {
552
      free_share(share,table, hidden_primary_key,1); /* purecov: inspected */
553
      my_free((char*) rec_buff,MYF(0)); /* purecov: inspected */
554 555 556
      my_free(alloc_ptr,MYF(0)); /* purecov: inspected */
      my_errno=error; /* purecov: inspected */
      DBUG_RETURN(1); /* purecov: inspected */
557
    }
unknown's avatar
unknown committed
558

559
    /* Open other keys;  These are part of the share structure */
560 561 562 563 564 565 566 567 568 569 570
    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
571 572 573
	  close();				/* purecov: inspected */
	  my_errno=error;			/* purecov: inspected */
	  DBUG_RETURN(1);			/* purecov: inspected */
574 575 576 577 578 579
	}
	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))
unknown's avatar
unknown committed
580 581
	{
	  DBUG_PRINT("bdb",("Setting DB_DUP for key %u", i));
582
	  (*ptr)->set_flags(*ptr, DB_DUP);
unknown's avatar
unknown committed
583
	}
unknown's avatar
unknown committed
584 585 586 587
	if ((error= txn_begin(db_env, 0, (DB_TXN**) &transaction, 0)) ||
	    (error=((*ptr)->open(*ptr, transaction, name_buff, part, DB_BTREE,
				 open_mode, 0))) ||
	    (error= transaction->commit(transaction, 0)))
588
	{
unknown's avatar
unknown committed
589 590 591
	  close();				/* purecov: inspected */
	  my_errno=error;			/* purecov: inspected */
	  DBUG_RETURN(1);			/* purecov: inspected */
592 593 594 595
	}
      }
    }
    /* Calculate pack_length of primary key */
596
    share->fixed_length_primary_key=1;
597 598 599 600 601
    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;
602
      for (; key_part != end ; key_part++)
603
	ref_length+= key_part->field->max_packed_col_length(key_part->length);
604
      share->fixed_length_primary_key=
605 606 607
	(ref_length == table->key_info[primary_key].key_length);
      share->status|=STATUS_PRIMARY_KEY_INIT;
    }    
608
    share->ref_length=ref_length;
unknown's avatar
unknown committed
609
  }
610
  ref_length=share->ref_length;			// If second open
611
  pthread_mutex_unlock(&share->mutex);
unknown's avatar
unknown committed
612 613 614

  transaction=0;
  cursor=0;
615
  key_read=0;
616
  block_size=8192;				// Berkeley DB block size
617
  share->fixed_length_row=!(table->db_create_options & HA_OPTION_PACK_RECORD);
unknown's avatar
unknown committed
618

619
  get_status();
unknown's avatar
unknown committed
620
  info(HA_STATUS_NO_LOCK | HA_STATUS_VARIABLE | HA_STATUS_CONST);
unknown's avatar
unknown committed
621 622 623 624 625 626 627 628
  DBUG_RETURN(0);
}


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

629
  my_free((char*) rec_buff,MYF(MY_ALLOW_ZERO_PTR));
unknown's avatar
unknown committed
630
  my_free(alloc_ptr,MYF(MY_ALLOW_ZERO_PTR));
unknown's avatar
unknown committed
631
  ha_berkeley::extra(HA_EXTRA_RESET);		// current_row buffer
unknown's avatar
unknown committed
632
  DBUG_RETURN(free_share(share,table, hidden_primary_key,0));
unknown's avatar
unknown committed
633 634 635 636 637 638 639 640 641 642 643 644
}


/* 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))))
645
      return 1; /* purecov: inspected */
unknown's avatar
unknown committed
646 647 648 649 650 651 652 653 654 655 656 657 658
    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++)
659
    length+= (*ptr)->get_length((char*) buf+(*ptr)->offset())+2;
unknown's avatar
unknown committed
660 661 662 663 664 665 666 667 668 669 670 671 672
  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.
*/

673
int ha_berkeley::pack_row(DBT *row, const byte *record, bool new_row)
unknown's avatar
unknown committed
674 675
{
  bzero((char*) row,sizeof(*row));
676
  if (share->fixed_length_row)
unknown's avatar
unknown committed
677 678
  {
    row->data=(void*) record;
679 680 681 682 683 684 685 686
    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
687 688 689 690 691
    return 0;
  }
  if (table->blob_fields)
  {
    if (fix_rec_buff_for_blob(max_row_length(record)))
692
      return HA_ERR_OUT_OF_MEM; /* purecov: inspected */
unknown's avatar
unknown committed
693 694 695 696 697 698 699
  }

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

  for (Field **field=table->field ; *field ; field++)
700 701
    ptr=(byte*) (*field)->pack((char*) ptr,
			       (char*) record + (*field)->offset());
702 703 704 705 706 707 708 709 710

  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
711 712 713 714 715 716 717 718
  row->data=rec_buff;
  row->size= (size_t) (ptr - rec_buff);
  return 0;
}


void ha_berkeley::unpack_row(char *record, DBT *row)
{
719
  if (share->fixed_length_row)
720
    memcpy(record,(char*) row->data,table->reclength+hidden_primary_key);
unknown's avatar
unknown committed
721 722 723 724 725 726 727 728 729 730 731 732
  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);
  }
}


733 734 735 736 737 738
/* 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
739
		*end=key_part+key_info->key_parts;
740 741

  char *pos=(char*) key->data;
742
  for (; key_part != end; key_part++)
743 744 745 746 747 748 749 750 751 752 753 754 755 756 757
  {
    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;
    }
758 759
    pos= (char*) key_part->field->unpack_key(record + key_part->field->offset(),
                                             pos, key_part->length);
760 761 762 763
  }
}


unknown's avatar
unknown committed
764 765 766 767 768
/*
  Create a packed key from from a row
  This will never fail as the key buffer is pre allocated.
*/

769 770
DBT *ha_berkeley::create_key(DBT *key, uint keynr, char *buff,
			     const byte *record, int key_length)
unknown's avatar
unknown committed
771
{
772 773 774
  bzero((char*) key,sizeof(*key));
  if (hidden_primary_key && keynr == primary_key)
  {
775
    /* We don't need to set app_private here */
776 777 778 779 780
    key->data=current_ident;
    key->size=BDB_HIDDEN_PRIMARY_KEY_LENGTH;
    return key;
  }

unknown's avatar
unknown committed
781 782 783
  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;
784
  DBUG_ENTER("create_key");
unknown's avatar
unknown committed
785 786

  key->data=buff;
787
  key->app_private= key_info;
788
  for (; key_part != end && key_length > 0; key_part++)
unknown's avatar
unknown committed
789 790 791 792 793 794 795 796 797 798 799 800
  {
    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
    }
801
    buff=key_part->field->pack_key(buff,(char*) (record + key_part->offset),
802
				   key_part->length);
803
    key_length-=key_part->length;
unknown's avatar
unknown committed
804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820
  }
  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;
821
  DBUG_ENTER("bdb:pack_key");
unknown's avatar
unknown committed
822 823 824

  bzero((char*) key,sizeof(*key));
  key->data=buff;
825
  key->app_private= (void*) key_info;
unknown's avatar
unknown committed
826 827 828

  for (; key_part != end && (int) key_length > 0 ; key_part++)
  {
829
    uint offset=0;
unknown's avatar
unknown committed
830 831 832 833 834 835 836 837 838
    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;
      }
839
      offset=1;					// Data is at key_ptr+1
unknown's avatar
unknown committed
840
    }
841
    buff=key_part->field->pack_key_from_key_image(buff,(char*) key_ptr+offset,
842
						  key_part->length);
unknown's avatar
unknown committed
843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858
    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);
859 860
  if (table->timestamp_default_now)
    update_timestamp(record+table->timestamp_default_now-1);
unknown's avatar
unknown committed
861 862
  if (table->next_number_field && record == table->record[0])
    update_auto_increment();
863
  if ((error=pack_row(&row, record,1)))
864
    DBUG_RETURN(error); /* purecov: inspected */
unknown's avatar
unknown committed
865

866
  if (table->keys + test(hidden_primary_key) == 1)
unknown's avatar
unknown committed
867
  {
868 869
    error=file->put(file, transaction, create_key(&prim_key, primary_key,
						  key_buff, record),
unknown's avatar
unknown committed
870
		    &row, key_type[primary_key]);
unknown's avatar
unknown committed
871
    last_dup_key=primary_key;
unknown's avatar
unknown committed
872 873 874
  }
  else
  {
875
    DB_TXN *sub_trans = transaction;
876 877
    /* Don't use sub transactions in temporary tables */
    ulong thd_options = table->tmp_table == NO_TMP_TABLE ? table->in_use->options : 0;
unknown's avatar
unknown committed
878 879
    for (uint retry=0 ; retry < berkeley_trans_retry ; retry++)
    {
unknown's avatar
unknown committed
880
      key_map changed_keys(0);
881 882
      if (using_ignore && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
      {
883 884 885
	if ((error=txn_begin(db_env, transaction, &sub_trans, 0))) /* purecov: deadcode */
	  break; /* purecov: deadcode */
	DBUG_PRINT("trans",("starting subtransaction")); /* purecov: deadcode */
886
      }
887 888
      if (!(error=file->put(file, sub_trans, create_key(&prim_key, primary_key,
							key_buff, record),
unknown's avatar
unknown committed
889 890
			    &row, key_type[primary_key])))
      {
891
	changed_keys.set_bit(primary_key);
892
	for (uint keynr=0 ; keynr < table->keys ; keynr++)
unknown's avatar
unknown committed
893 894 895 896
	{
	  if (keynr == primary_key)
	    continue;
	  if ((error=key_file[keynr]->put(key_file[keynr], sub_trans,
897 898
					  create_key(&key, keynr, key_buff2,
						     record),
unknown's avatar
unknown committed
899 900 901 902 903
					  &prim_key, key_type[keynr])))
	  {
	    last_dup_key=keynr;
	    break;
	  }
904
	  changed_keys.set_bit(keynr);
unknown's avatar
unknown committed
905 906
	}
      }
unknown's avatar
unknown committed
907 908
      else
	last_dup_key=primary_key;
909
      if (error)
unknown's avatar
unknown committed
910 911 912
      {
	/* Remove inserted row */
	DBUG_PRINT("error",("Got error %d",error));
913
	if (using_ignore)
unknown's avatar
unknown committed
914
	{
915 916 917
	  int new_error = 0;
	  if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
	  {
918 919
	    DBUG_PRINT("trans",("aborting subtransaction")); /* purecov: deadcode */
	    new_error=txn_abort(sub_trans); /* purecov: deadcode */
920
	  }
unknown's avatar
unknown committed
921
	  else if (!changed_keys.is_clear_all())
922 923
	  {
	    new_error = 0;
unknown's avatar
unknown committed
924 925
	    for (uint keynr=0 ; keynr < table->keys+test(hidden_primary_key) ;
                 keynr++)
926
	    {
unknown's avatar
unknown committed
927
	      if (changed_keys.is_set(keynr))
928 929
	      {
		if ((new_error = remove_key(sub_trans, keynr, record,
930
					    &prim_key)))
931
		  break; /* purecov: inspected */
932 933 934 935 936
	      }
	    }
	  }
	  if (new_error)
	  {
937 938
	    error=new_error;			// This shouldn't happen /* purecov: inspected */
	    break; /* purecov: inspected */
939
	  }
unknown's avatar
unknown committed
940 941
	}
      }
942 943
      else if (using_ignore && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
      {
944 945
	DBUG_PRINT("trans",("committing subtransaction")); /* purecov: deadcode */
	error=txn_commit(sub_trans, 0); /* purecov: deadcode */
946
      }
unknown's avatar
unknown committed
947 948 949 950 951 952
      if (error != DB_LOCK_DEADLOCK)
	break;
    }
  }
  if (error == DB_KEYEXIST)
    error=HA_ERR_FOUND_DUPP_KEY;
953 954
  else if (!error)
    changed_rows++;
unknown's avatar
unknown committed
955 956 957 958 959 960 961 962 963 964 965 966
  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;

967
  for (; key_part != end ; key_part++)
unknown's avatar
unknown committed
968 969 970 971 972 973 974 975 976
  {
    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
977

978 979
      if (key_part->field->cmp_binary((char*) (old_row + key_part->offset),
				      (char*) (new_row + key_part->offset),
unknown's avatar
unknown committed
980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995
				      (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.
996
  Clobbers key_buff2
unknown's avatar
unknown committed
997 998 999
*/

int ha_berkeley::update_primary_key(DB_TXN *trans, bool primary_key_changed,
1000 1001 1002
				    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
1003
{
1004
  DBT row;
1005
  int error;
unknown's avatar
unknown committed
1006 1007 1008 1009 1010 1011
  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
1012
    if (!(error=remove_key(trans, primary_key, old_row, old_key)))
unknown's avatar
unknown committed
1013
    {
1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027
      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])))
1028
	      error=new_error;                  // fatal error /* purecov: inspected */
1029 1030 1031
	  }
	}
      }
unknown's avatar
unknown committed
1032 1033 1034 1035 1036
    }
  }
  else
  {
    // Primary key didn't change;  just update the row data
1037 1038
    if (!(error=pack_row(&row, new_row, 0)))
      error=file->put(file, trans, new_key, &row, 0);
unknown's avatar
unknown committed
1039
  }
1040
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1041 1042
}

1043 1044 1045 1046 1047 1048
/*
  Restore changed keys, when a non-fatal error aborts the insert/update
  of one row.
  Clobbers keybuff2
*/

unknown's avatar
unknown committed
1049
int ha_berkeley::restore_keys(DB_TXN *trans, key_map *changed_keys,
1050 1051 1052 1053 1054 1055 1056
			      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;
1057
  uint keynr;
1058 1059 1060 1061 1062 1063
  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)))
1064
    goto err; /* purecov: inspected */
1065 1066 1067 1068 1069 1070

  /* 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. */
unknown's avatar
unknown committed
1071
  if (!changed_keys->is_clear_all())
1072
  {
unknown's avatar
unknown committed
1073
    for (keynr=0 ; keynr < table->keys+test(hidden_primary_key) ; keynr++)
1074
    {
unknown's avatar
unknown committed
1075
      if (changed_keys->is_set(keynr))
unknown's avatar
unknown committed
1076
      {
unknown's avatar
unknown committed
1077
        if (changed_keys->is_prefix(1) &&
unknown's avatar
unknown committed
1078 1079 1080 1081 1082 1083 1084 1085
            (error = remove_key(trans, keynr, new_row, new_key)))
          break; /* purecov: inspected */
        if ((error = key_file[keynr]->put(key_file[keynr], trans,
                                          create_key(&tmp_key, keynr, key_buff2,
                                                     old_row),
                                          old_key, key_type[keynr])))
          break; /* purecov: inspected */
      }
1086 1087
    }
  }
unknown's avatar
unknown committed
1088

1089
err:
unknown's avatar
unknown committed
1090
  DBUG_ASSERT(error != DB_KEYEXIST);
1091 1092
  DBUG_RETURN(error);
}
unknown's avatar
unknown committed
1093 1094 1095 1096


int ha_berkeley::update_row(const byte * old_row, byte * new_row)
{
1097
  DBT prim_key, key, old_prim_key;
unknown's avatar
unknown committed
1098 1099
  int error;
  DB_TXN *sub_trans;
1100
  ulong thd_options = table->tmp_table == NO_TMP_TABLE ? table->in_use->options : 0;
unknown's avatar
unknown committed
1101 1102
  bool primary_key_changed;
  DBUG_ENTER("update_row");
unknown's avatar
unknown committed
1103
  LINT_INIT(error);
unknown's avatar
unknown committed
1104 1105

  statistic_increment(ha_update_count,&LOCK_status);
1106 1107
  if (table->timestamp_on_update_now)
    update_timestamp(new_row+table->timestamp_on_update_now-1);
1108 1109 1110 1111 1112 1113 1114

  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
1115
    old_prim_key=prim_key;
1116 1117 1118
  }
  else
  {
1119
    create_key(&prim_key, primary_key, key_buff, new_row);
unknown's avatar
unknown committed
1120

1121
    if ((primary_key_changed=key_cmp(primary_key, old_row, new_row)))
1122
      create_key(&old_prim_key, primary_key, primary_key_buff, old_row);
1123 1124 1125
    else
      old_prim_key=prim_key;
  }
unknown's avatar
unknown committed
1126

1127
  sub_trans = transaction;
unknown's avatar
unknown committed
1128 1129
  for (uint retry=0 ; retry < berkeley_trans_retry ; retry++)
  {
unknown's avatar
unknown committed
1130
    key_map changed_keys(0);
1131 1132
    if (using_ignore &&	(thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
    {
1133 1134 1135
      if ((error=txn_begin(db_env, transaction, &sub_trans, 0))) /* purecov: deadcode */
	break; /* purecov: deadcode */
      DBUG_PRINT("trans",("starting subtransaction")); /* purecov: deadcode */
1136
    }
unknown's avatar
unknown committed
1137 1138
    /* Start by updating the primary key */
    if (!(error=update_primary_key(sub_trans, primary_key_changed,
1139 1140 1141
				   old_row, &old_prim_key,
				   new_row, &prim_key,
				   thd_options, using_ignore)))
unknown's avatar
unknown committed
1142 1143 1144 1145 1146 1147 1148 1149
    {
      // 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)
	{
1150
	  if ((error=remove_key(sub_trans, keynr, old_row, &old_prim_key)))
1151
	  {
1152
	    if (using_ignore && /* purecov: inspected */
1153 1154 1155 1156 1157 1158 1159 1160
		(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;
	    }
1161
	    DBUG_RETURN(error);			// Fatal error /* purecov: inspected */
1162
	  }
1163
	  changed_keys.set_bit(keynr);
1164
	  if ((error=key_file[keynr]->put(key_file[keynr], sub_trans,
1165
					  create_key(&key, keynr, key_buff2,
1166
						     new_row),
unknown's avatar
unknown committed
1167 1168 1169 1170 1171 1172 1173 1174
					  &prim_key, key_type[keynr])))
	  {
	    last_dup_key=keynr;
	    break;
	  }
	}
      }
    }
1175
    if (error)
unknown's avatar
unknown committed
1176 1177
    {
      /* Remove inserted row */
1178 1179 1180 1181 1182 1183
      DBUG_PRINT("error",("Got error %d",error));
      if (using_ignore)
      {
	int new_error = 0;
	if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
	{
1184 1185
	  DBUG_PRINT("trans",("aborting subtransaction")); /* purecov: deadcode */
	  new_error=txn_abort(sub_trans); /* purecov: deadcode */
1186
	}
unknown's avatar
unknown committed
1187
	else if (!changed_keys.is_clear_all())
unknown's avatar
unknown committed
1188
	  new_error=restore_keys(transaction, &changed_keys, primary_key,
1189 1190 1191 1192
				 old_row, &old_prim_key, new_row, &prim_key,
				 thd_options);
	if (new_error)
	{
1193 1194
	  error=new_error;			// This shouldn't happen /* purecov: inspected */
	  break; /* purecov: inspected */
1195 1196 1197 1198 1199
	}
      }
    }
    else if (using_ignore && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
    {
1200 1201
      DBUG_PRINT("trans",("committing subtransaction")); /* purecov: deadcode */
      error=txn_commit(sub_trans, 0); /* purecov: deadcode */
unknown's avatar
unknown committed
1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217
    }
    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.
*/

1218
int ha_berkeley::remove_key(DB_TXN *trans, uint keynr, const byte *record,
unknown's avatar
unknown committed
1219 1220 1221 1222 1223 1224 1225
			    DBT *prim_key)
{
  int error;
  DBT key;
  DBUG_ENTER("remove_key");
  DBUG_PRINT("enter",("index: %d",keynr));

unknown's avatar
unknown committed
1226 1227 1228 1229 1230
  if (keynr == active_index && cursor)
    error=cursor->c_del(cursor,0);
  else if (keynr == primary_key ||
	   ((table->key_info[keynr].flags & (HA_NOSAME | HA_NULL_PART_KEY)) ==
	    HA_NOSAME))
unknown's avatar
unknown committed
1231
  {						// Unique key
unknown's avatar
unknown committed
1232
    DBUG_ASSERT(keynr == primary_key || prim_key->data != key_buff2);
1233
    error=key_file[keynr]->del(key_file[keynr], trans,
unknown's avatar
unknown committed
1234 1235
			       keynr == primary_key ?
			       prim_key :
1236
			       create_key(&key, keynr, key_buff2, record),
unknown's avatar
unknown committed
1237 1238 1239 1240 1241 1242 1243 1244 1245
			       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
    */
unknown's avatar
unknown committed
1246
    DBUG_ASSERT(keynr != primary_key && prim_key->data != key_buff2);
unknown's avatar
unknown committed
1247
    DBC *tmp_cursor;
1248 1249
    if (!(error=key_file[keynr]->cursor(key_file[keynr], trans,
					&tmp_cursor, 0)))
unknown's avatar
unknown committed
1250
    {
1251
      if (!(error=tmp_cursor->c_get(tmp_cursor,
1252 1253
                                    create_key(&key, keynr, key_buff2, record),
                                    prim_key, DB_GET_BOTH | DB_RMW)))
unknown's avatar
unknown committed
1254
      {					// This shouldn't happen
unknown's avatar
unknown committed
1255
	error=tmp_cursor->c_del(tmp_cursor,0);
unknown's avatar
unknown committed
1256
      }
unknown's avatar
unknown committed
1257
      int result=tmp_cursor->c_close(tmp_cursor);
unknown's avatar
unknown committed
1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268
      if (!error)
	error=result;
    }
  }
  DBUG_RETURN(error);
}


/* Delete all keys for new_record */

int ha_berkeley::remove_keys(DB_TXN *trans, const byte *record,
unknown's avatar
unknown committed
1269
			     DBT *new_record, DBT *prim_key, key_map *keys)
unknown's avatar
unknown committed
1270
{
1271
  int result = 0;
unknown's avatar
unknown committed
1272
  for (uint keynr=0 ; keynr < table->keys+test(hidden_primary_key) ; keynr++)
unknown's avatar
unknown committed
1273
  {
unknown's avatar
unknown committed
1274
    if (keys->is_set(keynr))
unknown's avatar
unknown committed
1275
    {
1276
      int new_error=remove_key(trans, keynr, record, prim_key);
unknown's avatar
unknown committed
1277 1278
      if (new_error)
      {
1279 1280
	result=new_error;			// Return last error /* purecov: inspected */
	break;					// Let rollback correct things /* purecov: inspected */
unknown's avatar
unknown committed
1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292
      }
    }
  }
  return result;
}


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

1297
  if ((error=pack_row(&row, record, 0)))
1298
    DBUG_RETURN((error)); /* purecov: inspected */
1299
  create_key(&prim_key, primary_key, key_buff, record);
1300
  if (hidden_primary_key)
1301
    keys.set_bit(primary_key);
1302

1303 1304 1305
  /* 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
1306 1307
  for (uint retry=0 ; retry < berkeley_trans_retry ; retry++)
  {
1308 1309
    if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
    {
1310 1311 1312
      if ((error=txn_begin(db_env, transaction, &sub_trans, 0))) /* purecov: deadcode */
	break; /* purecov: deadcode */
      DBUG_PRINT("trans",("starting sub transaction")); /* purecov: deadcode */
1313
    }
unknown's avatar
unknown committed
1314
    error=remove_keys(sub_trans, record, &row, &prim_key, &keys);
1315
    if (!error && (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS))
unknown's avatar
unknown committed
1316
    {
1317 1318
      DBUG_PRINT("trans",("ending sub transaction")); /* purecov: deadcode */
      error=txn_commit(sub_trans, 0); /* purecov: deadcode */
unknown's avatar
unknown committed
1319 1320
    }
    if (error)
1321
    { /* purecov: inspected */
unknown's avatar
unknown committed
1322
      DBUG_PRINT("error",("Got error %d",error));
1323
      if (thd_options & OPTION_INTERNAL_SUBTRANSACTIONS)
unknown's avatar
unknown committed
1324
      {
1325 1326 1327 1328 1329 1330 1331 1332
	/* 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
1333
      }
1334 1335
      else
	break;					// No retry - return error
unknown's avatar
unknown committed
1336 1337 1338 1339
    }
    if (error != DB_LOCK_DEADLOCK)
      break;
  }
unknown's avatar
unknown committed
1340
#ifdef CANT_COUNT_DELETED_ROWS
1341 1342
  if (!error)
    changed_rows--;
unknown's avatar
unknown committed
1343
#endif
1344
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1345 1346 1347 1348 1349 1350
}


int ha_berkeley::index_init(uint keynr)
{
  int error;
1351
  DBUG_ENTER("ha_berkeley::index_init");
1352
  DBUG_PRINT("enter",("table: '%s'  key: %d", table->real_name, keynr));
unknown's avatar
unknown committed
1353 1354 1355 1356 1357 1358

  /*
    Under some very rare conditions (like full joins) we may already have
    an active cursor at this point
  */
  if (cursor)
unknown's avatar
unknown committed
1359 1360
  {
    DBUG_PRINT("note",("Closing active cursor"));
unknown's avatar
unknown committed
1361
    cursor->c_close(cursor);
unknown's avatar
unknown committed
1362
  }
unknown's avatar
unknown committed
1363
  active_index=keynr;
1364 1365 1366 1367
  if ((error=key_file[keynr]->cursor(key_file[keynr], transaction, &cursor,
				     table->reginfo.lock_type >
				     TL_WRITE_ALLOW_READ ?
				     0 : 0)))
unknown's avatar
unknown committed
1368
    cursor=0;				// Safety /* purecov: inspected */
unknown's avatar
unknown committed
1369 1370 1371 1372 1373 1374 1375
  bzero((char*) &last_key,sizeof(last_key));
  DBUG_RETURN(error);
}

int ha_berkeley::index_end()
{
  int error=0;
1376
  DBUG_ENTER("ha_berkely::index_end");
unknown's avatar
unknown committed
1377 1378
  if (cursor)
  {
1379
    DBUG_PRINT("enter",("table: '%s'", table->real_name));
unknown's avatar
unknown committed
1380 1381 1382
    error=cursor->c_close(cursor);
    cursor=0;
  }
unknown's avatar
unknown committed
1383
  active_index=MAX_KEY;
unknown's avatar
unknown committed
1384 1385 1386 1387 1388 1389 1390
  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,
1391
			  DBT *found_key, bool read_next)
unknown's avatar
unknown committed
1392
{
1393
  DBUG_ENTER("ha_berkeley::read_row");
unknown's avatar
unknown committed
1394 1395 1396 1397 1398 1399 1400
  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);
  }
1401 1402 1403 1404 1405
  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
1406 1407
  if (keynr != primary_key)
  {
1408 1409 1410 1411 1412 1413 1414 1415 1416
    /* 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
1417 1418
    DBT key;
    bzero((char*) &key,sizeof(key));
1419
    key.data=key_buff;
unknown's avatar
unknown committed
1420
    key.size=row->size;
1421
    key.app_private= (void*) (table->key_info+primary_key);
1422
    memcpy(key_buff,row->data,row->size);
unknown's avatar
unknown committed
1423 1424 1425 1426
    /* Read the data into current_row */
    current_row.flags=DB_DBT_REALLOC;
    if ((error=file->get(file, transaction, &key, &current_row, 0)))
    {
1427 1428
      table->status=STATUS_NOT_FOUND; /* purecov: inspected */
      DBUG_RETURN(error == DB_NOTFOUND ? HA_ERR_CRASHED : error); /* purecov: inspected */
unknown's avatar
unknown committed
1429 1430 1431 1432 1433 1434 1435 1436
    }
    row= &current_row;
  }
  unpack_row(buf,row);
  DBUG_RETURN(0);
}


1437 1438
/* This is only used to read whole keys */

unknown's avatar
unknown committed
1439 1440 1441 1442 1443 1444
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;
unknown's avatar
unknown committed
1445
  active_index=MAX_KEY;
1446
  DBUG_RETURN(read_row(key_file[keynr]->get(key_file[keynr], transaction,
unknown's avatar
unknown committed
1447 1448 1449
				 pack_key(&last_key, keynr, key_buff, key,
					  key_len),
				 &current_row,0),
1450
		       (char*) buf, keynr, &current_row, &last_key, 0));
unknown's avatar
unknown committed
1451 1452 1453 1454 1455 1456 1457
}


int ha_berkeley::index_read(byte * buf, const byte * key,
			    uint key_len, enum ha_rkey_function find_flag)
{
  DBT row;
1458
  int error;
1459
  KEY *key_info= &table->key_info[active_index];
1460
  int do_prev= 0;
1461
  DBUG_ENTER("ha_berkeley::index_read");
1462

unknown's avatar
unknown committed
1463 1464
  statistic_increment(ha_read_key_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));
1465 1466 1467 1468 1469 1470 1471 1472 1473 1474
  if (find_flag == HA_READ_BEFORE_KEY)
  {
    find_flag= HA_READ_KEY_OR_NEXT;
    do_prev= 1;
  }
  else if (find_flag == HA_READ_PREFIX_LAST_OR_PREV)
  {
    find_flag= HA_READ_AFTER_KEY;
    do_prev= 1;
  }
1475
  if (key_len == key_info->key_length)
1476
  {
1477 1478
    if (find_flag == HA_READ_AFTER_KEY)
      key_info->handler.bdb_return_if_eq= 1;
1479 1480 1481 1482
    error=read_row(cursor->c_get(cursor, pack_key(&last_key,
						  active_index,
						  key_buff,
						  key, key_len),
1483 1484 1485
				 &row,
				 (find_flag == HA_READ_KEY_EXACT ?
				  DB_SET : DB_SET_RANGE)),
1486
		   (char*) buf, active_index, &row, (DBT*) 0, 0);
1487
    key_info->handler.bdb_return_if_eq= 0;
1488 1489 1490 1491 1492 1493
  }
  else
  {
    /* read of partial key */
    pack_key(&last_key, active_index, key_buff, key, key_len);
    /* Store for compare */
1494
    memcpy(key_buff2, key_buff, (key_len=last_key.size));
1495 1496 1497 1498 1499 1500
    /*
      If HA_READ_AFTER_KEY is set, return next key, else return first
      matching key.
    */
    key_info->handler.bdb_return_if_eq= (find_flag == HA_READ_AFTER_KEY ?
					 1 : -1);
1501
    error=read_row(cursor->c_get(cursor, &last_key, &row, DB_SET_RANGE),
1502
		   (char*) buf, active_index, &row, (DBT*) 0, 0);
1503
    key_info->handler.bdb_return_if_eq= 0;
1504 1505
    if (!error && find_flag == HA_READ_KEY_EXACT)
    {
1506 1507
      /* 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))
1508 1509 1510
	error=HA_ERR_KEY_NOT_FOUND;
    }
  }
1511 1512 1513 1514 1515
  if (do_prev)
  {
    bzero((char*) &row, sizeof(row));
    error= read_row(cursor->c_get(cursor, &last_key, &row, DB_PREV),
                         (char*) buf, active_index, &row, &last_key, 1);
unknown's avatar
unknown committed
1516
  }
1517
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1518 1519
}

1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550
/*
  Read last key is solved by reading the next key and then reading
  the previous key
*/

int ha_berkeley::index_read_last(byte * buf, const byte * key, uint key_len)
{
  DBT row;
  int error;
  KEY *key_info= &table->key_info[active_index];
  DBUG_ENTER("ha_berkeley::index_read");

  statistic_increment(ha_read_key_count,&LOCK_status);
  bzero((char*) &row,sizeof(row));

  /* read of partial key */
  pack_key(&last_key, active_index, key_buff, key, key_len);
  /* Store for compare */
  memcpy(key_buff2, key_buff, (key_len=last_key.size));
  key_info->handler.bdb_return_if_eq= 1;
  error=read_row(cursor->c_get(cursor, &last_key, &row, DB_SET_RANGE),
		 (char*) buf, active_index, &row, (DBT*) 0, 0);
  key_info->handler.bdb_return_if_eq= 0;
  bzero((char*) &row,sizeof(row));
  if (read_row(cursor->c_get(cursor, &last_key, &row, DB_PREV),
	       (char*) buf, active_index, &row, &last_key, 1) ||
      berkeley_key_cmp(table, key_info, key_buff2, key_len))
    error=HA_ERR_KEY_NOT_FOUND;
  DBUG_RETURN(error);
}

unknown's avatar
unknown committed
1551 1552 1553 1554 1555 1556 1557 1558

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),
1559
		       (char*) buf, active_index, &row, &last_key, 1));
unknown's avatar
unknown committed
1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570
}

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),
1571
		   (char*) buf, active_index, &row, &last_key, 1);
unknown's avatar
unknown committed
1572 1573 1574
  else
  {
    error=read_row(cursor->c_get(cursor, &last_key, &row, DB_NEXT),
1575
		   (char*) buf, active_index, &row, &last_key, 1);
unknown's avatar
unknown committed
1576
    if (!error && ::key_cmp_if_same(table, key, active_index, keylen))
unknown's avatar
unknown committed
1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589
      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),
1590
		       (char*) buf, active_index, &row, &last_key, 1));
unknown's avatar
unknown committed
1591
}
unknown's avatar
unknown committed
1592

unknown's avatar
unknown committed
1593 1594 1595 1596 1597 1598 1599 1600

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),
1601
		       (char*) buf, active_index, &row, &last_key, 1));
unknown's avatar
unknown committed
1602 1603 1604 1605 1606 1607 1608 1609 1610
}

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),
1611
		       (char*) buf, active_index, &row, &last_key, 0));
unknown's avatar
unknown committed
1612 1613 1614 1615
}

int ha_berkeley::rnd_init(bool scan)
{
1616
  DBUG_ENTER("rnd_init");
unknown's avatar
unknown committed
1617
  current_row.flags=DB_DBT_REALLOC;
1618
  DBUG_RETURN(index_init(primary_key));
unknown's avatar
unknown committed
1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632
}

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),
1633
		       (char*) buf, primary_key, &row, &last_key, 1));
unknown's avatar
unknown committed
1634 1635 1636 1637 1638
}


DBT *ha_berkeley::get_pos(DBT *to, byte *pos)
{
1639
  /* We don't need to set app_private here */
unknown's avatar
unknown committed
1640 1641 1642
  bzero((char*) to,sizeof(*to));

  to->data=pos;
1643
  if (share->fixed_length_primary_key)
unknown's avatar
unknown committed
1644 1645 1646 1647 1648 1649
    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;

1650
    for (; key_part != end ; key_part++)
1651
      pos+=key_part->field->packed_col_length((char*) pos,key_part->length);
unknown's avatar
unknown committed
1652 1653 1654 1655 1656 1657 1658 1659 1660 1661
    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);
1662
  DBUG_ENTER("ha_berkeley::rnd_pos");
unknown's avatar
unknown committed
1663

unknown's avatar
unknown committed
1664
  active_index= MAX_KEY;
1665 1666 1667 1668
  DBUG_RETURN(read_row(file->get(file, transaction,
				 get_pos(&db_pos, pos),
				 &current_row, 0),
		       (char*) buf, primary_key, &current_row, (DBT*) 0, 0));
unknown's avatar
unknown committed
1669 1670
}

1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692
/*
  Set a reference to the current record in (ref,ref_length).

  SYNOPSIS
    ha_berkeley::position()
    record                      The current record buffer

  DESCRIPTION
    The BDB handler stores the primary key in (ref,ref_length).
    There is either an explicit primary key, or an implicit (hidden)
    primary key.
    During open(), 'ref_length' is calculated as the maximum primary
    key length. When an actual key is shorter than that, the rest of
    the buffer must be cleared out. The row cannot be identified, if
    garbage follows behind the end of the key. There is no length
    field for the current key, so that the whole ref_length is used
    for comparison.

  RETURN
    nothing
*/

unknown's avatar
unknown committed
1693 1694 1695
void ha_berkeley::position(const byte *record)
{
  DBT key;
1696
  DBUG_ENTER("ha_berkeley::position");
1697
  if (hidden_primary_key)
1698 1699
  {
    DBUG_ASSERT(ref_length == BDB_HIDDEN_PRIMARY_KEY_LENGTH);
1700
    memcpy_fixed(ref, (char*) current_ident, BDB_HIDDEN_PRIMARY_KEY_LENGTH);
1701
  }
1702
  else
1703
  {
1704
    create_key(&key, primary_key, (char*) ref, record);
1705 1706 1707 1708
    if (key.size < ref_length)
      bzero(ref + key.size, ref_length - key.size);
  }
  DBUG_VOID_RETURN;
unknown's avatar
unknown committed
1709 1710 1711 1712 1713
}


void ha_berkeley::info(uint flag)
{
1714
  DBUG_ENTER("ha_berkeley::info");
unknown's avatar
unknown committed
1715 1716
  if (flag & HA_STATUS_VARIABLE)
  {
1717
    records = share->rows + changed_rows; // Just to get optimisations right
unknown's avatar
unknown committed
1718 1719
    deleted = 0;
  }
1720 1721 1722 1723 1724 1725 1726 1727 1728
  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
1729 1730 1731
  /* Don't return key if we got an error for the internal primary key */
  if (flag & HA_STATUS_ERRKEY && last_dup_key < table->keys)
    errkey= last_dup_key;
unknown's avatar
unknown committed
1732 1733 1734 1735 1736 1737
  DBUG_VOID_RETURN;
}


int ha_berkeley::extra(enum ha_extra_function operation)
{
1738 1739 1740 1741
  switch (operation) {
  case HA_EXTRA_RESET:
  case HA_EXTRA_RESET_STATE:
    key_read=0;
1742
    using_ignore=0;
unknown's avatar
unknown committed
1743 1744 1745 1746 1747 1748 1749 1750 1751
    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;
      }
    }
1752 1753 1754 1755 1756 1757 1758
    break;
  case HA_EXTRA_KEYREAD:
    key_read=1;					// Query satisfied with key
    break;
  case HA_EXTRA_NO_KEYREAD:
    key_read=0;
    break;
1759 1760 1761 1762 1763 1764
  case HA_EXTRA_IGNORE_DUP_KEY:
    using_ignore=1;
    break;
  case HA_EXTRA_NO_IGNORE_DUP_KEY:
    using_ignore=0;
    break;
1765 1766 1767
  default:
    break;
  }
unknown's avatar
unknown committed
1768 1769 1770
  return 0;
}

1771

unknown's avatar
unknown committed
1772 1773
int ha_berkeley::reset(void)
{
1774
  ha_berkeley::extra(HA_EXTRA_RESET);
1775
  key_read=0;					// Reset to state after open
unknown's avatar
unknown committed
1776 1777 1778 1779 1780 1781 1782
  return 0;
}


/*
  As MySQL will execute an external lock for every new table it uses
  we can use this to start the transactions.
1783 1784 1785 1786
  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
1787 1788 1789 1790 1791 1792 1793 1794
*/

int ha_berkeley::external_lock(THD *thd, int lock_type)
{
  int error=0;
  DBUG_ENTER("ha_berkeley::external_lock");
  if (lock_type != F_UNLCK)
  {
1795
    if (!thd->transaction.bdb_lock_count++)
unknown's avatar
unknown committed
1796
    {
1797
      DBUG_ASSERT(thd->transaction.stmt.bdb_tid == 0);
unknown's avatar
unknown committed
1798
      transaction=0;				// Safety
1799
      /* First table lock, start transaction */
unknown's avatar
unknown committed
1800
      if ((thd->options & (OPTION_NOT_AUTOCOMMIT | OPTION_BEGIN |
unknown's avatar
unknown committed
1801
			   OPTION_TABLE_LOCK)) &&
1802 1803 1804
	  !thd->transaction.all.bdb_tid)
      {
	/* We have to start a master transaction */
unknown's avatar
unknown committed
1805
	DBUG_PRINT("trans",("starting transaction all"));
1806 1807 1808 1809
	if ((error=txn_begin(db_env, 0,
			     (DB_TXN**) &thd->transaction.all.bdb_tid,
			     0)))
	{
1810 1811
	  thd->transaction.bdb_lock_count--;	// We didn't get the lock /* purecov: inspected */
	  DBUG_RETURN(error); /* purecov: inspected */
1812
	}
unknown's avatar
unknown committed
1813 1814
	if (thd->in_lock_tables)
	  DBUG_RETURN(0);			// Don't create stmt trans
1815
      }
unknown's avatar
unknown committed
1816
      DBUG_PRINT("trans",("starting transaction stmt"));
1817 1818 1819
      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
1820
			   0)))
1821 1822
      {
	/* We leave the possible master transaction open */
1823 1824
	thd->transaction.bdb_lock_count--;	// We didn't get the lock /* purecov: inspected */
	DBUG_RETURN(error); /* purecov: inspected */
1825
      }
unknown's avatar
unknown committed
1826
    }
1827
    transaction= (DB_TXN*) thd->transaction.stmt.bdb_tid;
unknown's avatar
unknown committed
1828 1829 1830 1831
  }
  else
  {
    lock.type=TL_UNLOCK;			// Unlocked
1832
    thread_safe_add(share->rows, changed_rows, &share->mutex);
1833
    changed_rows=0;
unknown's avatar
unknown committed
1834 1835
    if (!--thd->transaction.bdb_lock_count)
    {
1836
      if (thd->transaction.stmt.bdb_tid)
unknown's avatar
unknown committed
1837
      {
unknown's avatar
unknown committed
1838
	/*
1839
	   F_UNLOCK is done without a transaction commit / rollback.
1840 1841
	   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
1842
	*/
1843 1844 1845
	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
1846
	transaction=0;
unknown's avatar
unknown committed
1847 1848 1849 1850
      }
    }
  }
  DBUG_RETURN(error);
unknown's avatar
unknown committed
1851
}
unknown's avatar
unknown committed
1852

unknown's avatar
unknown committed
1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865

/*
  When using LOCK TABLE's external_lock is only called when the actual
  TABLE LOCK is done.
  Under LOCK TABLES, each used tables will force a call to start_stmt.
*/

int ha_berkeley::start_stmt(THD *thd)
{
  int error=0;
  DBUG_ENTER("ha_berkeley::start_stmt");
  if (!thd->transaction.stmt.bdb_tid)
  {
unknown's avatar
unknown committed
1866
    DBUG_PRINT("trans",("starting transaction stmt"));
unknown's avatar
unknown committed
1867 1868 1869 1870
    error=txn_begin(db_env, (DB_TXN*) thd->transaction.all.bdb_tid,
		    (DB_TXN**) &thd->transaction.stmt.bdb_tid,
		    0);
  }
1871
  transaction= (DB_TXN*) thd->transaction.stmt.bdb_tid;
unknown's avatar
unknown committed
1872 1873 1874 1875
  DBUG_RETURN(error);
}


1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903
/*
  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
1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915

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;
1916 1917
    lock_on_read= ((table->reginfo.lock_type > TL_WRITE_ALLOW_READ) ? DB_RMW :
		   0);
unknown's avatar
unknown committed
1918 1919 1920 1921 1922 1923 1924 1925 1926
  }
  *to++= &lock;
  return to;
}


static int create_sub_table(const char *table_name, const char *sub_name,
			    DBTYPE type, int flags)
{
1927
  int error;
unknown's avatar
unknown committed
1928 1929
  DB *file;
  DBUG_ENTER("create_sub_table");
unknown's avatar
unknown committed
1930
  DBUG_PRINT("enter",("sub_name: %s  flags: %d",sub_name, flags));
unknown's avatar
unknown committed
1931 1932 1933 1934

  if (!(error=db_create(&file, db_env, 0)))
  {
    file->set_flags(file, flags);
unknown's avatar
unknown committed
1935
    error=(file->open(file, NULL, table_name, sub_name, type,
unknown's avatar
unknown committed
1936 1937 1938
		      DB_THREAD | DB_CREATE, my_umask));
    if (error)
    {
1939 1940 1941
      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
1942 1943 1944 1945 1946 1947
    }
    else
      (void) file->close(file,0);
  }
  else
  {
1948
    DBUG_PRINT("error",("Got error: %d when creting table",error)); /* purecov: inspected */
unknown's avatar
unknown committed
1949 1950
  }
  if (error)
1951
    my_errno=error; /* purecov: inspected */
unknown's avatar
unknown committed
1952 1953 1954 1955 1956 1957 1958 1959 1960
  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];
1961
  uint index=1;
unknown's avatar
unknown committed
1962
  int error;
unknown's avatar
unknown committed
1963 1964 1965 1966 1967
  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 */
unknown's avatar
unknown committed
1968 1969
  if ((error= create_sub_table(name_buff,"main",DB_BTREE,0)))
    DBUG_RETURN(error); /* purecov: inspected */
unknown's avatar
unknown committed
1970

1971
  primary_key=table->primary_key;
unknown's avatar
unknown committed
1972
  /* Create the keys */
1973
  for (uint i=0; i < form->keys; i++)
unknown's avatar
unknown committed
1974
  {
1975 1976 1977
    if (i != primary_key)
    {
      sprintf(part,"key%02d",index++);
unknown's avatar
unknown committed
1978 1979 1980 1981
      if ((error= create_sub_table(name_buff, part, DB_BTREE,
				   (table->key_info[i].flags & HA_NOSAME) ? 0 :
				   DB_DUP)))
	DBUG_RETURN(error); /* purecov: inspected */
1982
    }
unknown's avatar
unknown committed
1983 1984 1985 1986
  }

  /* 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
1987 1988

  DB *status_block;
unknown's avatar
unknown committed
1989
  if (!(error=(db_create(&status_block, db_env, 0))))
unknown's avatar
unknown committed
1990
  {
unknown's avatar
unknown committed
1991
    if (!(error=(status_block->open(status_block, NULL, name_buff,
unknown's avatar
unknown committed
1992
				    "status", DB_BTREE, DB_CREATE, 0))))
unknown's avatar
unknown committed
1993 1994 1995 1996
    {
      char rec_buff[4+MAX_KEY*4];
      uint length= 4+ table->keys*4;
      bzero(rec_buff, length);
unknown's avatar
unknown committed
1997
      error= write_status(status_block, rec_buff, length);
unknown's avatar
unknown committed
1998 1999 2000 2001
      status_block->close(status_block,0);
    }
  }
  DBUG_RETURN(error);
unknown's avatar
unknown committed
2002 2003 2004
}


unknown's avatar
unknown committed
2005

unknown's avatar
unknown committed
2006 2007 2008 2009
int ha_berkeley::delete_table(const char *name)
{
  int error;
  char name_buff[FN_REFLEN];
unknown's avatar
unknown committed
2010
  DBUG_ENTER("delete_table");
unknown's avatar
unknown committed
2011
  if ((error=db_create(&file, db_env, 0)))
2012
    my_errno=error; /* purecov: inspected */
unknown's avatar
unknown committed
2013 2014 2015
  else
    error=file->remove(file,fn_format(name_buff,name,"",ha_berkeley_ext,2 | 4),
		       NULL,0);
unknown's avatar
unknown committed
2016
  file=0;					// Safety
unknown's avatar
unknown committed
2017
  DBUG_RETURN(error);
unknown's avatar
unknown committed
2018 2019
}

2020 2021 2022 2023 2024 2025 2026 2027 2028 2029

int ha_berkeley::rename_table(const char * from, const char * to)
{
  int error;
  char from_buff[FN_REFLEN];
  char to_buff[FN_REFLEN];

  if ((error= db_create(&file, db_env, 0)))
    my_errno= error;
  else
2030 2031
  {
    /* On should not do a file->close() after rename returns */
2032 2033 2034 2035
    error= file->rename(file, 
			fn_format(from_buff, from, "", ha_berkeley_ext, 2 | 4),
			NULL, fn_format(to_buff, to, "", ha_berkeley_ext,
					2 | 4), 0);
2036
  }
2037 2038 2039 2040
  return error;
}


unknown's avatar
unknown committed
2041 2042 2043 2044 2045 2046 2047 2048
/*
  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()
{
2049
  return rows2double(records/3);
2050
}
unknown's avatar
unknown committed
2051

unknown's avatar
unknown committed
2052 2053
ha_rows ha_berkeley::records_in_range(uint keynr, key_range *start_key,
                                      key_range *end_key)
unknown's avatar
unknown committed
2054 2055 2056
{
  DBT key;
  DB_KEY_RANGE start_range, end_range;
2057
  DB *kfile=key_file[keynr];
unknown's avatar
unknown committed
2058 2059
  double start_pos,end_pos,rows;
  DBUG_ENTER("records_in_range");
2060 2061

  if ((start_key && kfile->key_range(kfile,transaction,
unknown's avatar
unknown committed
2062 2063 2064 2065
                                     pack_key(&key, keynr, key_buff,
                                              start_key->key,
                                              start_key->length),
                                     &start_range,0)) ||
2066
      (end_key && kfile->key_range(kfile,transaction,
unknown's avatar
unknown committed
2067 2068 2069
				   pack_key(&key, keynr, key_buff,
                                            end_key->key,
                                            end_key->length),
2070
				   &end_range,0)))
2071
    DBUG_RETURN(HA_BERKELEY_RANGE_COUNT); // Better than returning an error /* purecov: inspected */
unknown's avatar
unknown committed
2072 2073

  if (!start_key)
unknown's avatar
unknown committed
2074 2075
    start_pos= 0.0;
  else if (start_key->flag == HA_READ_KEY_EXACT)
unknown's avatar
unknown committed
2076 2077 2078 2079 2080
    start_pos=start_range.less;
  else
    start_pos=start_range.less+start_range.equal;

  if (!end_key)
unknown's avatar
unknown committed
2081 2082
    end_pos= 1.0;
  else if (end_key->flag == HA_READ_BEFORE_KEY)
unknown's avatar
unknown committed
2083 2084 2085 2086 2087 2088 2089 2090
    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);
}

2091 2092 2093 2094 2095 2096

longlong ha_berkeley::get_auto_increment()
{
  longlong nr=1;				// Default if error or new key
  int error;
  (void) ha_berkeley::extra(HA_EXTRA_KEYREAD);
2097 2098

  /* Set 'active_index' */
2099 2100 2101 2102 2103 2104 2105 2106
  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
  {
2107
    DBT row,old_key;
2108 2109 2110 2111 2112 2113 2114 2115
    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 */
2116
    memcpy(old_key.data=key_buff2, key_buff, (old_key.size=last_key.size));
2117
    old_key.app_private=(void*) key_info;
2118
    error=1;
2119
    {
2120 2121 2122
      /* 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
2123
      error=cursor->c_get(cursor, &last_key, &row, DB_SET_RANGE | DB_RMW);
2124 2125 2126 2127 2128 2129 2130 2131
      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
2132 2133 2134
	if (!cursor->c_get(cursor, &last_key, &row, DB_PREV | DB_RMW) &&
	    !berkeley_cmp_packed_key(key_file[active_index], &old_key,
				     &last_key))
2135 2136
	{
	  error=0;				// Found value
2137
	  unpack_key((char*) table->record[1], &last_key, active_index);
2138 2139
	}
      }
2140 2141
    }
  }
2142 2143 2144
  if (!error)
    nr=(longlong)
      table->next_number_field->val_int_offset(table->rec_buff_length)+1;
2145 2146 2147 2148 2149
  ha_berkeley::index_end();
  (void) ha_berkeley::extra(HA_EXTRA_NO_KEYREAD);
  return nr;
}

unknown's avatar
unknown committed
2150 2151 2152 2153 2154 2155
void ha_berkeley::print_error(int error, myf errflag)
{
  if (error == DB_LOCK_DEADLOCK)
    error=HA_ERR_LOCK_DEADLOCK;
  handler::print_error(error,errflag);
}
2156 2157 2158 2159 2160

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

2161
#ifdef NOT_YET
2162 2163 2164
static void print_msg(THD *thd, const char *table_name, const char *op_name,
		      const char *msg_type, const char *fmt, ...)
{
2165
  Protocol *protocol= thd->protocol;
2166 2167 2168 2169 2170 2171 2172 2173 2174
  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));

unknown's avatar
unknown committed
2175
  protocol->set_nfields(4);
2176 2177 2178 2179 2180 2181
  protocol->prepare_for_resend();
  protocol->store(table_name);
  protocol->store(op_name);
  protocol->store(msg_type);
  protocol->store(msgbuf);
  if (protocol->write())
2182 2183
    thd->killed=1;
}
2184
#endif
2185 2186 2187 2188

int ha_berkeley::analyze(THD* thd, HA_CHECK_OPT* check_opt)
{
  uint i;
2189
  DB_BTREE_STAT *stat=0;
unknown's avatar
unknown committed
2190 2191
  DB_TXN_STAT *txn_stat_ptr= 0;

2192 2193 2194 2195 2196 2197 2198 2199 2200
  /*
   Original bdb documentation says:
   "The DB->stat method cannot be transaction-protected.
   For this reason, it should be called in a thread of
   control that has no open cursors or active transactions."
   So, let's check if there are any changes have been done since
   the beginning of the transaction..
  */

unknown's avatar
unknown committed
2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227
  if (!db_env->txn_stat(db_env, &txn_stat_ptr, 0) &&
      txn_stat_ptr && txn_stat_ptr->st_nactive>=2)
  {
    DB_TXN_ACTIVE *atxn_stmt= 0, *atxn_all= 0;
    
    DB_TXN *txn_all= (DB_TXN*) thd->transaction.all.bdb_tid;
    u_int32_t all_id= txn_all->id(txn_all);
    
    DB_TXN *txn_stmt= (DB_TXN*) thd->transaction.stmt.bdb_tid;
    u_int32_t stmt_id= txn_stmt->id(txn_stmt);
    
    DB_TXN_ACTIVE *cur= txn_stat_ptr->st_txnarray;
    DB_TXN_ACTIVE *end= cur + txn_stat_ptr->st_nactive;
    for (; cur!=end && (!atxn_stmt || !atxn_all); cur++)
    {
      if (cur->txnid==all_id) atxn_all= cur;
      if (cur->txnid==stmt_id) atxn_stmt= cur;
    }
    
    if (atxn_stmt && atxn_all &&
	log_compare(&atxn_stmt->lsn,&atxn_all->lsn))
    {
      free(txn_stat_ptr);
      return HA_ADMIN_REJECT;
    }
    free(txn_stat_ptr);
  }
2228 2229 2230

  for (i=0 ; i < table->keys ; i++)
  {
unknown's avatar
unknown committed
2231 2232 2233 2234 2235
    if (stat)
    {
      free(stat);
      stat=0;
    }
unknown's avatar
unknown committed
2236
    if ((key_file[i]->stat)(key_file[i], (void*) &stat, 0))
2237
      goto err; /* purecov: inspected */
unknown's avatar
unknown committed
2238 2239
    share->rec_per_key[i]= (stat->bt_ndata /
			    (stat->bt_nkeys ? stat->bt_nkeys : 1));
2240
  }
unknown's avatar
unknown committed
2241
  /* A hidden primary key is not in key_file[] */
2242
  if (hidden_primary_key)
unknown's avatar
unknown committed
2243 2244 2245 2246 2247 2248
  {
    if (stat)
    {
      free(stat);
      stat=0;
    }
unknown's avatar
unknown committed
2249
    if ((file->stat)(file, (void*) &stat, 0))
2250
      goto err; /* purecov: inspected */
unknown's avatar
unknown committed
2251
  }
2252
  pthread_mutex_lock(&share->mutex);
unknown's avatar
unknown committed
2253
  share->rows=stat->bt_ndata;
2254 2255 2256
  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
2257 2258 2259
  update_status(share,table);			// Write status to file
  if (stat)
    free(stat);
2260 2261
  return ((share->status & STATUS_BDB_ANALYZE) ? HA_ADMIN_FAILED :
	  HA_ADMIN_OK);
unknown's avatar
unknown committed
2262 2263

err:
2264 2265 2266
  if (stat) /* purecov: inspected */
    free(stat); /* purecov: inspected */
  return HA_ADMIN_FAILED; /* purecov: inspected */
2267 2268 2269 2270 2271 2272 2273 2274 2275 2276
}

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
2277 2278 2279 2280 2281
  DBUG_ENTER("ha_berkeley::check");

  DBUG_RETURN(HA_ADMIN_NOT_IMPLEMENTED);

#ifdef NOT_YET
2282 2283 2284
  char name_buff[FN_REFLEN];
  int error;
  DB *tmp_file;
unknown's avatar
unknown committed
2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302
  /*
    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));
2303
  tmp_file->app_private= (void*) (table->key_info+table->primary_key);
2304
  fn_format(name_buff,share->table_name,"", ha_berkeley_ext, 2 | 4);
unknown's avatar
unknown committed
2305 2306
  if ((error=tmp_file->verify(tmp_file, name_buff, NullS, (FILE*) 0,
			      hidden_primary_key ? 0 : DB_NOORDERCHK)))
2307 2308 2309
  {
    print_msg(thd, table->real_name, "check", "error",
	      "Got error %d checking file structure",error);
unknown's avatar
unknown committed
2310 2311
    tmp_file->close(tmp_file,0);
    DBUG_RETURN(HA_ADMIN_CORRUPT);
2312
  }
unknown's avatar
unknown committed
2313 2314 2315 2316

  /* Check each index */
  tmp_file->set_bt_compare(tmp_file, berkeley_cmp_packed_key);
  for (uint index=0,i=0 ; i < table->keys ; i++)
2317
  {
unknown's avatar
unknown committed
2318 2319 2320 2321 2322 2323 2324 2325
    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)))
2326 2327
    {
      print_msg(thd, table->real_name, "check", "error",
unknown's avatar
unknown committed
2328 2329 2330 2331 2332
		"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);
2333 2334
    }
  }
unknown's avatar
unknown committed
2335 2336 2337
  tmp_file->close(tmp_file,0);
  DBUG_RETURN(HA_ADMIN_OK);
#endif
2338 2339
}

unknown's avatar
unknown committed
2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351
/****************************************************************************
 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;
}

2352
static BDB_SHARE *get_share(const char *table_name, TABLE *table)
unknown's avatar
unknown committed
2353 2354 2355
{
  BDB_SHARE *share;
  pthread_mutex_lock(&bdb_mutex);
unknown's avatar
unknown committed
2356
  uint length=(uint) strlen(table_name);
2357 2358
  if (!(share=(BDB_SHARE*) hash_search(&bdb_open_tables, (byte*) table_name,
				       length)))
unknown's avatar
unknown committed
2359
  {
2360
    ulong *rec_per_key;
2361 2362 2363
    char *tmp_name;
    DB **key_file;
    u_int32_t *key_type;
unknown's avatar
unknown committed
2364

2365 2366 2367 2368 2369 2370 2371 2372
    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
2373
    {
2374 2375
      share->rec_per_key = rec_per_key;
      share->table_name = tmp_name;
unknown's avatar
unknown committed
2376 2377
      share->table_name_length=length;
      strmov(share->table_name,table_name);
2378 2379
      share->key_file = key_file;
      share->key_type = key_type;
unknown's avatar
SCRUM  
unknown committed
2380
      if (my_hash_insert(&bdb_open_tables, (byte*) share))
unknown's avatar
unknown committed
2381
      {
2382 2383 2384
	pthread_mutex_unlock(&bdb_mutex); /* purecov: inspected */
	my_free((gptr) share,0); /* purecov: inspected */
	return 0; /* purecov: inspected */
unknown's avatar
unknown committed
2385 2386
      }
      thr_lock_init(&share->lock);
2387
      pthread_mutex_init(&share->mutex,MY_MUTEX_INIT_FAST);
unknown's avatar
unknown committed
2388 2389 2390 2391 2392 2393
    }
  }
  pthread_mutex_unlock(&bdb_mutex);
  return share;
}

unknown's avatar
unknown committed
2394 2395
static int free_share(BDB_SHARE *share, TABLE *table, uint hidden_primary_key,
		      bool mutex_is_locked)
unknown's avatar
unknown committed
2396
{
2397
  int error, result = 0;
2398
  uint keys=table->keys + test(hidden_primary_key);
unknown's avatar
unknown committed
2399
  pthread_mutex_lock(&bdb_mutex);
unknown's avatar
unknown committed
2400
  if (mutex_is_locked)
2401
    pthread_mutex_unlock(&share->mutex); /* purecov: inspected */
unknown's avatar
unknown committed
2402 2403
  if (!--share->use_count)
  {
2404
    DB **key_file = share->key_file;
2405
    update_status(share,table);
2406
    /* this does share->file->close() implicitly */
2407
    for (uint i=0; i < keys; i++)
2408 2409
    {
      if (key_file[i] && (error=key_file[i]->close(key_file[i],0)))
2410
	result=error; /* purecov: inspected */
2411 2412 2413
    }
    if (share->status_block &&
	(error = share->status_block->close(share->status_block,0)))
2414
      result = error; /* purecov: inspected */
2415
    hash_delete(&bdb_open_tables, (byte*) share);
unknown's avatar
unknown committed
2416
    thr_lock_delete(&share->lock);
2417
    pthread_mutex_destroy(&share->mutex);
unknown's avatar
unknown committed
2418 2419 2420
    my_free((gptr) share, MYF(0));
  }
  pthread_mutex_unlock(&bdb_mutex);
2421
  return result;
unknown's avatar
unknown committed
2422 2423
}

2424 2425 2426 2427
/*
  Get status information that is stored in the 'status' sub database
  and the max used value for the hidden primary key.
*/
2428

2429
void ha_berkeley::get_status()
2430
{
2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451
  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
2452
	if (share->status_block->open(share->status_block, NULL, name_buff,
unknown's avatar
unknown committed
2453
				      "status", DB_BTREE, open_mode, 0))
2454
	{
2455 2456
	  share->status_block->close(share->status_block, 0); /* purecov: inspected */
	  share->status_block=0; /* purecov: inspected */
2457 2458 2459 2460 2461 2462 2463
	}
      }
    }
    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;
2464
      if (!share->status_block->cursor(share->status_block, 0, &cursor, 0))
2465 2466
      {
	DBT row;
unknown's avatar
unknown committed
2467
	char rec_buff[64];
2468 2469 2470
	bzero((char*) &row,sizeof(row));
	bzero((char*) &last_key,sizeof(last_key));
	row.data=rec_buff;
unknown's avatar
unknown committed
2471
	row.ulen=sizeof(rec_buff);
2472 2473 2474 2475
	row.flags=DB_DBT_USERMEM;
	if (!cursor->c_get(cursor, &last_key, &row, DB_FIRST))
	{
	  uint i;
unknown's avatar
unknown committed
2476
	  uchar *pos=(uchar*) row.data;
2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492
	  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
2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509
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;
}


2510 2511 2512 2513 2514
static void update_status(BDB_SHARE *share, TABLE *table)
{
  DBUG_ENTER("update_status");
  if (share->rows != share->org_rows ||
      (share->status & STATUS_BDB_ANALYZE))
2515
  {
2516 2517 2518 2519 2520 2521 2522 2523
    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)
      */

2524 2525 2526 2527
      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 */
unknown's avatar
unknown committed
2528
      if (share->status_block->open(share->status_block, NULL,
2529 2530 2531
				    fn_format(name_buff,share->table_name,"",
					      ha_berkeley_ext,2 | 4),
				    "status", DB_BTREE,
2532 2533
				    DB_THREAD | DB_CREATE, my_umask)) /* purecov: inspected */
	goto end; /* purecov: inspected */
2534 2535
    }
    {
unknown's avatar
unknown committed
2536
      char rec_buff[4+MAX_KEY*4], *pos=rec_buff;
2537
      int4store(pos,share->rows); pos+=4;
unknown's avatar
unknown committed
2538
      for (uint i=0 ; i < table->keys ; i++)
2539 2540 2541
      {
	int4store(pos,share->rec_per_key[i]); pos+=4;
      }
unknown's avatar
unknown committed
2542 2543 2544
      DBUG_PRINT("info",("updating status for %s",share->table_name));
      (void) write_status(share->status_block, rec_buff,
			  (uint) (pos-rec_buff));
2545
      share->status&= ~STATUS_BDB_ANALYZE;
unknown's avatar
unknown committed
2546
      share->org_rows=share->rows;
2547 2548 2549
    }
end:
    pthread_mutex_unlock(&share->mutex);
2550
  }
2551
  DBUG_VOID_RETURN;
2552 2553
}

2554 2555 2556 2557 2558
/*
  Return an estimated of the number of rows in the table.
  Used when sorting to allocate buffers and by the optimizer.
*/

unknown's avatar
unknown committed
2559
ha_rows ha_berkeley::estimate_rows_upper_bound()
2560
{
2561
  return share->rows + HA_BERKELEY_EXTRA_ROWS;
2562 2563
}

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