1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346
|
/*
* $Id: h_table.h,v 1.11 2006/05/30 15:41:57 bogdan_iancu Exp $
*
* Copyright (C) 2001-2003 FhG Fokus
*
* This file is part of openser, a free SIP server.
*
* openser 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
*
* openser 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* History:
* --------
* 2003-03-16 removed _TOTAG (jiri)
* 2003-03-06 we keep a list of 200/INV to-tags now (jiri)
* 2003-03-01 kr set through a function now (jiri)
* 2003-12-04 callbacks per transaction added; completion callback
* merge into them as LOCAL_COMPETED (bogdan)
* 2004-02-11 FIFO/CANCEL + alignments (hash=f(callid,cseq)) (uli+jiri)
* 2004-02-13 t->is_invite, t->local, t->noisy_ctimer replaced
* with flags (bogdan)
* 2004-08-23 avp support added - avp list linked in transaction (bogdan)
*/
#ifndef _H_TABLE_H
#define _H_TABLE_H
#include <stdio.h>
#include <stdlib.h>
#include "../../parser/msg_parser.h"
#include "../../types.h"
#include "../../md5utils.h"
#include "../../usr_avp.h"
#include "config.h"
struct s_table;
struct entry;
struct cell;
struct timer;
struct retr_buf;
#include "../../mem/shm_mem.h"
#include "lock.h"
#include "sip_msg.h"
#include "t_reply.h"
#include "t_hooks.h"
#include "timer.h"
#define LOCK_HASH(_h) lock_hash((_h))
#define UNLOCK_HASH(_h) unlock_hash((_h))
void lock_hash(int i);
void unlock_hash(int i);
#define NO_CANCEL ( (char*) 0 )
#define EXTERNAL_CANCEL ( (char*) -1)
#define TYPE_LOCAL_CANCEL -1
#define TYPE_REQUEST 0
/* to be able to assess whether a script writer forgot to
release a transaction and leave it for ever in memory,
we mark it with operations done over it; if none of these
flags is set and script is being left, it is a sign of
script error and we need to release on writer's
behalf
REQ_FWDED means there is a UAC with final response timer
ticking. If it hits, transaction will be completed.
REQ_RPLD means that a transaction has been replied -- either
it implies going to wait state, or for invite transactions
FR timer is ticking until ACK arrives
REQ_RLSD means that a transaction was put on wait explicitly
from t_release_transaction
REQ_EXIST means that this request is a retransmission which does not
affect transactional state
*/
enum kill_reason { REQ_FWDED=1, REQ_RPLD=2, REQ_RLSD=4, REQ_EXIST=8 };
typedef struct retr_buf
{
int activ_type;
/* set to status code if the buffer is a reply,
0 if request or -1 if local CANCEL */
str buffer;
struct dest_info dst;
/* a message can be linked just to retransmission and FR list */
struct timer_link retr_timer;
struct timer_link fr_timer;
enum lists retr_list;
/*the cell that contains this retrans_buff*/
struct cell* my_T;
unsigned int branch;
}retr_buf_type;
/* User Agent Server content */
typedef struct ua_server
{
struct sip_msg *request;
char *end_request;
struct retr_buf response;
unsigned int status;
/* keep to-tags for local 200 replies for INVITE --
* we need them for dialog-wise matching of ACKs;
* the pointer shows to shmem-ed reply */
str local_totag;
}ua_server_type;
/* User Agent Client content */
typedef struct ua_client
{
struct retr_buf request;
/* we maintain a separate copy of cancel rather than
reuse the structure for original request; the
original request is no longer needed but its delayed
timer may fire and interfere with whoever tries to
rewrite it
*/
struct retr_buf local_cancel;
/* pointer to retransmission buffer where uri is printed;
good for generating ACK/CANCEL */
str uri;
/* if we store a reply (branch picking), this is where it is */
struct sip_msg *reply;
/* if we don't store, we at least want to know the status */
short last_received;
/* UAC specific flags */
short flags;
/* script flags, specific to this branch */
int br_flags;
}ua_client_type;
struct totag_elem {
str tag;
short acked;
struct totag_elem *next;
};
/* transaction's flags */
/* is the transaction's request an INVITE? */
#define T_IS_INVITE_FLAG (1<<0)
/* is this a transaction generated by local request? */
#define T_IS_LOCAL_FLAG (1<<1)
/* set to one if you want to disallow silent transaction
dropping when C timer hits */
#define T_NOISY_CTIMER_FLAG (1<<2)
/* set if a CANCEL was received for the transaction */
#define T_WAS_CANCELLED_FLAG (1<<3)
#define T_HOPBYHOP_CANCEL_FLAG (1<<4)
/* transaction UAC's flags */
/* is the UAC pending for CANCEL ? */
#define T_UAC_TO_CANCEL_FLAG (1<<0)
/* have the UAC received any replies? */
#define T_UAC_HAS_RECV_REPLY (1<<1)
/* transaction context */
typedef struct cell
{
/* linking data */
struct cell* next_cell;
struct cell* prev_cell;
/* tells in which hash table entry the cell lives */
unsigned int hash_index;
/* sequence number within hash collision slot */
unsigned int label;
/* different information about the transaction */
unsigned int flags;
/* how many processes are currently processing this transaction ;
note that only processes working on a request/reply belonging
to a transaction increase ref_count -- timers don't, since we
rely on transaction state machine to clean-up all but wait timer
when entering WAIT state and the wait timer is the only place
from which a transaction can be deleted (if ref_count==0); good
for protecting from conditions in which wait_timer hits and
tries to delete a transaction whereas at the same time
a delayed message belonging to the transaction is received */
volatile unsigned int ref_count;
/* needed for generating local ACK/CANCEL for local
transactions; all but cseq_n include the entire
header field value, cseq_n only Cseq number; with
local transactions, pointers point to outbound buffer,
with proxied transactions to inbound request */
str from, callid, cseq_n, to;
/* method shortcut -- for local transactions, pointer to
outbound buffer, for proxies transactions pointer to
original message; needed for reply matching */
str method;
/* head of callback list */
struct tmcb_head_list tmcb_hl;
/* bindings to wait and delete timer */
struct timer_link wait_tl;
struct timer_link dele_tl;
/* first branch - when serial forking is performed, keeps the first
* branch for each step ; it allows proper branch selection */
int first_branch;
/* number of forks */
int nr_of_outgoings;
/* nr of replied branch; 0..MAX_BRANCHES=branch value,
* -1 no reply, -2 local reply */
int relaied_reply_branch;
/* UA Server */
struct ua_server uas;
/* UA Clients */
struct ua_client uac[ MAX_BRANCHES ];
/* protection against concurrent reply processing */
ser_lock_t reply_mutex;
/* the route to take if no final positive reply arrived */
unsigned int on_negative;
/* the onreply_route to be processed if registered to do so */
unsigned int on_reply;
/* the branch_route to be processed separately for each branch */
unsigned int on_branch;
/* MD5checksum (meaningful only if syn_branch=0 */
char md5[MD5_LEN];
#ifdef EXTRA_DEBUG
/* scheduled for deletion ? */
short damocles;
#endif
/* to-tags of 200/INVITEs which were received from downstream and
* forwarded or passed to UAC; note that there can be arbitrarily
* many due to downstream forking; */
struct totag_elem *fwded_totags;
/* list with user avp */
struct usr_avp *user_avps;
}cell_type;
/* double-linked list of cells with hash synonyms */
typedef struct entry
{
struct cell* first_cell;
struct cell* last_cell;
/* currently highest sequence number in a synonym list */
unsigned int next_label;
/* sync mutex */
ser_lock_t mutex;
unsigned long acc_entries;
unsigned long cur_entries;
}entry_type;
/* transaction table */
struct s_table
{
/* table of hash entries; each of them is a list of synonyms */
struct entry entrys[ TM_TABLE_ENTRIES ];
};
#define list_entry(ptr, type, member) \
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
#define get_retr_timer_payload(_tl_) \
list_entry( _tl_, struct retr_buf, retr_timer)
#define get_fr_timer_payload(_tl_) \
list_entry( _tl_, struct retr_buf, fr_timer)
#define get_wait_timer_payload(_tl_) \
list_entry( _tl_, struct cell, wait_tl)
#define get_dele_timer_payload(_tl_) \
list_entry( _tl_, struct cell, dele_tl)
#define get_T_from_reply_rb(_rb_) \
list_entry( list_entry( _rb_, (struct ua_server), response),\
struct cell, uas)
#define get_T_from_request_rb(_rb_, _br_) \
list_entry( list_entry( (rb_, (struct ua_client), request) - \
(_br_)*sizeof(struct retr_buf), struct cell, uas)
#define get_T_from_cancel_rb(_rb_, _br_) \
list_entry( list_entry( (rb_, (struct ua_client), local_cancel) - \
(_br_)*sizeof(struct retr_buf), struct cell, uas)
#define is_invite(_t_) ((_t_)->flags&T_IS_INVITE_FLAG)
#define is_local(_t_) ((_t_)->flags&T_IS_LOCAL_FLAG)
#define has_noisy_ctimer(_t_) ((_t_)->flags&T_NOISY_CTIMER_FLAG)
#define was_cancelled(_t_) ((_t_)->flags&T_WAS_CANCELLED_FLAG)
#define is_hopbyhop_cancel(_t_) ((_t_)->flags&T_HOPBYHOP_CANCEL_FLAG)
void set_kr( enum kill_reason kr );
enum kill_reason get_kr();
struct s_table* get_tm_table();
struct s_table* init_hash_table();
void free_hash_table( );
void free_cell( struct cell* dead_cell );
struct cell* build_cell( struct sip_msg* p_msg );
void remove_from_hash_table_unsafe( struct cell * p_cell);
#ifdef OBSOLETED
void insert_into_hash_table( struct cell * p_cell, unsigned int _hash);
#endif
void insert_into_hash_table_unsafe( struct cell * p_cell, unsigned int _hash );
unsigned int transaction_count( void );
int fifo_hash( FILE *stream, char *response_file );
/* Unix socket variant */
int unixsock_hash(str* msg);
#endif
|