2006-12-31 01:02:27 +01:00
|
|
|
/* Copyright (C) 2000-2006 MySQL AB
|
2001-12-06 14:10:51 +02:00
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
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
|
2006-12-23 20:17:15 +01:00
|
|
|
the Free Software Foundation; version 2 of the License.
|
2001-12-06 14:10:51 +02:00
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
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.
|
2001-12-06 14:10:51 +02:00
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
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 */
|
|
|
|
|
|
|
|
/*
|
|
|
|
locking of isam-tables.
|
|
|
|
reads info from a isam-table. Must be first request before doing any furter
|
|
|
|
calls to any isamfunktion. Is used to allow many process use the same
|
|
|
|
isamdatabase.
|
2004-10-06 01:24:21 +03:00
|
|
|
*/
|
|
|
|
|
2005-12-28 16:05:30 +04:00
|
|
|
#include "ftdefs.h"
|
2000-07-31 21:29:14 +02:00
|
|
|
|
|
|
|
/* lock table by F_UNLCK, F_RDLCK or F_WRLCK */
|
|
|
|
|
|
|
|
int mi_lock_database(MI_INFO *info, int lock_type)
|
|
|
|
{
|
|
|
|
int error;
|
|
|
|
uint count;
|
|
|
|
MYISAM_SHARE *share=info->s;
|
|
|
|
uint flag;
|
|
|
|
DBUG_ENTER("mi_lock_database");
|
2004-10-06 01:24:21 +03:00
|
|
|
DBUG_PRINT("enter",("lock_type: %d old lock %d r_locks: %u w_locks: %u "
|
|
|
|
"global_changed: %d open_count: %u name: '%s'",
|
|
|
|
lock_type, info->lock_type, share->r_locks,
|
|
|
|
share->w_locks,
|
2004-09-18 20:33:39 +02:00
|
|
|
share->global_changed, share->state.open_count,
|
|
|
|
share->index_file_name));
|
2000-07-31 21:29:14 +02:00
|
|
|
if (share->options & HA_OPTION_READ_ONLY_DATA ||
|
|
|
|
info->lock_type == lock_type)
|
|
|
|
DBUG_RETURN(0);
|
2004-10-06 01:24:21 +03:00
|
|
|
if (lock_type == F_EXTRA_LCK) /* Used by TMP tables */
|
2003-07-14 12:40:58 +05:00
|
|
|
{
|
|
|
|
++share->w_locks;
|
|
|
|
++share->tot_locks;
|
|
|
|
info->lock_type= lock_type;
|
|
|
|
DBUG_RETURN(0);
|
|
|
|
}
|
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
flag=error=0;
|
|
|
|
pthread_mutex_lock(&share->intern_lock);
|
|
|
|
if (share->kfile >= 0) /* May only be false on windows */
|
|
|
|
{
|
2001-12-02 14:34:01 +02:00
|
|
|
switch (lock_type) {
|
2000-07-31 21:29:14 +02:00
|
|
|
case F_UNLCK:
|
2005-12-28 16:05:30 +04:00
|
|
|
ftparser_call_deinitializer(info);
|
2000-07-31 21:29:14 +02:00
|
|
|
if (info->lock_type == F_RDLCK)
|
|
|
|
count= --share->r_locks;
|
2003-08-25 14:27:32 +03:00
|
|
|
else
|
2003-08-25 17:19:44 +03:00
|
|
|
count= --share->w_locks;
|
2001-10-02 05:53:00 +03:00
|
|
|
--share->tot_locks;
|
2000-07-31 21:29:14 +02:00
|
|
|
if (info->lock_type == F_WRLCK && !share->w_locks &&
|
2003-11-20 22:06:25 +02:00
|
|
|
!share->delay_key_write && flush_key_blocks(share->key_cache,
|
2003-11-18 13:47:27 +02:00
|
|
|
share->kfile,FLUSH_KEEP))
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
|
|
|
error=my_errno;
|
2004-12-31 03:47:56 +02:00
|
|
|
mi_print_error(info->s, HA_ERR_CRASHED);
|
2000-07-31 21:29:14 +02:00
|
|
|
mi_mark_crashed(info); /* Mark that table must be checked */
|
|
|
|
}
|
|
|
|
if (info->opt_flag & (READ_CACHE_USED | WRITE_CACHE_USED))
|
|
|
|
{
|
|
|
|
if (end_io_cache(&info->rec_cache))
|
|
|
|
{
|
|
|
|
error=my_errno;
|
2004-12-31 03:47:56 +02:00
|
|
|
mi_print_error(info->s, HA_ERR_CRASHED);
|
2000-07-31 21:29:14 +02:00
|
|
|
mi_mark_crashed(info);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!count)
|
|
|
|
{
|
2003-09-05 06:42:55 +03:00
|
|
|
DBUG_PRINT("info",("changed: %u w_locks: %u",
|
|
|
|
(uint) share->changed, share->w_locks));
|
2000-07-31 21:29:14 +02:00
|
|
|
if (share->changed && !share->w_locks)
|
|
|
|
{
|
2006-02-02 16:22:31 +02:00
|
|
|
#ifdef HAVE_MMAP
|
2006-02-22 08:32:58 +01:00
|
|
|
if ((info->s->mmaped_length != info->s->state.state.data_file_length) &&
|
|
|
|
(info->s->nonmmaped_inserts > MAX_NONMAPPED_INSERTS))
|
2006-02-02 16:22:31 +02:00
|
|
|
{
|
|
|
|
if (info->s->concurrent_insert)
|
|
|
|
rw_wrlock(&info->s->mmap_lock);
|
|
|
|
mi_remap_file(info, info->s->state.state.data_file_length);
|
2006-02-22 08:32:58 +01:00
|
|
|
info->s->nonmmaped_inserts= 0;
|
2006-02-02 16:22:31 +02:00
|
|
|
if (info->s->concurrent_insert)
|
|
|
|
rw_unlock(&info->s->mmap_lock);
|
|
|
|
}
|
|
|
|
#endif
|
2000-07-31 21:29:14 +02:00
|
|
|
share->state.process= share->last_process=share->this_process;
|
|
|
|
share->state.unique= info->last_unique= info->this_unique;
|
2000-11-16 03:58:58 +02:00
|
|
|
share->state.update_count= info->last_loop= ++info->this_loop;
|
2004-10-06 01:24:21 +03:00
|
|
|
if (mi_state_info_write(share->kfile, &share->state, 1))
|
2000-07-31 21:29:14 +02:00
|
|
|
error=my_errno;
|
|
|
|
share->changed=0;
|
|
|
|
if (myisam_flush)
|
|
|
|
{
|
2003-11-02 15:55:02 +02:00
|
|
|
if (my_sync(share->kfile, MYF(0)))
|
|
|
|
error= my_errno;
|
|
|
|
if (my_sync(info->dfile, MYF(0)))
|
|
|
|
error= my_errno;
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
share->not_flushed=1;
|
|
|
|
if (error)
|
2004-12-23 20:11:38 +01:00
|
|
|
{
|
2004-12-31 03:47:56 +02:00
|
|
|
mi_print_error(info->s, HA_ERR_CRASHED);
|
2000-07-31 21:29:14 +02:00
|
|
|
mi_mark_crashed(info);
|
2004-12-23 20:11:38 +01:00
|
|
|
}
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
2003-08-25 17:19:44 +03:00
|
|
|
if (info->lock_type != F_EXTRA_LCK)
|
|
|
|
{
|
|
|
|
if (share->r_locks)
|
|
|
|
{ /* Only read locks left */
|
|
|
|
flag=1;
|
|
|
|
if (my_lock(share->kfile,F_RDLCK,0L,F_TO_EOF,
|
|
|
|
MYF(MY_WME | MY_SEEK_NOT_DONE)) && !error)
|
|
|
|
error=my_errno;
|
|
|
|
}
|
|
|
|
else if (!share->w_locks)
|
|
|
|
{ /* No more locks */
|
|
|
|
flag=1;
|
|
|
|
if (my_lock(share->kfile,F_UNLCK,0L,F_TO_EOF,
|
|
|
|
MYF(MY_WME | MY_SEEK_NOT_DONE)) && !error)
|
|
|
|
error=my_errno;
|
|
|
|
}
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
info->opt_flag&= ~(READ_CACHE_USED | WRITE_CACHE_USED);
|
|
|
|
info->lock_type= F_UNLCK;
|
|
|
|
break;
|
|
|
|
case F_RDLCK:
|
|
|
|
if (info->lock_type == F_WRLCK)
|
2004-10-06 01:24:21 +03:00
|
|
|
{
|
2004-09-18 20:33:39 +02:00
|
|
|
/*
|
2004-10-06 01:24:21 +03:00
|
|
|
Change RW to READONLY
|
|
|
|
|
2004-09-18 20:33:39 +02:00
|
|
|
mysqld does not turn write locks to read locks,
|
|
|
|
so we're never here in mysqld.
|
|
|
|
*/
|
2000-07-31 21:29:14 +02:00
|
|
|
if (share->w_locks == 1)
|
|
|
|
{
|
|
|
|
flag=1;
|
2004-10-06 01:24:21 +03:00
|
|
|
if (my_lock(share->kfile,lock_type,0L,F_TO_EOF,
|
2000-07-31 21:29:14 +02:00
|
|
|
MYF(MY_SEEK_NOT_DONE)))
|
|
|
|
{
|
|
|
|
error=my_errno;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
share->w_locks--;
|
|
|
|
share->r_locks++;
|
|
|
|
info->lock_type=lock_type;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!share->r_locks && !share->w_locks)
|
|
|
|
{
|
|
|
|
flag=1;
|
|
|
|
if (my_lock(share->kfile,lock_type,0L,F_TO_EOF,
|
|
|
|
info->lock_wait | MY_SEEK_NOT_DONE))
|
|
|
|
{
|
|
|
|
error=my_errno;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (mi_state_info_read_dsk(share->kfile, &share->state, 1))
|
|
|
|
{
|
|
|
|
error=my_errno;
|
|
|
|
VOID(my_lock(share->kfile,F_UNLCK,0L,F_TO_EOF,MYF(MY_SEEK_NOT_DONE)));
|
|
|
|
my_errno=error;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
VOID(_mi_test_if_changed(info));
|
|
|
|
share->r_locks++;
|
2001-10-02 05:53:00 +03:00
|
|
|
share->tot_locks++;
|
2000-07-31 21:29:14 +02:00
|
|
|
info->lock_type=lock_type;
|
|
|
|
break;
|
|
|
|
case F_WRLCK:
|
|
|
|
if (info->lock_type == F_RDLCK)
|
|
|
|
{ /* Change READONLY to RW */
|
|
|
|
if (share->r_locks == 1)
|
|
|
|
{
|
|
|
|
flag=1;
|
|
|
|
if (my_lock(share->kfile,lock_type,0L,F_TO_EOF,
|
|
|
|
MYF(info->lock_wait | MY_SEEK_NOT_DONE)))
|
|
|
|
{
|
|
|
|
error=my_errno;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
share->r_locks--;
|
|
|
|
share->w_locks++;
|
|
|
|
info->lock_type=lock_type;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!(share->options & HA_OPTION_READ_ONLY_DATA))
|
|
|
|
{
|
|
|
|
if (!share->w_locks)
|
|
|
|
{
|
|
|
|
flag=1;
|
2000-10-14 03:16:35 +03:00
|
|
|
if (my_lock(share->kfile,lock_type,0L,F_TO_EOF,
|
|
|
|
info->lock_wait | MY_SEEK_NOT_DONE))
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
|
|
|
error=my_errno;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!share->r_locks)
|
|
|
|
{
|
2000-10-14 03:16:35 +03:00
|
|
|
if (mi_state_info_read_dsk(share->kfile, &share->state, 1))
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
|
|
|
error=my_errno;
|
2000-10-14 03:16:35 +03:00
|
|
|
VOID(my_lock(share->kfile,F_UNLCK,0L,F_TO_EOF,
|
|
|
|
info->lock_wait | MY_SEEK_NOT_DONE));
|
2000-07-31 21:29:14 +02:00
|
|
|
my_errno=error;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
VOID(_mi_test_if_changed(info));
|
2005-12-01 13:34:48 +01:00
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
info->lock_type=lock_type;
|
2001-12-02 14:34:01 +02:00
|
|
|
info->invalidator=info->s->invalidator;
|
2000-07-31 21:29:14 +02:00
|
|
|
share->w_locks++;
|
2001-10-02 05:53:00 +03:00
|
|
|
share->tot_locks++;
|
2000-07-31 21:29:14 +02:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break; /* Impossible */
|
|
|
|
}
|
|
|
|
}
|
2006-09-19 17:40:09 +02:00
|
|
|
#ifdef __WIN__
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
Check for bad file descriptors if this table is part
|
|
|
|
of a merge union. Failing to capture this may cause
|
|
|
|
a crash on windows if the table is renamed and
|
|
|
|
later on referenced by the merge table.
|
|
|
|
*/
|
|
|
|
if( info->owned_by_merge && (info->s)->kfile < 0 )
|
|
|
|
{
|
|
|
|
error = HA_ERR_NO_SUCH_TABLE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
2000-07-31 21:29:14 +02:00
|
|
|
pthread_mutex_unlock(&share->intern_lock);
|
|
|
|
#if defined(FULL_LOG) || defined(_lint)
|
|
|
|
lock_type|=(int) (flag << 8); /* Set bit to set if real lock */
|
WL#3817: Simplify string / memory area types and make things more consistent (first part)
The following type conversions was done:
- Changed byte to uchar
- Changed gptr to uchar*
- Change my_string to char *
- Change my_size_t to size_t
- Change size_s to size_t
Removed declaration of byte, gptr, my_string, my_size_t and size_s.
Following function parameter changes was done:
- All string functions in mysys/strings was changed to use size_t
instead of uint for string lengths.
- All read()/write() functions changed to use size_t (including vio).
- All protocoll functions changed to use size_t instead of uint
- Functions that used a pointer to a string length was changed to use size_t*
- Changed malloc(), free() and related functions from using gptr to use void *
as this requires fewer casts in the code and is more in line with how the
standard functions work.
- Added extra length argument to dirname_part() to return the length of the
created string.
- Changed (at least) following functions to take uchar* as argument:
- db_dump()
- my_net_write()
- net_write_command()
- net_store_data()
- DBUG_DUMP()
- decimal2bin() & bin2decimal()
- Changed my_compress() and my_uncompress() to use size_t. Changed one
argument to my_uncompress() from a pointer to a value as we only return
one value (makes function easier to use).
- Changed type of 'pack_data' argument to packfrm() to avoid casts.
- Changed in readfrm() and writefrom(), ha_discover and handler::discover()
the type for argument 'frmdata' to uchar** to avoid casts.
- Changed most Field functions to use uchar* instead of char* (reduced a lot of
casts).
- Changed field->val_xxx(xxx, new_ptr) to take const pointers.
Other changes:
- Removed a lot of not needed casts
- Added a few new cast required by other changes
- Added some cast to my_multi_malloc() arguments for safety (as string lengths
needs to be uint, not size_t).
- Fixed all calls to hash-get-key functions to use size_t*. (Needed to be done
explicitely as this conflict was often hided by casting the function to
hash_get_key).
- Changed some buffers to memory regions to uchar* to avoid casts.
- Changed some string lengths from uint to size_t.
- Changed field->ptr to be uchar* instead of char*. This allowed us to
get rid of a lot of casts.
- Some changes from true -> TRUE, false -> FALSE, unsigned char -> uchar
- Include zlib.h in some files as we needed declaration of crc32()
- Changed MY_FILE_ERROR to be (size_t) -1.
- Changed many variables to hold the result of my_read() / my_write() to be
size_t. This was needed to properly detect errors (which are
returned as (size_t) -1).
- Removed some very old VMS code
- Changed packfrm()/unpackfrm() to not be depending on uint size
(portability fix)
- Removed windows specific code to restore cursor position as this
causes slowdown on windows and we should not mix read() and pread()
calls anyway as this is not thread safe. Updated function comment to
reflect this. Changed function that depended on original behavior of
my_pwrite() to itself restore the cursor position (one such case).
- Added some missing checking of return value of malloc().
- Changed definition of MOD_PAD_CHAR_TO_FULL_LENGTH to avoid 'long' overflow.
- Changed type of table_def::m_size from my_size_t to ulong to reflect that
m_size is the number of elements in the array, not a string/memory
length.
- Moved THD::max_row_length() to table.cc (as it's not depending on THD).
Inlined max_row_length_blob() into this function.
- More function comments
- Fixed some compiler warnings when compiled without partitions.
- Removed setting of LEX_STRING() arguments in declaration (portability fix).
- Some trivial indentation/variable name changes.
- Some trivial code simplifications:
- Replaced some calls to alloc_root + memcpy to use
strmake_root()/strdup_root().
- Changed some calls from memdup() to strmake() (Safety fix)
- Simpler loops in client-simple.c
2007-05-10 12:59:39 +03:00
|
|
|
myisam_log_command(MI_LOG_LOCK,info,(uchar*) &lock_type,sizeof(lock_type),
|
2000-07-31 21:29:14 +02:00
|
|
|
error);
|
|
|
|
#endif
|
|
|
|
DBUG_RETURN(error);
|
|
|
|
} /* mi_lock_database */
|
|
|
|
|
|
|
|
|
|
|
|
/****************************************************************************
|
2002-06-28 17:26:11 +03:00
|
|
|
The following functions are called by thr_lock() in threaded applications
|
2000-07-31 21:29:14 +02:00
|
|
|
****************************************************************************/
|
|
|
|
|
2005-05-13 12:08:08 +03:00
|
|
|
/*
|
|
|
|
Create a copy of the current status for the table
|
|
|
|
|
|
|
|
SYNOPSIS
|
|
|
|
mi_get_status()
|
|
|
|
param Pointer to Myisam handler
|
|
|
|
concurrent_insert Set to 1 if we are going to do concurrent inserts
|
|
|
|
(THR_WRITE_CONCURRENT_INSERT was used)
|
|
|
|
*/
|
|
|
|
|
|
|
|
void mi_get_status(void* param, int concurrent_insert)
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
|
|
|
MI_INFO *info=(MI_INFO*) param;
|
|
|
|
DBUG_ENTER("mi_get_status");
|
2005-05-13 12:08:08 +03:00
|
|
|
DBUG_PRINT("info",("key_file: %ld data_file: %ld concurrent_insert: %d",
|
2000-07-31 21:29:14 +02:00
|
|
|
(long) info->s->state.state.key_file_length,
|
2005-05-13 12:08:08 +03:00
|
|
|
(long) info->s->state.state.data_file_length,
|
|
|
|
concurrent_insert));
|
2000-07-31 21:29:14 +02:00
|
|
|
#ifndef DBUG_OFF
|
|
|
|
if (info->state->key_file_length > info->s->state.state.key_file_length ||
|
|
|
|
info->state->data_file_length > info->s->state.state.data_file_length)
|
|
|
|
DBUG_PRINT("warning",("old info: key_file: %ld data_file: %ld",
|
|
|
|
(long) info->state->key_file_length,
|
|
|
|
(long) info->state->data_file_length));
|
|
|
|
#endif
|
|
|
|
info->save_state=info->s->state.state;
|
|
|
|
info->state= &info->save_state;
|
2005-05-13 12:08:08 +03:00
|
|
|
info->append_insert_at_end= concurrent_insert;
|
2000-07-31 21:29:14 +02:00
|
|
|
DBUG_VOID_RETURN;
|
|
|
|
}
|
|
|
|
|
2005-05-13 12:08:08 +03:00
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
void mi_update_status(void* param)
|
|
|
|
{
|
|
|
|
MI_INFO *info=(MI_INFO*) param;
|
|
|
|
/*
|
|
|
|
Because someone may have closed the table we point at, we only
|
|
|
|
update the state if its our own state. This isn't a problem as
|
|
|
|
we are always pointing at our own lock or at a read lock.
|
|
|
|
(This is enforced by thr_multi_lock.c)
|
|
|
|
*/
|
|
|
|
if (info->state == &info->save_state)
|
|
|
|
{
|
|
|
|
#ifndef DBUG_OFF
|
|
|
|
DBUG_PRINT("info",("updating status: key_file: %ld data_file: %ld",
|
|
|
|
(long) info->state->key_file_length,
|
|
|
|
(long) info->state->data_file_length));
|
|
|
|
if (info->state->key_file_length < info->s->state.state.key_file_length ||
|
|
|
|
info->state->data_file_length < info->s->state.state.data_file_length)
|
|
|
|
DBUG_PRINT("warning",("old info: key_file: %ld data_file: %ld",
|
|
|
|
(long) info->s->state.state.key_file_length,
|
|
|
|
(long) info->s->state.state.data_file_length));
|
|
|
|
#endif
|
|
|
|
info->s->state.state= *info->state;
|
|
|
|
info->state= &info->s->state.state;
|
|
|
|
}
|
2005-05-13 12:08:08 +03:00
|
|
|
info->append_insert_at_end= 0;
|
2000-07-31 21:29:14 +02:00
|
|
|
|
|
|
|
/*
|
|
|
|
We have to flush the write cache here as other threads may start
|
|
|
|
reading the table before mi_lock_database() is called
|
|
|
|
*/
|
|
|
|
if (info->opt_flag & WRITE_CACHE_USED)
|
|
|
|
{
|
|
|
|
if (end_io_cache(&info->rec_cache))
|
|
|
|
{
|
2004-12-31 03:47:56 +02:00
|
|
|
mi_print_error(info->s, HA_ERR_CRASHED);
|
2000-07-31 21:29:14 +02:00
|
|
|
mi_mark_crashed(info);
|
|
|
|
}
|
|
|
|
info->opt_flag&= ~WRITE_CACHE_USED;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-12-05 18:44:14 +04:00
|
|
|
|
|
|
|
void mi_restore_status(void *param)
|
|
|
|
{
|
|
|
|
MI_INFO *info= (MI_INFO*) param;
|
|
|
|
info->state= &info->s->state.state;
|
|
|
|
info->append_insert_at_end= 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
void mi_copy_status(void* to,void *from)
|
|
|
|
{
|
|
|
|
((MI_INFO*) to)->state= &((MI_INFO*) from)->save_state;
|
|
|
|
}
|
|
|
|
|
2004-04-05 13:56:05 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
Check if should allow concurrent inserts
|
|
|
|
|
|
|
|
IMPLEMENTATION
|
2005-05-13 12:08:08 +03:00
|
|
|
Allow concurrent inserts if we don't have a hole in the table or
|
|
|
|
if there is no active write lock and there is active read locks and
|
|
|
|
myisam_concurrent_insert == 2. In this last case the new
|
|
|
|
row('s) are inserted at end of file instead of filling up the hole.
|
|
|
|
|
|
|
|
The last case is to allow one to inserts into a heavily read-used table
|
|
|
|
even if there is holes.
|
2004-04-05 13:56:05 +03:00
|
|
|
|
|
|
|
NOTES
|
2005-05-13 12:08:08 +03:00
|
|
|
If there is a an rtree indexes in the table, concurrent inserts are
|
|
|
|
disabled in mi_open()
|
2004-04-05 13:56:05 +03:00
|
|
|
|
|
|
|
RETURN
|
|
|
|
0 ok to use concurrent inserts
|
|
|
|
1 not ok
|
|
|
|
*/
|
|
|
|
|
2005-05-13 12:08:08 +03:00
|
|
|
my_bool mi_check_status(void *param)
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
|
|
|
MI_INFO *info=(MI_INFO*) param;
|
2005-05-13 12:08:08 +03:00
|
|
|
/*
|
|
|
|
The test for w_locks == 1 is here because this thread has already done an
|
|
|
|
external lock (in other words: w_locks == 1 means no other threads has
|
|
|
|
a write lock)
|
|
|
|
*/
|
|
|
|
DBUG_PRINT("info",("dellink: %ld r_locks: %u w_locks: %u",
|
|
|
|
(long) info->s->state.dellink, (uint) info->s->r_locks,
|
|
|
|
(uint) info->s->w_locks));
|
|
|
|
return (my_bool) !(info->s->state.dellink == HA_OFFSET_ERROR ||
|
|
|
|
(myisam_concurrent_insert == 2 && info->s->r_locks &&
|
|
|
|
info->s->w_locks == 1));
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/****************************************************************************
|
|
|
|
** functions to read / write the state
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
int _mi_readinfo(register MI_INFO *info, int lock_type, int check_keybuffer)
|
|
|
|
{
|
|
|
|
DBUG_ENTER("_mi_readinfo");
|
|
|
|
|
|
|
|
if (info->lock_type == F_UNLCK)
|
|
|
|
{
|
2001-10-02 05:53:00 +03:00
|
|
|
MYISAM_SHARE *share=info->s;
|
|
|
|
if (!share->tot_locks)
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
2001-11-29 21:46:51 +02:00
|
|
|
if (my_lock(share->kfile,lock_type,0L,F_TO_EOF,
|
|
|
|
info->lock_wait | MY_SEEK_NOT_DONE))
|
|
|
|
DBUG_RETURN(1);
|
2000-07-31 21:29:14 +02:00
|
|
|
if (mi_state_info_read_dsk(share->kfile, &share->state, 1))
|
|
|
|
{
|
|
|
|
int error=my_errno ? my_errno : -1;
|
|
|
|
VOID(my_lock(share->kfile,F_UNLCK,0L,F_TO_EOF,
|
|
|
|
MYF(MY_SEEK_NOT_DONE)));
|
|
|
|
my_errno=error;
|
|
|
|
DBUG_RETURN(1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (check_keybuffer)
|
|
|
|
VOID(_mi_test_if_changed(info));
|
2001-12-02 14:34:01 +02:00
|
|
|
info->invalidator=info->s->invalidator;
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
|
|
|
else if (lock_type == F_WRLCK && info->lock_type == F_RDLCK)
|
|
|
|
{
|
|
|
|
my_errno=EACCES; /* Not allowed to change */
|
|
|
|
DBUG_RETURN(-1); /* when have read_lock() */
|
|
|
|
}
|
|
|
|
DBUG_RETURN(0);
|
|
|
|
} /* _mi_readinfo */
|
|
|
|
|
|
|
|
|
2004-10-06 01:24:21 +03:00
|
|
|
/*
|
|
|
|
Every isam-function that uppdates the isam-database MUST end with this
|
|
|
|
request
|
|
|
|
*/
|
2000-07-31 21:29:14 +02:00
|
|
|
|
|
|
|
int _mi_writeinfo(register MI_INFO *info, uint operation)
|
|
|
|
{
|
|
|
|
int error,olderror;
|
2001-04-19 20:41:19 +03:00
|
|
|
MYISAM_SHARE *share=info->s;
|
2000-07-31 21:29:14 +02:00
|
|
|
DBUG_ENTER("_mi_writeinfo");
|
2003-09-05 06:42:55 +03:00
|
|
|
DBUG_PRINT("info",("operation: %u tot_locks: %u", operation,
|
|
|
|
share->tot_locks));
|
2000-07-31 21:29:14 +02:00
|
|
|
|
|
|
|
error=0;
|
2001-10-02 05:53:00 +03:00
|
|
|
if (share->tot_locks == 0)
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
|
|
|
olderror=my_errno; /* Remember last error */
|
|
|
|
if (operation)
|
|
|
|
{ /* Two threads can't be here */
|
|
|
|
share->state.process= share->last_process= share->this_process;
|
|
|
|
share->state.unique= info->last_unique= info->this_unique;
|
2000-11-16 03:58:58 +02:00
|
|
|
share->state.update_count= info->last_loop= ++info->this_loop;
|
2000-07-31 21:29:14 +02:00
|
|
|
if ((error=mi_state_info_write(share->kfile, &share->state, 1)))
|
|
|
|
olderror=my_errno;
|
|
|
|
#ifdef __WIN__
|
|
|
|
if (myisam_flush)
|
|
|
|
{
|
|
|
|
_commit(share->kfile);
|
|
|
|
_commit(info->dfile);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
if (!(operation & WRITEINFO_NO_UNLOCK) &&
|
|
|
|
my_lock(share->kfile,F_UNLCK,0L,F_TO_EOF,
|
|
|
|
MYF(MY_WME | MY_SEEK_NOT_DONE)) && !error)
|
|
|
|
DBUG_RETURN(1);
|
|
|
|
my_errno=olderror;
|
|
|
|
}
|
|
|
|
else if (operation)
|
|
|
|
share->changed= 1; /* Mark keyfile changed */
|
2001-04-19 20:41:19 +03:00
|
|
|
DBUG_RETURN(error);
|
2000-07-31 21:29:14 +02:00
|
|
|
} /* _mi_writeinfo */
|
|
|
|
|
|
|
|
|
|
|
|
/* Test if someone has changed the database */
|
|
|
|
/* (Should be called after readinfo) */
|
|
|
|
|
|
|
|
int _mi_test_if_changed(register MI_INFO *info)
|
|
|
|
{
|
|
|
|
MYISAM_SHARE *share=info->s;
|
|
|
|
if (share->state.process != share->last_process ||
|
2000-11-16 03:58:58 +02:00
|
|
|
share->state.unique != info->last_unique ||
|
|
|
|
share->state.update_count != info->last_loop)
|
2000-07-31 21:29:14 +02:00
|
|
|
{ /* Keyfile has changed */
|
2000-11-21 03:43:34 +02:00
|
|
|
DBUG_PRINT("info",("index file changed"));
|
2000-07-31 21:29:14 +02:00
|
|
|
if (share->state.process != share->this_process)
|
2003-11-20 22:06:25 +02:00
|
|
|
VOID(flush_key_blocks(share->key_cache, share->kfile, FLUSH_RELEASE));
|
2000-07-31 21:29:14 +02:00
|
|
|
share->last_process=share->state.process;
|
|
|
|
info->last_unique= share->state.unique;
|
2000-11-16 03:58:58 +02:00
|
|
|
info->last_loop= share->state.update_count;
|
2000-07-31 21:29:14 +02:00
|
|
|
info->update|= HA_STATE_WRITTEN; /* Must use file on next */
|
|
|
|
info->data_changed= 1; /* For mi_is_changed */
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return (!(info->update & HA_STATE_AKTIV) ||
|
|
|
|
(info->update & (HA_STATE_WRITTEN | HA_STATE_DELETED |
|
|
|
|
HA_STATE_KEY_CHANGED)));
|
|
|
|
} /* _mi_test_if_changed */
|
|
|
|
|
|
|
|
|
2004-10-06 17:20:39 +03:00
|
|
|
/*
|
|
|
|
Put a mark in the .MYI file that someone is updating the table
|
|
|
|
|
|
|
|
|
|
|
|
DOCUMENTATION
|
|
|
|
|
|
|
|
state.open_count in the .MYI file is used the following way:
|
|
|
|
- For the first change of the .MYI file in this process open_count is
|
|
|
|
incremented by mi_mark_file_change(). (We have a write lock on the file
|
|
|
|
when this happens)
|
|
|
|
- In mi_close() it's decremented by _mi_decrement_open_count() if it
|
|
|
|
was incremented in the same process.
|
|
|
|
|
|
|
|
This mean that if we are the only process using the file, the open_count
|
|
|
|
tells us if the MYISAM file wasn't properly closed. (This is true if
|
|
|
|
my_disable_locking is set).
|
|
|
|
*/
|
|
|
|
|
2000-07-31 21:29:14 +02:00
|
|
|
|
|
|
|
int _mi_mark_file_changed(MI_INFO *info)
|
|
|
|
{
|
2007-08-13 16:11:25 +03:00
|
|
|
uchar buff[3];
|
2000-07-31 21:29:14 +02:00
|
|
|
register MYISAM_SHARE *share=info->s;
|
2004-10-06 01:24:21 +03:00
|
|
|
DBUG_ENTER("_mi_mark_file_changed");
|
|
|
|
|
2000-08-18 17:38:24 +03:00
|
|
|
if (!(share->state.changed & STATE_CHANGED) || ! share->global_changed)
|
2000-07-31 21:29:14 +02:00
|
|
|
{
|
2000-08-18 17:38:24 +03:00
|
|
|
share->state.changed|=(STATE_CHANGED | STATE_NOT_ANALYZED |
|
|
|
|
STATE_NOT_OPTIMIZED_KEYS);
|
2000-07-31 21:29:14 +02:00
|
|
|
if (!share->global_changed)
|
|
|
|
{
|
|
|
|
share->global_changed=1;
|
|
|
|
share->state.open_count++;
|
|
|
|
}
|
2001-05-23 02:40:46 +03:00
|
|
|
if (!share->temporary)
|
|
|
|
{
|
|
|
|
mi_int2store(buff,share->state.open_count);
|
|
|
|
buff[2]=1; /* Mark that it's changed */
|
2004-10-06 01:24:21 +03:00
|
|
|
DBUG_RETURN(my_pwrite(share->kfile,buff,sizeof(buff),
|
|
|
|
sizeof(share->state.header),
|
|
|
|
MYF(MY_NABP)));
|
2001-05-23 02:40:46 +03:00
|
|
|
}
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
2004-10-06 01:24:21 +03:00
|
|
|
DBUG_RETURN(0);
|
2000-07-31 21:29:14 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
This is only called by close or by extra(HA_FLUSH) if the OS has the pwrite()
|
|
|
|
call. In these context the following code should be safe!
|
|
|
|
*/
|
|
|
|
|
|
|
|
int _mi_decrement_open_count(MI_INFO *info)
|
|
|
|
{
|
2007-08-13 16:11:25 +03:00
|
|
|
uchar buff[2];
|
2000-07-31 21:29:14 +02:00
|
|
|
register MYISAM_SHARE *share=info->s;
|
|
|
|
int lock_error=0,write_error=0;
|
|
|
|
if (share->global_changed)
|
|
|
|
{
|
|
|
|
uint old_lock=info->lock_type;
|
|
|
|
share->global_changed=0;
|
|
|
|
lock_error=mi_lock_database(info,F_WRLCK);
|
|
|
|
/* Its not fatal even if we couldn't get the lock ! */
|
|
|
|
if (share->state.open_count > 0)
|
|
|
|
{
|
|
|
|
share->state.open_count--;
|
|
|
|
mi_int2store(buff,share->state.open_count);
|
|
|
|
write_error=my_pwrite(share->kfile,buff,sizeof(buff),
|
|
|
|
sizeof(share->state.header),
|
|
|
|
MYF(MY_NABP));
|
|
|
|
}
|
|
|
|
if (!lock_error)
|
|
|
|
lock_error=mi_lock_database(info,old_lock);
|
|
|
|
}
|
|
|
|
return test(lock_error || write_error);
|
|
|
|
}
|