/*=================================================================
   Copyright (C) 2012 2013 BizStation Corp All rights reserved.

   This program is free software; you can redistribute it and/or
   modify it under the terms of the GNU General Public License
   as published by the Free Software Foundation; either version 2
   of the License, or (at your option) any later version.

   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
   GNU General Public License for more details.

   You should have received a copy of the GNU General Public License
   along with this program; if not, write to the Free Software 
   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  
   02111-1307, USA.
=================================================================*/

#include "database.h"
#include <boost/bind.hpp>
#include "IReadRecords.h"
#include "percentageKey.h"

#include "mydebuglog.h"

#include "mysqlThd.h"
#include "bookmark.h"
#include <bzs/rtl/stl_uty.h>
#include <boost/shared_array.hpp>

extern int g_useBtrvVariableTable;
namespace bzs
{
namespace db
{
namespace engine
{
namespace mysql
{

using namespace std;


unsigned int hash(const char *s, size_t len)
{
    unsigned int h = 0;
    for (size_t i=0;i < len; i++)
        h = h * 137 + *(s+i);
	return h % 1987;
}

tableCacheCounter::tableCacheCounter()
{

}

int tableCacheCounter::getHash(const std::string& dbname, const std::string& tbname)
{
	char tmp[256];
	sprintf_s(tmp, 256,"%s%s",dbname.c_str(), tbname.c_str());
	return  hash(tmp, strlen(tmp));
}

size_t tableCacheCounter::getCounterIndex(const std::string& dbname, const std::string& tbname)
{
	int h = getHash(dbname, tbname);
	vector<int>::iterator pos = find(m_tables.begin(),m_tables.end(), h);
	if (pos == m_tables.end())
	{
		m_tables.push_back(h);
		m_counts.push_back(0);
		return m_counts.size() - 1;
	}
	return pos - m_tables.begin();
}

void tableCacheCounter::addref(const std::string& dbname, const std::string& tbname)
{
	
	boost::mutex::scoped_lock lck(m_mutex);
	size_t pos = getCounterIndex(dbname, tbname);
	++m_counts[pos];
}

int tableCacheCounter::count(const std::string& dbname, const std::string& tbname)
{
	boost::mutex::scoped_lock lck(m_mutex);
	size_t pos = getCounterIndex(dbname, tbname);
	return m_counts[pos];
}

void tableCacheCounter::release(const std::string& dbname, const std::string& tbname)
{
	boost::mutex::scoped_lock lck(m_mutex);
	size_t pos = getCounterIndex(dbname, tbname);
	--m_counts[pos];
}

#define KEYLEN_ALLCOPY 0
#define OPEN_TABLE_TIMEOUT_SEC 2 

void lockTable(THD* thd, TABLE* tb)
{
	bool append = (thd->lock!=0);
	thd->in_lock_tables = 1;
	MYSQL_LOCK *lockMrg=NULL;

	MYSQL_LOCK *lock = mysql_lock_tables(thd, &tb, 1, 0);
	if (!append)
		thd->lock = lock;
	else if (lock)
	{
		MYSQL_LOCK *lockMrg = mysql_lock_merge(thd->lock, lock);
		if (lockMrg)
			thd->lock= lockMrg;
	}
	thd->in_lock_tables= 0;
	DEBUG_WRITELOG_SP1("LOCK TABLE table =%s\n", tb->s->table_name.str);

	return ;
}

/** The present lock type is returned. 
 *  The true lock type of innodb is controlled by m_thd->lex->sql_command.
 */
thr_lock_type locktype(bool trn, enum_sql_command cmd)
{
	if (trn)
		return TL_WRITE;
	thr_lock_type lock_type = TL_READ;
	switch(cmd)
	{
	case SQLCOM_INSERT:
	case SQLCOM_DELETE:
	case SQLCOM_UPDATE:
	case SQLCOM_DROP_TABLE:
	case SQLCOM_CREATE_TABLE:
	case SQLCOM_CREATE_INDEX:
		lock_type = TL_WRITE;
	default:
		;
	break;
	}
	return lock_type;
}

bool unlockTables(bool releaseStatementLock, THD* thd, bool rollback)
{
	if (thd->lock)
	{
		bool ret;
		if (rollback)
			ret = trans_rollback_stmt(thd);
		else
			ret = trans_commit_stmt(thd);
		if (releaseStatementLock)
			thd->mdl_context.release_statement_locks();
		mysql_unlock_tables(thd, thd->lock);
		thd->lock = 0;
		return !ret;
	}
	return false;

}

#ifdef _MSC_VER
#pragma warning(disable:4355) 
#endif


bool g_safe_share_mode=false;
tableCacheCounter database::tableRef;

database::database(const char* name, short cid)
		:m_dbname(name),m_thd(createThdForThread()),m_cid(cid)
		,m_inTransaction(0),m_inSnapshot(0),m_trnType(0)
{
	m_thd->security_ctx->skip_grants();
	



}

#ifdef _MSC_VER
#pragma warning(default:4355)
#endif 

database::~database()
{
	use();
	unUseTables(false);
	closeForReopen();
	m_tables.clear();//It clears ahead of the destructor of m_trn. 
	deleteThdForThread(m_thd);
}

void database::use() const
{
	attachThd(m_thd); 
	m_thd->clear_error();
}

// locktable
table* database::useTable(int index, enum_sql_command cmd)
{
	if (index>=(int)m_tables.size())
		THROW_BZS_ERROR_WITH_CODEMSG(1, "Invalid table id.");
	
	table* tb = m_tables[index].get();
	if (tb == NULL)
		THROW_BZS_ERROR_WITH_CODEMSG(STATUS_FILE_NOT_OPENED, "Invalid table id.");

	if (tb->m_blobBuffer)
		tb->m_blobBuffer->clear();
	if (tb->islocked())
	{
		if (tb->m_table==NULL)
			THROW_BZS_ERROR_WITH_CODEMSG(STATUS_FILE_NOT_OPENED, "Invalid table id.");
		return tb;
	}
	if (g_safe_share_mode && tb->m_table==NULL)
		reopen();
	if (tb->m_table==NULL)
		THROW_BZS_ERROR_WITH_CODEMSG(STATUS_FILE_NOT_OPENED, "Invalid table id.");
	bool trn = (m_inTransaction>0) & (tb->mode() != TD_OPEN_READONLY);
	tb->m_table->reginfo.lock_type = locktype(trn, cmd);
	if ((tb->mode() == TD_OPEN_READONLY) && (tb->m_table->reginfo.lock_type == TL_WRITE))
		THROW_BZS_ERROR_WITH_CODEMSG(STATUS_ACCESS_DENIED, "Access denined.");
	if (m_thd->lock==0)
	{
		m_thd->lex->sql_command = cmd;
		m_thd->tx_isolation= (enum_tx_isolation) m_thd->variables.tx_isolation;
		cp_thd_set_read_only(m_thd);
	}
	lockTable(m_thd, tb->m_table);


	if ((tb->m_table->reginfo.lock_type == TL_WRITE) && (m_thd->variables.sql_log_bin))
		m_thd->set_current_stmt_binlog_format_row();
	tb->setLocked(true);
	if (g_safe_share_mode)
	{
		tb->m_keyconv.setKey(tb->m_table->key_info);
		if (tb->keyNum()>=0)
			tb->m_table->file->ha_index_init(tb->keyNum(), 1/*sorted*/);
		else if(tb->keyNum() == -2)
			tb->m_table->file->ha_rnd_init(false);
	}
	
	return tb;		
}

void database::unUseTable(table* tb)
{
	if (tb->islocked() && (m_inTransaction + m_inSnapshot==0))
	{ //Only this table is lock release. 
		bool needUnlock = (locktype(false, m_thd->lex->sql_command)==TL_WRITE);
		bool changed = tb->isChanged();
		tb->resetTransctionInfo(m_thd);
		bool rollback = (!changed && needUnlock);
		if (unlockTables(needUnlock, m_thd, rollback))
		{
			DEBUG_WRITELOG_SP1("UNLOCK TABLE table =%s\n", tb->m_table->s->table_name.str);
		}else
		{
			DEBUG_WRITELOG_SP1("UNLOCK TABLE ERROR table =%s\n", tb->m_table->s->table_name.str);
			if (m_thd->is_error())
			{

				if (ER_LOCK_WAIT_TIMEOUT == m_thd->cp_get_sql_error())
					m_stat = STATUS_CANNOT_LOCK_TABLE;
				else
					m_stat = m_thd->cp_get_sql_error();
				THROW_BZS_ERROR_WITH_CODEMSG(m_stat, "Transaction commit error.");
			}
		}
		if (g_safe_share_mode)
		{
			unUseTables(false);
			closeForReopen();
		}

	}
}

void database::unUseTables(bool rollback)
{
	//All the table lock release 
	bool needUnlock = (locktype((m_inTransaction>0), m_thd->lex->sql_command)==TL_WRITE);
	m_inTransaction = 0;
	m_inSnapshot = 0;
	for (int i=0;i<(int)m_tables.size();i++)
	{
		if (m_tables[i])
			m_tables[i]->resetTransctionInfo(m_thd);
	}
	if (unlockTables(needUnlock, m_thd, rollback))
	{
		DEBUG_WRITELOG("UNLOCK TABLES \n")
	}
	else
	{
		if (m_thd->is_error())
		{
			DEBUG_WRITELOG("UNLOCK TABLES ERROR \n");
			if (ER_LOCK_WAIT_TIMEOUT == m_thd->cp_get_sql_error())
				m_stat = STATUS_CANNOT_LOCK_TABLE;
			else
				m_stat = m_thd->cp_get_sql_error();
			THROW_BZS_ERROR_WITH_CODEMSG(m_stat, "Transaction commit error.");
		}
	}
	if (g_safe_share_mode)
		closeForReopen();

}

bool database::beginTrn(short type)
{
	++m_inTransaction;
	if (m_inTransaction == 1)
	{
		m_trnType = type;
		return true;
	}
	return false;
}

bool database::commitTrn()
{
	if (m_inTransaction>0)
	{
		--m_inTransaction;
		if (m_inTransaction==0)
			unUseTables(false);
	}
	return (m_inTransaction == 0);
}

bool database::abortTrn()
{
	if (m_inTransaction>0)
	{
		--m_inTransaction;
		if (m_inTransaction==0)
			unUseTables(true);
	}
	return (m_inTransaction == 0);
}

bool database::beginSnapshot()
{
	++m_inSnapshot;
	return (m_inSnapshot == 1);
}

bool database::endSnapshot()
{
	if (m_inSnapshot>0)
	{
		--m_inSnapshot;
		if (m_inSnapshot==0)
			unUseTables(false);
	}
	return (m_inSnapshot == 0);
}

/** Metadata lock, a table name is case-sensitive 
 *  However, in actual opening, it is not distinguished at Windows.
 */
TABLE* database::doOpenTable(const std::string& name, short mode)
{
	TABLE_LIST tables;
	m_thd->variables.lock_wait_timeout = OPEN_TABLE_TIMEOUT_SEC;
	tables.init_one_table(m_dbname.c_str(), m_dbname.size(), name.c_str(), name.size(), name.c_str(), TL_READ);
	Open_table_context ot_act(m_thd, 0);
	if (mode == TD_OPEN_EXCLUSIVE)
		tables.mdl_request.set_type(MDL_EXCLUSIVE);
	else
		tables.mdl_request.set_type(MDL_SHARED_READ);
	
	if (cp_open_table(m_thd, &tables, &ot_act))
	{
		m_stat = STATUS_TABLE_NOTOPEN;
		if (ER_LOCK_WAIT_TIMEOUT == m_thd->cp_get_sql_error())
			m_stat = STATUS_CANNOT_LOCK_TABLE;
		THROW_BZS_ERROR_WITH_CODEMSG(m_stat, name.c_str());
	}

	tables.table->use_all_columns();
	tables.table->open_by_handler = 1;
#if (defined(DEBUG) && defined(WIN32))
	char buf[10];
	sprintf(buf, "%d", tables.table->field[1]->key_length());
	OutputDebugString(buf);
#endif
	return tables.table;
}

table* database::openTable(const std::string& name, short mode)
{
	if (existsTable(name))
	{
		tableRef.addref(m_dbname, name);//addef first then table open.
		boost::shared_ptr<table> tb(new table(doOpenTable(name, mode) , *this, name, mode, (int)m_tables.size()));
		m_tables.push_back(tb);
		m_stat = STATUS_SUCCESS;
		return tb.get();
	}
	m_stat = STATUS_TABLE_NOTOPEN;
	THROW_BZS_ERROR_WITH_CODEMSG(m_stat, name.c_str());
}

void database::closeTable(const std::string& name, bool drop)
{
	for (int i=(int)m_tables.size()-1;i>=0;i--)
	{
		if (m_tables[i] && (m_tables[i]->m_name == name))
		{
			m_tables[i].reset();
			DEBUG_WRITELOG_SP1("CLOSE TABLE table id=%d \n", i);
		}
	}
}

void database::closeTable(table* tb)
{
	for (int i=(int)m_tables.size()-1;i>=0;i--)
	{
		if (m_tables[i] && (m_tables[i].get() == tb))
		{
			m_tables[i].reset();
			DEBUG_WRITELOG_SP1("CLOSE TABLE table id=%d \n", i);
		}
	}
}

void database::closeForReopen()
{
	//A transaction is committed compulsorily.
	
	for (size_t i=0;i<m_tables.size();i++)
	{
		if (m_tables[i] && (m_tables[i]->m_table!=NULL))
			m_tables[i]->resetInternalTable(NULL);
	}

	trans_commit_stmt(m_thd);
	close_thread_tables(m_thd);
	m_thd->mdl_context.release_transactional_locks();//It is certainly after close_thread_tables.
	
}

void database::reopen()
{
	for (size_t i=0;i<m_tables.size();i++)
	{
		if (m_tables[i] && (m_tables[i]->m_table==NULL))
		{
			TABLE* table = doOpenTable(m_tables[i]->m_name.c_str(), m_tables[i]->m_mode);
			if (table)
				m_tables[i]->resetInternalTable(table);
			else
				m_tables[i].reset();
		}
	}
}

bool database::existsTable(const std::string& name)
{
	char tmp[FN_REFLEN + 1];
	
	build_table_filename(tmp, sizeof(tmp) - 1,
                       m_dbname.c_str(), name.c_str(), reg_ext, 0);
	MY_STAT st;
	if (mysql_file_stat(0, tmp, &st, MYF(0)))
		return true;
	return false;
  
}

bool database::existsDatabase()
{
	char tmp[FN_REFLEN + 1];
	size_t len = build_table_filename(tmp, sizeof(tmp) - 1, m_dbname.c_str(), "", "", 0);
	tmp[len-1]= 0x00;

	MY_STAT stat;
	if (mysql_file_stat(0, tmp, &stat, MYF(0)))
		return true;
	return false;
}

class autoincSetup
{
	TABLE* m_table;
public:
	autoincSetup(TABLE* table):m_table(table)
	{
		m_table->next_number_field = m_table->found_next_number_field;
	}
	~autoincSetup()
	{
		m_table->next_number_field = 0;
	}
};

/** Number of NIS fields
 */
unsigned short nisFieldNum(TABLE* tb)
{
	if (tb->s->null_fields)
	{
		int offset= 1;
		
		for (unsigned int i=tb->s->fields-offset;i>=0;--i)
			if (isNisField(tb->s->field[i]->field_name)==false)
				return (unsigned short)(tb->s->fields - i - offset);
		return tb->s->fields;
	}
	
	return 0;
}

bool table::noKeybufResult = true;

table::table(TABLE* myTable, database& db, const std::string& name, short mode, int id)
		:m_table(myTable),m_db(db),m_name(name), m_mode(mode),m_blobBuffer(NULL)
		,m_id(id),m_keyNum(-1),m_stat(0)
		,m_validCursor(true),m_cursor(false)
		,m_keybuf(new unsigned char[MAX_KEYLEN])
		,m_nonNccKeybuf(new unsigned char[MAX_KEYLEN])
		,m_nonNcc(false),m_bulkInserting(false)
		,m_keyconv(m_table->key_info, m_table->s->keys)
		,m_locked(false),m_changed(false),m_nounlock(false)
		
{
	
	m_table->read_set = &m_table->s->all_set;
	m_recordFormatType = RF_VALIABLE_LEN;
	m_lastVarLenBytes = 0;
	
	//Is the Nis field included or not? 
	m_nullFields = nisFieldNum(m_table);

	if (m_table->s->varchar_fields + m_table->s->blob_fields == 0)
		m_recordFormatType = RF_FIXED_LEN;
	else if ((m_table->s->varchar_fields == 1) && g_useBtrvVariableTable)
	{
		Field** fd = m_table->field + lastVarFiledNum();	
		if (isVarType((*fd)->type()) && ((*fd)->part_of_key.is_clear_all()/* == Bitmap<64>()*/)
			&& ((*fd)->key_start.is_clear_all()/* == Bitmap<64>()*/)
			&& (((*fd)->charset()) == &my_charset_bin))
		{
			m_recordFormatType = RF_FIXED_PLUS_VALIABLE_LEN;
			
			/* The number of bytes of the length area of the last VAR field */
			m_lastVarLenBytes = lastVarFiled()->field_length < 256 ? 1:2;
		}
	}
	
	if (m_nullFields)
		m_recordFormatType |= RF_INCLUDE_NIS;
	m_recordLenCl = (uint)(m_table->s->reclength-(uint)(m_table->s->null_fields>0) - m_nullFields-m_lastVarLenBytes);
	
	//Chash null field
	if (m_table->s->null_fields)
	{
		for (int i=0;i<(int)m_table->s->fields;++i)
		{
			Field* fd = m_table->field[i];
			if (fd->null_bit && fd->part_of_key.is_clear_all())
				m_nonKeySegNullFields.push_back(fd);
		}
	}
}

table::~table()
{
	resetInternalTable(NULL);
	database::tableRef.release(m_db.name(), m_name);
}

void table::resetTransctionInfo(THD* thd)
{
	if (m_table)
	{
		if (m_changed)
			query_cache_invalidate3(thd, m_table, 1);
		m_changed = false;
		m_table->next_number_field = 0;
		m_table->file->next_insert_id = 0;
	}
	m_locked = false;
	m_validCursor = false;
	m_nounlock = false;
}

void table::resetInternalTable(TABLE* table)
{
	if (table==NULL)
	{
		if (m_table)
			m_table->file->ha_index_or_rnd_end();
		m_table = NULL;
	}else
	{
		m_table = table; 
		m_table->read_set = &m_table->s->all_set;
		m_locked = false;
		m_changed = false;
		m_validCursor = false;
		m_nounlock = false;
		
	}
}

bool table::setNonKey(bool scan)
{
	if (m_keyNum != -2)
	{
		m_table->file->ha_index_or_rnd_end();
		m_table->file->ha_rnd_init(scan);
		m_keyNum = -2;
	}
	return true;
}

bool table::setKeyNum(char num)
{
	if ((m_keyNum != num) || ((m_keyNum >= 0)&& (m_table->file->inited == handler::NONE)))
	{
		m_table->file->ha_index_or_rnd_end();
		
		if(keynumCheck(num))
		{
			m_keyNum = num;
			m_table->file->ha_index_init(m_keyNum, 1/*sorted*/);
			return true;
		}
		else
		{
			m_stat = STATUS_INVALID_KEYNUM;
			return false;
		}
	}
	return true;
}

void table::fillNull(uchar* ptr, int size)
{
	for (int i = 0;i < size;i++)
	{
		if (ptr[i] == 0)
		{
			memset(ptr + i, 0, size - i);
			break;
		}
	}
}

void table::setKeyValues(const uchar* ptr, int size)
{
	KEY& key = m_table->key_info[m_keyNum];
	memcpy(&m_keybuf[0], ptr, std::min(MAX_KEYLEN, size));
	int pos = 0;
	for (int j = 0; j < (int)key.user_defined_key_parts; j++)
	{
		KEY_PART_INFO& seg = key.key_part[j];
		if (seg.field->type()==MYSQL_TYPE_STRING)
			fillNull(&m_keybuf[pos], seg.field->pack_length());
		pos+=seg.field->pack_length();
	}
}

/**
	If null able field segment that need add null indicator byte befor segment.
	Then key buffer length equal key length + null able segments.

	The purpose of null key is non create index.
	At read operation set not null(zero) to null indicator.

	Size bytes of var and  blob field is 2 byte fixed. 
	All most of key_part.length(segment lenght) is equal field.pack_length. 
	But blob and prefix index is not equal pack_length.

	Client needs to make the right image except for null byte. 
*/
void table::setKeyValuesPacked(const uchar* ptr, int size)
{	

	KEY& key = m_table->key_info[m_keyNum];
	int to = 0;
	const uchar* from = ptr;
	uint key_length = key.key_length;

	for (int j = 0; j < (int)key.user_defined_key_parts; j++)
	{   
		KEY_PART_INFO& seg = key.key_part[j];
		if (seg.null_bit)
		{
			m_keybuf[to++] = 0x00;
			seg.field->set_notnull();
		}
		if (seg.null_bit && isNisField(seg.field->field_name))
		{
			m_keybuf[to++] = 0x00;
			seg.field->set_notnull();
		}
		else
		{
			int copylen = seg.length;
			if (seg.key_part_flag & HA_BLOB_PART || seg.key_part_flag & HA_VAR_LENGTH_PART)
				copylen += 2;
			memcpy(&m_keybuf[to], from, copylen);
			to += copylen;
			from += copylen;
			
			if (to>=MAX_KEYLEN)
				THROW_BZS_ERROR_WITH_CODEMSG(STATUS_KEYBUFFERTOOSMALL, "");
		}
	}
	
}

uint table::keyPackCopy(uchar* ptr)
{
	KEY& key = m_table->key_info[m_keyNum];
	if ((key.flags & HA_NULL_PART_KEY) || (key.flags & HA_VAR_LENGTH_KEY))
	{
		int from = 0;
		uchar* to = ptr;
		uint key_length = key.key_length;

		for (int j = 0; j < (int)key.user_defined_key_parts; j++)
		{   
			KEY_PART_INFO& seg = key.key_part[j];
			if (seg.null_bit)
				from++;
			if (seg.null_bit && isNisField(seg.field->field_name))
				from++;
			else
			{
				int copylen = seg.length;
				if (seg.key_part_flag & HA_BLOB_PART || seg.key_part_flag & HA_VAR_LENGTH_PART)
					copylen += 2;
				memcpy(to, &m_keybuf[from], copylen);
				to += copylen;
				from += copylen;
				
			}
		}
		return (uint)(to-ptr);
	}
	memcpy(ptr, keybuf(), keylen());
	return keylen();
}

void* table::record()const
{
	Field* fd = m_table->field[0];
	return fd->ptr;
}

/** if offset and lastVarLenBytes() is non zero that is m_recordFormatType=RF_FIXED_PLUS_VALIABLE_LEN.
 *  ptr is excluding null flag sgement.
 */
void table::setRecord(void* ptr, unsigned short size, int offset)
{
	m_cursor = false;
	Field* fd = m_table->field[0];//remove null flag segment
	if (offset + size <= (unsigned short)m_table->s->reclength + lastVarLenBytes())
	{
		if (size>0)
			memcpy(fd->ptr + offset, ptr, size);
	}
	else
		THROW_BZS_ERROR_WITH_CODEMSG(STATUS_INVALID_DATASIZE, "");
}

inline bool isNull(Field* fd)
{
	if (isVarType(fd->type()))
	{
		int len = *((unsigned char*)fd->ptr);
		if (fd->field_length>255)
			len = *((unsigned short*)fd->ptr);
				
		return (len==0);
	}
	else
	{
		unsigned int k=0;
		for (k=0;k<fd->key_length();k++)
			if (fd->ptr[k]) break;
						
		if (k==fd->key_length())
			return true;
	}
	return false;
}

inline bool isNullNis(KEY& key, bool all)
{
	for (int j=1;j<(int)key.user_defined_key_parts;j++)
	{
		Field* fd = key.key_part[j].field;
		if (key.key_part[j].null_bit)
		{
			bool v = isNull(fd);
			v ? fd->set_null():fd->set_notnull();
			if (all && !v)
				return false;
			else if(!all && v)
				return true;
		}
	}
	if (all)
		return true;
	return false;
}

void table::setBlobFieldPointer(const bzs::db::blobHeader* hd)
{
    
	if (hd)
    {
        assert(hd->curRow < hd->rows);
		const blobField* f = hd->nextField;
        for (int i=0;i<hd->fieldCount;i++)
        {
            Field* fd = m_table->field[f->fieldNum];
            int sizeByte = blob_var_bytes(fd);
            memcpy(fd->ptr, &f->size, sizeByte);
            const char* data = f->data();
            memcpy(fd->ptr+sizeByte, &data, sizeof(char*));
            f = f->next();
        }
		++hd->curRow;
        hd->nextField = (blobField*)f;
    }

}

/** A packed data set to the record buffer.
 */
void table::setRecordFromPacked(const uchar* packedPtr, uint size, const bzs::db::blobHeader* hd)
{
	const uchar* p = packedPtr;
	if (recordFormatType() & RF_FIXED_PLUS_VALIABLE_LEN)
	{
		int varlenbyte = lastVarLenBytes();
		int varlenStartPos = lastVarFieldPos();
		setRecord((void*)p, varlenStartPos);
		int len = std::min((int)(size - varlenStartPos), (int)recordLenCl() - varlenStartPos);	
		if (len > 0)
		{
			setRecord(&len, varlenbyte, varlenStartPos);
			//if (len > 0)
			setRecord((void*)(p + varlenStartPos), len, varlenStartPos + varlenbyte);
		}else if (len == 0)
			;
		else
			THROW_BZS_ERROR_WITH_CODEMSG(STATUS_BUFFERTOOSMALL, "copyDataTo");
	}else if ((recordFormatType() & RF_VALIABLE_LEN)
				|| (recordFormatType() & RF_INCLUDE_NIS))
	{
		//It copies for every field. 
		for (uint i=0;i<m_table->s->fields;i++)
		{
			Field* fd = m_table->field[i];
			if (isNisField(fd->field_name))
				fd->ptr[0] = 0x00;//The Nis field is not sent from a client. 
			else
			{
				int len = fd->pack_length();
				if (isVarType(fd->type()))
					len = var_total_len(p, var_bytes(fd));
				
				memcpy(fd->ptr, p, len);
				p += len;
			}
		}
		if (m_table->s->blob_fields)
			setBlobFieldPointer(hd);
	}
	else
		setRecord((void*)p, std::min(size, recordLenCl()));

}

/**	A record image is packed, and is copied to the specified buffer, and length is returned. 
 *	-maxsize can be specified when recordFormatType() is RF_VALIABLE_LEN. 
 *	-Length is not inspected if maxsize is zero. 
 *	-When a buffer is too short, zero is returned to a result.
 */
uint table::recordPackCopy(char* buf, uint maxsize) 
{
	char* p = buf;
	
	if ((recordFormatType() & RF_VALIABLE_LEN)
			 || (recordFormatType() & RF_INCLUDE_NIS))
	{
		int blobs = 0;
		for (uint i=0;i<m_table->s->fields;i++)
		{
			Field* fd = m_table->field[i];
			if (isNisField(fd->field_name))
				;//The Nis field is not sent to a client.
			else
			{
				uint len = fd->pack_length();
				if (isVarType(fd->type()))
					len = var_total_len(fd);
				if (maxsize && ((p - buf + len) > maxsize))
					return 0;
				memcpy(p, fd->ptr, len);
				p+=len;
				if (isBlobType(fd->type()))
				{
					++blobs;
					addBlobBuffer(fd->field_index);
				}
			}
		}
		setBlobFieldCount(blobs);
	}else
	{  
		uint varLenBytes = lastVarLenBytes();
		uint varLenBytesPos = lastVarFieldPos();
		const uchar* data = (const uchar *) record();
		int len = recordLenCl();
		if (varLenBytes)
		{
			memcpy(p, data, varLenBytesPos);
			p += varLenBytesPos;
			data += varLenBytesPos;
			if (varLenBytes == 1)
				len  = *data;
			else
				len = *((const unsigned short*)data);
			//In the variable length of tdap type, it returns except for varsize.
			data += varLenBytes; 
		}
		memcpy(p, data, len);
		p += len;
	}
	return (uint)(p - buf);
}

inline bool table::keynumCheck(char num)
{
	return ((num>=0) && (num < (short)m_table->s->keys));
					//||(num == m_table->s->primary_key));

}

inline void table::unlockRow()
{
	if (!m_nounlock && m_validCursor && m_db.inTransaction() && (m_db.transactionType()== 0))
	{
		m_table->file->unlock_row();
		m_nounlock = false;
	}

}
/* read by key
 * A key field value is set in advance
 */
void  table::seekKey(enum ha_rkey_function find_flag)
{
	m_nonNcc = false;
	if(keynumCheck(m_keyNum))
	{
		unlockRow();
		m_stat = m_table->file->ha_index_read_map(m_table->record[0], &m_keybuf[0], keymap(), find_flag);
		m_cursor = m_validCursor = (m_stat == 0);
		if (m_stat==0)
		{
			if (find_flag != HA_READ_KEY_EXACT)
				key_copy(&m_keybuf[0], m_table->record[0], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);
		}
	}else
		m_stat = STATUS_INVALID_KEYNUM;
	if ((m_stat == HA_ERR_KEY_NOT_FOUND) && (find_flag != HA_READ_KEY_EXACT))
		m_stat = HA_ERR_END_OF_FILE;
}

void table::moveKey(boost::function<int()> func)
{
	m_nonNcc = false;
	if(keynumCheck(m_keyNum))
	{
		unlockRow();

		m_stat = func();
		m_cursor = m_validCursor = (m_stat == 0);
		if (m_stat == 0)
			key_copy(&m_keybuf[0], m_table->record[0], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);
	}else
		m_stat = STATUS_INVALID_KEYNUM;
	if (m_stat == HA_ERR_KEY_NOT_FOUND)
		m_stat = HA_ERR_END_OF_FILE;
	
}

void table::getNextSame()
{
	m_nonNcc = false;
	if(keynumCheck(m_keyNum))
	{
		if (m_validCursor && m_db.inTransaction()  && (m_db.transactionType()== 0))
			m_table->file->unlock_row();
		m_stat = m_table->file->ha_index_next_same(m_table->record[0], &m_keybuf[0], keymap());
		m_cursor = m_validCursor = (m_stat == 0);
		if (m_stat==0)
			key_copy(&m_keybuf[0], m_table->record[0], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);
	}else
		m_stat = STATUS_INVALID_KEYNUM;
}

void table::getLast()
{
	moveKey(boost::bind(&handler::ha_index_last, m_table->file, m_table->record[0]));
}

void table::getFirst()
{
	moveKey(boost::bind(&handler::ha_index_first, m_table->file, m_table->record[0]));
	
#if (defined(DEBUG) && defined(WIN32))

	char buf[1024];
	sprintf(buf, "name=%s reclength=%d rec_buff_length=%d\r\n",m_name.c_str(), m_table->s->reclength
		,m_table->s->rec_buff_length);
	OutputDebugString(buf);
	for (uint i=0;i<m_table->s->fields;i++)
	{
		Field* fd = m_table->s->field[i];
		
		sprintf(buf, "\tpack_length=%d field_length=%d key_length=%d\r\n",fd->pack_length()
			, fd->field_length,fd->key_length());
		OutputDebugString(buf);
	}
#endif
}

void table::getNext()
{
	if (!m_cursor)
	{
		m_stat = HA_ERR_NO_ACTIVE_RECORD; 
		return ;
	}
	if (m_nonNcc)
	{//It moves to the position after updating. 
	 //Since it may be lost, ref is compared and the next is decided.
		movePos(position(true), m_keyNum, true);
		if (m_stat)	return ;
	}
	moveKey(boost::bind(&handler::ha_index_next, m_table->file, m_table->record[0]));

}

void table::getPrev()
{
	if (!m_cursor)
	{
		m_stat = HA_ERR_NO_ACTIVE_RECORD; 
		return ;
	}
	if (m_nonNcc)
	{
		movePos(position(true), m_keyNum, true);
		if (m_stat)	return ;
	}
	moveKey(boost::bind(&handler::ha_index_prev, m_table->file, m_table->record[0]));
}

bool table::keyCheckForPercent()
{
	if (m_keyNum == -1)
		m_keyNum = m_table->s->primary_key;
	//The value of the beginning of a key
	KEY& key = m_table->key_info[m_keyNum];
	if (key.key_length > 128)
		return false;
	return true;
}

void table::preBuildPercent(uchar* first, uchar* last)
{
	KEY& key = m_table->key_info[m_keyNum];
	getFirst();
	if (m_stat == 0)
	{
		key_copy(first, m_table->record[0], &key, KEYLEN_ALLCOPY);
		getLast();
		if (m_stat == 0)
		{
			key_copy(last, m_table->record[0], &key, KEYLEN_ALLCOPY);
			memset(m_keybuf.get(), 0, MAX_KEYLEN);
		}else
			THROW_BZS_ERROR_WITH_CODEMSG(m_stat, "connot seek last position.");
	}else
		THROW_BZS_ERROR_WITH_CODEMSG(m_stat, "connot seek first position.");
}

void table::getByPercentage(unsigned short per)
{
	m_nonNcc = false;
	if (!keyCheckForPercent())
	{
		m_stat = STATUS_INVALID_KEYNUM;
		return ;
	}
	if (per > 9800)
	{
		getLast();
		return;
	}else if(per < 200)
	{
		getFirst();
		return;
	}

	uchar  keybufFirst[MAX_KEYLEN]={0x00};
	uchar  keybufLast[MAX_KEYLEN]={0x00};
	preBuildPercent(keybufFirst, keybufLast);
	if (m_stat == 0)
	{
		//5% of position is obtained.
		uchar* st = keybufFirst;
		uchar* en = keybufLast;
		uchar* cu = (uchar*) keybuf();
		KEY& key = m_table->key_info[m_keyNum];
		uint keylen = key.key_length + 10;
		boost::shared_array<uchar> stbuf(new uchar[keylen]);
		boost::shared_array<uchar> lsbuf(new uchar[keylen]);
		boost::shared_array<uchar> stbufResult(new uchar[keylen]);
		boost::shared_array<uchar> lsbufResult(new uchar[keylen]);
		percentageKey pk(key, st, en, cu);
		bool forwoard=true;
		int ov = 0;
		int sameCount = 0;
		while(1)
		{
			pk.reset(st, en, cu);
			int ret = pk.setKeyValueByPer(5000, forwoard);
			if (ret == KEY_ALL_SGMENTS_SAME)
				break;//THROW_BZS_ERROR_WITH_CODEMSG(1, "first and last record are same key value.");
			else if(ret == KEY_NEED_SGMENT_COPY)
				pk.copyFirstDeferentSegment();
			int v = percentage(keybufFirst, keybufLast, cu)-1000;
			(ov == v)?++sameCount:sameCount= 0;
			if (sameCount > 100)
				break;
			ov = v;
			if (v < -250)
			{
				memcpy(stbuf.get(), cu, keylen);
				st = stbuf.get();
				forwoard = true;
			}else if (v > 250)
			{
				memcpy(lsbuf.get(), cu, keylen);
				en = lsbuf.get();
				forwoard = false;
			}else
				break;
		}
		memcpy(stbufResult.get(), cu, keylen);
		if (per > 1000)
		{
			//95% of position is obtained.
			forwoard=true;
			memcpy(cu, keybufLast, keylen);
			memcpy(lsbuf.get(), keybufLast, keylen);
			en = lsbuf.get();
			while(1)
			{
				pk.reset(st, en, cu);
				int ret = pk.setKeyValueByPer(5000, forwoard);
				if (ret == KEY_ALL_SGMENTS_SAME)
					break;///THROW_BZS_ERROR_WITH_CODEMSG(1, "connot seek percant position.");
				else if(ret == KEY_NEED_SGMENT_COPY)
					pk.copyFirstDeferentSegment();
				int v = percentage(keybufFirst, keybufLast, cu)-9000;
				(ov == v)?++sameCount:sameCount= 0;
				if (sameCount > 100)
					break;
				ov = v;
				if (v < -250)
				{
					memcpy(stbuf.get(), cu, keylen);
					st = stbuf.get();
					forwoard = true;
				}else if (v > 250)
				{
					memcpy(lsbuf.get(), cu, keylen);
					en = lsbuf.get();
					forwoard = false;
				}else
					break;
			}
			memcpy(lsbufResult.get(), cu, keylen);
			pk.reset(stbufResult.get(), lsbufResult.get(), cu);
		
			pk.setKeyValueByPer( per, true);
		}
		seekKey(HA_READ_KEY_OR_NEXT);
	}
	
}

int table::percentage(uchar* first, uchar* last, uchar* cur)
{
	m_table->file->init_table_handle_for_HANDLER() ;
	KEY& key = m_table->key_info[m_keyNum];
	// 1 cur to last
	key_range minkey;
	minkey.key = cur;
	minkey.length = key.key_length;
	minkey.keypart_map =  keymap();
	minkey.flag = HA_READ_KEY_EXACT;
	key_range maxkey = minkey;
	maxkey.key = last;
	ha_rows rows1 = m_table->file->records_in_range(m_keyNum, &minkey, &maxkey); 
			
	//2 first to last
	maxkey.key = first;
	ha_rows rows2 = m_table->file->records_in_range(m_keyNum, &maxkey, &minkey); 

	//3 record count
	ha_rows total = recordCount(true);
			
	//result
	int v1 =10000-(int)(rows1*(double)10000/total);

	int v2 =(int)(rows2*(double)10000/total);
	if (abs(5000-v1) > abs(5000-v2))
		return v1;
	return  v2;
}

void table::calcPercentage()
{	
	if (!keyCheckForPercent())
	{
		m_stat = STATUS_INVALID_KEYNUM;
		return;
	}
	m_percentResult = 0;
	//The present key value is copied.
	uchar keybufCur[MAX_KEYLEN]={0x00};
	key_copy(keybufCur, m_table->record[0], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);

	uchar keybufFirst[MAX_KEYLEN]={0x00};
	uchar keybufLast[MAX_KEYLEN]={0x00};
	preBuildPercent(keybufFirst, keybufLast);

	if (m_stat == 0)
	{	//restore current
		setKeyValues(keybufCur, 128);
		seekKey(HA_READ_KEY_EXACT);
		if (m_stat == 0)
			m_percentResult =  percentage(keybufFirst,keybufLast, keybufCur);
	}
}

void table::stepFirst()
{
	if (m_table->s->primary_key < m_table->s->keys)
	{
		setKeyNum(m_table->s->primary_key);
		getFirst();
	}else
	{
		if (setNonKey(true))
		{
			m_stat = m_table->file->ha_rnd_next(m_table->record[0]);
			m_cursor = m_validCursor = (m_stat == 0);
		}
		else
			m_stat = STATUS_INVALID_KEYNUM;
	}
}

void table::stepLast()
{
	if (m_table->s->primary_key < m_table->s->keys)
	{
		setKeyNum(m_table->s->primary_key);
		getLast();
	}else 
		m_stat = STATUS_NOSUPPORT_OP;	
}

void table::stepNext()
{
	m_nonNcc = false;
	if (m_table->s->primary_key < m_table->s->keys)
	{
		setKeyNum(m_table->s->primary_key);
		getNext();
	}else 
	{
		if (m_keyNum != -2)
		{
			if (setNonKey(false))
			{
				m_stat = m_table->file->ha_rnd_pos(m_table->record[0], (uchar*)position(true));
				if (m_stat != 0)return;
			}
		}
		m_stat = m_table->file->ha_rnd_next(m_table->record[0]);
		m_cursor = m_validCursor = (m_stat == 0);
	}
}

void table::stepPrev()
{
	m_nonNcc = false;
	if (m_table->s->primary_key < m_table->s->keys)
	{
		setKeyNum(m_table->s->primary_key);
		getPrev();
	}
	else
		m_stat = STATUS_NOSUPPORT_OP;	
}

void table::readRecords(IReadRecordsHandler* hdr, bool includeCurrent, int type)
{
	if ((m_table->file->inited != handler::INDEX) || !m_cursor)
	{
		m_stat = STATUS_NO_CURRENT;
		return;
	}
	m_nonNcc = false;
	int reject = (hdr->rejectCount()==0)?4096:hdr->rejectCount();
	int rows = hdr->maxRows();
	
	//Is a current position read or not? 
	bool read = !includeCurrent;
	bool unlock = (!m_db.inSnapshot() && !m_db.inTransaction()) || (m_db.inTransaction() && (m_db.transactionType()== 0));
	while((reject!=0) && (rows!=0))
	{
		if (read)
		{
			
			if (unlock && !m_nounlock && m_validCursor)
			{
				m_table->file->unlock_row();
				m_nounlock = false;
			}

			if (type == READ_RECORD_GETNEXT)
				m_stat = m_table->file->ha_index_next(m_table->record[0]);
			else if (type == READ_RECORD_GETPREV)
				m_stat = m_table->file->ha_index_prev(m_table->record[0]);
			m_cursor = m_validCursor = (m_stat == 0);
		}else
			read = true;

		
		if (m_stat)	
			break;
		int ret = hdr->match(type == READ_RECORD_GETNEXT);
		if (ret == REC_MACTH)
		{
			m_stat = hdr->write(position(), posPtrLen());
			if (m_stat) break;
			--rows;
		}
		else if (ret == REC_NOMACTH_NOMORE)
		{
			m_stat = STATUS_REACHED_FILTER_COND;
			return ;
		}
		else
			--reject;	
	}
	//m_cursor = m_validCursor = (m_stat == 0);
	if (reject ==0)
		m_stat = STATUS_LIMMIT_OF_REJECT;
	
	
}

/*  seek to pos by ref
 *  need before set keybuf and keynum
 */
//private
void table::seekPos(const uchar* rawPos) 
{
	seekKey(HA_READ_KEY_OR_NEXT);
	if (m_keyNum == m_table->s->primary_key)
		return;
	int cmp;
	while ((m_stat==0) && ((cmp = m_table->file->cmp_ref(position(true), rawPos))!=0))
	{
		unlockRow();
		m_table->file->ha_index_next_same(m_table->record[0], &m_keybuf[0], keymap());
	}
}

void table::movePos(const uchar* pos, char keyNum, bool sureRawValue)
{
	const uchar* rawPos = pos;
	if (!sureRawValue && (m_table->file->ref_length > REF_SIZE_MAX))
		rawPos  = bms()->getRefByBm(*(unsigned int*)pos);

	setNonKey();
	unlockRow();
	m_stat = m_table->file->ha_rnd_pos(m_table->record[0], (uchar*)rawPos);
	m_cursor =  (m_stat == 0);
	if (keyNum==-1)
		return ;
	if (m_stat==0)
	{
		if (m_keyNum != keyNum)
		{// need key change
			key_copy(&m_keybuf[0], m_table->record[0], &m_table->key_info[keyNum], KEYLEN_ALLCOPY);
			//It seek(s) until ref becomes the same, since it is a duplication key. 
			setKeyNum(keyNum);
			seekPos(rawPos);
		}
	}
}

bookmarks* table::bms() 
{
	if (m_bms==NULL)
		m_bms.reset(new bookmarks(m_table->file->ref_length));
	return m_bms.get();
}

/** get current record bookmark (position)
 *
 */
const uchar* table::position(bool raw)
{
	m_table->file->position(m_table->record[0]);// handler is set uniqu number to ref.
	if (!raw && (m_table->file->ref_length > REF_SIZE_MAX))
		return bms()->getBookmarkPtr(m_table->file->ref);
	return m_table->file->ref;
}

uint table::posPtrLen()const
{
	return std::min(m_table->file->ref_length, (uint)REF_SIZE_MAX) ;
}

ha_rows table::recordCount(bool estimate)
{
	if (estimate)
	{	//Since the answer of innodb is random, 1 returns also 0.
		//Since it is important, in the case of 1
		//, whether there is nothing or it is scan and investigate.
		m_table->file->info(HA_STATUS_VARIABLE | HA_STATUS_NO_LOCK);
		ha_rows rows =  m_table->file->records();
		if (rows>1)
			return rows;
	}
	uint n = 0;
	m_table->read_set= &m_table->tmp_set;
	bitmap_clear_all(m_table->read_set);
	setNonKey(true/*scan*/);
	m_stat = m_table->file->ha_rnd_next(m_table->record[0]);
	while (m_stat == 0)
	{
		n++;
		m_stat = m_table->file->ha_rnd_next(m_table->record[0]);
	}
	m_table->read_set = &m_table->s->all_set;
	return n;
}

void table::clearBuffer()
{
	unsigned char* p = m_table->record[0];
	empty_record(m_table);
}

bool table::isNisKey(char num) const
{
	if((num>=0) && (num < (short)m_table->s->keys))
	{
		Field* fd = m_table->key_info[num].key_part[0].field; //Nis is only in a head segment. 
		if (isNisField(fd->field_name))
			return true;
		else if((fd->pack_length() == 1) && (fd->type() == MYSQL_TYPE_TINY) && fd->null_bit)
			return true;
	}
	return false;
}

bool setNullIf(KEY& key)
{
	bool nullkey = false;
	Field* fd = key.key_part[0].field; //Nis is only in a head segment.
	if (isNisField(fd->field_name))
	{
		if(isNullNis(key, fd->field_name[3]=='a'))
		{
			fd->set_null();
			nullkey = true;
		}
		else
			fd->set_notnull();
	}
	else
	{
		for (int j=0;j<(int)key.user_defined_key_parts;j++)
		{
			fd = key.key_part[j].field;
			if (key.key_part[j].null_bit && fd->ptr)
			{
				if (isNull(fd))
				{
					fd->set_null();
					nullkey = true;
				}else
					fd->set_notnull();
			}
		}
	}
	return nullkey;
}

/** Sets null value for all null able key fields
 *  @return null sets field count
 */
int table::setKeyNullFlags()
{
	int setCount = 0;
	if (m_table->s->null_fields)
	{
		for (int i=0;i<(int)m_table->s->keys;i++)
		{
			KEY& key = m_table->key_info[i];
			if (key.flags & HA_NULL_PART_KEY)
			{
				bool nullKey = setNullIf(key);
				if (nullKey && (i == m_keyNum))
					++setCount;
			}
		}
	}
	return setCount;
}

/** Sets null value for all null able fields
 */
void table::setFiledNullFlags()
{
	std::vector<Field*>::iterator it = m_nonKeySegNullFields.begin();
	while (it != m_nonKeySegNullFields.end())
	{
		if (isNull(*it))
			(*it)->set_null();
		else
			(*it)->set_notnull();
		++it;
	}
}

__int64 table::insert(bool ncc)
{
	if (!cp_is_write_lock(m_table->file))
	{
		m_stat = STATUS_INVALID_LOCKTYPE;
		return 0;
	}
	__int64 autoincValue = 0;
	
	{
		autoincSetup setup(m_table);
		if (!ncc)
			key_copy(&m_nonNccKeybuf[0], m_table->record[1], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);
		setKeyNullFlags();
		setFiledNullFlags();

		m_stat = m_table->file->ha_write_row(m_table->record[0]);
		autoincValue = m_table->file->insert_id_for_cur_row;
		
		if (m_stat==0 &&  m_table->file->insert_id_for_cur_row)
		{
			if (!m_bulkInserting)
				m_table->file->ha_release_auto_increment();
		}
	}
	
	if (m_stat==0)
	{
		if (!ncc)//innodb default is ncc=-1.
			m_nonNcc = true;
		else if (!m_bulkInserting)
			key_copy(&m_keybuf[0], m_table->record[0], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);
		m_cursor = m_validCursor = m_nounlock = (m_stat == 0);

		m_changed  = true;
	}
	return autoincValue;
}

void table::beginUpdate(char keyNum)
{
	m_table->file->try_semi_consistent_read(1); 
	beginDel();
	if (m_stat==0)
	{
		if (keyNum >= 0)
		{
			key_copy(&m_nonNccKeybuf[0], m_table->record[0], &m_table->key_info[keyNum], KEYLEN_ALLCOPY);
			setKeyNum(keyNum);
		}
		store_record(m_table, record[1]);
	}
}

void table::beginDel()
{
	if (m_cursor)
	{
		m_stat = 0;
		/* The current position is established in advance.
		 If not in transaction then m_validCursor=false */ 
		if (m_validCursor == false)
		{
			store_record(m_table, record[1]);
			if (m_keyNum>=0)
			{
				//seek until ref is same.
				uchar rawPos[128];
				memcpy(rawPos, position(true), m_table->file->ref_length);
				seekPos(rawPos);
			}
			else
				movePos(position(true), -1, true);
			if (cmp_record(m_table, record[1]))
				m_stat = STATUS_CHANGE_CONFLICT;
			
			m_cursor = m_validCursor = (m_stat == 0);
			if (m_stat)
				return ;
		}
		
	}else
		m_stat = STATUS_NO_CURRENT;
}

/** Update current record.
 *  It is indispensable that there is a current record in advance 
 *  and beginUpdate() is called. 
 */
void table::update(bool ncc)
{
	if (m_stat == 0)
	{

		int nullFieldsOfCurrentKey = setKeyNullFlags();
		setFiledNullFlags();
		m_stat = m_table->file->ha_update_row(m_table->record[1], m_table->record[0]);
		if (m_stat==0 || (m_stat==HA_ERR_RECORD_IS_THE_SAME))
		{
			m_stat = 0;
			m_nonNcc = false;
			if (!ncc)//innodb default is ncc=-1.
			{
				//Only when the present key value is changed 
				if (m_keyNum>=0)
				{
					const KEY& key = m_table->key_info[m_keyNum];
					key_copy(&m_keybuf[0], m_table->record[0], (KEY*)&key, KEYLEN_ALLCOPY);
					if (memcmp(&m_nonNccKeybuf[0], &m_keybuf[0], key.key_length))
					{
						//Since the NULL key was set, a current position is lost. 
						if (nullFieldsOfCurrentKey==0)
							m_nonNcc = true;
					}
				}
			}
			m_cursor = m_validCursor = m_nounlock = (m_stat == 0);
		}
	}
	if (m_stat==0)
		m_changed  = true;
	m_table->file->try_semi_consistent_read(0); 
}

/** del current record. 
 *  It is indispensable that there is a current record in advance 
 *  and beginDel() is called.
 */ 
void table::del()
{
	if (m_stat == 0)
		m_stat = m_table->file->ha_delete_row(m_table->record[0]);
	if (m_stat==0)
		m_changed  = true;
}

/** The offset position of the last VAR field data
 */
unsigned short table::lastVarFieldPos()const
{	
	if (m_table->s->varchar_fields && (m_recordFormatType == RF_FIXED_PLUS_VALIABLE_LEN))		
		return (unsigned short)(lastVarFiled()->ptr - m_table->s->field[0]->ptr);
	return 0;
}

/** The data length of the field 
 */
unsigned short table::fieldDataLen(int fieldNum) const
{
	Field* fd =  m_table->field[fieldNum];
	if (isVarType(fd->type()))
		return var_strlen(fd);
	return fd->pack_length();
}

const char* table::keyName(char keyNum)
{
	if((keyNum>=0) && (keyNum < (short)m_table->s->keys))
	{
		KEY& key = m_table->key_info[keyNum];
		return key.name;
	}
	return "";
}

int table::keynumByName(const char* name)const
{
	if (*name==0x00)
		name = "PRIMARY";
	for (int i=0; i<(int)m_table->s->keys; i++)
	{
		if (strcmp(m_table->key_info[i].name, name) == 0)
			return i;
	}
	THROW_BZS_ERROR_WITH_CODEMSG(STATUS_INVALID_KEYNAME, name);
}

void table::startBulkInsert(ha_rows rows)
{
	m_table->file->ha_start_bulk_insert(rows);
	m_bulkInserting = true;
}

void table::endBulkInsert()
{
	if (m_bulkInserting)
	{
		key_copy(&m_keybuf[0], m_table->record[0], &m_table->key_info[m_keyNum], KEYLEN_ALLCOPY);
		m_bulkInserting = false;
		m_table->file->ha_release_auto_increment();
		m_table->file->ha_end_bulk_insert();
	}
}

const char* table::valStr(int filedNum, int &size)
{
	assert((filedNum>=0) && (filedNum < (int)m_table->s->fields));

	Field* fd = m_table->field[filedNum];
	size = -1;
	if (fd->is_null())
		return "";
	else
		fd->val_str(&m_str, &m_str);
	size = m_str.length();
	return m_str.c_ptr();
	
}
	
uint table::makeBlobFieldList(int fieldNum)
{
	m_blobBuffer->clear();
	int st = fieldNum==-1?0:fieldNum;
	int en = fieldNum==-1?m_table->s->fields:fieldNum+1;
	uint count = 0;
	for (int i=st;i<en;i++)
	{
		Field* fd = m_table->field[fieldNum];
		if (isBlobType(fd->type()))
		{
			m_blobBuffer->addBlob(blob_len(fd), fd->field_index, fd->ptr + blob_var_bytes(fd));
			count++;
		}
	}
	m_blobBuffer->setFieldCount(count);
	return count;
}

#ifdef USE_HANDLERSOCKET
int table::fieldIndexByName(const char* name)const
{
	int index = 0;
	for (Field** fd=m_table->field ; *fd; ++fd)
	{
		if (strcmp(name, (*fd)->field_name)==0)
			return index;
		++index;
	}
	THROW_BZS_ERROR_WITH_CODEMSG(STATUS_INVALID_FIELDNAME, name);
}

void table::setUseFieldList(const std::string& csv)
{
	std::vector< std::string> values ;
	split(values, csv, ",");
	for (int i=0;i<values.size();i++)
		addUseField(fieldIndexByName(values[i].c_str()));

}

inline void setSegmentValue(const KEY_PART_INFO& segment, const std::string& v)
{
	segment.field->set_notnull();
	if (!((v.size() == 1) && (v[0] == 0x00)))
		segment.field->store(v.c_str(), (uint)v.size(), &my_charset_bin);
	else
		segment.field->set_null();
}

void table::setKeyValues(const std::vector<std::string>& values, int keypart, const std::string* inValue)
{
	KEY& key = m_table->key_info[m_keyNum];
	for (int i=0;i<(int)key.user_defined_key_parts;i++)
		if (i < values.size())
			setSegmentValue(key.key_part[i], values[i]);
	if (keypart !=-1)
		setSegmentValue(key.key_part[keypart], *inValue);
	key_copy(&m_keybuf[0], m_table->record[0], &key, KEYLEN_ALLCOPY);

}

void table::setValue(int index, const std::string& v, int type)
{
	Field* field = *(m_table->field+index);
	if ((v.size() == 1) && (v[0] == 0x00))
		field->set_null();
	else
		field->set_notnull();
	if ((type == UPDATE_INC) || (type == UPDATE_DEC))
	{
		__int64 old = field->val_int();
		__int64 intv = _atoi64(v.c_str());
		if (type == UPDATE_INC)
			field->store(old + intv , false);
		else
			field->store(old - intv , false);
	}else
		field->store(v.c_str(), (uint)v.size(), &my_charset_bin);
}

void table::setUseValues(const std::vector<std::string>& values, int type)
{
	for (int i=0;i<values.size();i++)
	{
		if (useFields().size()>i)
			setValue(m_useFields[i], values[i], type);
	}
}

void table::checkFiledIndex(int index)
{
	assert(index>=0);
}

#endif //USE_HANDLERSOCKET

}//namespace mysql
}//namespace engine
}//namespace db
}//namespace bzs