Sancaros/StoneAge
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
dfa7fee8ef
StoneAge/saac/db.c

1484 lines
40 KiB
C
Raw Normal View History

init commit
2018-08-07 15:51:35 +08:00
/*
<EFBFBD>¼<EFBFBD>ƽ<EFBFBD><EFBFBD><EFBFBD>봰 <EFBFBD><EFBFBD><EFBFBD>巸<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD>
1999 Aug 14 Created by ringo
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1 <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD><EFBFBD><EFBFBD>ƥ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ľ<EFBFBD>£<EFBFBD>
*/
#define _DB_C_
#include "db.h"
#include "main.h"
#include "util.h"
#include "version.h"
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <dirent.h>
#include <errno.h>
#include <string.h>
#include <sys/stat.h>
/* ٯ <20>޼<EFBFBD><DEBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> length */
//#define CHARVALUE_MAX 1024
#define MAXTABLE 16
// Spock 2000/10/12
#define CHARVALUE_MAX 256 // DB <20>ִ<EFBFBD><D6B4><EFBFBD><EFBFBD>ϵ<EFBFBD>buffer<65><72>С
#define KEY_MAX 64 // DB Key<65>ִ<EFBFBD><D6B4><EFBFBD>buffer<65><72>С
#define HASH_SIZE 65536 // Hash table һ<><D2BB><EFBFBD><EFBFBD><EFBFBD>ӵ<EFBFBD>Entry<72><79><EFBFBD><EFBFBD>
#define HASH_PRIME 65521 // Hash function ʹ<>õ<EFBFBD><C3B5><EFBFBD><EFBFBD><EFBFBD>
#define DBINIT_SIZE 16384 // DB ÿ<><C3BF><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Entry<72><79><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
// Spock end
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><C3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD>ۢ<EFBFBD><DBA2>1<EFBFBD><31>ëؤ<C3AB>մ<EFBFBD><D5B4>ʣ<EFBFBD> */
struct dbentry
{
int use;
// unsigned int keyhash; /* <20><><EFBFBD><EFBFBD>ƽ<EFBFBD><C6BD><EFBFBD><EFBFBD>˦<EFBFBD><CBA6><EFBFBD><EFBFBD>ب<EFBFBD><D8A8><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
int ivalue; /* <20><><EFBFBD><EFBFBD>ʧ<EFBFBD><CAA7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> NODE <20><> -1 ƥ<><C6A5>
<EFBFBD><EFBFBD><EFBFBD>ͻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʧ<EFBFBD><EFBFBD> 0 <EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƥئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD>*/
// int nextind; /* -1 <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> ë<><C3AB> <20><><EFBFBD><EFBFBD> */
// Spock 2000/10/12
int prev; // ǰһ<C7B0><D2BB>dbentry, -1<><31>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>Ϊhead
int next; // <20><>һ<EFBFBD><D2BB>dbentry, -1<><31>ʾ<EFBFBD><CABE><EFBFBD><EFBFBD>Ϊtail
char key[KEY_MAX];
char charvalue[CHARVALUE_MAX];
// char key[64]; /* <20><><EFBFBD><EFBFBD>ƽ<EFBFBD><C6BD><EFBFBD><EFBFBD>ئ<EFBFBD><D8A6> ٯ */
// int charvalue_index; /* ٯ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD><C3AB><EFBFBD><EFBFBD>index */
// Spock end
};
// Spock 2000/10/12
// Database hashtable
struct hashentry
{
char key[KEY_MAX]; // <20><><EFBFBD><EFBFBD>keyֵ
int use; // <20>Ƿ<EFBFBD><C7B7>ѱ<EFBFBD>ʹ<EFBFBD><CAB9>
int dbind; // ָ<><D6B8> dbentry <20><> index
int prev; // ͬһkeyֵ<79><D6B5><EFBFBD><EFBFBD>һ<EFBFBD><D2BB> hashentry, -1Ϊhead
int next; // ͬһkeyֵ<79><D6B5><EFBFBD><EFBFBD>һ<EFBFBD><D2BB> hashentry, -1Ϊtail
};
// Spock end
typedef enum
{
DB_INT_SORTED,
DB_STRING,
}DBTYPE;
/* 1<>ۼ<EFBFBD><DBBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><C3AC><EFBFBD><EFBFBD>ëؤ<C3AB>մ<EFBFBD><D5B4><EFBFBD> */
struct table
{
int use; // 0:δʹ<CEB4><CAB9> 1:<3A><>ʹ<EFBFBD><CAB9>
DBTYPE type; /* DB<44><42><EFBFBD><EFBFBD> */
char name[32]; /* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><C3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> */
int num; /* <20>޼<EFBFBD><DEBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
int toplinkindex;
// Spock 2000/10/12
struct hashentry *hashtable;
int hashsize;
int updated; // 0:dbflush<73><68>δ<EFBFBD><CEB4><EFBFBD><EFBFBD> 1:<3A>Ѹ<EFBFBD><D1B8><EFBFBD>
int ent_finder; // ָ<><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD>õ<EFBFBD> hashentry
// Spock end
};
struct dbentry *master_buf; /* <20>޼<EFBFBD><DEBC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʢ<EFBFBD><CAA2> */
int dbsize = 0; /* <20><>0ƥ<30><C6A5>1,2,4,8,16...*/
static int dbent_finder = 0;
struct table dbt[MAXTABLE];
static void dbShowAllTable(void);
// Spock 2000/10/12
int dbHash(char* s)
{
char *p;
unsigned int h= 0 ,g;
for( p = s ; *p ; p ++ ){
h = ( h<< 4 ) + (*p);
if( (g = h & 0xf0000000) != 0){
h = h ^ (g>>24);
h = h ^ g;
}
}
return h % HASH_PRIME;
}
// Spock end
/* Spock deleted 2000/10/12
struct charvalue
{
int use;
char buf[CHARVALUE_MAX];
};
struct charvalue *charvalue_buf;
int charvaluesize=0;
*/
/*
ٯ <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
/* Spock deleted 2000/10/12
int
reallocCharValue(void)
{
struct charvalue *previous = charvalue_buf;
struct charvalue *newbuf;
int new_charvaluesize;
if( charvaluesize == 0 ){
new_charvaluesize = 1;
} else {
new_charvaluesize = charvaluesize * 2;
}
newbuf = ( struct charvalue *) calloc( 1, new_charvaluesize *
sizeof( struct charvalue ));
if( newbuf == NULL ){
log( "reallocCharValue: memory shortage!! new_charvaluesize:%d\n",
new_charvaluesize );
return -1;
}
memset( newbuf, 0 , new_charvaluesize * sizeof( struct charvalue ));
if( previous) memcpy( (char*)newbuf, (char*)previous,
charvaluesize * sizeof( struct charvalue ));
free( previous );
charvaluesize = new_charvaluesize;
charvalue_buf = newbuf;
log( "reallocCharValue: "
"new_charvaluesize:%d Old address:%x New address:%x\n",
new_charvaluesize , (unsigned int )previous,
(unsigned int)newbuf );
return 0;
}
*/
/*
ٯ <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë1<EFBFBD>۴<EFBFBD>Իؤ<EFBFBD><EFBFBD><EFBFBD>£<EFBFBD>
<EFBFBD><EFBFBD>Իئ<EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>realloc<EFBFBD><EFBFBD><EFBFBD>£<EFBFBD>
*/
/* Spock deleted 2000/10/12
static int charvalue_finder=0;
static int
dbAllocCharValue( void )
{
int i;
for(i=0;i<charvaluesize;i++){
charvalue_finder++;
if( charvalue_finder == charvaluesize ) charvalue_finder =0;
if( charvalue_buf[charvalue_finder].use == 0 ){
charvalue_buf[charvalue_finder].use =1;
charvalue_buf[charvalue_finder].buf[0] = 0;
return charvalue_finder;
}
}
log( "dbAllocCharValue: charvalue array full. reallocating....\n" );
if( reallocCharValue() < 0 ){
log( "dbAllocCharValue: reallocation fail\n");
} else {
return dbAllocCharValue();
}
return -1;
}
*/
/*
charvalue <EFBFBD><EFBFBD><EFBFBD><EFBFBD>/<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>/<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int index : charvalue index
*/
/* Spock deleted 2000/10/12
static char *
dbGetString( int index )
{
return charvalue_buf[index].buf;
}
static int
dbSetString( int index , char *data )
{
int l = strlen(data);
if( l >= (sizeof( charvalue_buf[0].buf )-1)) return -1;
memcpy( charvalue_buf[index].buf , data, l+1 );
return 0;
}
*/
/*
DB<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>մ<EFBFBD>Իؤ<EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD>ʣ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>2 <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
0<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
static int
reallocDB( void )
{
struct dbentry *previous = master_buf;
struct dbentry *newbuf;
int new_dbsize;
/* Spock deleted 2000/10/12
if( dbsize == 0 ){
new_dbsize = 1;
} else {
new_dbsize = dbsize * 2;
}
*/
// Spock+1 2000/10/12
new_dbsize = dbsize + DBINIT_SIZE;
newbuf = (struct dbentry* ) calloc( 1, new_dbsize *
sizeof( struct dbentry) );
/* <20><>ƹ<EFBFBD><C6B9><EFBFBD><EFBFBD>Իئ<D4BB><D8A6> */
if( newbuf == NULL ){
log( "<EFBFBD><EFBFBD><EFBFBD>·<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: <20>ڴ治<DAB4><E6B2BB>!!! <20><><EFBFBD><EFBFBD><EFBFBD>ݴ<EFBFBD>С: %d\n", new_dbsize );
return -1;
}
/* <20><><EFBFBD>лõ<D0BB><C3B5><EFBFBD><EFBFBD><EFBFBD>ޥ<EFBFBD><DEA5><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƻ<EFBFBD> */
memset( newbuf , 0 , new_dbsize * sizeof( struct dbentry ) );
/* Spock deleted 2000/10/19
if( previous )memcpy( (char*)newbuf, (char*)previous,
dbsize * sizeof( struct dbentry ));
// <20><><EFBFBD>лõ<D0BB>ëݩ <20><>
free( previous );
*/
// Spock 2000/10/19
if ( dbsize > 0 )
{
memcpy( newbuf , previous , dbsize * sizeof(struct dbentry));
free( previous );
}
// Spock end
dbent_finder = dbsize; // <20><> dbent_finder ָ<><D6B8>δʹ<CEB4>õ<EFBFBD> entry
dbsize = new_dbsize;
master_buf = newbuf;
log( "<EFBFBD><EFBFBD><EFBFBD>·<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: <20><><EFBFBD><EFBFBD><EFBFBD>ݴ<EFBFBD>С:%d <20>ɵ<EFBFBD>ַ: %x <20>µ<EFBFBD>ַ:%x\n",
new_dbsize , (unsigned int)previous, (unsigned int)newbuf );
return 0;
}
/*
allocate a node
*/
static int
//dbAllocNode( DBTYPE type )
// Spock +1 2000/10/13
dbAllocNode()
{
int i;
for(i=0;i<dbsize;i++){
dbent_finder ++;
if( dbent_finder == dbsize ) {
dbent_finder = 0;
}
if( master_buf[dbent_finder].use == 0 ){
master_buf[dbent_finder].use = 1;
/* Spock deleted 2000/10/12
// int ƥ<><C6A5><EFBFBD>͵<EFBFBD><CDB5><EFBFBD> <20><><EFBFBD>б<EFBFBD>stringbufferë <20><><EFBFBD>DZ<EFBFBD><C7B1><EFBFBD><EFBFBD><EFBFBD> kawata
if( type == DB_STRING || type == DB_INT_SORTED){
if( ( master_buf[dbent_finder].charvalue_index =
dbAllocCharValue() ) < 0 ){
// ٯ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Իئ<D4BB><D8A6><EFBFBD><EFBFBD>
return -1;
}
}
*/
return dbent_finder;
}
}
log( "<EFBFBD><EFBFBD><EFBFBD>ݽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʧ<EFBFBD><EFBFBD>. <20><><EFBFBD>·<EFBFBD><C2B7><EFBFBD><EFBFBD><EFBFBD>....\n" );
if( reallocDB() < 0 ){
log( "<EFBFBD><EFBFBD><EFBFBD>·<EFBFBD><EFBFBD><EFBFBD>ʧ<EFBFBD><EFBFBD>\n" );
} else {
//return dbAllocNode( type );
// Spock 2000/10/13
master_buf[dbent_finder].use = 1;
log( "<EFBFBD><EFBFBD><EFBFBD><EFBFBD>̽<EFBFBD><EFBFBD>=%d\n" , dbent_finder );
return dbent_finder;
// Spock end
}
return -1;
}
static void
dbReleaseNode( int index )
{
// Spock 2000/10/12
int prev = master_buf[index].prev;
int next = master_buf[index].next;
master_buf[index].use = 0;
if ( prev >= 0 ) master_buf[prev].next = next;
if ( next >= 0 ) master_buf[next].prev = prev;
// Spock end
/* Spock deleted 2000/10/12
if( master_buf[index].charvalue_index >= 0 ) {
charvalue_buf[ master_buf[index].charvalue_index].use = 0;
}
*/
}
void
dbShowLink( int topind )
{
int cur = topind;
log( "<EFBFBD><EFBFBD>ʼ<EFBFBD><EFBFBD> %d <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>\n", cur );
/* Spock deleted 2000/10/19
for(;;){
if( cur == -1 )break;
*/
// Spock +1 2000/10/19
while ( cur >= 0 )
{
if( master_buf[cur].use == 0 ){
log( "dbShowLink: use is 0! key:%s\n", master_buf[cur].key );
return;
}
// Spock +1 2000/10/12
log( "%s %i\n", master_buf[cur].key, master_buf[cur].ivalue );
/* Spock deleted 2000/10/12
log( "%s %u %i\n", master_buf[cur].key ,
master_buf[cur].keyhash, master_buf[cur].ivalue );
*/
cur = master_buf[cur].next;
}
}
// Spock 2000/10/13
static int
reallocHash( int dbi )
{
struct hashentry *previous = dbt[dbi].hashtable;
struct hashentry *newbuf;
int new_hashsize;
new_hashsize = dbt[dbi].hashsize + HASH_SIZE;
newbuf = (struct hashentry* ) calloc( 1, new_hashsize *
sizeof( struct hashentry) );
if( newbuf == NULL ){
log( "<EFBFBD><EFBFBD><EFBFBD>·<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϣ: <20>ڴ治<DAB4><E6B2BB>!!! <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϣ<EFBFBD><CFA2>С: %d\n", new_hashsize );
return -1;
}
memset( newbuf , 0 , new_hashsize * sizeof( struct hashentry ) );
if( previous )
{
memcpy( newbuf, previous,
dbt[dbi].hashsize * sizeof( struct hashentry ));
free( previous );
}
if ( dbt[dbi].hashsize > HASH_PRIME )
dbt[dbi].ent_finder = dbt[dbi].hashsize;
else
dbt[dbi].ent_finder = HASH_PRIME;
dbt[dbi].hashsize = new_hashsize;
dbt[dbi].hashtable = newbuf;
log( "<EFBFBD><EFBFBD><EFBFBD>·<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϣ: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϣ<EFBFBD><CFA2>С:%d <20>ɵ<EFBFBD>ַ: %x <20>µ<EFBFBD>ַ:%x\n",
new_hashsize , (unsigned int)previous, (unsigned int)newbuf );
return 0;
}
static int tableGetEntry( int dbi , char *k )
{
int hashkey = dbHash( k );
struct hashentry *hash = dbt[dbi].hashtable;
if ( hash[hashkey].use == 0 ) return -1;
while ( 1 ) {
// if ( hash[hashkey].use == 1 && strcmp( hash[hashkey].key , k ) == 0 ){
if ( hash[hashkey].use == 1 ){
if( strcmp( hash[hashkey].key , k ) == 0 )return hashkey;
}
hashkey = hash[hashkey].next;
if ( hashkey <= 0 ){
// log("err not found hash[%x] -%s!\n", hashkey, k)
return -1;
}
}
}
static int tableInsertNode( int dbi , char *k , int dbind )
{
int hashkey = dbHash( k );
int hashnext = -1;
int i;
struct hashentry *hash = dbt[dbi].hashtable;
if ( hash[hashkey].use == 0 ) {
strcpy( hash[hashkey].key , k );
hash[hashkey].use = 1;
hash[hashkey].dbind = dbind;
hash[hashkey].prev = -1;
hash[hashkey].next = -1;
dbt[dbi].num++;
return hashkey;
}else {
for ( i=0; i<dbt[dbi].hashsize-HASH_PRIME; i++ ){
dbt[dbi].ent_finder++;
if ( dbt[dbi].ent_finder >= dbt[dbi].hashsize )
dbt[dbi].ent_finder = HASH_PRIME;
if ( hash[dbt[dbi].ent_finder].use == 0 )
{
hashnext = dbt[dbi].ent_finder;
break;
}
}
if ( hashnext < HASH_PRIME )
{
log( "tableInsertNode: hashentry array full. reallocating....\n" );
if( reallocHash( dbi ) < 0 ){
log( "tableInsertNode: reallocation fail\n" );
return -1;
}
else
{
hash = dbt[dbi].hashtable;
hashnext = dbt[dbi].ent_finder;
}
}
strcpy( hash[hashnext].key , k );
hash[hashnext].use = 1;
hash[hashnext].dbind = dbind;
hash[hashnext].prev = hashkey;
hash[hashnext].next = hash[hashkey].next;
if ( hash[hashkey].next >= 0 )
hash[hash[hashkey].next].prev = hashnext;
hash[hashkey].next = hashnext;
dbt[dbi].num++;
return hashnext;
}
}
static void
tableReleaseNode( int dbi , int ind )
{
dbt[dbi].hashtable[ind].use = 0;
if ( dbt[dbi].hashtable[ind].prev >= 0 ){
dbt[dbi].hashtable[dbt[dbi].hashtable[ind].prev].next =
dbt[dbi].hashtable[ind].next;
}
if ( dbt[dbi].hashtable[ind].next >= 0 ){
dbt[dbi].hashtable[dbt[dbi].hashtable[ind].next].prev =
dbt[dbi].hashtable[ind].prev;
}
dbt[dbi].num--;
}
// Spock end
/*
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ëܸ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ľ<EFBFBD><EFBFBD><EFBFBD>գ<EFBFBD>ƽ<EFBFBD><EFBFBD>ë Ի<EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>£<EFBFBD>
<EFBFBD>Ĺ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>޷¡<EFBFBD>ƥ<EFBFBD><EFBFBD>ئ<EFBFBD>м<EFBFBD>ƥ0
*/
/* Spock deleted 2000/10/13
static int
dbExtractNodeByKey( int topind , char *k )
{
int cur = topind;
int prev = -1;
unsigned int h = hashpjw( k );
// <20><><EFBFBD><EFBFBD><EFBFBD>ͻ<EFBFBD><CDBB><EFBFBD>ƥ<EFBFBD><C6A5><EFBFBD>Ĺ<EFBFBD><C4B9><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD>з<EFBFBD><D0B7><EFBFBD>ئ<EFBFBD><D8A6>ƥ0ë<30><C3AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if( topind == -1 ) return 0;
for(;;){
if( cur == -1 )break;
if( master_buf[cur].keyhash == h
&& strcmp( master_buf[cur].key , k ) == 0 ){
// prev <20><> <20>ݻ<EFBFBD> cur <20><><EFBFBD>ݱ<EFBFBD>ئ<EFBFBD>·<EFBFBD><C2B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
if( prev == -1 ){
// <20><> <20><><EFBFBD><EFBFBD><EFBFBD>׼<EFBFBD>ƥ<EFBFBD><C6A5><EFBFBD><EFBFBD><EFBFBD>ͷ<EFBFBD><CDB7><EFBFBD>Ԫ<EFBFBD><D4AA>ئ<EFBFBD><D8A6>
} else {
master_buf[prev].nextind = master_buf[cur].nextind;
}
// <20><>ľƥ<C4BE><C6A5><EFBFBD>л<EFBFBD><D0BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>½ľ<C2BD>¼<EFBFBD>ƥݩ <20><><EFBFBD><EFBFBD>
dbReleaseNode( cur );
log( "find key %s deleted\n", k );
return 0;
}
prev = cur;
cur = master_buf[cur].nextind;
}
// not found
log( "dbExtractNodeBykey: %s not found\n" , k );
return 0;
}
*/
// Spock 2000/10/13
static int
dbExtractNodeByKey( int dbi , char *k )
{
int hashind = tableGetEntry( dbi , k );
if ( hashind < 0 ){
log( "dbExtractNodeByKey: tableGetEntry fail, key:%s\n" , k );
return -1;
}
if ( dbt[dbi].hashtable[hashind].dbind < 0 ){
log( "dbExtractNodeByKey: invalid dbind in hash, key:%s\n" , k );
return -1;
}
dbReleaseNode( dbt[dbi].hashtable[hashind].dbind );
tableReleaseNode( dbi , hashind );
return 0;
}
// Spock end
/* Spock deleted 2000/10/12
static int
dbGetEntryByKey( int topind , char *k )
{
int cur = topind;
unsigned int h = hashpjw( k );
if( topind == -1 ) return 0;
for(;;){
if( cur == -1 )break;
if( master_buf[cur].keyhash == h
&& strcmp( master_buf[cur].key, k ) == 0 ){
return cur;
}
cur = master_buf[cur].nextind;
}
return -1;
}
*/
/*
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ëܸ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ľ<EFBFBD><EFBFBD><EFBFBD>գ<EFBFBD><EFBFBD><EFBFBD>ë Ի<EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƻ<EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD><EFBFBD> Insert <EFBFBD><EFBFBD><EFBFBD>£<EFBFBD><EFBFBD><EFBFBD><EFBFBD>н<EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƥ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
/* Spock deleted 2000/10/13
static int
dbInsertNodeByIValue( int topind , int ins )
{
int cur = topind;
int prev = -1;
if( topind == -1 ) return -1;
for(;;){
if( cur == -1 ){
// <20><>ƥ<EFBFBD><C6A5><EFBFBD><EFBFBD><EFBFBD>׼<EFBFBD>ƥܰ<C6A5><DCB0><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
master_buf[prev].nextind = ins;
master_buf[ins].nextind = -1;
return 0;
}
if( master_buf[cur].ivalue < master_buf[ins].ivalue ){
if( prev == -1 ){
log( "top_node is badly configured\n" );
return -1;
}
master_buf[prev].nextind = ins;
master_buf[ins].nextind = cur;
return 0;
}
prev = cur;
cur = master_buf[cur].nextind;
}
return -1;
}
*/
// Spock 2000/10/13
static int
dbInsertNodeByIValue( int topind , int ins )
{
int cur = topind;
if ( (topind < 0)||(topind >= dbsize)||(ins < 0)||(ins >= dbsize ) )
return -1;
while ( master_buf[cur].next >= 0 ){
if ( master_buf[master_buf[cur].next].ivalue < master_buf[ins].ivalue )
break;
cur = master_buf[cur].next;
}
master_buf[ins].prev = cur;
master_buf[ins].next = master_buf[cur].next;
if ( master_buf[cur].next >= 0 )
master_buf[master_buf[cur].next].prev = ins;
master_buf[cur].next = ins;
return 0;
}
// Spock end
/* Spock deleted 2000/10/13
static int
dbAppendNode( int topind , int ins )
{
int cur =topind;
int prev = -1;
if( topind == -1 ) return -1;
for(;;){
if( cur == -1 ){
master_buf[prev].nextind = ins;
master_buf[ins].nextind = -1;
return 0;
}
prev = cur;
cur = master_buf[cur].nextind;
}
return -1;
}
*/
// Spock 2000/10/13
static int
dbAppendNode( int topind , int ins )
{
if ( (topind < 0)||(topind >= dbsize)||(ins < 0)||(ins >= dbsize ) )
return -1;
master_buf[ins].prev = topind;
master_buf[ins].next = master_buf[topind].next;
if ( master_buf[topind].next >= 0 )
master_buf[master_buf[topind].next].prev = ins;
master_buf[topind].next = ins;
return 0;
}
// Spock end
/*
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD>ë <EFBFBD>£<EFBFBD>db<EFBFBD><EFBFBD><EFBFBD>ѻ<EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD>м<EFBFBD>ƥ ɧ<EFBFBD><EFBFBD>strcmp<EFBFBD>ƻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
DBTYPE :<EFBFBD><EFBFBD> <EFBFBD><EFBFBD>
<EFBFBD><EFBFBD>ئԪئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> ٯ <EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>³<EFBFBD><EFBFBD>绥ƥ<EFBFBD><EFBFBD><EFBFBD>£<EFBFBD>
*/
static int
dbGetTableIndex( char *tname , DBTYPE type )
{
int i;
for(i=0;i<MAXTABLE;i++){
if( dbt[i].use && strcmp( dbt[i].name , tname ) == 0 &&
dbt[i].type == type ){
return i ;
}
}
/* <20>Ĺ<EFBFBD><C4B9><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD><D8A6><EFBFBD><EFBFBD><EFBFBD>׼<EFBFBD>ƥޥ<C6A5><DEA5><EFBFBD><EFBFBD> */
for(i=0;i<MAXTABLE;i++){
if( dbt[i].use == 0 ){
int topind;
dbt[i].use = 1;
dbt[i].type = type;
snprintf( dbt[i].name , sizeof( dbt[i].name ) , "%s", tname );
// Spock 2000/10/16
if ( reallocHash( i ) < 0 )
{
log( "<EFBFBD><EFBFBD><EFBFBD>·<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϣʧ<EFBFBD><EFBFBD>\n");
return -2;
}
dbt[i].ent_finder = HASH_PRIME;
// Spock end
//topind = dbAllocNode( type );
// Spock +1 2000/10/16
topind = dbAllocNode();
if( topind < 0 ){
log( "<EFBFBD><EFBFBD><EFBFBD>ݷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ڵ<EFBFBD>ʧ<EFBFBD><EFBFBD>\n" );
return -2;
}
/* Spock deleted 2000/10/16
snprintf( master_buf[topind].key ,
sizeof(master_buf[topind].key), "top_node" );
master_buf[topind].keyhash = hashpjw( master_buf[topind].key );
master_buf[topind].nextind = -1;
*/
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><C3A1><EFBFBD>ë<EFBFBD><C3AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئԻ<D8A6><D4BB>
ٯ <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ְ<EFBFBD><EFBFBD>Ѽ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئԪƥ<EFBFBD><EFBFBD><EFBFBD>У<EFBFBD>
0x7fffffff<EFBFBD><EFBFBD><EFBFBD>е<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> ٯ <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> ë<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD>м<EFBFBD><EFBFBD>֣<EFBFBD>*/
master_buf[topind].ivalue = 0x7fffffff;
/* Spock deleted 2000/10/16
if( type == DB_INT_SORTED ){
master_buf[topind].charvalue_index = -1;
//dbSetString( master_buf[topind].charvalue_index, "" );
} else {
dbSetString( master_buf[topind].charvalue_index, "" );
}
*/
// Spock 2000/10/16
master_buf[topind].prev = -1;
master_buf[topind].next = -1;
strcpy( master_buf[topind].key , "top_node" );
master_buf[topind].charvalue[0] = 0;
// Spock end
dbt[i].toplinkindex = topind;
return i;
}
}
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>з֣<D0B7> */
log( "dbGetTableIndex: table full. now tables are:\n" );
dbShowAllTable();
return -1;
}
/*
<EFBFBD><EFBFBD>Իؤ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> strtol ƥ<EFBFBD><EFBFBD><EFBFBD>°<EFBFBD><EFBFBD>ƾ<EFBFBD><EFBFBD>Ӻ̡<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD>з<EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƻ<EFBFBD>έ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>á<EFBFBD><EFBFBD><EFBFBD><EFBFBD>帲<EFBFBD>ƻ<EFBFBD><EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>;<EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ȼ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>գ<EFBFBD><EFBFBD><EFBFBD>պ<EFBFBD><EFBFBD>ĩ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>¼<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD>׷<EFBFBD>Ի<EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë<EFBFBD>Ĺ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>գ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
/* Spock deleted 2000/10/16
int dbUpdateEntryInt( char *table , char *key , int value, char *info )
{
int r, dbi = dbGetTableIndex( table , DB_INT_SORTED );
int entind;
if( strlen(key) >= sizeof( master_buf[0].key) )return -1;
if( dbi < 0 ) return -1;
r = dbExtractNodeByKey( dbt[dbi].toplinkindex , key );
if( r < 0 ){
log( "dbUpdateEntryInt: dbExtractNodeByKey fail! bug!!!!\n" );
return -1;
}
entind = dbAllocNode(DB_INT_SORTED);
if( entind < 0 ) return -1;
master_buf[entind].ivalue = value;
snprintf( master_buf[entind].key ,
sizeof(master_buf[entind].key), "%s", key );
master_buf[entind].keyhash = hashpjw( master_buf[entind].key );
master_buf[entind].nextind = -1;
// <20>͵<EFBFBD><CDB5><EFBFBD> ë<><C3AB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
dbSetString( master_buf[entind].charvalue_index, info );
r = dbInsertNodeByIValue( dbt[dbi].toplinkindex , entind );
if( r < 0 ){
log( "dbUpdateEntryInt: dbInsertNodeByIValue failed\n" );
return -1;
}
log( "dbUpdateEntryInt: successfully updated entry %s:%s:%d\n",
table, key, value );
return 0;
}
*/
// Spock 2000/10/16
int dbUpdateEntryInt( char *table , char *key , int value, char *info )
{
int dbi = dbGetTableIndex( table , DB_INT_SORTED );
int dbind, hashind, newpos;
// Spock 2000/10/23
if ( strlen( key ) >= KEY_MAX ) {
log( "dbUpdateEntryInt: key is too long, key:%s\n", key );
return -1;
}
if ( strlen( info ) >= CHARVALUE_MAX ) {
log( "dbUpdateEntryInt: charvalue is too long, charvalue:%s\n", info );
return -1;
}
// Spock end
if ( dbi < 0 ){
log( "dbUpdateEntryInt: dbGetTableIndex fail\n");
return -1;
}
hashind = tableGetEntry( dbi , key );
if ( hashind < 0 )
{
dbind = dbAllocNode();
if ( dbind < 0 )
{
log( "dbUpdateEntryInt: dbAllocNode fail\n" );
return -1;
}
master_buf[dbind].ivalue = value;
strcpy( master_buf[dbind].key , key );
strcpy( master_buf[dbind].charvalue , info );
if ( dbInsertNodeByIValue( dbt[dbi].toplinkindex , dbind ) < 0 )
{
master_buf[dbind].use = 0;
log( "dbUpdateEntryInt: dbInsertNodeByIValue fail\n" );
return -1;
}
if ( tableInsertNode( dbi , key , dbind ) < 0 )
{
dbReleaseNode( dbind );
log( "dbUpdateEntryInt: tableInsertNode fail\n" );
return -1;
}
}
else
{
dbind = dbt[dbi].hashtable[hashind].dbind;
master_buf[dbind].ivalue = value;
strcpy( master_buf[dbind].charvalue , info );
newpos = dbind;
while ( master_buf[newpos].prev >= 0 )
{
if ( value <= master_buf[master_buf[newpos].prev].ivalue )
{
break;
}
newpos = master_buf[newpos].prev;
}
if ( newpos != dbind )
{
master_buf[master_buf[dbind].prev].next = master_buf[dbind].next;
if ( master_buf[dbind].next >= 0 )
master_buf[master_buf[dbind].next].prev = master_buf[dbind].prev;
master_buf[dbind].prev = master_buf[newpos].prev;
master_buf[dbind].next = newpos;
if ( master_buf[newpos].prev >= 0 )
master_buf[master_buf[newpos].prev].next = dbind;
master_buf[newpos].prev = dbind;
dbt[dbi].updated = 1;
/*
log( "dbUpdateEntryInt: successfully updated entry %s:%s:%d\n",
table, key, value );
*/
return 0;
}
while ( master_buf[newpos].next >= 0 )
{
if ( value >= master_buf[master_buf[newpos].next].ivalue )
{
break;
}
newpos = master_buf[newpos].next;
}
if ( newpos != dbind )
{
master_buf[master_buf[dbind].prev].next = master_buf[dbind].next;
master_buf[master_buf[dbind].next].prev = master_buf[dbind].prev;
master_buf[dbind].prev = newpos;
master_buf[dbind].next = master_buf[newpos].next;
if ( master_buf[newpos].next >= 0 )
master_buf[master_buf[newpos].next].prev = dbind;
master_buf[newpos].next = dbind;
}
}
dbt[dbi].updated = 1;
/*
log( "dbUpdateEntryInt: successfully updated entry %s:%s:%d\n",
table, key, value );
*/
return 0;
}
// Spock end
int
dbDeleteEntryInt( char *table, char *key )
{
int dbi = dbGetTableIndex( table , DB_INT_SORTED );
int r;
if ( strlen( key ) >= KEY_MAX ) {
log( "dbDeleteEntryInt: key is too long, key:%s\n", key );
return -1;
}
if( dbi < 0 ) {
log( "dbDeleteEntryInt: dbGetTableIndex failed for %s\n", table );
return -1;
}
//r = dbExtractNodeByKey( dbt[dbi].toplinkindex , key );
// Spock fixed 2000/10/19
r = dbExtractNodeByKey( dbi , key );
if( r < 0 ){
log( "dbDeleteEntryInt: dbExtractNodeByKey failed for %s in %s\n",
key,table );
return -1;
}
// Spock +1 2000/10/19
dbt[dbi].updated = 1;
log( "deleted key %s from table %s\n", key, table );
return 0;
}
static void
dbShowAllTable(void)
{
int i;
for(i=0;i<MAXTABLE;i++){
if( dbt[i].use ){
log( "%d Name:%s Use:%d Type:%d\n",i,
dbt[i].name , dbt[i].num , dbt[i].type );
}
}
}
/* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ë1<C3AB><31><EFBFBD><EFBFBD>Ի<EFBFBD><D4BB><EFBFBD>ʣ<EFBFBD>
*/
int
dbGetEntryInt( char *table, char *key, int *output )
{
int dbi = dbGetTableIndex( table , DB_INT_SORTED );
int entind;
// Spock +1 2000/10/19
int hashind;
// Spock deleted 2000/10/19
//if( strlen(key) >= sizeof( master_buf[entind].key) ) return -1;
if( dbi <0 ) {
log( "dbGetEntryInt: dbGetTableIndex fail\n" );
return -1;
}
// Spock 2000/10/19
if( strlen(key) >= KEY_MAX ) {
log( "dbGetEntryInt: key is too long, key:%s\n" , key );
return -1;
}
hashind = tableGetEntry( dbi , key );
if( hashind < 0 ) return -1;
entind = dbt[dbi].hashtable[hashind].dbind;
//entind = dbGetEntryByKey( dbt[dbi].toplinkindex , key );
// Spock end
if( entind < 0 ) {
log( "dbGetEntryInt: Invalid dbind in hashtable of %s\n" , table );
return -1;
}
/* <20>Ĺ<EFBFBD><C4B9><EFBFBD><EFBFBD><EFBFBD><EFBFBD>׼<EFBFBD>ƥ<EFBFBD><C6A5>ë<EFBFBD><C3AB> <20><> ľ<><C4BE>߯<EFBFBD><DFAF> */
*output = master_buf[entind].ivalue;
return 0;
}
/*
<EFBFBD>޷¡<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD>0<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD>
int *rank_out : <EFBFBD>¼<EFBFBD><EFBFBD>ͼ<EFBFBD><EFBFBD><EFBFBD>
int *count_out : <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
int
dbGetEntryRank( char *table, char *key , int *rank_out, int *count_out)
{
int dbi = dbGetTableIndex( table , DB_INT_SORTED );
// Spock deleted 2000/10/19
//unsigned int hash = hashpjw(key);
int cur;
int now_score = 0x7fffffff; /*int ƥ<><C6A5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ƥ<EFBFBD><C6A5><EFBFBD>а<EFBFBD> */
int r = -1 , i=0;
// Spock 2000/10/23
//if( strlen(key) >= sizeof( master_buf[cur].key) ) return -1;
if( strlen(key) >= KEY_MAX ) {
log( "dbGetEntryRank: key is too long, key:%s\n" , key );
return -1;
}
if( dbi <0 ) {
log( "dbGetEntryRank: dbGetTableIndex fail\n" );
return -1;
}
// Spock end
// Spock 2000/10/23
//cur = master_buf[dbt[dbi].toplinkindex].nextind;
cur = master_buf[dbt[dbi].toplinkindex].next;
//i=0;
//for(;;){
// if( cur == -1 )break;
while ( cur >= 0 )
{
// Spock end
if( master_buf[cur].ivalue != now_score ){
r=i;
now_score = master_buf[cur].ivalue;
}
// Spock 2000/10/19
//if( hash == master_buf[cur].keyhash &&
// strcmp( master_buf[cur].key, key )== 0 ){
if( strcmp( master_buf[cur].key , key ) == 0 )
{
// Spock end
*rank_out = r;
*count_out = i;
return 0;
}
//cur = master_buf[cur].nextind;
// Spock fixed 2000/10/19
cur = master_buf[cur].next;
i++;
}
*count_out = i;
*rank_out = r;
return 0;
}
/*
int <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
int
dbGetEntryRankRange( char *table,
int start, int end, char *output, int outlen )
{
#define MAXHITS 1024 /* <20><><EFBFBD><EFBFBD>֧ئؤ<D8A6><D8A4>ƥ<EFBFBD>ֳ<EFBFBD>ľƥ<C4BE><C6A5><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> ringo */
struct hitent{ /* <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>հ <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>֧<EFBFBD><D6A7>ë<EFBFBD>׻<EFBFBD><D7BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> */
int entind;
int rank;
};
int r=0;
struct hitent hits[MAXHITS];
int dbi = dbGetTableIndex( table , DB_INT_SORTED );
int cur;
int hitsuse = 0,i;
int now_score = 0x7fffffff;
if( dbi <0 ) return -1;
if( outlen <= 0 )return -1;
cur = dbt[dbi].toplinkindex;
// Spock 2000/10/23
//for(;;){
// if( cur == -1 )break;
while ( cur >= 0 )
{
// Spock end
if( master_buf[cur].ivalue != now_score ){
r++;
now_score = master_buf[cur].ivalue;
}
if( r >= start && r <= end ){
hits[hitsuse].entind = cur;
hits[hitsuse].rank = r;
hitsuse++;
//if( hitsuse == MAXHITS )break;
// Spock fixed 2000/10/23
if( hitsuse >= MAXHITS ) break;
}
//cur = master_buf[cur].nextind;
// Spock fixed 2000/10/19
cur = master_buf[cur].next;
}
output[0] = 0;
for(i=0;i<hitsuse;i++){
char tmp[1024];
snprintf( tmp, sizeof(tmp),
"%d,%s,%d,%s", hits[i].rank, master_buf[hits[i].entind].key,
master_buf[hits[i].entind].ivalue,
// dbGetString( master_buf[i].charvalue_index ));
// Spock fixed 2000/10/19
master_buf[hits[i].entind].charvalue );
strcatsafe( output, outlen, tmp );
if( i != ( hitsuse -1 ) ){
strcatsafe( output, outlen, "|" );
}
}
return 0;
}
int
dbFlush( char *dir )
{
int i;
for(i=0;i<MAXTABLE;i++){
FILE *fp;
char filename[1024];
int entind;
//int j;
if( !dbt[i].use ) continue;
// Spock 2000/10/23
if( dbt[i].updated == 0 )
{
log( "dbFlush: table %s not updated\n" , dbt[i].name );
continue;
}
// Spock end
if( dbt[i].type == DB_INT_SORTED ){
snprintf( filename, sizeof(filename),
"%s/int/%s", dir, dbt[i].name );
} else {
snprintf( filename, sizeof( filename),
"%s/string/%s", dir, dbt[i].name );
}
fp = fopen( filename, "w" );
if( fp == NULL ){
log( "cannot open file: %s %s\n",
filename, strerror( errno ));
continue;
}
// Spock 2000/10/19
//entind = master_buf[dbt[i].toplinkindex].nextind;
entind = master_buf[dbt[i].toplinkindex].next;
//for(j=0;;j++){
// if( entind == -1 )break;
while ( entind >= 0 )
{
// Spock end
if( dbt[i].type == DB_INT_SORTED ){
fprintf( fp , "%s %d %s\n", master_buf[entind].key,
master_buf[entind].ivalue,
//makeStringFromEscaped(
// dbGetString(master_buf[entind].charvalue_index)));
// Spock fixed 2000/10/19
makeStringFromEscaped(master_buf[entind].charvalue));
} else {
fprintf( fp , "%s %s\n", master_buf[entind].key,
//makeStringFromEscaped(
// dbGetString(master_buf[entind].charvalue_index)));
// Spock fixed 2000/10/19
makeStringFromEscaped(master_buf[entind].charvalue));
}
//entind = master_buf[entind].nextind;
// Spock fixed 2000/10/19
entind = master_buf[entind].next;
}
fclose(fp);
dbt[i].updated = 0;
}
return 0;
}
int dbRead( char *dir )
{
char dirname[1024];
DIR *d;
struct dirent *de;
// Spock +1 2000/10/19
memset( dbt , 0 , MAXTABLE * sizeof(struct table) );
{
char tmp[1024];
snprintf( tmp, sizeof( tmp ), "%s/int" , dir );
if( mkdir( tmp, 0755 )==0){
log( "<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %s\n", tmp );
}
snprintf( tmp, sizeof( tmp ), "%s/string" , dir );
if( mkdir( tmp, 0755 )==0){
log( "<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %s\n", tmp );
}
}
snprintf( dirname, sizeof( dirname ),
"%s/int" , dir );
d = opendir(dirname);
if( d == NULL ){
log( "<EFBFBD><EFBFBD><EFBFBD>ܴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ļ<EFBFBD> %s\n", dirname );
return -1;
}
while(1){
de = readdir( d );
if( de == NULL )break;
if( de->d_name[0] != '.' ){
char filename[1024];
FILE *fp;
struct stat s;
snprintf( filename, sizeof(filename),"%s/%s",dirname, de->d_name );
log( "<EFBFBD><EFBFBD>ȡ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>:%s\n..", filename);
if( stat( filename, &s ) < 0 ){
continue;
}
if( !( s.st_mode & S_IFREG ) ){
continue;
}
fp = fopen( filename, "r" );
if( fp == NULL ){
log( "<EFBFBD><EFBFBD><EFBFBD>ܴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ļ<EFBFBD> %s %s\n",
filename, strerror( errno ));
continue;
}
while(1){
char line[1024];
char k[1024] , v[1024], info[1024];
if( fgets( line , sizeof( line) , fp ) == NULL )break;
chop( line);
k[0] = '\0';
easyGetTokenFromString( line, 1, k, sizeof(k));
v[0] = '\0';
easyGetTokenFromString( line, 2, v, sizeof(v));
info[0] = '\0';
easyGetTokenFromString( line, 3, info, sizeof(info));
dbUpdateEntryInt( de->d_name, k, atoi(v), info);
}
fclose(fp);
}
}
closedir(d);
snprintf( dirname, sizeof( dirname), "%s/string" , dir );
d = opendir( dirname );
if( d == NULL ){
log( "<EFBFBD><EFBFBD><EFBFBD>ܴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ļ<EFBFBD> %s\n", dirname );
return -1;
}
while(1){
de = readdir( d );
if( de == NULL )break;
if( de->d_name[0] != '.' ){
char filename[1024];
FILE *fp;
struct stat s;
snprintf( filename, sizeof( filename),"%s/%s",dirname,de->d_name );
log( "<EFBFBD><EFBFBD>ȡ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>:%s\n..", filename);
if( stat( filename, &s ) < 0 ){
continue;
}
if( !(s.st_mode & S_IFREG )){
continue;
}
fp = fopen( filename, "r" );
if( fp == NULL ){
log( "<EFBFBD><EFBFBD><EFBFBD>ܴ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>ļ<EFBFBD> %s %s\n",
filename, strerror(errno ));
continue;
}
while(1){
char line[CHARVALUE_MAX+1024];
char k[1024];
if( fgets( line, sizeof( line), fp ) == NULL )break;
/* chop */
chop(line);
k[0] = '\0';
easyGetTokenFromString( line, 1, k,sizeof(k));
dbUpdateEntryString( de->d_name, k, line+strlen(k)+1);
}
// Nuke +1 1027: Close for safe
fclose(fp);
}
}
closedir(d);
return 0;
}
/* ϶<><CFB6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD>϶<EFBFBD><CFB6><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ի<EFBFBD><D4BB><EFBFBD>ʣ<EFBFBD>
<EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>0<EFBFBD><EFBFBD><EFBFBD><EFBFBD> <EFBFBD>ƻ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>뼰<EFBFBD><EFBFBD> <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>廥ؤ<EFBFBD><EFBFBD><EFBFBD>ߣ<EFBFBD>
<EFBFBD><EFBFBD>num<EFBFBD><EFBFBD>0<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>羮<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>¾޼<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ئ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>÷<EFBFBD><EFBFBD><EFBFBD>
*/
int dbGetEntryCountRange( char *table, int count_start, int num,
char *output, int outlen )
{
int dbi = dbGetTableIndex( table , DB_INT_SORTED );
int cur;
int i;
int now_score = 0x7fffffff , r;
if( dbi < 0) return -1;
if( outlen < 1 ) return -1;
output[0]=0;
//cur = master_buf[dbt[dbi].toplinkindex].nextind;
// Spock fixed 2000/10/19
cur = master_buf[dbt[dbi].toplinkindex].next;
i=0;
r=0;
for(;;){
if( cur == -1 ) break;
if( master_buf[cur].ivalue != now_score ){
r=i;
now_score = master_buf[cur].ivalue;
}
if( ( i >= count_start ) &&
( i < (count_start + num ) ) ){
char tmp[1024];
if( (i !=count_start)){
strcatsafe( output, outlen, "|" );
}
snprintf( tmp, sizeof( tmp),
"%d,%d,%s,%d,%s", i, r, master_buf[cur].key,
master_buf[cur].ivalue,
//dbGetString( master_buf[cur].charvalue_index ));
// Spock fixed 2000/10/19
master_buf[cur].charvalue);
strcatsafe( output, outlen,tmp );
}
i++;
//cur = master_buf[cur].nextind;
// Spock fixed 2000/10/19
cur = master_buf[cur].next;
}
return 0;
}
/*
ٯ <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ì<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
*/
/* Spock deleted 2000/10/19
int
dbUpdateEntryString( char *table, char *key, char *value )
{
int dbi = dbGetTableIndex(table, DB_STRING);
int r, entind;
log( "dbUpdateEntryString: [%s] [%s] [%s]\n", table, key, value );
if( strlen(key) >= sizeof(master_buf[0].key) )return -1;
if( dbi < 0 )return -1;
r = dbExtractNodeByKey( dbt[dbi].toplinkindex, key );
if( r< 0 ){
log( "dbUpdateEntryString dbExtractNodeByKey fail! bug!!\n" );
return -1;
}
entind = dbAllocNode( DB_STRING );
if( entind < 0 ) return -1;
master_buf[entind].ivalue = 0;
dbSetString( master_buf[entind].charvalue_index, value );
snprintf( master_buf[entind].key,
sizeof(master_buf[0].key), "%s",key );
master_buf[entind].keyhash = hashpjw( master_buf[entind].key );
master_buf[entind].nextind = -1;
if( dbAppendNode( dbt[dbi].toplinkindex, entind ) < 0 ){
log( "dbUpdateEntryString: dbAppendNode failed\n" );
return -1;
}
log( "dbUpdateEntryString: successfully updated entry %s:%s:%s\n",
table,key,value );
return 0;
}
*/
// Spock 2000/10/19
int dbUpdateEntryString( char *table, char *key, char *value )
{
int dbi = dbGetTableIndex( table , DB_STRING );
int dbind, hashind;
if ( strlen( key ) >= KEY_MAX ) {
log( "dbUpdateEntryString: key is too long, key:%s\n", key );
return -1;
}
if ( strlen( value ) >= CHARVALUE_MAX ) {
log( "dbUpdateEntryString: charvalue is too long, charvalue:%s\n", value );
return -1;
}
if ( dbi < 0 ) {
log( "dbUpdateEntryString: dbGetTableIndex fail, table:%s\n", table );
return -1;
}
hashind = tableGetEntry( dbi , key );
if ( hashind < 0 )
{
dbind = dbAllocNode();
if ( dbind < 0 )
{
log( "dbUpdateEntryString: dbAllocNode fail\n" );
return -1;
}
strcpy( master_buf[dbind].key , key );
strcpy( master_buf[dbind].charvalue , value );
if ( dbAppendNode( dbt[dbi].toplinkindex , dbind ) < 0 )
{
master_buf[dbind].use = 0;
log( "dbUpdateEntryString: dbAppendNode fail\n" );
return -1;
}
if ( tableInsertNode( dbi , key , dbind ) < 0 )
{
dbReleaseNode( dbind );
log( "dbUpdateEntryString: tableInsertNode fail\n" );
return -1;
}
}
else
{
dbind = dbt[dbi].hashtable[hashind].dbind;
strcpy( master_buf[dbind].charvalue , value );
}
dbt[dbi].updated = 1;
/*
log( "dbUpdateEntryString: successfully updated entry %s:%s:%s\n",
table,key,value );
*/
return 0;
}
// Spock end
int
dbGetEntryString( char *table, char *key, char *output, int outlen )
{
int dbi = dbGetTableIndex( table, DB_STRING );
int entind;
// Spock +1 2000/10/19
int hashind;
// Spock 2000/10/23
//if( strlen(key) >= sizeof( master_buf[entind].key) ) return -1;
if ( strlen(key) >= KEY_MAX ) {
log( "dbGetEntryString: key is too long, key:%s\n", key );
return -1;
}
if( dbi <0 ) {
log( "dbGetEntryString: dbGetTableIndex fail\n" );
return -1;
}
// Spock 2000/10/19
hashind = tableGetEntry( dbi , key );
if ( hashind < 0 ){
log("err hashind <0\n")
return -1;
}
entind = dbt[dbi].hashtable[hashind].dbind;
if ( entind < 0 ){
log( "entind < 0 ");
return -1;
}
snprintf( output , outlen , "%s" , master_buf[entind].charvalue );
return 0;
}
int
dbDeleteEntryString( char *table, char *key )
{
int dbi = dbGetTableIndex( table, DB_STRING );
int r;
// Spock 2000/10/23
//if( strlen(key) >= sizeof( master_buf[entind].key) ) return -1;
if ( strlen(key) >= KEY_MAX ) {
log( "dbDeleteEntryString: key is too long, key:%s\n", key );
return -1;
}
if( dbi <0 ) {
log( "dbDeleteEntryString: dbGetTableIndex fail\n" );
return -1;
}
// Spock end
//r = dbExtractNodeByKey( dbt[dbi].toplinkindex, key );
// Spock fixed 2000/10/19
r = dbExtractNodeByKey( dbi , key );
if( r < 0 ){
log( "dbDeleteEntryString: dbExtractNodeByKey failed for %s in %s\n",
key,table );
return -1;
}
dbt[dbi].updated = 1;
log( "deleted key %s from table %s\n", key, table );
return 0;
}
Reference in New Issue Copy Permalink