scscf_list.c File Reference

---

Detailed Description

Interrogating-CSCF - Serving-CSCFs Lists.

The I-CSCF performs a serial fork and tries to deliver the requests to the first S-CSCF that responds, from a list.

The list is received from the HSS or created from the received (from HSS) list of mandatory and optional capabilities for that particular user. This is often called capabilities selection.

Author:

Dragos Vingarzan vingarzan -at- fokus dot fraunhofer dot de

Definition in file scscf_list.c.

#include <values.h>
#include "../../mem/shm_mem.h"
#include "../../dset.h"
#include "../tm/tm_load.h"
#include "scscf_list.h"
#include "db.h"
#include "sip.h"

Go to the source code of this file.

Defines
#define	h_inc   h+=v^(v>>3)
Functions
int	I_get_capabilities ()
	Refreshes the capabilities list reading them from the db.
int	I_get_capab_match (scscf_capabilities *c, int *m, int mcnt, int *o, int ocnt)
	Returns the matching rank of a S-CSCF.
static scscf_entry *	I_add_to_scscf_list (scscf_entry *root, str name, int score, int originating)
	Adds the name to the list starting at root, ordered by score.
scscf_entry *	I_get_capab_ordered (str scscf_name, int *m, int mcnt, int *o, int ocnt, str *p, int pcnt, int orig)
	Returns a list of S-CSCFs that we should try on, based on the capabilities requested.
unsigned int	get_call_id_hash (str callid, int hash_size)
	Computes the hash for a string.
int	i_hash_table_init (int hash_size)
	Initialize the hash with S-CSCF lists.
void	i_hash_table_destroy ()
	Destroy the hash with S-CSCF lists.
void	i_lock (unsigned int hash)
	Locks the required part of hash with S-CSCF lists.
void	i_unlock (unsigned int hash)
	UnLocks the required part of hash with S-CSCF lists.
scscf_entry *	new_scscf_entry (str name, int score, int orig)
scscf_list *	new_scscf_list (str call_id, scscf_entry *sl)
int	add_scscf_list (str call_id, scscf_entry *sl)
int	is_scscf_list (str call_id)
str	take_scscf_entry (str call_id)
	Takes on S-CSCF name for the respective Call-ID from the respective name list.
void	del_scscf_list (str call_id)
void	free_scscf_list (scscf_list *sl)
void	print_scscf_list (int log_level)
int	I_trans_in_processing (struct sip_msg *msg, char *str1, char *str2)
int	I_scscf_select (struct sip_msg *msg, char *str1, char *str2)
int	I_scscf_drop (struct sip_msg *msg, char *str1, char *str2)
Variables
tm_binds	tmb
	Structure with pointers to tm funcs.
scscf_capabilities *	SCSCF_Capabilities = 0
	list of S-CSCFs and their capabilities
int	SCSCF_Capabilities_cnt = 0
	size of list of S-CSCFs and their capabilities
int	i_hash_size
	size of the hash table for the S-CSCF lists
i_hash_slot *	i_hash_table = 0
	the hash table for the S-CSCF lists
static str	route_hdr_s = {"Route: <",8}
static str	route_hdr_e = {">\r\n",3}

---

Define Documentation

#define h_inc   h+=v^(v>>3)

Referenced by get_aor_hash(), get_call_id_hash(), get_contact_hash(), get_hash_auth(), get_p_dialog_hash(), get_s_dialog_hash(), and get_subscription_hash().

---

Function Documentation

int I_get_capabilities

(

)

Refreshes the capabilities list reading them from the db.

Drops the old cache and queries the db

Todo:

• IMPLEMENT A WAY TO PUSH AN EXTERNAL EVENT FOR THIS

Todo:

• SOLVE THE LOCKING PROBLEM - THIS IS A WRITER

Returns:

1 on success, 0 on failure

Definition at line 90 of file scscf_list.c.

