?? c_shm_merge.cpp
字號:
/***********************************************************************
* Module: c_shm_merge.cpp
* Author: Administrator
* Modified: 2005年9月15日 9:03:22
* Purpose: class c_shm_merge
* Comment: 共享內存實時合帳類
***********************************************************************/
#include "c_shm_merge.h"
vector<MAIN_KEY_INFO> g_main_key;
int itemComp( const void *arg1, const void *arg2 )
{
//return strcmp( ((SHM_MERGE_LIST*)arg1)->main, ((SHM_MERGE_LIST*)arg2)->main );
int i,comp_value;
for(i=0; i<g_main_key.size(); i++)
{
if( g_main_key[i].type == STRING_TYPE_D )
comp_value = strcmp( &((((SHM_MERGE_LIST*)arg1)->main)[g_main_key[i].pos]), &((((SHM_MERGE_LIST*)arg2)->main)[g_main_key[i].pos]) );
else
comp_value = memcmp( &((((SHM_MERGE_LIST*)arg1)->main)[g_main_key[i].pos]), &((((SHM_MERGE_LIST*)arg2)->main)[g_main_key[i].pos]), g_main_key[i].size );
//cout<<g_main_key[i].type<<"|"<<g_main_key[i].pos<<"|"<<g_main_key[i].size<<"|"<<comp_value<<"|"<<&((((SHM_MERGE_LIST*)arg2)->main)[g_main_key[i].pos])<<"|"<<&((((SHM_MERGE_LIST*)arg1)->main)[g_main_key[i].pos])<<"|"<<endl;
if( comp_value != 0 )
return comp_value;
}
return comp_value;
}
int listItemComp( const void *arg1, const void *arg2 )
{
return ((ACCT_ITEM_FEE*)arg1)->key - ((ACCT_ITEM_FEE*)arg2)->key ;
}
bool lessByItemKey( const ACCT_ITEM_FEE& tmp1, const ACCT_ITEM_FEE& tmp2 )
{
return tmp1.key < tmp2.key;
/*char buf1[30], buf2[30];
memcpy( buf1, &(tmp1.key), 4 );
memcpy( buf2, &(tmp2.key), 4 );
short int item_type1, item_type2, item_source1, item_source2;
memcpy( &item_type1, &buf1[0], 2 );
memcpy( &item_type2, &buf2[0], 2 );
if( item_type1 != item_type2 )
{
return item_type1 < item_type2 ;
}
else
{
memcpy( &item_source1, &buf1[2], 2 );
memcpy( &item_source2, &buf2[2], 2 );
return item_source1 < item_source2 ;
}*/
}
int serialComp( const void *arg1, const void *arg2 )
{
return (*((int*)arg1)) - (*((int*)arg2)) ;
}
//比較serv_id和計費方式
int servComp( const void *arg1, const void *arg2 )
{
//return strcmp( ((SHM_MERGE_LIST*)arg1)->main, ((SHM_MERGE_LIST*)arg2)->main );
int comp_value;
char buff1[20], buff2[20];
memcpy( buff1, &((((SHM_MERGE_LIST*)arg1)->main)[g_main_key[0].pos]), g_main_key[0].size );
buff1[ g_main_key[0].size ] = '\0';
memcpy( buff2, &((((SHM_MERGE_LIST*)arg2)->main)[g_main_key[0].pos]), g_main_key[0].size );
buff2[ g_main_key[0].size ] = '\0';
comp_value = atoi(buff1) - atoi(buff2 );
if( comp_value != 0 )
{
return comp_value;
}
else
{
memset(buff1,0, g_main_key[1].size);
memset(buff2,0, g_main_key[1].size);
memcpy( buff1, &((((SHM_MERGE_LIST*)arg1)->main)[g_main_key[1].pos]), g_main_key[1].size );
buff1[ g_main_key[1].size ] = '\0';
memcpy( buff2, &((((SHM_MERGE_LIST*)arg2)->main)[g_main_key[1].pos]), g_main_key[1].size );
buff2[ g_main_key[1].size ] = '\0';
comp_value = atoi(buff1) - atoi(buff2 );
//cout<<buff1<<":"<<buff2<<":"<<comp_value<<endl;
return comp_value;
}
}
//add by renkm, 20060415, 只比較serv_id
int servNewComp( const void *arg1, const void *arg2 )
{
//return strcmp( ((SHM_MERGE_LIST*)arg1)->main, ((SHM_MERGE_LIST*)arg2)->main );
int comp_value;
char buff1[20], buff2[20];
memcpy( buff1, &((((SHM_MERGE_LIST*)arg1)->main)[g_main_key[0].pos]), g_main_key[0].size );
buff1[ g_main_key[0].size ] = '\0';
memcpy( buff2, &((((SHM_MERGE_LIST*)arg2)->main)[g_main_key[0].pos]), g_main_key[0].size );
buff2[ g_main_key[0].size ] = '\0';
comp_value = atoi(buff1) - atoi(buff2 );
return comp_value;
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::c_shm_merge()
// Purpose: 構造函數
// Return:
////////////////////////////////////////////////////////////////////////
c_shm_merge::c_shm_merge()
{
//p_share_info = new c_share_info();
//p_share_info->loadAllInfo();
int i;
for ( i = 0 ; i < MAX_ITEM_COUNT ; i ++ )
{
p_merge_item[i] = new c_shm_merge_item( this );
}
p_merge_addition = new c_shm_merge_addition( this );
v_main_key.reserve(10);
v_item_key.reserve(10);
v_item_seq.reserve(10);
get_next_pos == -1;
main_key_size = 0;
max_addition_count = 0;
p_find_charge_main = NULL;
//cout<<"sizeof pthread_mutex_t:"<<sizeof(pthread_mutex_t)<<endl;
i_item_seq=0;
i_sort_seq=1;
i_element_seq=0;
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::~c_shm_merge()
// Purpose: 析構函數
// Comment: 刪除c_share_info對象
// Return:
////////////////////////////////////////////////////////////////////////
c_shm_merge::~c_shm_merge()
{
int i;
for ( i = 0 ; i < MAX_ITEM_COUNT ; i ++ )
{
delete p_merge_item[i];
}
delete p_merge_addition;
//delete p_share_info;
return;
}
/*void c_shm_merge::init( char* mem_name )
{
SHARE_MEM_INFO* tmp = p_share_info->getMemInfo( mem_name);
if( tmp == NULL )
{
printf("不存在%s的共享內存\n", mem_name );fflush(stdout);
exit(1);
}
c_shm newshm(tmp->share_area_id);
newshm.getshm();
c_shm_merge* newmem = newshm.get_mem(mem_name);
p_share_mem_info = newmem->p_share_mem_info;
p_stShareInfo = newmem->p_stShareInfo;
p_field_info = newmem->p_field_info;
head_point = newmem->head_point;
//生成鎖
append_mutex._mutex = newmem->append_mutex._mutex;
record_count_mutex._mutex = newmem->record_count_mutex._mutex;
v_update_mutex.clear();
for( int i = 0 ; i < MAX_ITEM_COUNT ; i ++ )
{
c_mutex t_mutex;
t_mutex._mutex = newmem->p_stShareInfo->update_lock[i];
v_update_mutex.push_back( t_mutex );
}
append_key_mutex._mutex = newmem->append_key_mutex._mutex;
getItemShm();
//拷貝路徑
strcpy( file_path, newmem->file_path );
strcpy( backup_dir, para.getChar( "shm", "ShmBackupDir") );
max_backup_num = para.getInt( "shm", "MaxBackupNum" );
}*/
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::loadData()
// Purpose: 加載數據，繼承類可以重寫，在初始化后一次調用
// Return: int 成功：0 失敗：errMemDelete，errAppenElement
////////////////////////////////////////////////////////////////////////
int c_shm_merge::loadData(const int sql_seq)
{
return 0;
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::unloadData()
// Purpose: 卸載數據
// Comment: 修改標志，同時，將記錄數修改為0
// Return: int，成功：0，失敗：errMemUnload
////////////////////////////////////////////////////////////////////////
int c_shm_merge::unloadData()
{
return 0;
}
int c_shm_merge::appendElement(void* p_main, void* p_item_key, void* p_item)
{
int mem_seq = getMergeItemSeq( p_main );
v_update_mutex[mem_seq].enterMutex();
int tmp = p_merge_item[mem_seq]->addRecord( p_main, p_item_key, p_item );
v_update_mutex[mem_seq].leaveMutex();
return tmp;
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::appendElement( void * p_element )
// Purpose: Implementation of c_shm_merge::appendElement( void * p_element )
// Comment: 在原有數據的后面添加一條記錄，同時把記錄數加1。用鎖。
// Return: int，成功:0，失敗errMemLimited
////////////////////////////////////////////////////////////////////////
int c_shm_merge::appendElement( void * p_element )
{
char* p_point = ( char * ) p_element;
//確定是在哪一個小塊中
//cout<<"main:"<<v_mem_field_info[v_main_key[0]].field_pos<<"\t"<<(char*)&p_point[v_mem_field_info[v_main_key[0]].field_pos]<<endl
// <<"key:"<<v_item_key[0]<<"\t"<<v_mem_field_info[v_item_key[0]].field_pos<<"\t"<<*(int*)&(p_point[v_mem_field_info[v_item_key[0]].field_pos])<<endl
// <<"item:"<<*(int*)&(p_point[v_mem_field_info[v_item_seq[0]].field_pos])<<endl;
int mem_seq = getMergeItemSeq( &p_point[v_mem_field_info[v_main_key[1]].field_pos] );
return p_merge_item[mem_seq]->addRecord(
&(p_point[v_mem_field_info[v_main_key[0]].field_pos]),
&(p_point[v_mem_field_info[v_item_key[0]].field_pos]),
&(p_point[v_mem_field_info[v_item_seq[0]].field_pos]) );
//////////////////////只用一塊
//return p_merge_item[0]->addRecord(
// &(p_point[v_mem_field_info[v_main_key[0]].field_pos]),
// &(p_point[v_mem_field_info[v_item_key[0]].field_pos]),
// &(p_point[v_mem_field_info[v_item_seq[0]].field_pos]) );
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::deleteElement(int seq)
// Purpose: Implementation of c_shm_merge::deleteElement()
// Comment: 刪除時做一個刪除標記。
// Return: int
////////////////////////////////////////////////////////////////////////
int c_shm_merge::deleteElement( int seq )
{
return 0;
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::updateElement( int seq, void* element_value )
// Purpose: Implementation of c_shm_merge::updateElement( int seq, void* element_value )
// Comment: 實時合帳類，修改記錄時，直接修改數據。
// Return: int
////////////////////////////////////////////////////////////////////////
int c_shm_merge::updateElement( int seq, void* element_value )
{
return 0;
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::appendElement()
// Purpose: Implementation of c_shm_merge::appendElement()
// Comment: 添加記錄。
// 使用該函數，須先使用SetData，將記錄內容添加到buff中，添加時，從buff中獲取要修改的記錄內容。
// Return: int，成功:0，失敗errMemLimited
////////////////////////////////////////////////////////////////////////
int c_shm_merge::appendElement()
{
return appendElement(buff);
}
////////////////////////////////////////////////////////////////////////
// Name: c_shm_merge::updateElement( int seq )
// Purpose: Implementation of c_shm_merge::updateElement( int seq )
// Comment: 修改時， 不能修改關鍵字， 只能修改非關鍵字的部分。
// 使用該函數，須先使用SetData，將記錄內容添加到buff中，更新時，從buff中獲取要修改的記錄內容。
// Return: int，成功，0，失敗：errNoDataSeq, errDataDelete, errChangeKeyValue
////////////////////////////////////////////////////////////////////////
int c_shm_merge::updateElement( int seq )
{
return updateElement( seq, buff );
}
int c_shm_merge::SetData( int seq, void * buf_v )
{
return c_shm_mem::SetData( seq, buf_v );
}
int c_shm_merge::getFieldValue(int seq, char* out_value)
{
return c_shm_mem::getFieldValue(seq, out_value);
}
//初始化各個子塊的指針
int c_shm_merge::createItemShm()
{
//計算item_size;
item_size = p_share_mem_info->mem_size - SHM_ITEM_SIZE * MAX_ITEM_COUNT ;
if ( item_size < 0 )
{
cout<<"塊大小"<<p_share_mem_info->mem_size<<"小于"<<MAX_SERIAL_COUNT*12 + SHM_ITEM_SIZE*MAX_ITEM_COUNT<<"，不足分配!"<<endl;
exit(1);
}
int i = 0;
//int* count;
////////////////////用多塊的情況
p_serial_list = (int*)head_point;
p_serial_list[1] = 0;
p_serial_list[0] = 0;
//p_shm_mem_load->addition_point = &(p_shm_mem_load->head_point[p_shm_mem_load->p_share_mem_info->mem_size-p_shm_mem_load->p_share_mem_info->addition_size]);
SHM_MERGE_INFO t;
for( i = 0 ; i < MAX_ITEM_COUNT ; i ++ )
{
p_merge_item[i]->p_merge_info =(SHM_MERGE_INFO*)(head_point + MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE*i);
p_merge_item[i]->p_merge_info->add_record_count = 0;
p_merge_item[i]->p_merge_info->record_count = 0;
p_merge_item[i]->p_merge_info->sort_count = 0;
p_merge_item[i]->p_merge_info->unsort_find_count = 0;
p_merge_item[i]->head_point = head_point + MAX_SERIAL_COUNT*4+ SHM_ITEM_SIZE*i + ITEM_HEAD_COUNT ;
p_merge_item[i]->add_head_point = head_point + MAX_SERIAL_COUNT*4 +SHM_ITEM_SIZE*(i+1) - SHM_ITEM_ADD;
p_merge_item[i]->p_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->head_point;
p_merge_item[i]->p_add_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->add_head_point;
}
p_merge_addition->p_merge_info = (SHM_MERGE_INFO*)(&head_point[MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE*MAX_ITEM_COUNT] );
p_merge_addition->p_merge_info->record_count = 0;
p_merge_addition->p_merge_info->add_record_count = 0;
p_merge_addition->p_merge_info->sort_count = 0;
p_merge_addition->p_merge_info->unsort_find_count = 0;
p_merge_addition->head_point = &head_point[MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE*MAX_ITEM_COUNT + ITEM_HEAD_COUNT];
p_merge_addition->p_merge_list_item = (SHM_MERGE_LIST_ITEM*) p_merge_addition->head_point;
/*
////////////////////只用一塊的情況
p_merge_item[0]->p_merge_info = (SHM_MERGE_INFO*)head_point;
p_merge_item[0]->p_merge_info->add_record_count = 0;
p_merge_item[0]->p_merge_info->record_count = 0;
p_merge_item[0]->head_point = (char*)head_point + ITEM_HEAD_COUNT ;
p_merge_item[0]->add_head_point = (char*)head_point + SINGLE_SHM_ITEM_SIZE - SHM_ITEM_ADD ;
p_merge_item[0]->p_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->head_point;
p_merge_item[0]->p_add_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->add_head_point;
p_merge_addition->p_merge_info = (SHM_MERGE_INFO*)(head_point + SINGLE_SHM_ITEM_SIZE );
p_merge_addition->p_merge_info->record_count = 0;
p_merge_addition->head_point = head_point + SINGLE_SHM_ITEM_SIZE + ITEM_HEAD_COUNT ;
p_merge_addition->p_merge_list_item = (SHM_MERGE_LIST_ITEM*) p_merge_addition->head_point;
*/
return 0;
}
int c_shm_merge::getItemShm()
{
item_size = p_share_mem_info->mem_size - SHM_ITEM_SIZE * MAX_ITEM_COUNT ;
if ( item_size < 0 )
{
cout<<"塊大小小于"<<SHM_ITEM_SIZE * MAX_ITEM_COUNT<<"K，不足分配!"<<endl;
exit(1);
}
int i = 0;
////////////////////用多塊的情況
p_serial_list = (int*)head_point;
for( i = 0 ; i < MAX_ITEM_COUNT ; i ++ )
{
p_merge_item[i]->p_merge_info = (SHM_MERGE_INFO*) (head_point + MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE * i );
p_merge_item[i]->head_point = head_point + MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE * i + ITEM_HEAD_COUNT ;
p_merge_item[i]->add_head_point = head_point + MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE * (i + 1) - SHM_ITEM_ADD ;
p_merge_item[i]->p_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->head_point;
p_merge_item[i]->p_add_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->add_head_point;
p_merge_item[i]->m_p_shm_merge_addition = p_merge_addition;
}
p_merge_addition->p_merge_info = (SHM_MERGE_INFO*)(head_point + MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE * MAX_ITEM_COUNT );
p_merge_addition->head_point = head_point + MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE * MAX_ITEM_COUNT + ITEM_HEAD_COUNT ;
p_merge_addition->p_merge_list_item = (SHM_MERGE_LIST_ITEM*) p_merge_addition->head_point;
max_addition_count = (p_share_mem_info->mem_size - MAX_SERIAL_COUNT*4 + SHM_ITEM_SIZE * MAX_ITEM_COUNT + ITEM_HEAD_COUNT - 10000)/4;
/*
////////////////////只用一塊的情況
p_merge_item[0]->p_merge_info = (SHM_MERGE_INFO*) (head_point + SINGLE_SHM_ITEM_SIZE * 0 );
p_merge_item[0]->head_point = head_point + SINGLE_SHM_ITEM_SIZE * 0 + ITEM_HEAD_COUNT ;
p_merge_item[0]->add_head_point = head_point + SINGLE_SHM_ITEM_SIZE * (0 + 1) - SHM_ITEM_ADD ;
p_merge_item[0]->p_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->head_point;
p_merge_item[0]->p_add_merge_list = (SHM_MERGE_LIST*) p_merge_item[i]->add_head_point;
p_merge_item[0]->m_p_shm_merge_addition = p_merge_addition;
p_merge_addition->p_merge_info = (SHM_MERGE_INFO*)(head_point + SINGLE_SHM_ITEM_SIZE );
p_merge_addition->head_point = head_point + SINGLE_SHM_ITEM_SIZE + ITEM_HEAD_COUNT ;
p_merge_addition->p_merge_list_item = (SHM_MERGE_LIST_ITEM*) p_merge_addition->head_point;
*/
return 0;
}
int c_shm_merge::setMainKey( const int field_seq )
{
v_main_key.push_back( field_seq );
MAIN_KEY_INFO temp;
int i;
int pos = 0;
for(i=0; i<g_main_key.size(); i++)
pos+=g_main_key[i].size;
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -