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
|
/*
* This program 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.
*
* This program 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
*
* Author : Richard GAYRAUD - 04 Nov 2003
* From Hewlett Packard Company.
*/
#ifndef __CALL__
#define __CALL__
#include <map>
#include <list>
#include <sys/types.h>
#include <sys/socket.h>
#include <string.h>
#include "scenario.hpp"
#ifdef _USE_OPENSSL
#include "sslcommon.h"
#endif
#ifdef PCAPPLAY
#include "send_packets.h"
#endif
#ifndef MAX
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#endif
#define MAX_HEADER_LEN 2049
#define UDP_MAX_RETRANS_INVITE_TRANSACTION 5
#define UDP_MAX_RETRANS_NON_INVITE_TRANSACTION 9
#define UDP_MAX_RETRANS MAX(UDP_MAX_RETRANS_INVITE_TRANSACTION, UDP_MAX_RETRANS_NON_INVITE_TRANSACTION)
#define MAX_SUB_MESSAGE_LENGTH 2049
#define DEFAULT_T2_TIMER_VALUE 4000
#define SIP_TRANSACTION_TIMEOUT 32000
#ifdef __HPUX
extern int createAuthHeader(char * user, char * password, char * method, char * uri, char * msgbody, char * auth, char * aka_OP, char * aka_AMF, char * aka_K, char * result);
#else
extern "C" { extern int createAuthHeader(char * user, char * password, char * method, char * uri, char * msgbody, char * auth, char * aka_OP, char * aka_AMF, char * aka_K, char * result); }
#endif
/* Forward declaration of call, so that we can define the call_list iterator
* that is referenced from call. */
class call;
typedef std::list<call *> call_list;
/* This arrangement of wheels lets us support up to 32 bit timers.
*
* If we were to put a minimum bound on timer_resol (or do some kind of dynamic
* allocation), then we could reduce the level one order by a factor of
* timer_resol. */
#define LEVEL_ONE_ORDER 12
#define LEVEL_TWO_ORDER 10
#define LEVEL_THREE_ORDER 10
#define LEVEL_ONE_SLOTS (1 << LEVEL_ONE_ORDER)
#define LEVEL_TWO_SLOTS (1 << LEVEL_TWO_ORDER)
#define LEVEL_THREE_SLOTS (1 << LEVEL_THREE_ORDER)
/* A time wheel structure as defined in Varghese and Lauck's 1996 journal
* article (based on their 1987 SOSP paper). */
class timewheel {
public:
timewheel();
int expire_paused_calls();
/* Add a paused call and increment count. */
void add_paused_call(call *call, bool increment);
void remove_paused_call(call *call);
int size();
private:
/* How many calls are in this wheel. */
int count;
unsigned int wheel_base;
/* The actual wheels. */
call_list wheel_one[LEVEL_ONE_SLOTS];
call_list wheel_two[LEVEL_TWO_SLOTS];
call_list wheel_three[LEVEL_THREE_SLOTS];
/* Calls that are paused indefinitely. */
call_list forever_list;
/* Turn a call into a list (based on wakeup). */
call_list *call2list(call *call);
};
class call {
public:
char * id;
unsigned int number;
unsigned int tdm_map_number;
int msg_index;
/* Last message sent from scenario step (retransmitions do not
* change this index. Only message sent from the scenario
* are kept in this index.) */
int last_send_index;
char * last_send_msg;
/* Last received message (expected, not optional, and not
* retransmitted) and the associated hash. Stills setted until a new
* scenario steps sends a message */
unsigned long last_recv_hash;
int last_recv_index;
char * last_recv_msg;
/* Recv message characteristics when we sent a valid message
* (scneario, no retrans) just after a valid reception. This was
* a cause relationship, so the next time this cookie will be recvd,
* we will retransmit the same message we sent this time */
unsigned long recv_retrans_hash;
unsigned int recv_retrans_recv_index;
unsigned int recv_retrans_send_index;
unsigned int recv_timeout;
/* holds the route set */
char * dialog_route_set;
char * next_req_url;
/* cseq value for [cseq] keyword */
unsigned int cseq;
#ifdef PCAPPLAY
int hasMediaInformation;
pthread_t media_thread;
play_args_t play_args_a;
play_args_t play_args_v;
#endif
#ifdef _USE_OPENSSL
/* holds the auth header and if the challenge was 401 or 407 */
char * dialog_authentication;
int dialog_challenge_type;
#endif
unsigned int next_retrans;
int nb_retrans;
unsigned int nb_last_delay;
unsigned int paused_until;
unsigned long start_time;
unsigned long start_time_rtd[MAX_RTD_INFO_LENGTH];
bool rtd_done[MAX_RTD_INFO_LENGTH];
char *peer_tag;
int call_socket;
int call_remote_socket;
int call_port;
bool poll_flag_write ;
/* Index of the socket, only if the call locally created it
* and must delete it on call deletion */
int pollset_index;
void * comp_state;
int deleted;
bool call_established; // == true when the call is established
// ie ACK received or sent
// => init to false
bool count_in_stats; // == true if normal call to be counted
// in statistics
bool ack_is_pending; // == true if an ACK is pending
// Needed to avoid abortCall sending a
// CANCEL instead of BYE in some extreme
// cases for 3PCC scenario.
// => init to false
/* Call Variable Table */
CCallVariable * M_callVariableTable[SCEN_VARIABLE_SIZE];
/* result of execute action */
enum T_ActionResult
{
E_AR_NO_ERROR = 0,
E_AR_REGEXP_DOESNT_MATCH,
E_AR_STOP_CALL,
E_AR_HDR_NOT_FOUND
};
/* Store the last action result to allow */
/* call to continue and mark it as failed */
T_ActionResult last_action_result;
call(char * id, bool ipv6 = false);
~call();
/* rc == true means call not deleted by processing */
bool run();
void formatNextReqUrl (char* next_req_url);
void computeRouteSetAndRemoteTargetUri (char* rrList, char* contact, bool bRequestIncoming);
bool matches_scenario(unsigned int index, int reply_code, char * request, char * responsecseqmethod);
bool process_incoming(char * msg);
T_ActionResult executeAction(char * msg, int scenarioIndex);
void extractSubMessage(char * msg, char * matchingString, char* result, bool case_indep,
int occurrence, bool headers);
bool rejectCall();
// Get parameters from a [keyword]
void getHexStringParam(char * dest, char * src, int * len);
char* getKeywordParam(char * src, char * param, char * output);
// P_index use for message index in scenario and ctrl of CRLF
// P_index = -2 No ctrl of CRLF
// P_index = -1 Add crlf to end of message
char* createSendingMessage(char * src, int P_index);
// method for the management of unexpected messages
bool abortCall(); // call aborted with BYE or CANCEL
bool checkInternalCmd(char* cmd); // check of specific internal command
// received from the twin socket
// used for example to cancel the call
// of the third party
bool check_peer_src(char* msg,
int search_index); // 3pcc extended mode:check if
// the twin message received
// comes from the expected sender
int sendBuffer(char *buf); // send a message out of a scenario
// execution
int checkAutomaticResponseMode(char * P_recv);
bool automaticResponseMode(int P_case, char* P_recv);
#ifdef __3PCC__
int sendCmdMessage(int index); // 3PCC
bool process_twinSippCom(char * msg); // 3PCC
int sendCmdBuffer(char* cmd); // for 3PCC, send a command out of a
// scenario execution
#endif
typedef enum {
InputFileSequentialOrder = 0,
InputFileRandomOrder
}InputFileUsage;
static void readInputFileContents(const char* fileName);
static void dumpFileContents(void);
static void getFieldFromInputFile(const char* fieldName, unsigned int lineNum, char*& dest);
static void getIpFieldFromInputFile(int fieldNr, int lineNum, char *dest);
static int m_counter; // used for sequential access
/* Is this call paused or running? */
bool running;
/* If we are running, the iterator to remove us from the running list. */
call_list::iterator runit;
/* If we are paused, the iterator to remove us from the paused list. */
call_list::iterator pauseit;
private:
/* rc == true means call not deleted by processing */
bool next();
bool process_unexpected(char * msg);
void do_bookkeeping(int index);
void extract_cseq_method (char* responseCseq, char* msg);
int send_raw(char * msg, int index);
char * send_scene(int index, int *send_status);
void connect_socket_if_needed();
char * compute_cseq(char * src);
char * get_header_field_code(char * msg, char * code);
char * get_last_header(char * name);
char * get_header_content(char* message, char * name);
char * get_header(char* message, char * name, bool content);
static InputFileUsage m_usage;
int m_localLineNumber;
bool use_ipv6;
void get_remote_media_addr(char * message);
#ifdef _USE_OPENSSL
SSL_CTX *m_ctx_ssl ;
BIO *m_bio ;
#endif
};
/* Call contexts interface */
typedef std::map<std::string, call *> call_map;
call_map * get_calls();
call_list * get_running_calls();
call * add_call(char * call_id , int P_pollset_indx, bool ipv6 = false);
call * add_call(char * call_id , bool ipv6 = false);
call * add_call(bool ipv6 = false);
call * get_call(char *);
void delete_call(char *);
void delete_calls(void);
void add_running_call(call *call);
bool remove_running_call(call *call);
int expire_paused_calls();
int paused_calls_count();
void remove_paused_call(call *call);
#endif
|