References _scscf_capabilities::cnt, icscf_db_get_capabilities(), icscf_db_get_scscf(), id_s_cscf, M_NAME, SCSCF_Capabilities, SCSCF_Capabilities_cnt, scscf_name, and _scscf_capabilities::scscf_name.

Referenced by icscf_mod_init().

{
    int i,j,r;
    /* free the old cache */
    if (SCSCF_Capabilities!=0){
        for(i=0;i<SCSCF_Capabilities_cnt;i++){
            if (SCSCF_Capabilities[i].capabilities)
                shm_free(SCSCF_Capabilities[i].capabilities);
        }
        shm_free(SCSCF_Capabilities);
    }
    
    SCSCF_Capabilities_cnt = icscf_db_get_scscf(&SCSCF_Capabilities);
    
    r = icscf_db_get_capabilities(&SCSCF_Capabilities,SCSCF_Capabilities_cnt);

    LOG(L_DBG,"DBG:"M_NAME":------  S-CSCF Map with Capabilities  begin ------\n");
    if (SCSCF_Capabilities!=0){
        for(i=0;i<SCSCF_Capabilities_cnt;i++){
            LOG(L_DBG,"DBG:"M_NAME":S-CSCF [%d] <%.*s>\n",
                SCSCF_Capabilities[i].id_s_cscf,
                SCSCF_Capabilities[i].scscf_name.len,
                SCSCF_Capabilities[i].scscf_name.s);
            for(j=0;j<SCSCF_Capabilities[i].cnt;j++)
            LOG(L_DBG,"DBG:"M_NAME":       \t [%d]\n",
             SCSCF_Capabilities[i].capabilities[j]);
        }
    }
    LOG(L_DBG,"DBG:"M_NAME":------  S-CSCF Map with Capabilities  end ------\n");
    
    return r;
}

int I_get_capab_match	(	scscf_capabilities *	c,
		int *	m,
		int	mcnt,
		int *	o,
		int	ocnt
	)

Returns the matching rank of a S-CSCF.

Todo:

• optimize the search as O(n^2) is hardly desireable

Parameters:

	c	- the capabilities of the S-CSCF
	m	- mandatory capabilities list requested
	mcnt	- mandatory capabilities list size
	o	- optional capabilities list
	ocnt	- optional capabilities list sizeint I_get_capab_match(icscf_capabilities *c,int *m,int mcnt,int *o,int ocnt)

Returns:

- -1 if mandatory not satisfied, else count of matched optional capab

Definition at line 133 of file scscf_list.c.

References _scscf_capabilities::capabilities, and _scscf_capabilities::cnt.

Referenced by I_get_capab_ordered().

{
    int r=0,i,j,t=0;
    for(i=0;i<mcnt;i++){
        t=0;
        for(j=0;j<c->cnt;j++)
            if (m[i]==c->capabilities[j]) {
                t=1;
                break;
            }
        if (!t) return -1;
    }
    for(i=0;i<ocnt;i++){
        for(j=0;j<c->cnt;j++)
            if (o[i]==c->capabilities[j]) r++;
    }   
    return r;
}

static scscf_entry* I_add_to_scscf_list	(	scscf_entry *	root,
		str	name,
		int	score,
		int	originating
	)			[inline, static]

Adds the name to the list starting at root, ordered by score.

Returns the new root

Definition at line 156 of file scscf_list.c.

References new_scscf_entry(), _scscf_entry::next, _scscf_entry::score, and _scscf_entry::scscf_name.

Referenced by I_get_capab_ordered().

{
    scscf_entry *x,*i;

    //duplicate?
    for(i=root;i;i=i->next)
        if (name.len == i->scscf_name.len &&
            strncasecmp(name.s,i->scscf_name.s,name.len)==0)
                return root;

    x = new_scscf_entry(name,score, originating);
    if (!x) return root;
    
    if (!root){
        return x;
    }
    if (root->score < x->score){
        x->next = root;
        return x;
    }
    i = root;
    while(i->next && i->next->score > x->score)
        i = i->next;
    x->next = i->next;
    i->next = x;
    return root;
}

scscf_entry* I_get_capab_ordered	(	str	scscf_name,
		int *	m,
		int	mcnt,
		int *	o,
		int	ocnt,
		str *	p,
		int	pcnt,
		int	orig
	)

Returns a list of S-CSCFs that we should try on, based on the capabilities requested.

Todo:

• order the list according to matched optionals - r

Parameters:

	scscf_name	- the first S-CSCF if specified
	m	- mandatory capabilities list
	mcnt	- mandatory capabilities list size
	o	- optional capabilities list
	ocnt	- optional capabilities list size
	orig	- indicates originating session case

Returns:

list of S-CSCFs, terminated with a str={0,0}

Definition at line 196 of file scscf_list.c.

References I_add_to_scscf_list(), I_get_capab_match(), M_NAME, SCSCF_Capabilities, SCSCF_Capabilities_cnt, and _scscf_capabilities::scscf_name.

Referenced by I_LIA(), and I_UAA().

{
    scscf_entry *list=0;
    int i,r;
    
    if (scscf_name.len) list = I_add_to_scscf_list(list,scscf_name,MAXINT, orig);

    for(i=0;i<pcnt;i++)
        list = I_add_to_scscf_list(list,p[i],MAXINT-i,orig);
        
    for(i=0;i<SCSCF_Capabilities_cnt;i++){
        r = I_get_capab_match(SCSCF_Capabilities+i,m,mcnt,o,ocnt);
        if (r!=-1){
             list = I_add_to_scscf_list(list,SCSCF_Capabilities[i].scscf_name,r, orig);
             LOG(L_DBG,"DBG:"M_NAME":I_get_capab_ordered: <%.*s> Added to the list, orig=%d\n",
                SCSCF_Capabilities[i].scscf_name.len,SCSCF_Capabilities[i].scscf_name.s, orig);
        }
    }
    return list;
}

unsigned int get_call_id_hash	(	str	callid,
		int	hash_size
	)			[inline]

Computes the hash for a string.

Definition at line 221 of file scscf_list.c.

References h_inc.

Referenced by add_scscf_list(), del_scscf_list(), is_scscf_list(), and take_scscf_entry().

{
#define h_inc h+=v^(v>>3)
   char* p;
   register unsigned v;
   register unsigned h;

   h=0;
   for (p=callid.s; p<=(callid.s+callid.len-4); p+=4){
       v=(*p<<24)+(p[1]<<16)+(p[2]<<8)+p[3];
       h_inc;
   }
   v=0;
   for (;p<(callid.s+callid.len); p++) {
       v<<=8;
       v+=*p;
   }
   h_inc;

   h=((h)+(h>>11))+((h>>13)+(h>>23));
   return (h)%hash_size;
#undef h_inc 
}

int i_hash_table_init

(

int

hash_size

)

Initialize the hash with S-CSCF lists.

Definition at line 248 of file scscf_list.c.

References i_hash_size, i_hash_table, i_hash_slot::lock, and M_NAME.

Referenced by icscf_mod_init().

{
    int i;
    
    i_hash_size = hash_size;
    i_hash_table = shm_malloc(sizeof(i_hash_slot)*i_hash_size);

    if (!i_hash_table) return 0;
    
    memset(i_hash_table,0,sizeof(i_hash_slot)*i_hash_size);
    
    for(i=0;i<i_hash_size;i++){
        i_hash_table[i].lock = lock_alloc();
        if (!i_hash_table[i].lock){
            LOG(L_ERR,"ERR:"M_NAME":i_hash_table_init(): Error creating lock\n");
            return 0;
        }
        i_hash_table[i].lock = lock_init(i_hash_table[i].lock);
    }
            
    return 1;
}

void i_hash_table_destroy

(

)

Destroy the hash with S-CSCF lists.

Definition at line 274 of file scscf_list.c.

References free_scscf_list(), i_hash_slot::head, i_hash_size, i_hash_table, i_lock(), i_unlock(), and _scscf_list::next.

