int ht_db_load_tables(void)
{
ht_t *ht;
ht = _ht_root;
while(ht)
{
if(ht->dbtable.len>0)
{
LM_DBG("loading db table [%.*s] in ht [%.*s]\n",
ht->dbtable.len, ht->dbtable.s,
ht->name.len, ht->name.s);
if(ht_db_load_table(ht, &ht->dbtable, 0)!=0)
return -1;
}
ht = ht->next;
}
return 0;
}
static struct mi_root* ht_mi_reload(struct mi_root* cmd_tree, void* param)
{
struct mi_node* node;
str htname;
ht_t *ht;
ht_t nht;
ht_cell_t *first;
ht_cell_t *it;
int i;
if(ht_db_url.len<=0)
return init_mi_tree(500, MI_ERR_RELOAD, MI_ERR_RELOAD_LEN);
if(ht_db_init_con()!=0)
return init_mi_tree(500, MI_ERR_RELOAD, MI_ERR_RELOAD_LEN);
if(ht_db_open_con()!=0)
return init_mi_tree(500, MI_ERR_RELOAD, MI_ERR_RELOAD_LEN);
node = cmd_tree->node.kids;
if(node == NULL)
{
ht_db_close_con();
return init_mi_tree( 400, MI_MISSING_PARM_S, MI_MISSING_PARM_LEN);
}
htname = node->value;
if(htname.len<=0 || htname.s==NULL)
{
LM_ERR("bad hash table name\n");
ht_db_close_con();
return init_mi_tree( 500, "bad hash table name", 19);
}
ht = ht_get_table(&htname);
if(ht==NULL || ht->dbtable.len<=0)
{
LM_ERR("bad hash table name\n");
ht_db_close_con();
return init_mi_tree( 500, "no such hash table", 18);
}
memcpy(&nht, ht, sizeof(ht_t));
/* it's temporary operation - use system malloc */
nht.entries = (ht_entry_t*)malloc(nht.htsize*sizeof(ht_entry_t));
if(nht.entries == NULL)
{
ht_db_close_con();
return init_mi_tree(500, MI_ERR_RELOAD, MI_ERR_RELOAD_LEN);
}
memset(nht.entries, 0, nht.htsize*sizeof(ht_entry_t));
if(ht_db_load_table(&nht, &ht->dbtable, 0)<0)
{
/* free any entry set if it was a partial load */
for(i=0; i<nht.htsize; i++)
{
first = nht.entries[i].first;
while(first)
{
it = first;
first = first->next;
ht_cell_free(it);
}
}
free(nht.entries);
ht_db_close_con();
return init_mi_tree(500, MI_ERR_RELOAD, MI_ERR_RELOAD_LEN);
}
/* replace old entries */
for(i=0; i<nht.htsize; i++)
{
ht_slot_lock(ht, i);
first = ht->entries[i].first;
ht->entries[i].first = nht.entries[i].first;
ht->entries[i].esize = nht.entries[i].esize;
ht_slot_unlock(ht, i);
nht.entries[i].first = first;
}
/* free old entries */
for(i=0; i<nht.htsize; i++)
{
first = nht.entries[i].first;
while(first)
{
it = first;
first = first->next;
ht_cell_free(it);
}
}
free(nht.entries);
ht_db_close_con();
return init_mi_tree( 200, MI_OK_S, MI_OK_LEN);
}
/*! \brief RPC htable.reload command to reload content of a hash table */
static void htable_rpc_reload(rpc_t* rpc, void* c)
{
str htname;
ht_t *ht;
ht_t nht;
ht_cell_t *first;
ht_cell_t *it;
int i;
if(ht_db_url.len<=0) {
rpc->fault(c, 500, "No htable db_url");
return;
}
if(ht_db_init_con()!=0) {
rpc->fault(c, 500, "Failed to init htable db connection");
return;
}
if(ht_db_open_con()!=0) {
rpc->fault(c, 500, "Failed to open htable db connection");
return;
}
if (rpc->scan(c, "S", &htname) < 1)
{
rpc->fault(c, 500, "No htable name given");
return;
}
ht = ht_get_table(&htname);
if(ht==NULL)
{
rpc->fault(c, 500, "No such htable");
return;
}
memcpy(&nht, ht, sizeof(ht_t));
/* it's temporary operation - use system malloc */
nht.entries = (ht_entry_t*)malloc(nht.htsize*sizeof(ht_entry_t));
if(nht.entries == NULL)
{
ht_db_close_con();
rpc->fault(c, 500, "Mtree reload failed");
return;
}
memset(nht.entries, 0, nht.htsize*sizeof(ht_entry_t));
if(ht_db_load_table(&nht, &ht->dbtable, 0)<0)
{
/* free any entry set if it was a partial load */
for(i=0; i<nht.htsize; i++)
{
first = nht.entries[i].first;
while(first)
{
it = first;
first = first->next;
ht_cell_free(it);
}
}
free(nht.entries);
ht_db_close_con();
rpc->fault(c, 500, "Mtree reload failed");
return;
}
/* replace old entries */
for(i=0; i<nht.htsize; i++)
{
ht_slot_lock(ht, i);
first = ht->entries[i].first;
ht->entries[i].first = nht.entries[i].first;
ht->entries[i].esize = nht.entries[i].esize;
ht_slot_unlock(ht, i);
nht.entries[i].first = first;
}
/* free old entries */
for(i=0; i<nht.htsize; i++)
{
first = nht.entries[i].first;
while(first)
{
it = first;
first = first->next;
ht_cell_free(it);
}
}
free(nht.entries);
ht_db_close_con();
return;
}
