-
Notifications
You must be signed in to change notification settings - Fork 564
/
dlg_hash.c
1820 lines (1523 loc) · 46.1 KB
/
dlg_hash.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
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (C) 2009-2020 OpenSIPS Solutions
* Copyright (C) 2006-2009 Voice System SRL
*
* 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
*/
#include <stdlib.h>
#include <string.h>
#include "../../dprint.h"
#include "../../ut.h"
#include "../../hash_func.h"
#include "../../mi/mi.h"
#include "../../route.h"
#include "../../md5utils.h"
#include "../../parser/parse_to.h"
#include "../../parser/contact/parse_contact.h"
#include "../tm/tm_load.h"
#include "../../script_cb.h"
#include "dlg_hash.h"
#include "dlg_profile.h"
#include "dlg_replication.h"
#include "dlg_req_within.h"
#include "dlg_handlers.h"
#include "dlg_db_handler.h"
#include "../../evi/evi_params.h"
#include "../../evi/evi_modules.h"
#define MAX_LDG_LOCKS 2048
#define MIN_LDG_LOCKS 2
/* useful for dialog ref debugging, once -DDBG_DIALOG is enabled */
struct struct_hist_list *dlg_hist;
struct dlg_table *d_table = NULL;
int ctx_dlg_idx = 0;
static inline void raise_state_changed_event(struct dlg_cell *dlg,
unsigned int ostate, unsigned int nstate);
static str ei_st_ch_name = str_init("E_DLG_STATE_CHANGED");
static evi_params_p event_params;
static str ei_h_entry = str_init("hash_entry");
static str ei_h_id = str_init("hash_id");
static str ei_c_id = str_init("callid");
static str ei_from_tag = str_init("from_tag");
static str ei_to_tag = str_init("to_tag");
static str ei_old_state = str_init("old_state");
static str ei_new_state = str_init("new_state");
static event_id_t ei_st_ch_id = EVI_ERROR;
static evi_param_p hentry_p, hid_p, cid_p, fromt_p, tot_p;
static evi_param_p ostate_p, nstate_p;
int dialog_cleanup( struct sip_msg *msg, void *param )
{
if (current_processing_ctx && ctx_dialog_get()) {
unref_dlg( ctx_dialog_get(), 1);
ctx_dialog_set(NULL);
}
return SCB_RUN_ALL;
}
struct dlg_cell *get_current_dialog(void)
{
struct cell *trans;
if (current_processing_ctx && ctx_dialog_get()) {
/* use the processing context */
return ctx_dialog_get();
}
/* look into transaction */
trans = d_tmb.t_gett();
if (trans==NULL || trans==T_UNDEFINED) {
/* no transaction */
return NULL;
}
if (current_processing_ctx && trans->dialog_ctx) {
/* if we have context, but no dlg info, and we
found dlg info into transaction, populate
the dialog too */
ref_dlg((struct dlg_cell*)trans->dialog_ctx, 1);
ctx_dialog_set(trans->dialog_ctx);
}
return (struct dlg_cell*)trans->dialog_ctx;
}
int init_dlg_table(unsigned int size)
{
unsigned int n;
unsigned int i;
d_table = (struct dlg_table*)shm_malloc
( sizeof(struct dlg_table) + size*sizeof(struct dlg_entry));
if (d_table==0) {
LM_ERR("no more shm mem (1)\n");
goto error0;
}
#if defined(DBG_STRUCT_HIST) && defined(DBG_DIALOG)
dlg_hist = shl_init("dialog hist", 10000, 0);
if (!dlg_hist) {
LM_ERR("oom\n");
goto error1;
}
#endif
memset( d_table, 0, sizeof(struct dlg_table) );
d_table->size = size;
d_table->entries = (struct dlg_entry*)(d_table+1);
n = (size<MAX_LDG_LOCKS)?size:MAX_LDG_LOCKS;
for( ; n>=MIN_LDG_LOCKS ; n-- ) {
d_table->locks = lock_set_alloc(n);
if (d_table->locks==0)
continue;
if (lock_set_init(d_table->locks)==0) {
lock_set_dealloc(d_table->locks);
d_table->locks = 0;
continue;
}
d_table->locks_no = n;
break;
}
if (d_table->locks==0) {
LM_ERR("unable to allocted at least %d locks for the hash table\n",
MIN_LDG_LOCKS);
goto error1;
}
for( i=0 ; i<size; i++ ) {
memset( &(d_table->entries[i]), 0, sizeof(struct dlg_entry) );
d_table->entries[i].next_id = rand();
d_table->entries[i].lock_idx = i % d_table->locks_no;
}
return 0;
error1:
shm_free( d_table );
error0:
return -1;
}
static inline void free_dlg_dlg(struct dlg_cell *dlg)
{
struct dlg_val *dv;
unsigned int i;
if (dlg->cbs.first)
destroy_dlg_callbacks_list(dlg->cbs.first);
context_destroy(CONTEXT_DIALOG, context_of(dlg));
if (dlg->profile_links) {
destroy_linkers_unsafe(dlg);
remove_dlg_prof_table(dlg, 1);
}
if (dlg->legs) {
for( i=0 ; i<dlg->legs_no[DLG_LEGS_USED] ; i++) {
shm_free(dlg->legs[i].tag.s);
shm_free(dlg->legs[i].r_cseq.s);
if (dlg->legs[i].inv_cseq.s)
shm_free(dlg->legs[i].inv_cseq.s);
if (dlg->legs[i].prev_cseq.s)
shm_free(dlg->legs[i].prev_cseq.s);
if (dlg->legs[i].contact.s)
shm_free(dlg->legs[i].contact.s);
if (dlg->legs[i].route_set.s)
shm_free(dlg->legs[i].route_set.s);
if (dlg->legs[i].adv_contact.s)
shm_free(dlg->legs[i].adv_contact.s);
if (dlg->legs[i].from_uri.s)
shm_free(dlg->legs[i].from_uri.s);
if (dlg->legs[i].to_uri.s)
shm_free(dlg->legs[i].to_uri.s);
if (dlg->legs[i].out_sdp.s)
shm_free(dlg->legs[i].out_sdp.s);
if (dlg->legs[i].in_sdp.s)
shm_free(dlg->legs[i].in_sdp.s);
if (dlg->legs[i].tmp_out_sdp.s)
shm_free(dlg->legs[i].tmp_out_sdp.s);
if (dlg->legs[i].tmp_in_sdp.s)
shm_free(dlg->legs[i].tmp_in_sdp.s);
}
shm_free(dlg->legs);
}
while (dlg->vals) {
dv = dlg->vals;
dlg->vals = dlg->vals->next;
shm_free(dv);
}
if (dlg->shtag.s)
shm_free(dlg->shtag.s);
if (dlg->terminate_reason.s)
shm_free(dlg->terminate_reason.s);
#ifdef DBG_DIALOG
sh_log(dlg->hist, DLG_DESTROY, "ref %d", dlg->ref);
sh_unref(dlg->hist);
dlg->hist = NULL;
#endif
shm_free(dlg);
}
void destroy_dlg(struct dlg_cell *dlg)
{
int ret = 0;
LM_DBG("destroying dialog %p\n",dlg);
ret = remove_dlg_timer(&dlg->tl);
if (ret < 0) {
LM_CRIT("unable to unlink the timer on dlg %p [%u:%u] "
"with clid '%.*s' and tags '%.*s' '%.*s'\n",
dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg_leg_print_info( dlg, DLG_CALLER_LEG, tag),
dlg_leg_print_info( dlg, callee_idx(dlg), tag));
} else if (ret > 0) {
LM_DBG("dlg expired or not in list - dlg %p [%u:%u] "
"with clid '%.*s' and tags '%.*s' '%.*s'\n",
dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg_leg_print_info( dlg, DLG_CALLER_LEG, tag),
dlg_leg_print_info( dlg, callee_idx(dlg), tag));
}
run_dlg_callbacks(DLGCB_DESTROY , dlg, 0, DLG_DIR_NONE, NULL, 0, 1);
free_dlg_dlg(dlg);
}
void destroy_dlg_table(void)
{
struct dlg_cell *dlg, *l_dlg;
unsigned int i;
if (d_table==0)
return;
if (d_table->locks) {
lock_set_destroy(d_table->locks);
lock_set_dealloc(d_table->locks);
}
for( i=0 ; i<d_table->size; i++ ) {
dlg = d_table->entries[i].first;
while (dlg) {
l_dlg = dlg;
dlg = dlg->next;
free_dlg_dlg(l_dlg);
}
}
shm_free(d_table);
d_table = 0;
return;
}
struct dlg_cell* build_new_dlg( str *callid, str *from_uri, str *to_uri,
str *from_tag)
{
struct dlg_cell *dlg;
int len;
char *p;
len = sizeof(struct dlg_cell) + callid->len + from_uri->len +
to_uri->len + context_size(CONTEXT_DIALOG);
dlg = (struct dlg_cell*)shm_malloc( len );
if (dlg==0) {
LM_ERR("no more shm mem (%d)\n",len);
return 0;
}
memset(dlg, 0, len);
#if defined(DBG_STRUCT_HIST) && defined(DBG_DIALOG)
dlg->hist = sh_push(dlg, dlg_hist);
if (!dlg->hist) {
LM_ERR("oom\n");
shm_free(dlg);
return NULL;
}
#endif
dlg->state = DLG_STATE_UNCONFIRMED;
dlg->h_entry = dlg_hash( callid);
LM_DBG("new dialog %p (c=%.*s,f=%.*s,t=%.*s,ft=%.*s) on hash %u\n",
dlg, callid->len,callid->s, from_uri->len, from_uri->s,
to_uri->len,to_uri->s, from_tag->len, from_tag->s, dlg->h_entry);
p = (char*)(dlg+1);
/* dialog context has to be first, otherwise context_of will break */
p += context_size(CONTEXT_DIALOG);
dlg->callid.s = p;
dlg->callid.len = callid->len;
memcpy( p, callid->s, callid->len);
p += callid->len;
dlg->from_uri.s = p;
dlg->from_uri.len = from_uri->len;
memcpy( p, from_uri->s, from_uri->len);
p += from_uri->len;
dlg->to_uri.s = p;
dlg->to_uri.len = to_uri->len;
memcpy( p, to_uri->s, to_uri->len);
p += to_uri->len;
return dlg;
}
int dlg_clone_callee_leg(struct dlg_cell *dlg, int cloned_leg_idx)
{
struct dlg_leg *leg, *src_leg;
if (ensure_leg_array(dlg->legs_no[DLG_LEGS_USED] + 1, dlg) != 0)
return -1;
src_leg = &dlg->legs[cloned_leg_idx];
leg = &dlg->legs[dlg->legs_no[DLG_LEGS_USED]];
if (shm_str_dup(&leg->adv_contact, &src_leg->adv_contact) != 0) {
LM_ERR("oom contact\n");
return -1;
}
if (src_leg->out_sdp.s && shm_str_dup(&leg->out_sdp, &src_leg->out_sdp) != 0) {
shm_free(leg->adv_contact.s);
LM_ERR("oom sdp\n");
return -1;
}
return dlg->legs_no[DLG_LEGS_USED]++;
}
static inline int translate_contact_ipport( str *ct, struct socket_info *sock,
str *dst)
{
struct hdr_field ct_hdr;
struct contact_body *cb;
contact_t *c;
struct sip_uri puri;
str hostport;
str *send_address_str, *send_port_str;
char *p;
/* rely on the fact that the replicated hdr is well formated, so
* skip the hdr name */
if ((p=q_memchr(ct->s, ':', ct->len))==NULL) {
LM_ERR("failed find hdr body in "
"advertised contact <%.*s>\n", ct->len, ct->s);
}
memset( &ct_hdr, 0, sizeof(ct_hdr));
ct_hdr.body.s = p+1;
ct_hdr.body.len = (ct->s+ct->len)-ct_hdr.body.s;
if (parse_contact( &ct_hdr )<0 ||
(cb=(contact_body_t*)ct_hdr.parsed)==NULL ||
(c=cb->contacts)==NULL || c->next!=NULL ) {
LM_ERR("failed to parsed or wrong nr of contacts in "
"advertised contact <%.*s>\n", ct->len, ct->s);
return -1;
}
if (parse_uri( c->uri.s, c->uri.len, &puri)<0) {
LM_ERR("failed to parsed URI in contact <%.*s>\n",
c->uri.len, c->uri.s);
goto error;
}
hostport.s = puri.host.s;
hostport.len = puri.port.len ?
(puri.port.s+puri.port.len-puri.host.s) : puri.host.len ;
LM_DBG("replacing <%.*s> from ct <%.*s>\n",
hostport.len, hostport.s, ct->len, ct->s);
/* init send_address_str & send_port_str */
if(sock->adv_name_str.len)
send_address_str=&(sock->adv_name_str);
else if (default_global_address->s)
send_address_str=default_global_address;
else
send_address_str=&(sock->address_str);
if(sock->adv_port_str.len)
send_port_str=&(sock->adv_port_str);
else if (default_global_port->s)
send_port_str=default_global_port;
else
send_port_str=&(sock->port_no_str);
dst->len = (hostport.s - ct->s) + /* staring preserved part */
(send_address_str->len + 1 + send_port_str->len) + /*new ip:port part*/
(ct->s + ct->len - hostport.s - hostport.len);
dst->s = (char*)shm_malloc( dst->len );
if (dst->s==NULL) {
LM_ERR("failed to allocated new host:port, len %d\n",dst->len);
goto error;
}
/* start building the new ct hdr */
p = dst->s;
memcpy( p, ct->s, hostport.s - ct->s);
p += hostport.s - ct->s;
memcpy( p, send_address_str->s, send_address_str->len);
p += send_address_str->len;
*(p++) = ':';
memcpy( p, send_port_str->s, send_port_str->len);
p += send_port_str->len;
memcpy( p, hostport.s+hostport.len, ct->s+ct->len-hostport.s-hostport.len);
p += ct->s+ct->len-hostport.s-hostport.len;
LM_DBG("resulting ct is <%.*s> / %d\n",
dst->len, dst->s, dst->len);
free_contact( &cb );
return 0;
error:
free_contact( &cb );
return -1;
}
/* first time it will called for a CALLER leg - at that time there will
be no leg allocated, so automatically CALLER gets the first position, while
the CALLEE legs will follow into the array in the same order they came */
int dlg_update_leg_info(int leg_idx, struct dlg_cell *dlg, str* tag, str *rr,
str *contact, str *adv_ct, str *cseq, struct socket_info *sock,
str *mangled_from,str *mangled_to,str *in_sdp, str *out_sdp)
{
struct dlg_leg *leg;
rr_t *head = NULL, *rrp;
if (leg_idx >= MAX_BRANCHES) {
LM_WARN("invalid callee leg index (branch id part): %d\n", leg_idx);
return -1;
}
if (ensure_leg_array(leg_idx + 1, dlg) != 0)
return -1;
leg = &dlg->legs[leg_idx];
leg->tag.s = (char*)shm_malloc(tag->len);
if ( leg->tag.s==NULL) {
LM_ERR("no more shm mem for tag\n");
return -1;
}
leg->r_cseq.s = (char*)shm_malloc( cseq->len );
if (leg->r_cseq.s==NULL) {
LM_ERR("no more shm mem for cseq\n");
goto error1;
}
if (dlg->legs_no[DLG_LEGS_USED] == 0) {
/* first leg = caller. also store inv cseq */
leg->inv_cseq.s = (char *)shm_malloc( cseq->len);
if (leg->inv_cseq.s == NULL) {
LM_ERR("no more shm mem\n");
goto error2;
}
}
if (contact->len) {
/* contact */
leg->contact.s = shm_malloc(contact->len);
if (leg->contact.s==NULL) {
LM_ERR("no more shm mem\n");
goto error2;
}
leg->contact.len = contact->len;
memcpy( leg->contact.s, contact->s, contact->len);
/* rr */
if (rr->len) {
leg->route_set.s = shm_malloc(rr->len);
if (leg->route_set.s==NULL) {
LM_ERR("no more shm mem for rr set\n");
goto error_all;
}
leg->route_set.len = rr->len;
memcpy(leg->route_set.s, rr->s, rr->len);
if (parse_rr_body(leg->route_set.s,leg->route_set.len,&head) != 0) {
LM_ERR("failed parsing route set\n");
goto error_all;
}
rrp = head;
leg->nr_uris = 0;
while (rrp) {
leg->route_uris[leg->nr_uris++] = rrp->nameaddr.uri;
rrp = rrp->next;
}
free_rr(&head);
}
}
/* save mangled FROM/TO URIs, if any */
if (mangled_from && mangled_from->s && mangled_from->len &&
shm_str_dup( &leg->from_uri, mangled_from)==-1 ) {
LM_ERR("failed to shm duplicate mangled FROM hdr\n");
goto error_all;
}
if (mangled_to && mangled_to->s && mangled_to->len &&
shm_str_dup( &leg->to_uri, mangled_to)==-1 ) {
LM_ERR("failed to shm duplicate mangled TO hdr\n");
goto error_all;
}
/* these are the inbound/outbound SDPs for this leg */
if (in_sdp && in_sdp->s && in_sdp->len &&
shm_str_dup( &leg->in_sdp, in_sdp)==-1 ) {
LM_ERR("failed to shm duplicate inbound SDP\n");
goto error_all;
}
if (out_sdp && out_sdp->s && out_sdp->len &&
shm_str_dup( &leg->out_sdp, out_sdp)==-1 ) {
LM_ERR("failed to shm duplicate outbound SDP\n");
goto error_all;
}
/* this is the advertised contact for this leg */
if (adv_ct && adv_ct->s && adv_ct->len) {
/* if the advertised tag is correlated with an interface indetified
* by a TAG, it means that the actual IP of the interface may be
* different, so we better re-compute the IP:port part of the contact*/
if (sock->tag.s) {
if (translate_contact_ipport(adv_ct,sock, &leg->adv_contact)<0){
LM_ERR("failed to shm translate advertised contact\n");
goto error_all;
}
} else if (shm_str_dup( &leg->adv_contact, adv_ct)==-1 ) {
LM_ERR("failed to shm duplicate advertised contact\n");
goto error_all;
}
}
/* tag */
leg->tag.len = tag->len;
memcpy( leg->tag.s, tag->s, tag->len);
/* socket */
leg->bind_addr = sock;
if (dlg->legs_no[DLG_LEGS_USED] == 0)
{
/* first leg = caller . store inv cseq */
leg->inv_cseq.len = cseq->len;
memcpy(leg->inv_cseq.s,cseq->s,cseq->len);
/* set cseq for caller to 0
* future requests to the caller leg will update this
* needed for proper validation of in-dialog requests
*
* TM also increases this value by one, if dialog
* is terminated from the middle, so 0 is ok*/
leg->r_cseq.len = 1;
leg->r_cseq.s[0]='0';
} else {
/* cseq */
leg->r_cseq.len = cseq->len;
memcpy( leg->r_cseq.s, cseq->s, cseq->len);
}
/* make leg visible for searchers */
if (leg_idx >= dlg->legs_no[DLG_LEGS_USED])
dlg->legs_no[DLG_LEGS_USED] = leg_idx + 1;
LM_DBG("set leg %d for %p: tag=<%.*s> rcseq=<%.*s>\n",
dlg->legs_no[DLG_LEGS_USED]-1, dlg,
leg->tag.len,leg->tag.s,
leg->r_cseq.len,leg->r_cseq.s );
return 0;
error_all:
if (leg->to_uri.s) {
shm_free(leg->to_uri.s);
leg->to_uri.s = NULL;
}
if (leg->from_uri.s) {
shm_free(leg->from_uri.s);
leg->from_uri.s = NULL;
}
if (leg->route_set.s) {
shm_free(leg->route_set.s);
leg->route_set.s = NULL;
}
if (leg->contact.s) {
shm_free(leg->contact.s);
leg->contact.s = NULL;
}
if (leg->in_sdp.s) {
shm_free(leg->in_sdp.s);
leg->in_sdp.s = NULL;
}
error2:
shm_free(leg->r_cseq.s);
error1:
shm_free(leg->tag.s);
return -1;
}
/* update cseq filed in leg
* if inv = 1, update the inv_cseq field
* else, update the r_cseq */
int dlg_update_cseq(struct dlg_cell * dlg, unsigned int leg, str *cseq,int inv)
{
str* update_cseq;
if (inv == 1)
update_cseq = &dlg->legs[leg].inv_cseq;
else
update_cseq = &dlg->legs[leg].r_cseq;
if ( update_cseq->s ) {
if (update_cseq->len < cseq->len) {
update_cseq->s = (char*)shm_realloc(update_cseq->s,cseq->len);
if (update_cseq->s==NULL) {
LM_ERR("no more shm mem for realloc (%d)\n",cseq->len);
goto error;
}
}
} else {
update_cseq->s = (char*)shm_malloc(cseq->len);
if (update_cseq->s==NULL) {
LM_ERR("no more shm mem for malloc (%d)\n",cseq->len);
goto error;
}
}
memcpy( update_cseq->s, cseq->s, cseq->len );
update_cseq->len = cseq->len;
if (inv == 1)
LM_DBG("dlg %p[%d]: last invite cseq is %.*s\n", dlg,leg,
dlg->legs[leg].inv_cseq.len, dlg->legs[leg].inv_cseq.s);
else
LM_DBG("dlg %p[%d]: cseq is %.*s\n", dlg,leg,
dlg->legs[leg].r_cseq.len, dlg->legs[leg].r_cseq.s);
return 0;
error:
LM_ERR("not more shm mem\n");
return -1;
}
int dlg_update_routing(struct dlg_cell *dlg, unsigned int leg,
str *rr, str *contact)
{
rr_t *head = NULL, *rrp;
LM_DBG("dialog %p[%d]: rr=<%.*s> contact=<%.*s>\n",
dlg, leg,
rr->len,rr->s,
contact->len,contact->s );
if (dlg->legs[leg].contact.s)
shm_free(dlg->legs[leg].contact.s);
dlg->legs[leg].contact.s = shm_malloc(contact->len);
if (dlg->legs[leg].contact.s==NULL) {
LM_ERR("no more shm mem\n");
return -1;
}
dlg->legs[leg].contact.len = contact->len;
memcpy( dlg->legs[leg].contact.s, contact->s, contact->len);
/* rr */
if (rr->len) {
if (dlg->legs[leg].route_set.s)
shm_free(dlg->legs[leg].route_set.s);
dlg->legs[leg].route_set.s = shm_malloc(rr->len);
if (!dlg->legs[leg].route_set.s) {
LM_ERR("failed to alloc route set!\n");
/* leave the contact there, otherwise we will get no contact at
* all, or worse, we will use free'd memory */
return -1;
}
dlg->legs[leg].route_set.len = rr->len;
memcpy( dlg->legs[leg].route_set.s, rr->s, rr->len);
/* also update URI pointers */
if (parse_rr_body(dlg->legs[leg].route_set.s,
dlg->legs[leg].route_set.len,&head) != 0) {
LM_ERR("failed parsing route set\n");
shm_free(dlg->legs[leg].route_set.s);
dlg->legs[leg].route_set.s = NULL;
return -1;
}
rrp = head;
dlg->legs[leg].nr_uris = 0;
while (rrp) {
dlg->legs[leg].route_uris[dlg->legs[leg].nr_uris++] = rrp->nameaddr.uri;
rrp = rrp->next;
}
free_rr(&head);
}
return 0;
}
struct dlg_cell* lookup_dlg( unsigned int h_entry, unsigned int h_id)
{
struct dlg_cell *dlg;
struct dlg_entry *d_entry;
if (h_entry>=d_table->size)
goto not_found;
d_entry = &(d_table->entries[h_entry]);
dlg_lock( d_table, d_entry);
for( dlg=d_entry->first ; dlg ; dlg=dlg->next ) {
if (dlg->h_id == h_id) {
if (dlg->state==DLG_STATE_DELETED) {
dlg_unlock( d_table, d_entry);
goto not_found;
}
DBG_REF(dlg, 1);
dlg->ref++;
dlg_unlock( d_table, d_entry);
LM_DBG("dialog id=%u found on entry %u\n", h_id, h_entry);
return dlg;
}
}
dlg_unlock( d_table, d_entry);
not_found:
LM_DBG("no dialog id=%u found on entry %u\n", h_id, h_entry);
return 0;
}
/* Get dialog that correspond to CallId, From Tag and To Tag */
/* See RFC 3261, paragraph 4. Overview of Operation: */
/* "The combination of the To tag, From tag, and Call-ID completely */
/* defines a peer-to-peer SIP relationship between [two UAs] and is */
/* referred to as a dialog."*/
struct dlg_cell* get_dlg( str *callid, str *ftag, str *ttag,
unsigned int *dir, unsigned int *dst_leg)
{
struct dlg_cell *dlg;
struct dlg_entry *d_entry;
unsigned int h_entry;
h_entry = dlg_hash(callid);
d_entry = &(d_table->entries[h_entry]);
dlg_lock( d_table, d_entry);
LM_DBG("input ci=<%.*s>(%d), tt=<%.*s>(%d), ft=<%.*s>(%d)\n",
callid->len,callid->s, callid->len,
ftag->len, ftag->s, ftag->len,
ttag->len, ttag->s, ttag->len);
for( dlg = d_entry->first ; dlg ; dlg = dlg->next ) {
/* Check callid / fromtag / totag */
#ifdef EXTRA_DEBUG
LM_DBG("DLG (%p)(%d): ci=<%.*s>(%d), ft=<%.*s>(%d), tt=<%.*s>(%d),"
"ct_er=%d, ct_ee=%d\n",
dlg,dlg->state,dlg->callid.len,dlg->callid.s, dlg->callid.len,
dlg->legs[DLG_CALLER_LEG].tag.len,dlg->legs[DLG_CALLER_LEG].tag.s,
dlg->legs[DLG_CALLER_LEG].tag.len,
dlg->legs[callee_idx(dlg)].tag.len,dlg->legs[callee_idx(dlg)].tag.s,
dlg->legs[callee_idx(dlg)].tag.len,
dlg->legs[DLG_CALLER_LEG].contact.len,
dlg->legs[DLG_CALLER_LEG].contact.len);
#endif
if (match_dialog( dlg, callid, ftag, ttag, dir, dst_leg)==1) {
if (dlg->state==DLG_STATE_DELETED)
/* even if matched, skip the deleted dialogs as they may be
a previous unsuccessful attempt of established call
with the same callid and fromtag - like in auth/challenge
case -bogdan */
continue;
DBG_REF(dlg, 1);
dlg->ref++;
dlg_unlock( d_table, d_entry);
LM_DBG("dialog callid='%.*s' found\n on entry %u, dir=%d\n",
callid->len, callid->s,h_entry,*dir);
return dlg;
}
}
dlg_unlock( d_table, d_entry);
LM_DBG("no dialog callid='%.*s' found\n", callid->len, callid->s);
return 0;
}
struct dlg_cell* get_dlg_by_val(str *attr, str *val)
{
struct dlg_entry *d_entry;
struct dlg_cell *dlg;
unsigned int h;
/* go through all hash entries (entire table) */
for ( h=0 ; h<d_table->size ; h++ ) {
d_entry = &(d_table->entries[h]);
dlg_lock( d_table, d_entry);
/* go through all dialogs on entry */
for( dlg = d_entry->first ; dlg ; dlg = dlg->next ) {
LM_DBG("dlg in state %d to check\n",dlg->state);
if ( dlg->state>DLG_STATE_CONFIRMED )
continue;
if (check_dlg_value_unsafe( dlg, attr, val)==0) {
ref_dlg_unsafe( dlg, 1);
dlg_unlock( d_table, d_entry);
return dlg;
}
}
dlg_unlock( d_table, d_entry);
}
return NULL;
}
struct dlg_cell* get_dlg_by_callid(const str *callid, int active_only)
{
struct dlg_cell *dlg;
struct dlg_entry *d_entry;
unsigned int h_entry;
h_entry = dlg_hash(callid);
d_entry = &(d_table->entries[h_entry]);
dlg_lock( d_table, d_entry);
LM_DBG("input ci=<%.*s>(%d)\n", callid->len,callid->s, callid->len);
for( dlg = d_entry->first ; dlg ; dlg = dlg->next ) {
if ( active_only && dlg->state>DLG_STATE_CONFIRMED )
continue;
if ( dlg->callid.len==callid->len &&
strncmp( dlg->callid.s, callid->s, callid->len)==0 ) {
ref_dlg_unsafe( dlg, 1);
dlg_unlock( d_table, d_entry);
return dlg;
}
}
dlg_unlock( d_table, d_entry);
return NULL;
}
struct dlg_cell* get_dlg_by_did(str *did, int active_only)
{
struct dlg_cell *dlg;
struct dlg_entry *d_entry;
unsigned h_entry, h_id;
if (parse_dlg_did(did, &h_entry, &h_id) < 0)
return NULL;
if (h_entry>=d_table->size)
return NULL;
LM_DBG("looking for hentry=%d hid=%d\n", h_entry, h_id);
d_entry = &(d_table->entries[h_entry]);
dlg_lock( d_table, d_entry);
for( dlg = d_entry->first ; dlg ; dlg = dlg->next ) {
if (active_only && dlg->state>DLG_STATE_CONFIRMED )
continue;
if (dlg->h_id == h_id) {
ref_dlg_unsafe( dlg, 1);
dlg_unlock( d_table, d_entry);
return dlg;
}
}
dlg_unlock( d_table, d_entry);
return NULL;
}
struct dlg_cell *get_dlg_by_dialog_id(str *dialog_id)
{
struct dlg_cell *dlg = NULL;
unsigned int h_entry, h_id;
if (parse_dlg_did(dialog_id, &h_entry, &h_id) == 0) {
/* we might have a dialog did */
LM_DBG("ID: %*s (h_entry %u h_id %u)\n",
dialog_id->len, dialog_id->s, h_entry, h_id);
dlg = lookup_dlg(h_entry, h_id);
}
if (!dlg) {
/* the ID is not a number, so let's consider
* the value a SIP call-id */
LM_DBG("Call-ID: <%.*s>\n", dialog_id->len, dialog_id->s);
dlg = get_dlg_by_callid(dialog_id, 1);
}
return dlg;
}
void link_dlg(struct dlg_cell *dlg, int extra_refs)
{
struct dlg_entry *d_entry;
d_entry = &(d_table->entries[dlg->h_entry]);
dlg_lock(d_table, d_entry);
link_dlg_unsafe(d_entry, dlg);
DBG_REF(dlg, extra_refs);
dlg->ref += extra_refs;
LM_DBG("ref dlg %p with %d -> %d in h_entry %p - %d \n",
dlg, extra_refs + 1, dlg->ref, d_entry, dlg->h_entry);
dlg_unlock( d_table, d_entry);
}
void unlink_unsafe_dlg(struct dlg_entry *d_entry,
struct dlg_cell *dlg)
{
if (dlg->next)
dlg->next->prev = dlg->prev;
else
d_entry->last = dlg->prev;
if (dlg->prev)
dlg->prev->next = dlg->next;
else
d_entry->first = dlg->next;
dlg->next = dlg->prev = 0;
d_entry->cnt--;
return;
}
void _ref_dlg(struct dlg_cell *dlg, unsigned int cnt)
{
struct dlg_entry *d_entry;
d_entry = &(d_table->entries[dlg->h_entry]);
dlg_lock( d_table, d_entry);
ref_dlg_unsafe( dlg, cnt);
dlg_unlock( d_table, d_entry);
}