Referenced by icscf_mod_destroy().

{
    int i;
    scscf_list *sl,*nsl;
    for(i=0;i<i_hash_size;i++){
        i_lock(i);
            sl = i_hash_table[i].head;
            while(sl){
                nsl = sl->next;
                free_scscf_list(sl);
                sl = nsl;
            }
        i_unlock(i);
        lock_dealloc(i_hash_table[i].lock);
    }
    shm_free(i_hash_table);
}

void i_lock

(

unsigned int

hash

)

[inline]

Locks the required part of hash with S-CSCF lists.

Definition at line 295 of file scscf_list.c.

References i_hash_table.

Referenced by add_scscf_list(), del_scscf_list(), i_hash_table_destroy(), is_scscf_list(), print_scscf_list(), and take_scscf_entry().

{
//  LOG(L_CRIT,"GET %d\n",hash);
    lock_get(i_hash_table[(hash)].lock);
//  LOG(L_CRIT,"GOT %d\n",hash);    
}

void i_unlock

(

unsigned int

hash

)

[inline]

UnLocks the required part of hash with S-CSCF lists.

Definition at line 305 of file scscf_list.c.

References i_hash_table.

Referenced by add_scscf_list(), del_scscf_list(), i_hash_table_destroy(), is_scscf_list(), print_scscf_list(), and take_scscf_entry().

{
    lock_release(i_hash_table[(hash)].lock);
//  LOG(L_CRIT,"RELEASED %d\n",hash);   
}

scscf_entry* new_scscf_entry	(	str	name,
		int	score,
		int	orig
	)

Definition at line 311 of file scscf_list.c.

References M_NAME, _scscf_entry::next, _scscf_entry::score, and _scscf_entry::scscf_name.

Referenced by I_add_to_scscf_list(), and I_LIA().

{
    scscf_entry *x=0;
    x = shm_malloc(sizeof(scscf_entry));
    if (!x) {   
        LOG(L_ERR,"ERR:"M_NAME":new_scscf_entry: Error allocating %d bytes\n",
            sizeof(scscf_entry));
        return 0;
    }
    /* duplicate always the scscf_name because of possible list reloads and scscf_name coming in LIA/UAA */
    if (orig) x->scscf_name.s = shm_malloc(name.len+5);
    else x->scscf_name.s = shm_malloc(name.len);
    if (!x->scscf_name.s){  
        LOG(L_ERR,"ERR:"M_NAME":new_scscf_entry: Error allocating %d bytes\n",
            orig?name.len+5:name.len);
        shm_free(x);
        return 0;
    }
    memcpy(x->scscf_name.s,name.s,name.len);
    x->scscf_name.len = name.len;
    if (orig) {
        memcpy(x->scscf_name.s+name.len, ";orig", 5);
        x->scscf_name.len += 5;
    }
    
    LOG(L_INFO,"INFO:"M_NAME":new_scscf_entry:  <%.*s>\n",x->scscf_name.len,x->scscf_name.s);
    
    x->score = score;
    x->next = 0;
    return x;
}

scscf_list* new_scscf_list	(	str	call_id,
		scscf_entry *	sl
	)

Definition at line 344 of file scscf_list.c.

References _scscf_list::call_id, _scscf_list::list, M_NAME, and STR_SHM_DUP.

Referenced by add_scscf_list().

{
    scscf_list *l;
    
    l = shm_malloc(sizeof(scscf_list));
    if (!l) {
        LOG(L_ERR,"ERR:"M_NAME":new_scscf_list(): Unable to alloc %d bytes\n",
            sizeof(scscf_list));
        goto error;
    }
    memset(l,0,sizeof(scscf_list));
    
    STR_SHM_DUP(l->call_id,call_id,"shm");
    l->list = sl;
                
    return l;
error:
out_of_memory:
    if (l){
        shm_free(l);        
    }
    return 0;
}

int add_scscf_list	(	str	call_id,
		scscf_entry *	sl
	)

Definition at line 368 of file scscf_list.c.

