void kill_mob(int npc)
{
t_list **mob;
mob = find_mob(npc);
del_link(mob, del_mob);
}
int builtin_unsetenv(t_list *list, char **cmd)
{
int i;
t_node *tmp;
i = 0;
if (unsetenv_checking(list, cmd) == FAILURE)
return (FAILURE);
if (!(strcmp("?", cmd[1])))
return (SUCCESS);
while (cmd[++i])
{
tmp = list->myEnv->head;
if (tmp == list->myEnv->tail && tmp == list->myEnv->tail)
{
if ((strcmp(tmp->name, cmd[1])) == 0)
return (is_last_node(tmp, list));
}
while (tmp != NULL)
{
if ((strcmp(cmd[i], tmp->name)) == 0)
list = del_link(list, tmp->name);
tmp = tmp->next;
}
}
return (SUCCESS);
}
void cache_set(cache_t cache, key_type key, val_type val, uint32_t val_size){
link_t * init_link = querry_hash(cache,key);
//if the item is already in the list, then delete it
del_link(cache,init_link);
//if the policy tells the cache not to add the item, do not add it
if(!should_add_evict_deletions(cache,val_size)){
return;
}
add_to_cache(cache,key,val,val_size);
}
void destroy_cache(cache_t cache){
//deletes the links
for(size_t i = 0; i < cache->table_size; i++){
while(cache->table[i] != NULL){
del_link(cache,&cache->table[i]);
}
}
delete_policy(cache->evic_policy);
free(cache->table);
free(cache);
}
int main(int argc, char *argv[])
{
int opt, op = 0, context = 0;
while((opt = getopt(argc, argv, "adgLAR"))!=-1)
{
switch (opt){
case 'a':
op = TYPE_OP_ADD;
break;
case 'd':
op = TYPE_OP_DEL;
break;
case 'g':
op = TYPE_OP_GET;
break;
case 'L':
context = TYPE_CONTEXT_LINK;
break;
case 'A':
context = TYPE_CONTEXT_ADDR;
break;
case 'R':
context = TYPE_CONTEXT_ROUTE;
break;
}
}
if(!op || !context){
Usage(argv[0]);
return -1;
}
if(context == TYPE_CONTEXT_LINK){
switch (op){
case TYPE_OP_ADD:
add_link();
break;
case TYPE_OP_DEL:
del_link();
break;
}
}
return 0;
}
/*
* -------------------------------------
* Dispatch one event
* -------------------------------------
*/
void dispatch_event(struct es* es)
{
assert(es);
switch (es->ev) {
case _es_link:
add_link(es->peer0, es->port0, es->peer1, es->port1,
es->cost, es->name);
break;
case _ud_link:
ud_link(es->name, es->cost);
break;
case _td_link:
del_link(es->name);
break;
default:
printf("[es]\t\tUnknown event!\n");
break;
}
}
/*
* divide and conquer delaunay
*/
void del_divide_and_conquer( delaunay_t *del, int start, int end )
{
delaunay_t left, right;
int i, n;
n = (end - start + 1);
if( n > 3 )
{
i = (n / 2) + (n & 1);
left.points = del->points;
right.points = del->points;
del_divide_and_conquer( &left, start, start + i - 1 );
del_divide_and_conquer( &right, start + i, end );
del_link( del, &left, &right );
} else
if( n == 3 )
del_init_tri( del, start );
else
if( n == 2 )
del_init_seg( del, start );
}
void cache_delete(cache_t cache, key_type key){
del_link(cache,querry_hash(cache,key));
}
