forked from OpenSIPS/opensips
-
Notifications
You must be signed in to change notification settings - Fork 1
/
dset.c
846 lines (688 loc) · 17.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
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
/*
* Copyright (C) 2001-2004 FhG FOKUS
*
* This file is part of opensips, a free SIP server.
*
* opensips 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
*
* opensips 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
*/
/*!
* \file
* \brief Destination set handling functions
*/
#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 "context.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)
#define DSET_INCREMENT 4
struct branch
{
char uri[MAX_URI_SIZE];
unsigned int len;
/* Real destination of the request */
char dst_uri[MAX_URI_SIZE];
unsigned int dst_uri_len;
/* Path vector of the request */
char path[MAX_PATH_SIZE];
unsigned int path_len;
int q; /* Preference of the contact among contact within the array */
const struct socket_info* force_send_socket;
unsigned int flags;
};
struct dset_ctx
{
int enabled;
/*! how many of them we currently have */
int nr_branches;
/*!
* Where we store URIs of additional transaction branches
* (-1 because of the default branch, #0)
*/
struct branch *branches;
};
static int dset_ctx_idx = -1;
#define get_dset_ctx() \
(!current_processing_ctx ? NULL : (struct dset_ctx *) \
context_get_ptr(CONTEXT_GLOBAL, current_processing_ctx, dset_ctx_idx))
int get_nr_branches(void)
{
struct dset_ctx *dsct = get_dset_ctx();
return !dsct ? 0 : dsct->nr_branches;
}
#define store_dset_ctx(value) \
(context_put_ptr( \
CONTEXT_GLOBAL, current_processing_ctx, dset_ctx_idx, value))
/*! Frees a destination set which used to be stored in the global context */
static void dset_destroy(void *dsct)
{
pkg_free(((struct dset_ctx *)dsct)->branches);
pkg_free(dsct);
}
int init_dset(void)
{
dset_ctx_idx = context_register_ptr(CONTEXT_GLOBAL, dset_destroy);
if (dset_ctx_idx < 0)
return -1;
return 0;
}
static inline unsigned int* get_ptr_bflags(struct sip_msg *msg, unsigned int b_idx)
{
struct dset_ctx *dsct = get_dset_ctx();
if (!dsct && b_idx != 0)
return NULL;
if (b_idx == 0) {
return &getb0flags(msg);
} else {
if (b_idx - 1 < dsct->nr_branches) {
return &dsct->branches[b_idx - 1].flags;
} else {
return 0;
}
}
}
int setbflag(struct sip_msg *msg, unsigned int b_idx, unsigned int mask)
{
unsigned int *flags;
flags = get_ptr_bflags( msg, b_idx );
#ifdef EXTRA_DEBUG
LM_DBG("bflags for %p : (%u, %u)\n", msg, mask, *flags);
#endif
if (flags==0)
return -1;
(*flags) |= mask;
return 1;
}
/*! \brief
* Tests the per branch flags
*/
int isbflagset(struct sip_msg *msg, unsigned int b_idx, unsigned int mask)
{
unsigned int *flags;
flags = get_ptr_bflags( msg, b_idx );
#ifdef EXTRA_DEBUG
LM_DBG("bflags for %p : (%u, %u)\n", msg, mask, *flags);
#endif
if (flags==0)
return -1;
return ( (*flags) & mask) ? 1 : -1;
}
/*! \brief
* Resets the per branch flags
*/
int resetbflag(struct sip_msg *msg, unsigned int b_idx, unsigned int mask)
{
unsigned int *flags;
flags = get_ptr_bflags( msg, b_idx );
#ifdef EXTRA_DEBUG
LM_DBG("bflags for %p : (%u, %u)\n", msg, mask, *flags);
#endif
if (flags==0)
return -1;
(*flags) &= ~mask;
return 1;
}
/*! \brief Disable/Enables parallel branch usage (read and write)
*/
void set_dset_state(unsigned char enable)
{
struct dset_ctx *dsct = get_dset_ctx();
static unsigned int bk_nr_branches;
if (!dsct)
return;
if (enable) {
/* enable dset usage */
if (dsct->enabled) return; /* already enabled */
/* enable read */
dsct->nr_branches = bk_nr_branches;
bk_nr_branches = 0;
/* enable write */
dsct->enabled = 1;
} else {
/* disable dset usage */
if (!dsct->enabled) return; /* already disabled */
/* disable read */
bk_nr_branches = dsct->nr_branches;
dsct->nr_branches = 0;
/* disabel write */
dsct->enabled = 0;
}
}
/*! \brief Find the next brand from the destination set
* \return Return the next branch from the dset
* array, 0 is returned if there are no
* more branches
*/
char* get_branch(unsigned int idx, int* len, qvalue_t* q, str* dst_uri,
str* path, unsigned int *flags, const struct socket_info** force_socket)
{
struct dset_ctx *dsct = get_dset_ctx();
struct branch *branches;
if (dsct && idx < dsct->nr_branches) {
branches = dsct->branches;
*len = branches[idx].len;
*q = branches[idx].q;
if (dst_uri) {
dst_uri->len = branches[idx].dst_uri_len;
dst_uri->s = (dst_uri->len)?branches[idx].dst_uri : NULL;
}
if (path) {
path->len = branches[idx].path_len;
path->s = (path->len)?branches[idx].path : NULL;
}
if (force_socket)
*force_socket = branches[idx].force_send_socket;
if (flags)
*flags = branches[idx].flags;
return branches[idx].uri;
} else {
*len = 0;
*q = Q_UNSPECIFIED;
if (dst_uri) {
dst_uri->s = NULL;
dst_uri->len = 0;
}
if (force_socket)
*force_socket = NULL;
if (flags)
*flags = 0;
return NULL;
}
}
/*! \brief
* Empty the dset array
*/
void clear_branches(void)
{
struct dset_ctx *dsct = get_dset_ctx();
if (dsct)
dsct->nr_branches = 0;
}
/* ! \brief
* Add a new branch to current transaction
*/
int append_branch(struct sip_msg* msg, str* uri, str* dst_uri, str* path,
qvalue_t q, unsigned int flags, const struct socket_info* force_socket)
{
str luri;
int nr_branches;
struct branch *branches, *new_br;
struct dset_ctx *dsct = get_dset_ctx();
if (dsct && !dsct->enabled)
return -1;
if (!dsct) {
dsct = pkg_malloc(sizeof *dsct);
if (!dsct) {
LM_ERR("oom 1\n");
return E_OUT_OF_MEM;
}
memset(dsct, 0, sizeof *dsct);
dsct->enabled = 1;
store_dset_ctx(dsct);
}
nr_branches = dsct->nr_branches;
/* if we have already set up the maximum number
* of branches, don't try new ones
*/
if (nr_branches == MAX_BRANCHES - 1) {
LM_ERR("max nr of branches exceeded\n");
ser_error = E_TOO_MANY_BRANCHES;
return -1;
}
if (nr_branches % DSET_INCREMENT == 0) {
new_br = pkg_realloc(dsct->branches,
(nr_branches + DSET_INCREMENT) * sizeof *dsct->branches);
if (!new_br) {
LM_ERR("oom 2\n");
return E_OUT_OF_MEM;
}
dsct->branches = new_br;
}
/* if not parameterized, take current uri */
if (ZSTRP(uri)) {
if (msg->new_uri.s)
luri = msg->new_uri;
else
luri = msg->first_line.u.request.uri;
} else {
luri = *uri;
}
if (luri.len > MAX_URI_SIZE - 1) {
LM_ERR("too long uri: %.*s\n", luri.len, luri.s);
return -1;
}
branches = dsct->branches;
/* copy the dst_uri */
if (ZSTRP(dst_uri)) {
branches[nr_branches].dst_uri[0] = '\0';
branches[nr_branches].dst_uri_len = 0;
} else {
if (dst_uri->len > MAX_URI_SIZE - 1) {
LM_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;
}
/* copy the path string */
if (ZSTRP(path)) {
branches[nr_branches].path[0] = '\0';
branches[nr_branches].path_len = 0;
} else {
if (path->len > MAX_PATH_SIZE - 1) {
LM_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;
}
/* 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;
dsct->nr_branches++;
return 1;
}
/* ! \brief
* Updates one or more fields of an already appended branch
*/
int update_branch(unsigned int idx, str** uri, str** dst_uri, str** path,
qvalue_t* q, unsigned int* flags, const struct socket_info** force_socket)
{
struct dset_ctx *dsct = get_dset_ctx();
struct branch *branches;
if (!dsct || !dsct->enabled || idx >= dsct->nr_branches)
return -1;
branches = dsct->branches;
/* uri ? */
if (uri) {
/* set uri */
if (*uri==NULL || (*uri)->len>MAX_URI_SIZE-1) {
LM_ERR("empty or too long uri\n");
return -1;
}
memcpy(branches[idx].uri, (*uri)->s, (*uri)->len);
branches[idx].uri[(*uri)->len] = '\0';
branches[idx].len = (*uri)->len;
}
/* duri ? */
if (dst_uri) {
if (ZSTRP(*dst_uri)) {
branches[idx].dst_uri[0] = '\0';
branches[idx].dst_uri_len = 0;
} else {
if ((*dst_uri)->len > MAX_URI_SIZE - 1) {
LM_ERR("too long dst_uri: %.*s\n",
(*dst_uri)->len, (*dst_uri)->s);
return -1;
}
memcpy(branches[idx].dst_uri, (*dst_uri)->s, (*dst_uri)->len);
branches[idx].dst_uri[(*dst_uri)->len] = '\0';
branches[idx].dst_uri_len = (*dst_uri)->len;
}
}
/* path ? */
if (path) {
if (ZSTRP(*path)) {
branches[idx].path[0] = '\0';
branches[idx].path_len = 0;
} else {
if ((*path)->len > MAX_PATH_SIZE - 1) {
LM_ERR("too long path: %.*s\n", (*path)->len, (*path)->s);
return -1;
}
memcpy(branches[idx].path, (*path)->s, (*path)->len);
branches[idx].path[(*path)->len] = '\0';
branches[idx].path_len = (*path)->len;
}
}
/* Q value ? */
if (q)
branches[idx].q = *q;
/* flags ? */
if (flags)
branches[idx].flags = *flags;
/* socket ? */
if (force_socket)
branches[idx].force_send_socket = *force_socket;
return 0;
}
int remove_branch(unsigned int idx)
{
struct dset_ctx *dsct = get_dset_ctx();
if (!dsct || !dsct->enabled || idx >= dsct->nr_branches)
return -1;
/* not last branch? */
if (idx + 1 != dsct->nr_branches)
memmove(dsct->branches + idx, dsct->branches + idx + 1,
(dsct->nr_branches - idx - 1) * sizeof *dsct->branches);
dsct->nr_branches--;
return 0;
}
/*! \brief
* Create a Contact header field from the dset
* array
*/
char* print_dset(struct sip_msg* msg, int* len)
{
int cnt, i, idx;
unsigned int qlen;
qvalue_t q;
str uri;
char* p, *qbuf;
static char *dset = NULL;
static unsigned int dset_len = 0;
if (msg->new_uri.s) {
cnt = 1;
*len = msg->new_uri.len+2 /*for <>*/;
if (get_ruri_q(msg) != Q_UNSPECIFIED) {
*len += Q_PARAM_LEN + len_q(get_ruri_q(msg));
}
} else {
cnt = 0;
*len = 0;
}
for( idx=0 ; (uri.s=get_branch(idx,&uri.len,&q,0,0,0,0))!=0 ; idx++ ) {
cnt++;
*len += uri.len+2 /*for <>*/ ;
if (q != Q_UNSPECIFIED) {
*len += Q_PARAM_LEN + len_q(q);
}
}
if (cnt == 0) return 0;
*len += CONTACT_LEN + CRLF_LEN + (cnt - 1) * CONTACT_DELIM_LEN;
/* does the current buffer fit the new dset ? */
if (*len + 1 > dset_len) {
/* need to resize */
dset = pkg_realloc(dset, *len + 1);
if (!dset) {
dset_len = 0;
LM_ERR("failed to allocate redirect buffer for %d bytes\n", *len + 1);
return NULL;
}
dset_len = *len + 1;
}
memcpy(dset, CONTACT, CONTACT_LEN);
p = dset + CONTACT_LEN;
if (msg->new_uri.s) {
*p++ = '<';
memcpy(p, msg->new_uri.s, msg->new_uri.len);
p += msg->new_uri.len;
*p++ = '>';
if (get_ruri_q(msg) != Q_UNSPECIFIED) {
memcpy(p, Q_PARAM, Q_PARAM_LEN);
p += Q_PARAM_LEN;
qbuf = q2str(get_ruri_q(msg), &qlen);
memcpy(p, qbuf, qlen);
p += qlen;
}
i = 1;
} else {
i = 0;
}
for( idx=0 ; (uri.s=get_branch(idx,&uri.len,&q,0,0,0,0))!=0 ; idx++ ) {
if (i) {
memcpy(p, CONTACT_DELIM, CONTACT_DELIM_LEN);
p += CONTACT_DELIM_LEN;
}
*p++ = '<';
memcpy(p, uri.s, uri.len);
p += uri.len;
*p++ = '>';
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);
return dset;
}
/*! \brief moves the uri to destination for all branches and
* all uris are set to given uri */
int branch_uri2dset( str *new_uri )
{
struct dset_ctx *dsct = get_dset_ctx();
struct branch *branches;
unsigned int b;
/* no branches have been added yet */
if (!dsct)
return 0;
branches = dsct->branches;
if (new_uri->len+1 > MAX_URI_SIZE) {
LM_ERR("new uri too long (%d)\n",new_uri->len);
return -1;
}
for (b = 0; b < dsct->nr_branches; b++) {
/* move uri to dst */
memcpy(branches[b].dst_uri, branches[b].uri, branches[b].len + 1);
branches[b].dst_uri_len = branches[b].len;
/* set new uri */
memcpy(branches[b].uri, new_uri->s, new_uri->len);
branches[b].len = new_uri->len;
branches[b].uri[new_uri->len] = '\0';
}
return 0;
}
int move_branch_to_ruri(int idx, struct sip_msg *msg)
{
struct dset_ctx *dsct = get_dset_ctx();
struct branch *branch;
str s;
/* no branches have been added yet */
if (!dsct) {
LM_DBG("no branches found\n");
return -1;
}
/* */
if (idx >= dsct->nr_branches) {
LM_DBG("trying to move inexisting branch idx %d, out of %d\n",
idx, dsct->nr_branches);
return -1;
}
branch = &dsct->branches[idx];
/* move RURI */
s.s = branch->uri;
s.len = branch->len;
if (set_ruri( msg, &s)<0) {
LM_ERR("failed to set new RURI\n");
return -1;
}
/* move DURI (empty is accepted as reset) */
s.s = branch->dst_uri;
s.len = branch->dst_uri_len;
if (set_dst_uri( msg, &s)<0) {
LM_ERR("failed to set DST URI\n");
return -1;
}
/* move PATH (empty is accepted as reset) */
s.s = branch->path;
s.len = branch->path_len;
if (set_path_vector( msg, &s)<0) {
LM_ERR("failed to set PATH\n");
return -1;
}
/* Qval */
set_ruri_q( msg, branch->q );
/* BFLAGS */
setb0flags( msg, branch->flags );
/* socket info */
msg->force_send_socket = branch->force_send_socket;
return 0;
}
static inline int _branch_2_msg(struct branch *br, struct sip_msg *msg)
{
str s;
s.s = br->uri;
s.len = br->len;
if (set_ruri( msg, &s))
return -1;
s.s = br->dst_uri;
s.len = br->dst_uri_len;
if (set_dst_uri( msg, &s))
return -1;
s.s = br->path;
s.len = br->path_len;
if (set_path_vector( msg, &s))
return -1;
msg->ruri_q = br->q;
msg->force_send_socket = br->force_send_socket;
msg->ruri_bflags = br->flags;
return 0;
}
static inline int _msg_2_branch(struct sip_msg *msg, struct branch *br)
{
str *ruri;
/* run tests first */
ruri = GET_RURI(msg);
if (ruri->len > MAX_URI_SIZE - 1) {
LM_ERR("too long ruri: %.*s\n", ruri->len, ruri->s);
return -1;
}
if (msg->dst_uri.len > MAX_URI_SIZE - 1) {
LM_ERR("too long dst_uri: %.*s\n", msg->dst_uri.len, msg->dst_uri.s);
return -1;
}
if (msg->path_vec.len > MAX_PATH_SIZE - 1) {
LM_ERR("too long path: %.*s\n", msg->path_vec.len, msg->path_vec.s);
return -1;
}
/* we are all good, start copying */
memset( br, 0, sizeof(struct branch));
// this will make all strings NULL terminated
memcpy( br->uri, ruri->s, ruri->len);
br->len = ruri->len;
if (!ZSTR(msg->dst_uri)) {
memcpy( br->dst_uri, msg->dst_uri.s, msg->dst_uri.len);
br->dst_uri_len = msg->dst_uri.len;
}
if (!ZSTR(msg->path_vec)) {
memcpy( br->path, msg->path_vec.s, msg->path_vec.len);
br->path_len = msg->path_vec.len;
}
br->q = msg->ruri_q;
br->force_send_socket = msg->force_send_socket;
br->flags = msg->ruri_bflags;
return 0;
}
static inline int _copy_branch(struct sip_msg *msg, struct branch *branches,
int src_idx, int dst_idx)
{
int ret = 0;
if (dst_idx>=0) {
/* we copy into a branch */
if (src_idx>=0) {
/* we copy from a branch */
branches[dst_idx] = branches[src_idx];
} else {
/* we copy from msg */
ret = _msg_2_branch( msg, &branches[dst_idx]);
}
} else {
/* we copy into msg */
if (src_idx>=0) {
/* we copy from a branch */
ret = _branch_2_msg( &branches[src_idx], msg);
} else {
/* this should not happen, it is a NOP */
}
}
return ret;
}
int swap_branches(struct sip_msg *msg, int src_idx, int dst_idx)
{
struct dset_ctx *dsct = get_dset_ctx();
struct branch *branches;
struct branch bk;
if (src_idx==dst_idx)
/* this is a NOP */
return 0;
/* no branches have been added yet */
if (!dsct)
return -1;
if ( (src_idx>0 && src_idx>=dsct->nr_branches)
|| (dst_idx>0 && dst_idx>=dsct->nr_branches) ) {
LM_ERR("overflow in src [%d] or dst [%d] indexes (having %d)\n",
src_idx, dst_idx, dsct->nr_branches);
return -1;
}
branches = dsct->branches;
/* backup the info from dst branch, so we can write into it */
if (dst_idx>=0) {
/* backup the dst branch */
bk = branches[dst_idx];
} else {
/* backup the msg branch */
if (_msg_2_branch( msg, &bk)<0)
return -1;
}
/* copy dst over src */
if (_copy_branch( msg, branches, src_idx, dst_idx)<0)
return -1;
/* now copy the original dst (from bk) into src */
if (src_idx>=0) {
/* copy bk into a branch */
branches[src_idx] = bk;
} else {
/* copy bk in msg */
if (_branch_2_msg( &bk, msg)<0)
return -1; //we may have an inconsistent msg branch :(
}
return 0;
}
int move_branch(struct sip_msg *msg, int src_idx, int dst_idx, int keep_src)
{
struct dset_ctx *dsct = get_dset_ctx();
struct branch *branches;
if (src_idx==dst_idx)
/* this is a NOP */
return 0;
/* no branches have been added yet */
if (!dsct)
return -1;
if ( (src_idx>0 && src_idx>=dsct->nr_branches)
|| (dst_idx>0 && dst_idx>=dsct->nr_branches) ) {
LM_ERR("overflow in src [%d] or dst [%d] indexes (having %d)\n",
src_idx, dst_idx, dsct->nr_branches);
return -1;
}
branches = dsct->branches;
/* copy dst over src */
if (_copy_branch( msg, branches, src_idx, dst_idx)<0)
return -1;
if (!keep_src && src_idx>0)
remove_branch(src_idx);
return 0;
}