References get_call_id_hash(), i_hash_slot::head, i_hash_size, i_hash_table, i_lock(), i_unlock(), new_scscf_list(), _scscf_list::next, _scscf_list::prev, and i_hash_slot::tail.

Referenced by I_LIA(), and I_UAA().

{
    scscf_list *l;
    unsigned int hash = get_call_id_hash(call_id,i_hash_size);
    
    l = new_scscf_list(call_id,sl);
    if (!l) return 0;       
    
    i_lock(hash);
    l->prev = 0;
    l->next = i_hash_table[hash].head;
    if (l->next) l->next->prev = l;
    i_hash_table[hash].head = l;
    if (!i_hash_table[hash].tail) i_hash_table[hash].tail = l;
    i_unlock(hash); 
    
    return 1;
}

int is_scscf_list

(

str

call_id

)

Definition at line 387 of file scscf_list.c.

References _scscf_list::call_id, get_call_id_hash(), i_hash_slot::head, i_hash_size, i_hash_table, i_lock(), i_unlock(), and _scscf_list::next.

{
    scscf_list *l=0;
    unsigned int hash = get_call_id_hash(call_id,i_hash_size);

    i_lock(hash);
    l = i_hash_table[hash].head;
    while(l){
        if (l->call_id.len == call_id.len &&
            strncasecmp(l->call_id.s,call_id.s,call_id.len)==0) {
                i_unlock(hash);
                return 1;
            }
        l = l->next;
    }
    i_unlock(hash);
    return 0;
}

str take_scscf_entry

(

str

call_id

)

Takes on S-CSCF name for the respective Call-ID from the respective name list.

Should shm_free the result.s when no longer needed.

Parameters:

call_id

- the id of the call

Returns:

the shm_malloced S-CSCF name if found or empty string if list is empty or does not exists

Definition at line 412 of file scscf_list.c.

References _scscf_list::call_id, get_call_id_hash(), i_hash_slot::head, i_hash_size, i_hash_table, i_lock(), i_unlock(), _scscf_list::list, _scscf_entry::next, _scscf_list::next, and _scscf_entry::scscf_name.

Referenced by I_scscf_select().

{
    str scscf={0,0};
    scscf_list *l=0;
    scscf_entry *sl;
    unsigned int hash = get_call_id_hash(call_id,i_hash_size);

    i_lock(hash);
    l = i_hash_table[hash].head;
    while(l){
        if (l->call_id.len == call_id.len &&
            strncasecmp(l->call_id.s,call_id.s,call_id.len)==0) {
                if (l->list){
                    scscf = l->list->scscf_name;
                    sl = l->list->next;
                    shm_free(l->list);
                    l->list = sl;
                }
                break;
            }
        l = l->next;
    }
    i_unlock(hash);
    return scscf;
}

void del_scscf_list

(

str

call_id

)

Definition at line 438 of file scscf_list.c.

References _scscf_list::call_id, free_scscf_list(), get_call_id_hash(), i_hash_slot::head, i_hash_size, i_hash_table, i_lock(), i_unlock(), _scscf_list::next, _scscf_list::prev, and i_hash_slot::tail.

Referenced by I_scscf_drop().

{
    scscf_list *l=0;
    unsigned int hash = get_call_id_hash(call_id,i_hash_size);

    i_lock(hash);
    l = i_hash_table[hash].head;
    while(l){
        if (l->call_id.len == call_id.len &&
            strncasecmp(l->call_id.s,call_id.s,call_id.len)==0) {
                if (l->prev) l->prev->next = l->next;
                else i_hash_table[hash].head = l->next;
                if (l->next) l->next->prev = l->prev;
                else i_hash_table[hash].tail = l->prev;                 
                i_unlock(hash);
                free_scscf_list(l);
                return;
            }
        l = l->next;
    }
    i_unlock(hash);
}

void free_scscf_list

(

scscf_list *

sl

)

Definition at line 461 of file scscf_list.c.

