mirror of https://github.com/sysown/proxysql
removed KV_Btree_Array.cpp removed query_SQL from MySQL_Data_Stream added some documentation for QC_entry_t Query_Cache::get() and Query_Cache::set() now requires also the length of the key Query_Cache::get() and Query_Cache::set() now process hk (the hash key) using the length of the keySQLiteServer
René Cannaò
10 years ago
parent
d22bf01737
commit
60ddf5d8e4
@ -1,176 +0,0 @@
|
||||
#include "btree_map.h"
|
||||
#include "proxysql.h"
|
||||
#include "cpp.h"
|
||||
|
||||
|
||||
using namespace std;
|
||||
|
||||
|
||||
/*
|
||||
AdvancedKV::AdvancedKV() {
|
||||
// dataSize=0;
|
||||
};
|
||||
*/
|
||||
|
||||
/*
|
||||
struct classcomp1 {
|
||||
bool operator() (char *a, char *b) const
|
||||
{return strcmp(a,b); }
|
||||
};
|
||||
|
||||
//typedef btree::btree_map<char *, char *, classcomp> MyMap;
|
||||
*/
|
||||
|
||||
|
||||
|
||||
KV_BtreeArray::KV_BtreeArray() {
|
||||
spinlock_rwlock_init(&lock);
|
||||
}
|
||||
|
||||
/*
|
||||
KV_BtreeAray::set((char *kp, void *entry)
|
||||
//spin_wrlock(&fdb_hashes[i].lock);
|
||||
spin_wrlock(&rwlock);
|
||||
ptrArray->add(entry);
|
||||
btree::btree_map<const char *, char *, classcomp>::iterator lookup;
|
||||
lookup = bt_map.find(key);
|
||||
if (lookup != bt_map.end()) {
|
||||
g_hash_table_replace(fdb_hashes[i].hash, (void *)entry->key, (void *)entry);
|
||||
spin_wrunlock(&lock);
|
||||
|
||||
*/
|
||||
|
||||
/*
|
||||
void SimpleKV::insert(const char *key, char *value) {
|
||||
if (lock_enabled)
|
||||
spin_wrlock(&rwlock);
|
||||
//g_hash_table_insert(hash, key, value);
|
||||
bt_map.insert(std::make_pair(key,value));
|
||||
if (lock_enabled)
|
||||
spin_wrunlock(&rwlock);
|
||||
}
|
||||
|
||||
void SimpleKV::insert_copy(const char *key, char * value) {
|
||||
//std::string *key_copy=key;
|
||||
char * key_copy=strdup(key);
|
||||
char * value_copy=strdup(value);
|
||||
if (lock_enabled)
|
||||
spin_wrlock(&rwlock);
|
||||
//g_hash_table_insert(hash, key_copy, value_copy);
|
||||
bt_map.insert(std::make_pair(key_copy,value_copy));
|
||||
if (lock_enabled)
|
||||
spin_wrunlock(&rwlock);
|
||||
}
|
||||
|
||||
void SimpleKV::replace(const char *key, char * value) {
|
||||
if (lock_enabled)
|
||||
spin_wrlock(&rwlock);
|
||||
//g_hash_table_replace(hash, key, value);
|
||||
//btree::btree_map<std::string *, char *>::iterator lookup;
|
||||
btree::btree_map<const char *, char *, classcomp>::iterator lookup;
|
||||
//btree::btree_map<char *, char *, classcomp>::iterator lookup ;
|
||||
//btree::btree_map<char *, char *, classcomp>::iterator lookup ;
|
||||
lookup = bt_map.find(key);
|
||||
//printf("%s\n", *lookup->first) ;
|
||||
if (lookup != bt_map.end()) {
|
||||
const char *f=lookup->first;
|
||||
free(lookup->second);
|
||||
bt_map.erase(lookup);
|
||||
free((void *)f);
|
||||
}
|
||||
bt_map.insert(std::make_pair(key,value));
|
||||
if (lock_enabled)
|
||||
spin_wrunlock(&rwlock);
|
||||
}
|
||||
|
||||
void SimpleKV::replace_copy(char *key, char * value) {
|
||||
char * key_copy=strdup((const char *)key);
|
||||
char * value_copy=strdup((const char *)value);
|
||||
replace(key_copy, value_copy);
|
||||
if (lock_enabled)
|
||||
spin_wrlock(&rwlock);
|
||||
g_hash_table_replace(hash, key_copy, value_copy);
|
||||
if (lock_enabled)
|
||||
spin_wrunlock(&rwlock);
|
||||
}
|
||||
|
||||
|
||||
char * SimpleKV::lookup(const char * key) {
|
||||
char *v=NULL;
|
||||
if (lock_enabled)
|
||||
spin_rdlock(&rwlock);
|
||||
btree::btree_map<const char *, char *, classcomp>::iterator lookup;
|
||||
lookup = bt_map.find(key);
|
||||
if (lookup != bt_map.end()) {
|
||||
v=lookup->second;
|
||||
}
|
||||
if (lock_enabled)
|
||||
spin_rdunlock(&rwlock);
|
||||
return v;
|
||||
}
|
||||
|
||||
char * SimpleKV::lookup_copy(const char * key) {
|
||||
char *v=NULL;
|
||||
char *r=NULL;
|
||||
if (lock_enabled)
|
||||
spin_rdlock(&rwlock);
|
||||
btree::btree_map<const char *, char *, classcomp>::iterator lookup;
|
||||
lookup = bt_map.find(key);
|
||||
if (lookup != bt_map.end()) {
|
||||
r=lookup->second;
|
||||
}
|
||||
if (r)
|
||||
v=strdup((const char *)r);
|
||||
if (lock_enabled)
|
||||
spin_rdunlock(&rwlock);
|
||||
return v;
|
||||
}
|
||||
|
||||
|
||||
void SimpleKV::remove(const char *key) {
|
||||
if (lock_enabled)
|
||||
spin_wrlock(&rwlock);
|
||||
btree::btree_map<const char *, char *, classcomp>::iterator lookup;
|
||||
lookup = bt_map.find(key);
|
||||
if (lookup != bt_map.end()) {
|
||||
const char *f=lookup->first;
|
||||
free(lookup->second);
|
||||
bt_map.erase(lookup);
|
||||
free((void *)f);
|
||||
}
|
||||
if (lock_enabled)
|
||||
spin_wrunlock(&rwlock);
|
||||
|
||||
}
|
||||
|
||||
void SimpleKV::empty() {
|
||||
if (lock_enabled)
|
||||
spin_wrlock(&rwlock);
|
||||
btree::btree_map<const char *, char *, classcomp>::iterator lookup;
|
||||
|
||||
while (bt_map.size()) {
|
||||
lookup = bt_map.begin();
|
||||
if ( lookup != bt_map.end() ) {
|
||||
//free((char *)lookup.first);
|
||||
const char *f=lookup->first;
|
||||
free(lookup->second);
|
||||
bt_map.erase(lookup);
|
||||
free((void *)f);
|
||||
}
|
||||
}
|
||||
|
||||
if (lock_enabled)
|
||||
spin_wrunlock(&rwlock);
|
||||
|
||||
}
|
||||
|
||||
SimpleKV::~SimpleKV() {
|
||||
//g_hash_table_destroy(hash);
|
||||
empty();
|
||||
}
|
||||
|
||||
int SimpleKV::size() {
|
||||
return bt_map.size();
|
||||
}
|
||||
|
||||
*/
|
||||
Loading…
Reference in new issue