forked from sipwise/kamailio
-
Notifications
You must be signed in to change notification settings - Fork 0
/
dset.c
518 lines (435 loc) · 10.9 KB
/
dset.c
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
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
/*
* $Id$
*
* destination set
*
* Copyright (C) 2001-2004 FhG FOKUS
*
* This file is part of ser, a free SIP server.
*
* ser 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
*
* For a license to use the ser software under conditions
* other than those described here, or to purchase support for this
* software, please contact iptel.org by e-mail at the following addresses:
* info@iptel.org
*
* ser 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
*/
/** destination set / branches support.
* @file dset.c
* @ingroup core
* Module: @ref core
*/
#include <string.h>
#include "dprint.h"
#include "config.h"
#include "parser/parser_f.h"
#include "parser/msg_parser.h"
#include "ut.h"
#include "hash_func.h"
#include "error.h"
#include "dset.h"
#include "mem/mem.h"
#include "ip_addr.h"
#define CONTACT "Contact: "
#define CONTACT_LEN (sizeof(CONTACT) - 1)
#define CONTACT_DELIM ", "
#define CONTACT_DELIM_LEN (sizeof(CONTACT_DELIM) - 1)
#define Q_PARAM ">;q="
#define Q_PARAM_LEN (sizeof(Q_PARAM) - 1)
/*
* Where we store URIs of additional transaction branches
* (-1 because of the default branch, #0)
*/
static struct branch branches[MAX_BRANCHES - 1];
/* how many of them we have */
unsigned int nr_branches = 0;
/* branch iterator */
static int branch_iterator = 0;
/* used to mark ruris "consumed" when branching (1 new, 0 consumed) */
int ruri_is_new = 0;
/* The q parameter of the Request-URI */
static qvalue_t ruri_q = Q_UNSPECIFIED;
/* Branch flags of the Request-URI */
static flag_t ruri_bflags;
/*! \brief
* Return pointer to branch[idx] structure
* @param idx - branch index
*
* @return pointer to branch or NULL if invalid branch
*/
branch_t *get_sip_branch(int idx)
{
if(nr_branches==0)
return NULL;
if(idx<0)
{
if(nr_branches + idx >= 0)
return &branches[nr_branches+idx];
return NULL;
}
if(idx < nr_branches)
return &branches[idx];
return 0;
}
/*! \brief
* Drop branch[idx]
* @param idx - branch index
*
* @return 0 on success, -1 on error
*/
int drop_sip_branch(int idx)
{
if(nr_branches==0 || idx>=nr_branches)
return 0;
if(idx<0 && nr_branches+idx<0)
return 0;
/* last branch */
if(idx==nr_branches-1)
{
nr_branches--;
return 0;
}
if(idx<0)
idx = nr_branches+idx;
/* shift back one position */
for(; idx<nr_branches-1; idx++)
memcpy(&branches[idx], &branches[idx+1], sizeof(branch_t));
nr_branches--;
return 0;
}
static inline flag_t* get_bflags_ptr(unsigned int branch)
{
if (branch == 0) return &ruri_bflags;
if (branch - 1 < nr_branches) return &branches[branch - 1].flags;
return NULL;
}
int setbflag(unsigned int branch, flag_t flag)
{
flag_t* flags;
if ((flags = get_bflags_ptr(branch)) == NULL) return -1;
(*flags) |= 1 << flag;
return 1;
}
int isbflagset(unsigned int branch, flag_t flag)
{
flag_t* flags;
if ((flags = get_bflags_ptr(branch)) == NULL) return -1;
return ((*flags) & (1 << flag)) ? 1 : -1;
}
int resetbflag(unsigned int branch, flag_t flag)
{
flag_t* flags;
if ((flags = get_bflags_ptr(branch)) == NULL) return -1;
(*flags) &= ~ (1 << flag);
return 1;
}
int getbflagsval(unsigned int branch, flag_t* res)
{
flag_t* flags;
if (res == NULL) return -1;
if ((flags = get_bflags_ptr(branch)) == NULL) return -1;
*res = *flags;
return 1;
}
int setbflagsval(unsigned int branch, flag_t val)
{
flag_t* flags;
if ((flags = get_bflags_ptr(branch)) == NULL) return -1;
*flags = val;
return 1;
}
/*
* Initialize the branch iterator, the next
* call to next_branch will return the first
* contact from the dset array
*/
void init_branch_iterator(void)
{
branch_iterator = 0;
}
/**
* return the value of current branch iterator
*/
int get_branch_iterator(void)
{
return branch_iterator;
}
/**
* set the value of current branch interator
*/
void set_branch_iterator(int n)
{
branch_iterator = n;
}
/** \brief Get a branch from the destination set
* \return Return the 'i' branch from the dset
* array, 0 is returned if there are no
* more branches
*/
char* get_branch(unsigned int i, int* len, qvalue_t* q, str* dst_uri,
str* path, unsigned int *flags,
struct socket_info** force_socket)
{
if (i < nr_branches) {
*len = branches[i].len;
*q = branches[i].q;
if (dst_uri) {
dst_uri->len = branches[i].dst_uri_len;
dst_uri->s = (dst_uri->len)?branches[i].dst_uri:0;
}
if (path) {
path->len = branches[i].path_len;
path->s = (path->len)?branches[i].path:0;
}
if (force_socket)
*force_socket = branches[i].force_send_socket;
if (flags)
*flags = branches[i].flags;
return branches[i].uri;
} else {
*len = 0;
*q = Q_UNSPECIFIED;
if (dst_uri) {
dst_uri->s = 0;
dst_uri->len = 0;
}
if (path) {
path->s = 0;
path->len = 0;
}
if (force_socket)
*force_socket = 0;
if (flags)
*flags = 0;
return 0;
}
}
/** Return the next branch from the dset array.
* 0 is returned if there are no more branches
*/
char* next_branch(int* len, qvalue_t* q, str* dst_uri, str* path,
unsigned int* flags, struct socket_info** force_socket)
{
char* ret;
ret=get_branch(branch_iterator, len, q, dst_uri, path, flags,
force_socket);
if (likely(ret))
branch_iterator++;
return ret;
}
/*
* Empty the dset array
*/
void clear_branches(void)
{
nr_branches = 0;
ruri_q = Q_UNSPECIFIED;
ruri_bflags = 0;
ruri_mark_consumed();
}
/** Add a new branch to the current transaction.
* @param msg - sip message, used for getting the uri if not specified (0).
* @param uri - uri, can be 0 (in which case the uri is taken from msg)
* @param dst_uri - destination uri, can be 0.
* @param path - path vector (passed in a string), can be 0.
* @param q - q value.
* @param flags - per branch flags.
* @param force_socket - socket that should be used when sending.
*
* @return <0 (-1) on failure, 1 on success (script convention).
*/
int append_branch(struct sip_msg* msg, str* uri, str* dst_uri, str* path,
qvalue_t q, unsigned int flags, struct socket_info* force_socket)
{
str luri;
/* if we have already set up the maximum number
* of branches, don't try new ones
*/
if (unlikely(nr_branches == MAX_BRANCHES - 1)) {
LOG(L_ERR, "max nr of branches exceeded\n");
ser_error = E_TOO_MANY_BRANCHES;
return -1;
}
/* if not parameterized, take current uri */
if (uri==0 || uri->len==0 || uri->s==0) {
if (msg->new_uri.s)
luri = msg->new_uri;
else
luri = msg->first_line.u.request.uri;
} else {
luri = *uri;
}
if (unlikely(luri.len > MAX_URI_SIZE - 1)) {
LOG(L_ERR, "too long uri: %.*s\n", luri.len, luri.s);
return -1;
}
/* copy the dst_uri */
if (dst_uri && dst_uri->len && dst_uri->s) {
if (unlikely(dst_uri->len > MAX_URI_SIZE - 1)) {
LOG(L_ERR, "too long dst_uri: %.*s\n", dst_uri->len, dst_uri->s);
return -1;
}
memcpy(branches[nr_branches].dst_uri, dst_uri->s, dst_uri->len);
branches[nr_branches].dst_uri[dst_uri->len] = 0;
branches[nr_branches].dst_uri_len = dst_uri->len;
} else {
branches[nr_branches].dst_uri[0] = '\0';
branches[nr_branches].dst_uri_len = 0;
}
/* copy the path string */
if (unlikely(path && path->len && path->s)) {
if (unlikely(path->len > MAX_PATH_SIZE - 1)) {
LOG(L_ERR, "too long path: %.*s\n", path->len, path->s);
return -1;
}
memcpy(branches[nr_branches].path, path->s, path->len);
branches[nr_branches].path[path->len] = 0;
branches[nr_branches].path_len = path->len;
} else {
branches[nr_branches].path[0] = '\0';
branches[nr_branches].path_len = 0;
}
/* copy the ruri */
memcpy(branches[nr_branches].uri, luri.s, luri.len);
branches[nr_branches].uri[luri.len] = 0;
branches[nr_branches].len = luri.len;
branches[nr_branches].q = q;
branches[nr_branches].force_send_socket = force_socket;
branches[nr_branches].flags = flags;
nr_branches++;
return 1;
}
/*
* Create a Contact header field from the dset
* array
*/
char* print_dset(struct sip_msg* msg, int* len)
{
int cnt, i;
unsigned int qlen;
qvalue_t q;
str uri;
char* p, *qbuf;
int crt_branch;
static char dset[MAX_REDIRECTION_LEN];
if (msg->new_uri.s) {
cnt = 1;
*len = msg->new_uri.len;
if (ruri_q != Q_UNSPECIFIED) {
*len += 1 + Q_PARAM_LEN + len_q(ruri_q);
}
} else {
cnt = 0;
*len = 0;
}
/* backup current branch index to restore it later */
crt_branch = get_branch_iterator();
init_branch_iterator();
while ((uri.s = next_branch(&uri.len, &q, 0, 0, 0, 0))) {
cnt++;
*len += uri.len;
if (q != Q_UNSPECIFIED) {
*len += 1 + Q_PARAM_LEN + len_q(q);
}
}
if (cnt == 0) return 0;
*len += CONTACT_LEN + CRLF_LEN + (cnt - 1) * CONTACT_DELIM_LEN;
if (*len + 1 > MAX_REDIRECTION_LEN) {
LOG(L_ERR, "ERROR: redirection buffer length exceed\n");
goto error;
}
memcpy(dset, CONTACT, CONTACT_LEN);
p = dset + CONTACT_LEN;
if (msg->new_uri.s) {
if (ruri_q != Q_UNSPECIFIED) {
*p++ = '<';
}
memcpy(p, msg->new_uri.s, msg->new_uri.len);
p += msg->new_uri.len;
if (ruri_q != Q_UNSPECIFIED) {
memcpy(p, Q_PARAM, Q_PARAM_LEN);
p += Q_PARAM_LEN;
qbuf = q2str(ruri_q, &qlen);
memcpy(p, qbuf, qlen);
p += qlen;
}
i = 1;
} else {
i = 0;
}
init_branch_iterator();
while ((uri.s = next_branch(&uri.len, &q, 0, 0, 0, 0))) {
if (i) {
memcpy(p, CONTACT_DELIM, CONTACT_DELIM_LEN);
p += CONTACT_DELIM_LEN;
}
if (q != Q_UNSPECIFIED) {
*p++ = '<';
}
memcpy(p, uri.s, uri.len);
p += uri.len;
if (q != Q_UNSPECIFIED) {
memcpy(p, Q_PARAM, Q_PARAM_LEN);
p += Q_PARAM_LEN;
qbuf = q2str(q, &qlen);
memcpy(p, qbuf, qlen);
p += qlen;
}
i++;
}
memcpy(p, CRLF " ", CRLF_LEN + 1);
set_branch_iterator(crt_branch);
return dset;
error:
set_branch_iterator(crt_branch);
return 0;
}
/*
* Sets the q parameter of the Request-URI
*/
void set_ruri_q(qvalue_t q)
{
ruri_q = q;
}
/*
* Return the q value of the Request-URI
*/
qvalue_t get_ruri_q(void)
{
return ruri_q;
}
/*
* Rewrite Request-URI
*/
int rewrite_uri(struct sip_msg* _m, str* _s)
{
char* buf;
buf = (char*)pkg_malloc(_s->len + 1);
if (!buf) {
LOG(L_ERR, "ERROR: rewrite_uri: No memory left\n");
return -1;
}
memcpy(buf, _s->s, _s->len);
buf[_s->len] = '\0';
_m->parsed_uri_ok = 0;
if (_m->new_uri.s) {
pkg_free(_m->new_uri.s);
}
_m->new_uri.s = buf;
_m->new_uri.len = _s->len;
/* mark ruri as new and available for forking */
ruri_mark_new();
return 1;
}