References _scscf_list::call_id, _scscf_list::list, _scscf_entry::next, and _scscf_entry::scscf_name.

Referenced by del_scscf_list(), and i_hash_table_destroy().

{
    scscf_entry *i;
    if (!sl) return;
    if (sl->call_id.s) shm_free(sl->call_id.s);
    while (sl->list) {
        i = sl->list->next;
        if (sl->list->scscf_name.s) shm_free(sl->list->scscf_name.s);
        shm_free(sl->list);
        sl->list = i;
    }
    shm_free(sl);
}

void print_scscf_list

(

int

log_level

)

Definition at line 475 of file scscf_list.c.

References _scscf_list::call_id, i_hash_slot::head, i_hash_size, i_hash_table, i_lock(), i_unlock(), _scscf_list::list, M_NAME, _scscf_entry::next, and _scscf_list::next.

{
    scscf_list *l;
    int i;
    scscf_entry *sl;
    LOG(log_level,"INF:"M_NAME":----------  S-CSCF Lists begin --------------\n");
    for(i=0;i<i_hash_size;i++){
        i_lock(i);
            l = i_hash_table[i].head;
            while(l){
                LOG(log_level,"INF:"M_NAME":[%4d] Call-ID: <%.*s> \n",i,
                    l->call_id.len,l->call_id.s);
                sl = l->list;
                while(sl){
                    LOG(log_level,"INF:"M_NAME":         Score:[%4d] S-CSCF: <%.*s> \n",
                        sl->score,
                        sl->scscf_name.len,sl->scscf_name.s);                   
                    sl = sl->next;
                }
                l = l->next;
            }       
        i_unlock(i);
    }
    LOG(log_level,"INF:"M_NAME":----------  S-CSCF Lists end   --------------\n");
    
}

int I_trans_in_processing	(	struct sip_msg *	msg,
		char *	str1,
		char *	str2
	)

Definition at line 502 of file scscf_list.c.

References CSCF_RETURN_FALSE, CSCF_RETURN_TRUE, and tmb.

{
        unsigned int hash, label;
        if (tmb.t_get_trans_ident(msg,&hash,&label)<0)
            return CSCF_RETURN_FALSE;
        return CSCF_RETURN_TRUE;
}

int I_scscf_select	(	struct sip_msg *	msg,
		char *	str1,
		char *	str2
	)

Definition at line 513 of file scscf_list.c.

References cscf_add_header_first(), cscf_get_call_id(), cscf_reply_transactional(), CSCF_RETURN_BREAK, CSCF_RETURN_ERROR, CSCF_RETURN_FALSE, CSCF_RETURN_TRUE, I_scscf_drop(), M_NAME, MSG_600_FORWARDING_FAILED, scscf_name, STR_APPEND, STR_PKG_DUP, and take_scscf_entry().

