-
Notifications
You must be signed in to change notification settings - Fork 909
/
t_lookup.c
1911 lines (1693 loc) · 57.2 KB
/
t_lookup.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
/*
* This C-file takes care of matching requests and replies with
* existing transactions. Note that we do not do SIP-compliant
* request matching as asked by SIP spec. We do bitwise matching of
* all header fields in requests which form a transaction key.
* It is much faster and it works pretty well -- we haven't
* had any interop issue neither in lab nor in bake-offs. The reason
* is that retransmissions do look same as original requests
* (it would be really silly if they would be mangled). The only
* exception is we parse To as To in ACK is compared to To in
* reply and both of them are constructed by different software.
*
* As for reply matching, we match based on branch value -- that is
* faster too.
* The branch parameter is formed as follows: hash.md5.branch
*
* -jiri
*
*
* Copyright (C) 2001-2003 FhG Fokus
*
* This file is part of Kamailio, a free SIP server.
*
* Kamailio 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
*
* Kamailio 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 "defs.h"
#include "../../core/comp_defs.h"
#include "../../core/compiler_opt.h"
#include "../../core/dprint.h"
#include "../../core/config.h"
#include "../../core/parser/parser_f.h"
#include "../../core/parser/parse_from.h"
#include "../../core/ut.h"
#include "../../core/timer.h"
#include "../../core/timer_ticks.h"
#include "../../core/hash_func.h"
#include "../../core/globals.h"
#include "../../core/forward.h"
#include "t_funcs.h"
#include "config.h"
#include "sip_msg.h"
#include "t_hooks.h"
#include "t_fwd.h"
#include "t_lookup.h"
#include "dlg.h" /* for t_lookup_callid */
#include "t_msgbuilder.h" /* for t_lookup_callid */
#define EQ_VIA_LEN(_via)\
( (p_msg->via1->bsize-(p_msg->_via->name.s-(p_msg->_via->hdr.s+p_msg->_via->hdr.len)))==\
(t_msg->via1->bsize-(t_msg->_via->name.s-(t_msg->_via->hdr.s+t_msg->_via->hdr.len))) )
#define EQ_LEN(_hf) (t_msg->_hf->body.len==p_msg->_hf->body.len)
#define EQ_REQ_URI_LEN\
(p_msg->first_line.u.request.uri.len==t_msg->first_line.u.request.uri.len)
#define EQ_STR(_hf) (memcmp(t_msg->_hf->body.s,\
p_msg->_hf->body.s, \
p_msg->_hf->body.len)==0)
#define EQ_REQ_URI_STR\
( memcmp( t_msg->first_line.u.request.uri.s,\
p_msg->first_line.u.request.uri.s,\
p_msg->first_line.u.request.uri.len)==0)
#define EQ_VIA_STR(_via)\
( memcmp( t_msg->_via->name.s,\
p_msg->_via->name.s,\
(t_msg->via1->bsize-(t_msg->_via->name.s-(t_msg->_via->hdr.s+t_msg->_via->hdr.len)))\
)==0 )
#define HF_LEN(_hf) ((_hf)->len)
/* presumably matching transaction for an e2e ACK */
static struct cell *t_ack;
/* this is a global variable which keeps pointer to
* transaction currently processed by a process; it it
* set by t_lookup_request or t_reply_matching; don't
* dare to change it anywhere else as it would
* break ref_counting.
* It has a valid value only if:
* - it's checked inside a failure or tm on_reply route (not core
* on_reply[0]!)
* - global_msg_id == msg->id in all the other kinds of routes
* Note that this is the safest check and is valid also for
* failure routes (because fake_env() sets global_msg_id) or tm
* tm onreply routes (the internal reply_received() t_check() will set
* T and global_msg_id).
*/
static struct cell *T;
/* this is a global variable which keeps the current branch
* for the transaction currently processed.
* It has a valid value only if T is valid (global_msg_id==msg->id -- see
* above, and T!=0 and T!=T_UNDEFINED).
* For a request it's value is T_BR_UNDEFINED (it can have valid values only
* for replies).
*/
static int T_branch;
/* number of currently processed message; good to know
* to be able to doublecheck whether we are still working
* on a current transaction or a new message arrived;
* don't even think of changing it.
*/
unsigned int global_msg_id;
struct cell *get_t() { return T; }
void set_t(struct cell *t, int branch) { T=t; T_branch=branch; }
void init_t() {global_msg_id=0; set_t(T_UNDEFINED, T_BR_UNDEFINED);}
int get_t_branch() { return T_branch; }
static inline int parse_dlg( struct sip_msg *msg )
{
if (parse_headers(msg, HDR_FROM_F | HDR_CSEQ_F | HDR_TO_F, 0)==-1) {
LM_ERR("From or Cseq or To invalid\n");
return 0;
}
if ((msg->from==0)||(msg->cseq==0)||(msg->to==0)) {
LM_ERR("missing From or Cseq or To\n");
return 0;
}
if (parse_from_header(msg)==-1) {
LM_ERR("From broken\n");
return 0;
}
return 1;
}
/* is the ACK (p_msg) in p_msg dialog-wise equal to the INVITE (t_msg)
* except to-tags? */
static inline int partial_dlg_matching(struct sip_msg *t_msg, struct sip_msg *p_msg)
{
struct to_body *inv_from;
if (!EQ_LEN(callid)) return 0;
if (get_cseq(t_msg)->number.len!=get_cseq(p_msg)->number.len)
return 0;
inv_from=get_from(t_msg);
if (!inv_from) {
LM_ERR("INV/From not parsed\n");
return 0;
}
if (inv_from->tag_value.len!=get_from(p_msg)->tag_value.len)
return 0;
if (!EQ_STR(callid))
return 0;
if (memcmp(get_cseq(t_msg)->number.s, get_cseq(p_msg)->number.s,
get_cseq(p_msg)->number.len)!=0)
return 0;
if (memcmp(inv_from->tag_value.s, get_from(p_msg)->tag_value.s,
get_from(p_msg)->tag_value.len)!=0)
return 0;
return 1;
}
/* are to-tags in ACK/200 same as those we sent out? */
static inline int dlg_matching(struct cell *p_cell, struct sip_msg *ack )
{
if (get_to(ack)->tag_value.len!=p_cell->uas.local_totag.len)
return 0;
if (memcmp(get_to(ack)->tag_value.s,p_cell->uas.local_totag.s,
p_cell->uas.local_totag.len)!=0)
return 0;
return 1;
}
/* returns 2 if one of the save totags matches the totag in the current
* message (which should be an ACK) and 0 if not */
static inline int totag_e2e_ack_matching(struct cell* p_cell,
struct sip_msg *ack)
{
struct totag_elem *i;
str *tag;
tag=&get_to(ack)->tag_value;
/* no locking needed for reading/searching, see update_totag_set() */
for (i=p_cell->fwded_totags; i; i=i->next){
membar_depends(); /* make sure we don't see some old i content
* (needed on CPUs like Alpha) */
if (i->tag.len==tag->len && memcmp(i->tag.s, tag->s, tag->len)==0) {
return 2;
}
}
return 0;
}
/* returns: 0 - no match
* 1 - full match to a local transaction
* 2 - full match to a proxied transaction
* 3 - partial match to a proxied transaction (totag not checked) =>
* care must be taken not to falsely match an ACK for a negative
* reply to a "fork" of the transaction
*/
static inline int ack_matching(struct cell *p_cell, struct sip_msg *p_msg)
{
/* partial dialog matching -- no to-tag, only from-tag,
* callid, cseq number ; */
if (!partial_dlg_matching(p_cell->uas.request, p_msg))
return 0;
/* if this transaction is proxied (as opposed to UAS) we're
* done now -- we ignore to-tags; the ACK simply belongs to
* this UAS part of dialog, whatever to-tag it gained
*/
if (likely(p_cell->relayed_reply_branch!=-2)) {
if (likely(has_tran_tmcbs(p_cell,
TMCB_E2EACK_IN|TMCB_E2EACK_RETR_IN)))
return totag_e2e_ack_matching(p_cell, p_msg); /* 2 or 0 */
else
LM_WARN("attempted on"
" a transaction with no E2EACK callbacks => the results"
" are not completely reliable when forking is involved\n");
return 3; /* e2e proxied ACK partial match */
}
/* it's a local dialog -- we wish to verify to-tags too */
if (dlg_matching(p_cell, p_msg)) {
return 1;
}
return 0;
}
/* branch-based transaction matching */
static inline int via_matching( struct via_body *inv_via,
struct via_body *ack_via )
{
if (inv_via->tid.len!=ack_via->tid.len)
return 0;
if (memcmp(inv_via->tid.s, ack_via->tid.s,
ack_via->tid.len)!=0)
return 0;
/* ok, tid matches -- now make sure that the
* originator matches too to avoid confusion with
* different senders generating the same tid
*/
if (inv_via->host.len!=ack_via->host.len)
return 0;
if (memcmp(inv_via->host.s, ack_via->host.s,
ack_via->host.len)!=0)
return 0;
if (inv_via->port!=ack_via->port) {
if(inv_via->port==0
&& ack_via->port!=SIP_PORT && ack_via->port!=SIPS_PORT)
return 0;
if(ack_via->port==0
&& inv_via->port!=SIP_PORT && inv_via->port!=SIPS_PORT)
return 0;
}
if (inv_via->transport.len!=ack_via->transport.len)
return 0;
if (memcmp(inv_via->transport.s, ack_via->transport.s,
ack_via->transport.len)!=0)
return 0;
if (inv_via->port!=ack_via->port
&& (inv_via->port==0 || ack_via->port==0)) {
/* test SIPS_PORT (5061) is used with TLS transport */
if(inv_via->port==SIPS_PORT || ack_via->port==SIPS_PORT) {
if(inv_via->transport.len!=3
|| memcmp(inv_via->transport.s, "TLS", 3)!=0) {
return 0;
}
}
}
/* everything matched -- we found it */
return 1;
}
/* transaction matching a-la RFC-3261 using transaction ID in branch
* (the function assumes there is magic cookie in branch)
* It returns:
* 2 if e2e ACK for a proxied transaction found
* 1 if found (covers ACK for local UAS)
* 0 if not found (trans undefined)
* It also sets *cancel if a cancel was found for the searched transaction
*/
static int matching_3261( struct sip_msg *p_msg, struct cell **trans,
enum request_method skip_method, int* cancel)
{
struct cell *p_cell;
struct cell *e2e_ack_trans;
struct sip_msg *t_msg;
struct via_body *via1;
int is_ack;
int dlg_parsed;
int ret = 0;
struct entry* hash_bucket;
*cancel=0;
e2e_ack_trans=0;
via1=p_msg->via1;
is_ack=p_msg->REQ_METHOD==METHOD_ACK;
dlg_parsed=0;
/* update parsed tid */
via1->tid.s=via1->branch->value.s+MCOOKIE_LEN;
via1->tid.len=via1->branch->value.len-MCOOKIE_LEN;
hash_bucket=&(get_tm_table()->entries[p_msg->hash_index]);
clist_foreach(hash_bucket, p_cell, next_c){
prefetch_loc_r(p_cell->next_c, 1);
t_msg=p_cell->uas.request;
if (unlikely(!t_msg)) continue;/*don't try matching UAC transactions */
/* we want to set *cancel for transaction for which there is
* already a canceled transaction (e.g. re-ordered INV-CANCEL, or
* INV blocked in dns lookup); we don't care about ACKs */
if ((is_ack || (t_msg->REQ_METHOD!=METHOD_CANCEL)) &&
(skip_method & t_msg->REQ_METHOD))
continue;
/* here we do an exercise which will be removed from future code
* versions: we try to match end-2-end ACKs if they appear at our
* server. This allows some applications bound to TM via callbacks
* to correlate the e2e ACKs with transaction context, e.g., for
* purpose of accounting. We think it is a bad place here, among
* other things because it is not reliable. If a transaction loops
* via server the ACK can't be matched to proper INVITE transaction
* (it is a separate transactino with its own branch ID) and it
* matches all transaction instances in the loop dialog-wise.
* Eventually, regardless to which transaction in the loop the
* ACK belongs, only the first one will match.
*/
/* dialog matching needs to be applied for ACK/200s but only if
* this is a local transaction or its a proxied transaction interested
* in e2e ACKs (has E2EACK* callbacks installed) */
if (unlikely(is_ack && p_cell->uas.status<300)) {
if (unlikely(has_tran_tmcbs(p_cell,
TMCB_E2EACK_IN|TMCB_E2EACK_RETR_IN) ||
(p_cell->relayed_reply_branch==-2) )) {
/* make sure we have parsed all things we need for dialog
* matching */
if (!dlg_parsed) {
dlg_parsed=1;
if (unlikely(!parse_dlg(p_msg))) {
LOG(L_INFO, "dlg parsing failed\n");
return 0;
}
}
ret=ack_matching(p_cell /* t w/invite */, p_msg /* ack */);
if (unlikely(ret>0)) {
/* if ret==1 => fully matching e2e ack for local trans
* if ret==2 => matching e2e ack for proxied transaction.
* which is interested in it (E2EACK* callbacks)
* if ret==3 => partial match => we should at least
* make sure the ACK is not for a negative reply
* (FIXME: ret==3 should never happen, it's a bug catch
* case)*/
if (unlikely(ret==1)) goto found;
if (unlikely(ret==3)){
if (e2e_ack_trans==0)
e2e_ack_trans=p_cell;
continue; /* maybe we get a better
* match for a neg. replied trans. */
}
e2e_ack_trans=p_cell;
goto e2eack_found;
}
/* this ACK is neither local "negative" one, nor a proxied
* end-2-end one, nor an end-2-end one for a UAS transaction
* -- we failed to match */
continue;
}
/* not interested, it's an ack and a 2xx replied
* transaction but the transaction is not local and
* the transaction is not interested in e2eacks (no e2e callbacks)*/
continue;
}
/* now real tid matching occurs for negative ACKs and any
* other requests */
if (!via_matching(t_msg->via1 /* inv via */, via1 /* ack */ ))
continue;
/* check if call-id is still the same */
if (cfg_get(tm, tm_cfg, callid_matching)
&& !EQ_LEN(callid) && !EQ_STR(callid)) {
LM_ERR("matching transaction found but callids"
" don't match (received: %.*s stored: %.*s)\n",
p_msg->callid->body.len, p_msg->callid->body.s,
t_msg->callid->body.len, t_msg->callid->body.s);
continue;
}
if (t_msg->REQ_METHOD==METHOD_CANCEL){
if ((p_msg->REQ_METHOD!=METHOD_CANCEL) && !is_ack){
/* found an existing cancel for the searched transaction */
*cancel=1;
}
if (skip_method & t_msg->REQ_METHOD) continue;
}
found:
prefetch_w(p_cell); /* great chance of modifiying it */
/* all matched -- we found the transaction ! */
LM_DBG("RFC3261 transaction matched, tid=%.*s\n",
via1->tid.len, via1->tid.s);
*trans=p_cell;
return 1;
}
/* ... we didn't find any */
/* just check if it we found an e2e ACK previously
* (Note: this is not very reliable, since we match e2e proxy ACKs
* w/o totag => for a pre-forked invite it might match the wrong
* transaction) */
if (e2e_ack_trans) {
e2eack_found:
*trans=e2e_ack_trans;
return 2;
}
LM_DBG("RFC3261 transaction matching failed\n");
return 0;
}
/** find the transaction corresponding to a request.
* @return - negative - transaction wasn't found (-1) or
* possible e2eACK match (-2).
* 1 - transaction found
* 0 - parse error
* It also sets *cancel if there is already a cancel transaction.
* Side-effects: sets T and T_branch
* (T_branch is always set to T_BR_UNDEFINED).
*/
int t_lookup_request( struct sip_msg* p_msg , int leave_new_locked,
int* cancel)
{
struct cell *p_cell;
unsigned int isACK;
struct sip_msg *t_msg;
struct via_param *branch;
int match_status;
struct cell *e2e_ack_trans;
struct entry* hash_bucket;
/* parse all*/
if (unlikely(check_transaction_quadruple(p_msg)==0))
{
LM_ERR("too few headers\n");
set_t(0, T_BR_UNDEFINED);
/* stop processing */
return 0;
}
/* start searching into the table */
if (!(p_msg->msg_flags & FL_HASH_INDEX)){
p_msg->hash_index=hash( p_msg->callid->body , get_cseq(p_msg)->number);
p_msg->msg_flags|=FL_HASH_INDEX;
}
isACK = p_msg->REQ_METHOD==METHOD_ACK;
LM_DBG("start searching: hash=%d, isACK=%d\n",
p_msg->hash_index,isACK);
/* assume not found */
e2e_ack_trans = 0;
/* first of all, look if there is RFC3261 magic cookie in branch; if
* so, we can do very quick matching and skip the old-RFC bizzar
* comparison of many header fields
*/
if (!p_msg->via1) {
LM_ERR("no via\n");
set_t(0, T_BR_UNDEFINED);
return 0;
}
branch=p_msg->via1->branch;
if (branch && branch->value.s && branch->value.len>MCOOKIE_LEN
&& memcmp(branch->value.s,MCOOKIE,MCOOKIE_LEN)==0) {
/* huhuhu! the cookie is there -- let's proceed fast */
LOCK_HASH(p_msg->hash_index);
match_status=matching_3261(p_msg,&p_cell,
/* skip transactions with different method; otherwise CANCEL
* would match the previous INVITE trans. */
isACK ? ~METHOD_INVITE: ~p_msg->REQ_METHOD,
cancel);
switch(match_status) {
case 0: goto notfound; /* no match */
case 1: goto found; /* match */
case 2: goto e2e_ack; /* e2e proxy ACK */
}
}
/* ok -- it's ugly old-fashioned transaction matching -- it is
* a bit simplified to be fast -- we don't do all the comparisons
* of parsed uri, which was simply too bloated */
LM_DBG("proceeding to pre-RFC3261 transaction matching\n");
*cancel=0;
/* lock the whole entry*/
LOCK_HASH(p_msg->hash_index);
hash_bucket=&(get_tm_table()->entries[p_msg->hash_index]);
if (likely(!isACK)) {
/* all the transactions from the entry are compared */
clist_foreach(hash_bucket, p_cell, next_c){
prefetch_loc_r(p_cell->next_c, 1);
t_msg = p_cell->uas.request;
if (!t_msg) continue; /* skip UAC transactions */
/* for non-ACKs we want same method matching, we
* make an exception for pre-exisiting CANCELs because we
* want to set *cancel */
if ((t_msg->REQ_METHOD!=p_msg->REQ_METHOD) &&
(t_msg->REQ_METHOD!=METHOD_CANCEL))
continue;
/* compare lengths first */
if (!EQ_LEN(callid)) continue;
/* CSeq only the number without method ! */
if (get_cseq(t_msg)->number.len!=get_cseq(p_msg)->number.len)
continue;
if (!EQ_LEN(from)) continue;
if (!EQ_LEN(to)) continue;
if (cfg_get(tm, tm_cfg, ruri_matching) && !EQ_REQ_URI_LEN)
continue;
if (cfg_get(tm, tm_cfg, via1_matching) && !EQ_VIA_LEN(via1))
continue;
/* length ok -- move on */
if (!EQ_STR(callid)) continue;
if (memcmp(get_cseq(t_msg)->number.s, get_cseq(p_msg)->number.s,
get_cseq(p_msg)->number.len)!=0) continue;
if (!EQ_STR(from)) continue;
if (!EQ_STR(to)) continue;
if (cfg_get(tm, tm_cfg, ruri_matching) && !EQ_REQ_URI_STR)
continue;
if (cfg_get(tm, tm_cfg, via1_matching) && !EQ_VIA_STR(via1))
continue;
if ((t_msg->REQ_METHOD==METHOD_CANCEL) &&
(p_msg->REQ_METHOD!=METHOD_CANCEL)){
/* we've matched an existing CANCEL */
*cancel=1;
continue;
}
/* request matched ! */
LM_DBG("non-ACK matched\n");
goto found;
} /* synonym loop */
} else { /* it's an ACK request*/
/* all the transactions from the entry are compared */
clist_foreach(hash_bucket, p_cell, next_c){
prefetch_loc_r(p_cell->next_c, 1);
t_msg = p_cell->uas.request;
if (!t_msg) continue; /* skip UAC transactions */
/* ACK's relate only to INVITEs */
if (t_msg->REQ_METHOD!=METHOD_INVITE) continue;
/* From|To URI , CallID, CSeq # must be always there */
/* compare lengths now */
if (!EQ_LEN(callid)) continue;
/* CSeq only the number without method ! */
if (get_cseq(t_msg)->number.len!=get_cseq(p_msg)->number.len)
continue;
/* To only the uri -- to many UACs screw up tags */
if (get_to(t_msg)->uri.len!=get_to(p_msg)->uri.len)
continue;
if (!EQ_STR(callid)) continue;
if (memcmp(get_cseq(t_msg)->number.s, get_cseq(p_msg)->number.s,
get_cseq(p_msg)->number.len)!=0) continue;
if (memcmp(get_to(t_msg)->uri.s, get_to(p_msg)->uri.s,
get_to(t_msg)->uri.len)!=0) continue;
/* it is e2e ACK/200 */
if (p_cell->uas.status<300) {
/* For e2e ACKs, From's tag 'MUST' equal INVITE's, while use
* of the URI in this case is to be deprecated (Sec. 12.2.1.1).
* Comparing entire From body is dangerous, since some UAs
* screw the display name up. */
if (parse_from_header(p_msg) < 0) {
LM_ERR("failed to parse From HF; ACK might not match.\n");
continue;
}
if (! STR_EQ(get_from(t_msg)->tag_value,
get_from(p_msg)->tag_value))
continue;
#ifdef TM_E2E_ACK_CHECK_FROM_URI
if (! STR_EQ(get_from(t_msg)->uri,
get_from(p_msg)->uri))
continue;
#endif
/* all criteria for proxied ACK are ok */
if (likely(p_cell->relayed_reply_branch!=-2)) {
if (unlikely(has_tran_tmcbs(p_cell,
TMCB_E2EACK_IN|TMCB_E2EACK_RETR_IN))){
if (likely(totag_e2e_ack_matching(p_cell, p_msg)==2))
goto e2e_ack;
else if (e2e_ack_trans==0)
e2e_ack_trans=p_cell;
}
continue;
}
/* it's a local UAS transaction */
if (dlg_matching(p_cell, p_msg))
goto found;
continue;
} else {
/* for hbh ACKs, From HF 'MUST' equal INVITE's one */
if (! EQ_LEN(from)) continue;
if (! EQ_STR(from)) continue;
}
/* it is not an e2e ACK/200 -- perhaps it is
* local negative case; in which case we will want
* more elements to match: r-uri and via; allow
* mismatching r-uri as an config option for broken
* UACs */
if (cfg_get(tm, tm_cfg, ruri_matching) && !EQ_REQ_URI_LEN )
continue;
if (cfg_get(tm, tm_cfg, via1_matching) && !EQ_VIA_LEN(via1))
continue;
if (cfg_get(tm, tm_cfg, ruri_matching) && !EQ_REQ_URI_STR)
continue;
if (cfg_get(tm, tm_cfg, via1_matching) && !EQ_VIA_STR(via1))
continue;
/* wow -- we survived all the check! we matched! */
LM_DBG("non-2xx ACK matched\n");
goto found;
} /* synonym loop */
} /* ACK */
notfound:
if (e2e_ack_trans) {
p_cell=e2e_ack_trans;
goto e2e_ack;
}
/* no transaction found */
set_t(0, T_BR_UNDEFINED);
if (!leave_new_locked) {
UNLOCK_HASH(p_msg->hash_index);
}
LM_DBG("no transaction found\n");
return -1;
e2e_ack:
t_ack=p_cell; /* e2e proxied ACK */
set_t(0, T_BR_UNDEFINED);
if (!leave_new_locked) {
UNLOCK_HASH(p_msg->hash_index);
}
LM_DBG("e2e proxy ACK found\n");
return -2;
found:
set_t(p_cell, T_BR_UNDEFINED);
REF_UNSAFE( T );
set_kr(REQ_EXIST);
UNLOCK_HASH( p_msg->hash_index );
LM_DBG("transaction found (T=%p)\n",T);
return 1;
}
/* function lookups transaction being canceled by CANCEL in p_msg;
* it returns:
* 0 - transaction wasn't found
* T - transaction found
*/
struct cell* t_lookupOriginalT( struct sip_msg* p_msg )
{
struct cell *p_cell;
unsigned int hash_index;
struct sip_msg *t_msg;
struct via_param *branch;
struct entry* hash_bucket;
int foo;
int ret;
/* start searching in the table */
if (!(p_msg->msg_flags & FL_HASH_INDEX)){
/* parse all*/
if (check_transaction_quadruple(p_msg)==0)
{
LM_ERR("too few headers\n");
/* stop processing */
return 0;
}
p_msg->hash_index=hash( p_msg->callid->body , get_cseq(p_msg)->number);
p_msg->msg_flags|=FL_HASH_INDEX;
}
hash_index = p_msg->hash_index;
LM_DBG("searching on hash entry %d\n",hash_index );
/* first of all, look if there is RFC3261 magic cookie in branch; if
* so, we can do very quick matching and skip the old-RFC bizzar
* comparison of many header fields
*/
if (!p_msg->via1) {
LM_ERR("no via\n");
return 0;
}
branch=p_msg->via1->branch;
if (branch && branch->value.s && branch->value.len>MCOOKIE_LEN
&& memcmp(branch->value.s,MCOOKIE,MCOOKIE_LEN)==0) {
/* huhuhu! the cookie is there -- let's proceed fast */
LOCK_HASH(hash_index);
ret=matching_3261(p_msg, &p_cell,
/* we are seeking the original transaction --
* skip CANCEL transactions during search
*/
METHOD_CANCEL, &foo);
if (ret==1) goto found; else goto notfound;
}
/* no cookies --proceed to old-fashioned pre-3261 t-matching */
LOCK_HASH(hash_index);
hash_bucket=&(get_tm_table()->entries[hash_index]);
/* all the transactions from the entry are compared */
clist_foreach(hash_bucket, p_cell, next_c){
prefetch_loc_r(p_cell->next_c, 1);
t_msg = p_cell->uas.request;
if (!t_msg) continue; /* skip UAC transactions */
/* we don't cancel CANCELs ;-) */
if (unlikely(t_msg->REQ_METHOD==METHOD_CANCEL))
continue;
/* check lengths now */
if (!EQ_LEN(callid))
continue;
if (get_cseq(t_msg)->number.len!=get_cseq(p_msg)->number.len)
continue;
if (!EQ_LEN(from))
continue;
#ifdef CANCEL_TAG
if (!EQ_LEN(to))
continue;
#else
/* relaxed matching -- we don't care about to-tags anymore,
* many broken UACs screw them up and ignoring them does not
* actually hurt
*/
if (get_to(t_msg)->uri.len!=get_to(p_msg)->uri.len)
continue;
#endif
if (cfg_get(tm, tm_cfg, ruri_matching) && !EQ_REQ_URI_LEN)
continue;
if (cfg_get(tm, tm_cfg, via1_matching) && !EQ_VIA_LEN(via1))
continue;
/* check the content now */
if (!EQ_STR(callid))
continue;
if (memcmp(get_cseq(t_msg)->number.s,
get_cseq(p_msg)->number.s,get_cseq(p_msg)->number.len)!=0)
continue;
if (!EQ_STR(from))
continue;
#ifdef CANCEL_TAG
if (!EQ_STR(to))
continue;
#else
if (memcmp(get_to(t_msg)->uri.s, get_to(p_msg)->uri.s,
get_to(t_msg)->uri.len)!=0)
continue;
#endif
if (cfg_get(tm, tm_cfg, ruri_matching) && !EQ_REQ_URI_STR)
continue;
if (cfg_get(tm, tm_cfg, via1_matching) && !EQ_VIA_STR(via1))
continue;
/* found */
goto found;
}
notfound:
/* no transaction found */
LM_DBG(" no CANCEL matching found! \n" );
UNLOCK_HASH(hash_index);
LM_DBG("lookup completed\n");
return 0;
found:
LM_DBG("canceled transaction found (%p)! \n",p_cell );
REF_UNSAFE( p_cell );
UNLOCK_HASH(hash_index);
LM_DBG("found - lookup completed\n");
return p_cell;
}
/** get the transaction corresponding to a reply.
* @return -1 - nothing found, 1 - T found
* Side-effects: sets T and T_branch on success.
*/
int t_reply_matching( struct sip_msg *p_msg , int *p_branch )
{
struct cell* p_cell;
unsigned int hash_index = 0;
unsigned int entry_label = 0;
unsigned int branch_id = 0;
char *hashi, *branchi, *p, *n;
struct entry* hash_bucket;
int hashl, branchl;
int scan_space;
str cseq_method;
str req_method;
char *loopi;
int loopl;
short is_cancel;
/* make compiler warnings happy */
loopi=0;
loopl=0;
/* split the branch into pieces: loop_detection_check(ignored),
* hash_table_id, synonym_id, branch_id */
if (!(p_msg->via1 && p_msg->via1->branch && p_msg->via1->branch->value.s))
goto nomatch2;
/* we do RFC 3261 tid matching and want to see first if there is
* magic cookie in branch */
if (p_msg->via1->branch->value.len<=MCOOKIE_LEN)
goto nomatch2;
if (memcmp(p_msg->via1->branch->value.s, MCOOKIE, MCOOKIE_LEN)!=0)
goto nomatch2;
p=p_msg->via1->branch->value.s+MCOOKIE_LEN;
scan_space=p_msg->via1->branch->value.len-MCOOKIE_LEN;
/* hash_id */
n=eat_token2_end( p, p+scan_space, BRANCH_SEPARATOR);
hashl=n-p;
scan_space-=hashl;
if (!hashl || scan_space<2 || *n!=BRANCH_SEPARATOR) goto nomatch2;
hashi=p;
p=n+1;scan_space--;
/* md5 value */
n=eat_token2_end( p, p+scan_space, BRANCH_SEPARATOR );
loopl = n-p;
scan_space-= loopl;
if (n==p || scan_space<2 || *n!=BRANCH_SEPARATOR)
goto nomatch2;
loopi=p;
p=n+1; scan_space--;
/* branch id - should exceed the scan_space */
n=eat_token_end( p, p+scan_space );
branchl=n-p;
if (!branchl ) goto nomatch2;
branchi=p;
/* sanity check */
if (unlikely(reverse_hex2int(hashi, hashl, &hash_index)<0
|| hash_index>=TABLE_ENTRIES
|| reverse_hex2int(branchi, branchl, &branch_id)<0
|| branch_id>=sr_dst_max_branches
|| loopl!=MD5_LEN)
) {
LM_DBG("poor reply ids - index %d label %d branch %d loopl %d/%d\n",
hash_index, entry_label, branch_id, loopl, MD5_LEN);
goto nomatch2;
}
LM_DBG("t_reply_matching: hash %d label %d branch %d\n",
hash_index, entry_label, branch_id );
/* search the hash table list at entry 'hash_index'; lock the entry first */
cseq_method=get_cseq(p_msg)->method;
is_cancel=cseq_method.len==CANCEL_LEN
&& memcmp(cseq_method.s, CANCEL, CANCEL_LEN)==0;
LOCK_HASH(hash_index);
hash_bucket=&(get_tm_table()->entries[hash_index]);
/* all the transactions from the entry are compared */
clist_foreach(hash_bucket, p_cell, next_c){
prefetch_loc_r(p_cell->next_c, 1);
if ( memcmp(p_cell->md5, loopi,MD5_LEN)!=0)
continue;
/* sanity check ... too high branch ? */
if (unlikely(branch_id>=p_cell->nr_of_outgoings))
continue;
/* does method match ? (remember -- CANCELs have the same branch
* as canceled transactions) */
req_method=p_cell->method;
if ( /* method match */
! ((cseq_method.len==req_method.len
&& memcmp( cseq_method.s, req_method.s, cseq_method.len )==0)
/* or it is a local cancel */
|| (is_cancel && is_invite(p_cell)
/* commented out -- should_cancel_branch set it to
* BUSY_BUFFER to avoid collisions with replies;
* thus, we test here by buffer size
*/
/* && p_cell->uac[branch_id].local_cancel.buffer ))) */
&& p_cell->uac[branch_id].local_cancel.buffer_len )))
continue;
if (cfg_get(tm, tm_cfg, callid_matching) &&
p_cell->uas.request && p_cell->uas.request->callid
&& (p_msg->callid->body.len != p_cell->uas.request->callid->body.len
|| memcmp(p_msg->callid->body.s,
p_cell->uas.request->callid->body.s,
p_msg->callid->body.len) != 0)
) {
LM_ERR("matching transaction found but callids"
" don't match (received: %.*s stored: %.*s)\n",
p_msg->callid->body.len, p_msg->callid->body.s,
p_cell->uas.request->callid->body.len, p_cell->uas.request->callid->body.s);
continue;
}
/* passed all disqualifying factors - the transaction has been matched */
set_t(p_cell, (int)branch_id);
*p_branch =(int) branch_id;
REF_UNSAFE( T );
UNLOCK_HASH(hash_index);
LM_DBG("reply (%p) matched an active transaction (T=%p)!\n", p_msg, T);
if(likely(!(p_msg->msg_flags&FL_TM_RPL_MATCHED))) {
/* if this is a 200 for INVITE, we will wish to store to-tags to be
* able to distinguish retransmissions later and not to call
* TMCB_RESPONSE_OUT uselessly; we do it only if callbacks are
* enabled -- except callback customers, nobody cares about
* retransmissions of multiple 200/INV or ACK/200s
*/
if (unlikely( is_invite(p_cell) && p_msg->REPLY_STATUS>=200
&& p_msg->REPLY_STATUS<300
&& ((!is_local(p_cell) &&
has_tran_tmcbs(p_cell,
TMCB_RESPONSE_OUT|TMCB_RESPONSE_READY
|TMCB_E2EACK_IN|TMCB_E2EACK_RETR_IN) )
|| (is_local(p_cell)&&has_tran_tmcbs(p_cell, TMCB_LOCAL_COMPLETED))
)) ) {
if (parse_headers(p_msg, HDR_TO_F, 0)==-1) {
LM_ERR("to parsing failed\n");
}
}
if (unlikely(has_tran_tmcbs(T, TMCB_RESPONSE_IN |
TMCB_LOCAL_RESPONSE_IN))){
if (!is_local(p_cell)) {
run_trans_callbacks( TMCB_RESPONSE_IN, T, T->uas.request,
p_msg, p_msg->REPLY_STATUS);
}else{
run_trans_callbacks( TMCB_LOCAL_RESPONSE_IN, T, T->uas.request,
p_msg, p_msg->REPLY_STATUS);
}
}
p_msg->msg_flags |= FL_TM_RPL_MATCHED;
} else {
LM_DBG("reply in callbacks already done (T=%p)!\n", T);
}
return 1;
} /* for cycle */
/* nothing found */
UNLOCK_HASH(hash_index);
LM_DBG("no matching transaction exists\n");
nomatch2:
LM_DBG("failure to match a transaction\n");
*p_branch = -1;
set_t(0, T_BR_UNDEFINED);
return -1;
}