mirror of https://github.com/sipwise/kamailio.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
140 lines
3.4 KiB
140 lines
3.4 KiB
/*
|
|
* Copyright (C) 2014 Federico Cabiddu (federico.cabiddu@gmail.com)
|
|
*
|
|
* This file is part of Kamailio, a free SIP server.
|
|
*
|
|
* Kamailio is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version
|
|
*
|
|
* Kamailio is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "../../sr_module.h"
|
|
#include "../../dprint.h"
|
|
#include "../../mod_fix.h"
|
|
#include "../../route.h"
|
|
#include "../../data_lump.h"
|
|
#include "../../lib/kcore/statistics.h"
|
|
#include "../../dset.h"
|
|
#include "../../script_cb.h"
|
|
#include "../../parser/msg_parser.h"
|
|
#include "../../parser/contact/parse_contact.h"
|
|
#include "tsilo.h"
|
|
#include "ts_hash.h"
|
|
#include "ts_append.h"
|
|
|
|
int ts_append(struct sip_msg* msg, str *ruri, char *table) {
|
|
ts_urecord_t* _r;
|
|
ts_transaction_t* ptr;
|
|
|
|
struct sip_uri p_uri;
|
|
str *t_uri;
|
|
|
|
int res;
|
|
int appended;
|
|
|
|
if (use_domain) {
|
|
t_uri = ruri;
|
|
} else {
|
|
if(parse_uri(ruri->s, ruri->len, &p_uri)<0) {
|
|
LM_ERR("failed to parse uri %.*s\n", ruri->len, ruri->s);
|
|
return -1;
|
|
}
|
|
t_uri = &p_uri.user;
|
|
}
|
|
|
|
lock_entry_by_ruri(t_uri);
|
|
|
|
res = get_ts_urecord(t_uri, &_r);
|
|
|
|
if (res != 0) {
|
|
LM_ERR("failed to retrieve record for %.*s\n", t_uri->len, t_uri->s);
|
|
unlock_entry_by_ruri(t_uri);
|
|
return -1;
|
|
}
|
|
|
|
ptr = _r->transactions;
|
|
|
|
while(ptr) {
|
|
LM_DBG("transaction %u:%u found for %.*s, going to append branches\n",ptr->tindex, ptr->tlabel, t_uri->len, t_uri->s);
|
|
|
|
appended = ts_append_to(msg, ptr->tindex, ptr->tlabel, table, ruri);
|
|
if (appended > 0)
|
|
update_stat(added_branches, appended);
|
|
ptr = ptr->next;
|
|
}
|
|
|
|
unlock_entry_by_ruri(t_uri);
|
|
|
|
return 1;
|
|
}
|
|
|
|
int ts_append_to(struct sip_msg* msg, int tindex, int tlabel, char *table, str *uri) {
|
|
struct cell *t=0;
|
|
struct cell *orig_t;
|
|
struct sip_msg *orig_msg;
|
|
int ret;
|
|
|
|
orig_t = _tmb.t_gett();
|
|
|
|
if(_tmb.t_lookup_ident(&t, tindex, tlabel) < 0)
|
|
{
|
|
LM_ERR("transaction [%u:%u] not found\n",
|
|
tindex, tlabel);
|
|
ret = -1;
|
|
goto done;
|
|
}
|
|
|
|
if (t->flags & T_CANCELED) {
|
|
LM_DBG("trasaction [%u:%u] was cancelled\n",
|
|
tindex, tlabel);
|
|
ret = -2;
|
|
goto done;
|
|
}
|
|
|
|
if (t->uas.status >= 200) {
|
|
LM_DBG("trasaction [%u:%u] sent out a final response already - %d\n",
|
|
tindex, tlabel, t->uas.status);
|
|
ret = -3;
|
|
goto done;
|
|
}
|
|
|
|
orig_msg = t->uas.request;
|
|
|
|
if(uri==NULL || uri->s==NULL || uri->len<=0) {
|
|
ret = _regapi.lookup_to_dset(orig_msg, table, NULL);
|
|
} else {
|
|
ret = _regapi.lookup_to_dset(orig_msg, table, uri);
|
|
}
|
|
|
|
if(ret != 1) {
|
|
LM_DBG("transaction %u:%u: error updating dset (%d)\n", tindex, tlabel, ret);
|
|
ret = -4;
|
|
goto done;
|
|
}
|
|
|
|
ret = _tmb.t_append_branches();
|
|
|
|
done:
|
|
/* unref the transaction which had been referred by t_lookup_ident() call.
|
|
* Restore the original transaction (if any) */
|
|
if(t) _tmb.unref_cell(t);
|
|
_tmb.t_sett(orig_t, T_BR_UNDEFINED);
|
|
|
|
return ret;
|
|
}
|