{
    str call_id,scscf_name={0,0};
    struct sip_msg *req;
    int result;
    str hdr={0,0};

    //print_scscf_list(L_ERR);
        
    call_id = cscf_get_call_id(msg,0);
    LOG(L_DBG,"DBG:"M_NAME":I_scscf_select(): <%.*s>\n",call_id.len,call_id.s);
    if (!call_id.len)
        return CSCF_RETURN_FALSE;
    
    scscf_name = take_scscf_entry(call_id);
    if (!scscf_name.len){
        I_scscf_drop(msg,str1,str2);
        cscf_reply_transactional(msg,600,MSG_600_FORWARDING_FAILED);            
        return CSCF_RETURN_BREAK;
    }
    
    if (msg->first_line.u.request.method.len==8 &&
        strncasecmp(msg->first_line.u.request.method.s,"REGISTER",8)==0) {
        /* REGISTER fwding */           
        if (str1&&str1[0]=='0'){
            /* first time */    
            //LOG(L_CRIT,"rewrite uri\n");
            if (rewrite_uri(msg, &(scscf_name)) < 0) {
                LOG(L_ERR,"ERR:"M_NAME":I_UAR_forward: Unable to Rewrite URI\n");
                result = CSCF_RETURN_FALSE;
            }else
                result = CSCF_RETURN_TRUE;
        }else{
            /* subsequent */
            //LOG(L_CRIT,"append branch\n");
            req = msg;//cscf_get_request_from_reply(msg);
            append_branch(req,scscf_name.s,scscf_name.len,0,0,0,0);
            result = CSCF_RETURN_TRUE;
        }
    }else{
        /* Another request */
        result = CSCF_RETURN_TRUE;
        
        hdr.len = route_hdr_s.len+scscf_name.len+route_hdr_e.len;
        hdr.s = pkg_malloc(hdr.len);
        if (!hdr.s){
            LOG(L_ERR,"ERR:"M_NAME":Mw_REQUEST_forward: Error allocating %d bytes\n",
                hdr.len);
            result = CSCF_RETURN_TRUE;
        }
        hdr.len=0;
        STR_APPEND(hdr,route_hdr_s);
        STR_APPEND(hdr,scscf_name);
        STR_APPEND(hdr,route_hdr_e);
    
        if (!cscf_add_header_first(msg,&hdr,HDR_ROUTE_T)){
            pkg_free(hdr.s);
            result = CSCF_RETURN_TRUE;
        }
        
        if (msg->dst_uri.s) pkg_free(msg->dst_uri.s);   
        STR_PKG_DUP(msg->dst_uri,scscf_name,"pkg");
    }

    if (scscf_name.s) shm_free(scscf_name.s);
    return result;
out_of_memory:  
    if (scscf_name.s) shm_free(scscf_name.s);
    return CSCF_RETURN_ERROR;
}

int I_scscf_drop	(	struct sip_msg *	msg,
		char *	str1,
		char *	str2
	)

Definition at line 584 of file scscf_list.c.

References cscf_get_call_id(), CSCF_RETURN_FALSE, CSCF_RETURN_TRUE, del_scscf_list(), and M_NAME.

Referenced by I_scscf_select().

{
    str call_id;
    //print_scscf_list(L_ERR);
    call_id = cscf_get_call_id(msg,0);
    LOG(L_DBG,"DBG:"M_NAME":I_scscf_drop(): <%.*s>\n",call_id.len,call_id.s);
    if (!call_id.len)
        return CSCF_RETURN_FALSE;
    
    del_scscf_list(call_id);
    return CSCF_RETURN_TRUE;
}

---

Variable Documentation

struct tm_binds tmb

Structure with pointers to tm funcs.

Definition at line 257 of file mod.c.

scscf_capabilities* SCSCF_Capabilities = 0

list of S-CSCFs and their capabilities

Definition at line 76 of file scscf_list.c.

Referenced by I_get_capab_ordered(), and I_get_capabilities().

int SCSCF_Capabilities_cnt = 0

size of list of S-CSCFs and their capabilities

Definition at line 77 of file scscf_list.c.

Referenced by I_get_capab_ordered(), and I_get_capabilities().

int i_hash_size

size of the hash table for the S-CSCF lists

Definition at line 79 of file scscf_list.c.

Referenced by add_scscf_list(), del_scscf_list(), i_hash_table_destroy(), i_hash_table_init(), is_scscf_list(), print_scscf_list(), and take_scscf_entry().

i_hash_slot* i_hash_table = 0

the hash table for the S-CSCF lists

Definition at line 80 of file scscf_list.c.

Referenced by add_scscf_list(), del_scscf_list(), i_hash_table_destroy(), i_hash_table_init(), i_lock(), i_unlock(), is_scscf_list(), print_scscf_list(), and take_scscf_entry().

str route_hdr_s = {"Route: <",8} [static]

Definition at line 510 of file scscf_list.c.

Referenced by cscf_remove_first_route(), and cscf_remove_own_route().

str route_hdr_e = {">\r\n",3} [static]

Definition at line 511 of file scscf_list.c.

Referenced by cscf_remove_first_route(), and cscf_remove_own_route().

---