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 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759
|
/*!
* \file
* \brief Functions related to dialog creation and searching
* \ingroup dialog
* Module: \ref dialog
*/
#include <stdlib.h>
#include <string.h>
#include "../../dprint.h"
#include "../../ut.h"
#include "../../lib/kmi/mi.h"
#include "dlg_timer.h"
#include "dlg_var.h"
#include "dlg_hash.h"
#include "dlg_profile.h"
#include "dlg_handlers.h"
#include "dlg_db_handler.h"
#define MAX_LDG_LOCKS 2048
#define MIN_LDG_LOCKS 2
extern int dlg_db_mode;
/*! global dialog table */
struct dlg_table *d_table = 0;
/*! global dialog out table */
static int dlg_hash_size_out = 4096;
/*!
* \brief Reference a dialog without locking
* \param _dlg dialog
* \param _cnt increment for the reference counter
*/
#define ref_dlg_unsafe(_dlg,_cnt) \
do { \
(_dlg)->ref += (_cnt); \
LM_DBG("ref dlg %p with %d -> %d\n", \
(_dlg),(_cnt),(_dlg)->ref); \
}while(0)
/*!
* \brief Unreference a dialog without locking
* \param _dlg dialog
* \param _cnt decrement for the reference counter
* \param _d_entry dialog entry
*/
#define unref_dlg_unsafe(_dlg,_cnt,_d_entry) \
do { \
(_dlg)->ref -= (_cnt); \
LM_DBG("unref dlg %p with %d -> %d\n",\
(_dlg),(_cnt),(_dlg)->ref);\
if ((_dlg)->ref<0) {\
LM_CRIT("bogus ref %d with cnt %d for dlg %p [%u:%u] "\
"with clid '%.*s' and tags '%.*s'\n",\
(_dlg)->ref, _cnt, _dlg,\
(_dlg)->h_entry, (_dlg)->h_id,\
(_dlg)->callid.len, (_dlg)->callid.s,\
(_dlg)->from_tag.len,\
(_dlg)->from_tag.s);\
}\
if ((_dlg)->ref<=0) { \
unlink_unsafe_dlg( _d_entry, _dlg);\
LM_DBG("ref <=0 for dialog %p\n",_dlg);\
destroy_dlg(_dlg);\
}\
}while(0)
/*!
* \brief Initialize the global dialog table
* \param size size of the table
* \return 0 on success, -1 on failure
*/
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;
}
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() % (3*size);
d_table->entries[i].lock_idx = i % d_table->locks_no;
}
return 0;
error1:
shm_free(d_table);
error0:
return -1;
}
/*!
* \brief free all the memory in the entry_out structure
* \param d_entry_out structure
* \return void
*/
static void destroy_entry_out(struct dlg_entry_out *d_entry_out) {
struct dlg_cell_out *dlg_out;
struct dlg_cell_out *dlg_out_tmp;
dlg_out = d_entry_out->first;
LM_DBG("Destroy dialog entry out\n");
while (dlg_out) {
//clear all dlg_out memory space
if (dlg_out->caller_cseq.s) {
LM_DBG("content before freeing caller cseq is [%.*s]\n", dlg_out->caller_cseq.len, dlg_out->caller_cseq.s);
shm_free(dlg_out->caller_cseq.s);
}
if (dlg_out->callee_cseq.s) {
LM_DBG("content before freeing callee cseq is [%.*s]\n", dlg_out->callee_cseq.len, dlg_out->callee_cseq.s);
shm_free(dlg_out->callee_cseq.s);
}
if (dlg_out->callee_contact.s) {
LM_DBG("content before freeing callee contact is [%.*s]\n", dlg_out->callee_contact.len, dlg_out->callee_contact.s);
shm_free(dlg_out->callee_contact.s);
}
if (dlg_out->callee_route_set.s) {
shm_free(dlg_out->callee_route_set.s);
}
if (dlg_out->did.s) {
shm_free(dlg_out->did.s);
}
dlg_out_tmp = dlg_out->next;
shm_free(dlg_out);
dlg_out = dlg_out_tmp;
}
}
/*!
* \brief Destroy a dialog, run callbacks and free memory
* \param dlg destroyed dialog
*/
inline void destroy_dlg(struct dlg_cell *dlg) {
int ret = 0;
struct dlg_var *var;
LM_DBG("destroying dialog %p\n", dlg);
ret = remove_dialog_timer(&dlg->tl);
if (ret < 0) {
LM_CRIT("unable to unlink the timer on dlg %p [%u:%u] "
"with clid '%.*s' and tags '%.*s'\n",
dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg->from_tag.len, dlg->from_tag.s);
} else if (ret > 0) {
LM_DBG("removed timer for dlg %p [%u:%u] "
"with clid '%.*s' and tags '%.*s' \n",
dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg->from_tag.len, dlg->from_tag.s);
}
if (dlg_db_mode)
remove_dialog_in_from_db(dlg);
LM_DBG("About to run dlg callback for destroy\n");
run_dlg_callbacks(DLGCB_DESTROY, dlg, NULL, NULL, DLG_DIR_NONE, 0);
LM_DBG("DONE: About to run dlg callback for destroy\n");
if (dlg == get_current_dlg_pointer())
reset_current_dlg_pointer();
if (dlg->cbs.first)
destroy_dlg_callbacks_list(dlg->cbs.first);
if (dlg->profile_links)
destroy_linkers(dlg->profile_links);
if (dlg->from_tag.s)
shm_free(dlg->from_tag.s);
if (dlg->first_req_cseq.s)
shm_free(dlg->first_req_cseq.s);
if (dlg->toroute_name.s)
shm_free(dlg->toroute_name.s);
if (dlg->did.s)
shm_free(dlg->did.s);
if (dlg->caller_route_set.s)
shm_free(dlg->caller_route_set.s);
if (dlg->caller_contact.s)
shm_free(dlg->caller_contact.s);
while (dlg->vars) {
var = dlg->vars;
dlg->vars = dlg->vars->next;
shm_free(var->key.s);
shm_free(var->value.s);
shm_free(var);
}
if (&(dlg->dlg_entry_out)) {
lock_get(dlg->dlg_out_entries_lock);
destroy_entry_out(&(dlg->dlg_entry_out));
lock_release(dlg->dlg_out_entries_lock);
}
lock_destroy(dlg->dlg_out_entries_lock);
lock_dealloc(dlg->dlg_out_entries_lock);
shm_free(dlg);
dlg = 0;
}
/*!
* \brief Destroy the global dialog table
*/
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;
destroy_dlg(l_dlg);
}
}
shm_free(d_table);
d_table = 0;
return;
}
/*!
* \brief Create a new dialog structure for a SIP dialog
* \param callid dialog callid
* \param from_uri dialog from uri
* \param to_uri dialog to uri
* \param from_tag dialog from tag
* \param req_uri dialog r-uri
* \return created dialog structure on success, NULL otherwise
*/
struct dlg_cell* build_new_dlg(str *callid, str *from_uri, str *from_tag, str *req_uri) {
struct dlg_cell *dlg;
int len;
char *p;
len = sizeof (struct dlg_cell) +callid->len + from_uri->len + req_uri->len;
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);
dlg->dlg_out_entries_lock = lock_alloc();
if (dlg->dlg_out_entries_lock == NULL) {
LM_ERR("Cannot allocate lock for dlg out entries. Aborting...\n");
shm_free(dlg);
return 0;
} else {
if (lock_init(dlg->dlg_out_entries_lock) == NULL) {
LM_ERR("Cannot init the lock for dlg out entries. Aborting...\n");
lock_destroy(dlg->dlg_out_entries_lock);
lock_dealloc(dlg->dlg_out_entries_lock);
shm_free(dlg);
return 0;
}
}
dlg->state = DLG_STATE_UNCONFIRMED;
dlg->h_entry = core_hash(callid, 0, d_table->size);
LM_DBG("new dialog on hash %u\n", dlg->h_entry);
p = (char*) (dlg + 1);
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->req_uri.s = p;
dlg->req_uri.len = req_uri->len;
memcpy(p, req_uri->s, req_uri->len);
p += req_uri->len;
if (p != (((char*) dlg) + len)) {
LM_CRIT("buffer overflow\n");
shm_free(dlg);
return 0;
}
return dlg;
}
/*!
* \brief Set the leg information for an existing dialog
* \param dlg dialog
* \param tag from tag or to tag
* \param rr record-routing information
* \param contact caller or callee contact
* \param cseq CSEQ of caller or callee
* \param leg must be either DLG_CALLER_LEG, or DLG_CALLEE_LEG
* \return 0 on success, -1 on failure
*/
int dlg_set_leg_info(struct dlg_cell *dlg, str* tag, str *rr, str *contact,
str *cseq, struct socket_info *bind_addr, unsigned int leg) {
if (!dlg) {
return -1;
}
//create new dlg_out entry
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
struct dlg_cell_out *dlg_out;
if (leg == DLG_CALLER_LEG) {
if (tag->len > 0) {
dlg->from_tag.s = (char*) shm_malloc(tag->len);
if (!dlg->from_tag.s) {
LM_ERR("no more shm_mem\n");
return -1;
}
memcpy(dlg->from_tag.s, tag->s, tag->len);
dlg->from_tag.len = tag->len;
}
if (contact->len > 0) {
dlg->caller_contact.s = (char*) shm_malloc(contact->len);
if (!dlg->caller_contact.s) {
LM_ERR("no more shm_mem\n");
return -1;
}
memcpy(dlg->caller_contact.s, contact->s, contact->len);
dlg->caller_contact.len = contact->len;
}
if (rr->len > 0) {
dlg->caller_route_set.s = (char*) shm_malloc(rr->len);
if (!dlg->caller_route_set.s) {
LM_ERR("no more shm_mem\n");
return -1;
}
memcpy(dlg->caller_route_set.s, rr->s, rr->len);
dlg->caller_route_set.len = rr->len;
}
if (cseq->len > 0) {
dlg->first_req_cseq.s = (char*) shm_malloc(cseq->len);
if (!dlg->first_req_cseq.s) {
LM_ERR("no more shm_mem\n");
return -1;
}
memcpy(dlg->first_req_cseq.s, cseq->s, cseq->len);
dlg->first_req_cseq.len = cseq->len;
}
} else {
/* this is the callee side so we need to find the dialog_out entry with the correct to_tag
and assign caller and callee cseq, callee contact, callee route_set
*/
if (d_entry_out) {
lock_get(dlg->dlg_out_entries_lock);
dlg_out = d_entry_out->first;
while (dlg_out) {
LM_DBG("Searching out dialog with to_tag '%.*s' (looking for %.*s\n", dlg_out->to_tag.len, dlg_out->to_tag.s, tag->len, tag->s);
if (dlg_out->to_tag.len == tag->len && memcmp(dlg_out->to_tag.s, tag->s, dlg_out->to_tag.len) == 0) {
LM_DBG("Found dialog_out entry with correct to_tag - updating leg info\n");
if (contact->len > 0) {
dlg_out->callee_contact.s = (char*) shm_malloc(contact->len);
if (!dlg_out->callee_contact.s) {
LM_ERR("no more shm mem\n");
return -1; //if we're out of mem we dont really care about cleaning up - prob going to crash anyway
}
dlg_out->callee_contact.len = contact->len;
memcpy(dlg_out->callee_contact.s, contact->s, contact->len);
}
if (rr->len > 0) {
dlg_out->callee_route_set.s = (char*) shm_malloc(rr->len);
if (!dlg_out->callee_route_set.s) {
LM_ERR("no more shm mem\n");
return -1; //if we're out of mem we dont really care about cleaning up - prob going to crash anyway
}
dlg_out->callee_route_set.len = rr->len;
memcpy(dlg_out->callee_route_set.s, rr->s, rr->len);
}
if (cseq->len > 0) {
dlg_out->callee_cseq.s = (char*) shm_malloc(cseq->len);
dlg_out->caller_cseq.s = (char*) shm_malloc(cseq->len);
if (!dlg_out->callee_cseq.s || !dlg_out->caller_cseq.s) {
LM_ERR("no more shm mem\n");
return -1; //if we're out of mem we dont really care about cleaning up - prob going to crash anyway
}
dlg_out->caller_cseq.len = cseq->len;
memcpy(dlg_out->caller_cseq.s, cseq->s, cseq->len);
dlg_out->callee_cseq.len = cseq->len;
memcpy(dlg_out->callee_cseq.s, cseq->s, cseq->len);
}
dlg_out->callee_bind_addr = bind_addr;
}
dlg_out = dlg_out->next;
}
lock_release(dlg->dlg_out_entries_lock);
} else {
LM_ERR("This dialog has no dialog out entries\n");
return -1;
}
}
return 0;
}
/*!
* \brief Create a new dialog out structure for a SIP dialog
* \param to_tag - dialog to_tag
* \return created dlg_out structure on success, NULL otherwise
*/
struct dlg_cell_out* build_new_dlg_out(struct dlg_cell *dlg, str* to_uri, str* to_tag) {
struct dlg_cell_out *dlg_out;
int len;
char *p;
//len = sizeof (struct dlg_cell_out) +dlg->did.len + to_tag->len + to_uri->len;
len = sizeof (struct dlg_cell_out) +to_tag->len + to_uri->len;
dlg_out = (struct dlg_cell_out*) shm_malloc(len);
if (dlg_out == 0) {
LM_ERR("no more shm mem (%d)\n", len);
return 0;
}
memset(dlg_out, 0, len);
dlg_out->h_entry = core_hash(to_tag, 0, dlg_hash_size_out);
LM_DBG("new dialog_out on hash %u\n", dlg_out->h_entry);
p = (char*) (dlg_out + 1);
//dlg_out->did.s = p;
//dlg_out->did.len = dlg->did.len;
//memcpy(p, dlg->did.s, dlg->did.len);
//p += dlg->did.len;
dlg_out->to_uri.s = p;
dlg_out->to_uri.len = to_uri->len;
memcpy(p, to_uri->s, to_uri->len);
p += to_uri->len;
dlg_out->to_tag.s = p;
dlg_out->to_tag.len = to_tag->len;
memcpy(p, to_tag->s, to_tag->len);
p += to_tag->len;
if (p != (((char*) dlg_out) + len)) {
LM_CRIT("buffer overflow\n");
shm_free(dlg_out);
return 0;
}
//did might be updated (check update_did_dlg_out) if there is a concurrent call -therefore this should not be done as single block of memory
//so Richard editted this to not have did in the single block of memory
if (dlg->did.len > 0) {
dlg_out->did.s = (char*) shm_malloc(dlg->did.len);
if (!dlg_out->did.s) {
LM_ERR("no more shm_mem\n");
return 0;
}
memcpy(dlg_out->did.s, dlg->did.s, dlg->did.len);
dlg_out->did.len = dlg->did.len;
}
return dlg_out;
}
/*!
* \brief Free the memory for a dlg_out cell
* \param dlg_out structure
* \return void
*/
void free_dlg_out_cell(struct dlg_cell_out *dlg_out) {
if (dlg_out->callee_contact.s)
shm_free(dlg_out->callee_contact.s);
if (dlg_out->callee_cseq.s)
shm_free(dlg_out->callee_cseq.s);
if (dlg_out->callee_route_set.s)
shm_free(dlg_out->callee_route_set.s);
if (dlg_out->caller_cseq.s)
shm_free(dlg_out->caller_cseq.s);
//Richard removed this - it is free-ed two lines above!!??!
//if (dlg_out->callee_route_set.s)
// shm_free(dlg_out->callee_route_set.s);
//Richard added this as the did is now malloc-ed separately and not as a single concurrent block (as the totag etc. are)
if (dlg_out->did.s)
shm_free(dlg_out->did.s);
shm_free(dlg_out);
}
/*!
* \brief Remove dlg_out entry identified by to_tag from dlg structure
* \param dlg structure
* \param dlg_out to_tag
* \return void
*/
void dlg_remove_dlg_out_tag(struct dlg_cell *dlg, str *to_tag) {
lock_get(dlg->dlg_out_entries_lock);
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
struct dlg_cell_out *pdlg_out = d_entry_out->first;
struct dlg_cell_out *tmpdlg = 0;
int only = 0;
while (pdlg_out) {
if (pdlg_out->deleted) {
LM_DBG("Found dlg_out to remove\n");
if (pdlg_out->prev) {
pdlg_out->prev->next = pdlg_out->next;
} else {
//assume that we are first
if (pdlg_out->next) {
d_entry_out->first = pdlg_out->next;
pdlg_out->next->prev = 0;
} else {
LM_ERR("dlg out entry has prev set to null and next set to null too\n");
only = 1;
}
}
if (pdlg_out->next) {
pdlg_out->next->prev = pdlg_out->prev;
} else {
//we are likely the last
if (pdlg_out->prev) {
d_entry_out->last = pdlg_out->prev;
} else {
LM_ERR("dlg out next is NULL and so is prev");
only = 1;
}
}
tmpdlg = pdlg_out->next;
free_dlg_out_cell(pdlg_out);
pdlg_out = tmpdlg;
if (only) {
d_entry_out->last = 0;
d_entry_out->first = 0;
}
} else {
LM_DBG("Not deleting dlg_out as it is not set to deleted\n");
pdlg_out = pdlg_out->next;
}
}
lock_release(dlg->dlg_out_entries_lock);
}
/*!
* \brief Remove all dlg_out entries from dlg structure expect that identified as dlg_do_not_remove
* \param dlg_out cell - structure to not remove
* \param mark_only - 1 then only mark for deletion, if 0 then delete
* \return void
*/
void dlg_remove_dlg_out(struct dlg_cell_out *dlg_out_do_not_remove, struct dlg_cell *dlg, int only_mark) {
lock_get(dlg->dlg_out_entries_lock);
//get dlg_out_entry list from dlg
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
struct dlg_cell_out *dlg_out;
//check if list is empty
if ((d_entry_out->first == d_entry_out->last) && (d_entry_out->first == 0)) {
LM_DBG("There are no dlg_out entries\n");
lock_release(dlg->dlg_out_entries_lock);
return;
}
dlg_out = d_entry_out->first;
LM_DBG("Scanning dlg_entry_out list for dlg_out entry with did: [%s]", dlg->did.s);
//run through the list and for each dlg_out_entry:
while (dlg_out) {
//check if it is the dlg_out that we don't want to remove (compare the to-tags)
if (dlg_out->to_tag.len == dlg_out_do_not_remove->to_tag.len &&
memcmp(dlg_out->to_tag.s, dlg_out_do_not_remove->to_tag.s, dlg_out->to_tag.len) == 0) {
LM_DBG("This is the dlg_out not to be removed!\n");
} else {
//check if this the last entry in the entry_table
if ((d_entry_out->first == d_entry_out->last)) {
//we shouldnt ever get here
LM_DBG("This is the last dlg_out_entry in the dlg_entries_out\n");
//this is the last then set entry_out-> first and entry_out->last to zero
dlg->dlg_entry_out.first = dlg->dlg_entry_out.last = 0;
} else {
if (!only_mark) {
LM_DBG("Deleteing dlg out structure\n");
if (dlg_out->prev) {
dlg_out->prev->next = dlg_out->next;
}
//make the next->previous dlg_out point to the previous of this dlg_out
//do not do this if this is the last entry in the list as the next struct is null
if (dlg_out->next) {
dlg_out->next->prev = dlg_out->prev;
}
free_dlg_out_cell(dlg_out);
} else {
LM_DBG("Marking dlg_out structure for deletion - it should be deleted by tm callback instead to_tag: %.*s\n", dlg_out->to_tag.len, dlg_out->to_tag.s);
dlg_out->deleted = 1;
}
}
}
dlg_out = dlg_out->next;
}
lock_release(dlg->dlg_out_entries_lock);
}
/*!
* \brief Update or set the CSEQ for an existing dialog
* \param dlg dialog
* \param leg must be either DLG_CALLER_LEG, or DLG_CALLEE_LEG
* \param cseq CSEQ of caller or callee
* \return 0 on success, -1 on failure
*/
int dlg_update_cseq(struct dlg_cell * dlg, unsigned int leg, str *cseq, str *to_tag) {
LM_DBG("trying to update cseq with seq [%.*s]\n", cseq->len, cseq->s);
//Runs through the dlg_oput entries finds the one that matches the to_tag and updates the callee or caller cseq accordingly
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
struct dlg_cell_out *dlg_out;
dlg_out = d_entry_out->first;
if (to_tag) {
//compare the to_tag passed parameter to all the dlg_out to_tag entry of the dlg parameter (There could be multiple)
while (dlg_out) {
if (dlg_out->to_tag.len == to_tag->len && memcmp(dlg_out->to_tag.s, to_tag->s, dlg_out->to_tag.len) == 0) {
//this parameter matches we have found the dlg_out to update the cseq
if (leg == DLG_CALLER_LEG) {
//update caller cseq
if (dlg_out->caller_cseq.s) {
if (dlg_out->caller_cseq.len < cseq->len) {
shm_free(dlg_out->caller_cseq.s);
dlg_out->caller_cseq.s = (char*) shm_malloc(cseq->len);
if (dlg_out->caller_cseq.s == NULL)
goto error;
dlg_out->caller_cseq.len = cseq->len;
memcpy(dlg_out->caller_cseq.s, cseq->s, cseq->len);
}
} else {
dlg_out->caller_cseq.s = (char*) shm_malloc(cseq->len);
if (dlg_out->caller_cseq.s == NULL)
goto error;
dlg_out->caller_cseq.len = cseq->len;
memcpy(dlg_out->caller_cseq.s, cseq->s, cseq->len);
}
} else if (leg == DLG_CALLEE_LEG) {
//update callee cseq
if (dlg_out->callee_cseq.s) {
if (dlg_out->callee_cseq.len < cseq->len) {
shm_free(dlg_out->callee_cseq.s);
dlg_out->callee_cseq.s = (char*) shm_malloc(cseq->len);
if (dlg_out->callee_cseq.s == NULL)
goto error;
dlg_out->callee_cseq.len = cseq->len;
memcpy(dlg_out->callee_cseq.s, cseq->s, cseq->len);
}
} else {
dlg_out->callee_cseq.s = (char*) shm_malloc(cseq->len);
if (dlg_out->callee_cseq.s == NULL)
goto error;
dlg_out->callee_cseq.len = cseq->len;
memcpy(dlg_out->callee_cseq.s, cseq->s, cseq->len);
}
}
}
dlg_out = dlg_out->next;
}
}
return 0;
error:
LM_ERR("not more shm mem\n");
return -1;
}
/*!
* \brief Update or set the CSEQ for an existing dialog
* \param dlg dialog
* \param leg must be either DLG_CALLER_LEG, or DLG_CALLEE_LEG
* \param cseq CSEQ of caller or callee
* \return 0 on success, -1 on failure
*/
int dlg_update_contact(struct dlg_cell * dlg, unsigned int leg, str *contact, str *to_tag) {
LM_DBG("trying to update contact with contact [%.*s]\n", contact->len, contact->s);
//Runs through the dlg_oput entries finds the one that matches the to_tag and updates the callee or caller contact accordingly
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
struct dlg_cell_out *dlg_out;
dlg_out = d_entry_out->first;
if (leg == DLG_CALLER_LEG) {
//update caller contact
if (dlg->caller_contact.s) {
if (dlg->caller_contact.len < contact->len) {
shm_free(dlg->caller_contact.s);
dlg->caller_contact.s = (char*) shm_malloc(contact->len);
if (dlg->caller_contact.s == NULL)
goto error;
dlg->caller_contact.len = contact->len;
memcpy(dlg->caller_contact.s, contact->s, contact->len);
}
} else {
dlg->caller_contact.s = (char*) shm_malloc(contact->len);
if (dlg->caller_contact.s == NULL)
goto error;
dlg->caller_contact.len = contact->len;
memcpy(dlg->caller_contact.s, contact->s, contact->len);
}
}
if (leg == DLG_CALLEE_LEG) {
//update callee contact
if (!to_tag) {
LM_ERR("No to tag to identify dlg_out\n");
return -1;
}
//compare the to_tag passed parameter to all the dlg_out to_tag entry of the dlg parameter (There could be multiple)
while (dlg_out) {
if (dlg_out->to_tag.len == to_tag->len && memcmp(dlg_out->to_tag.s, to_tag->s, dlg_out->to_tag.len) == 0) {
//this parameter matches we have found the dlg_out to update the callee contact
//update callee contact
if (dlg_out->callee_contact.s) {
if (dlg_out->callee_contact.len < contact->len) {
shm_free(dlg_out->callee_contact.s);
dlg_out->callee_contact.s = (char*) shm_malloc(contact->len);
if (dlg_out->callee_contact.s == NULL)
goto error;
dlg_out->callee_contact.len = contact->len;
memcpy(dlg_out->callee_contact.s, contact->s, contact->len);
}
} else {
dlg_out->callee_contact.s = (char*) shm_malloc(contact->len);
if (dlg_out->callee_contact.s == NULL)
goto error;
dlg_out->callee_contact.len = contact->len;
memcpy(dlg_out->callee_contact.s, contact->s, contact->len);
}
}
dlg_out = dlg_out->next;
}
}
return 0;
error:
LM_ERR("not more shm mem\n");
return -1;
}
/*!
* \brief Lookup a dialog in the global list
*
* Note that the caller is responsible for decrementing (or reusing)
* the reference counter by one again iff a dialog has been found.
* \param h_entry number of the hash table entry
* \param h_id id of the hash table entry
* \return dialog structure on success, NULL on failure
*/
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) {
ref_dlg_unsafe(dlg, 1);
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;
}
/*!
* \brief Helper function to get a dialog corresponding to a SIP message
* \see get_dlg
* \param callid callid
* \param ftag from tag
* \param ttag to tag
* \param dir direction
* \return dialog structure on success, NULL on failure
*/
static inline struct dlg_cell * internal_get_dlg(unsigned int h_entry,
str *callid, str *ftag, str *ttag, unsigned int *dir) {
struct dlg_cell *dlg;
struct dlg_entry *d_entry;
d_entry = &(d_table->entries[h_entry]);
dlg_lock(d_table, d_entry);
for (dlg = d_entry->first; dlg; dlg = dlg->next) {
/* Check callid / fromtag / totag */
if (match_dialog(dlg, callid, ftag, ttag, dir) == 1) {
ref_dlg_unsafe(dlg, 1);
dlg_unlock(d_table, d_entry);
return dlg;
}
}
dlg_unlock(d_table, d_entry);
return 0;
}
/*!
* \brief Get dialog that correspond to CallId, From Tag and To Tag
*
* 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."
* Note that the caller is responsible for decrementing (or reusing)
* the reference counter by one again iff a dialog has been found.
* \param callid callid
* \param ftag from tag
* \param ttag to tag
* \param dir direction
* \return dialog structure on success, NULL on failure
*/
struct dlg_cell * get_dlg(str *callid, str *ftag, str *ttag, unsigned int *dir) {
struct dlg_cell *dlg;
if ((dlg = internal_get_dlg(core_hash(callid, 0,
d_table->size), callid, ftag, ttag, dir)) == 0 &&
(dlg = internal_get_dlg(core_hash(callid, ttag->len
? ttag : 0, d_table->size), callid, ftag, ttag, dir)) == 0) {
LM_DBG("no dialog callid='%.*s' found\n", callid->len, callid->s);
return 0;
}
return dlg;
}
/*!
* \brief Link a dialog structure
* \param dlg dialog
* \param n extra increments for the reference counter
*/
void link_dlg_out(struct dlg_cell *dlg, struct dlg_cell_out *dlg_out, int n) {
LM_DBG("Start: link_dlg_out\n");
lock_get(dlg->dlg_out_entries_lock);
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
if ((d_entry_out->first == d_entry_out->last) && (d_entry_out->first == 0)) {
//adding first out dialog
LM_DBG("Adding first dlg_out structure\n");
d_entry_out->first = dlg_out;
d_entry_out->last = dlg_out;
} else {
LM_DBG("Adding new dlg_out structure\n");
dlg_out->prev = d_entry_out->last;
dlg_out->next = 0;
d_entry_out->last->next = dlg_out;
d_entry_out->last = dlg_out;
}
lock_release(dlg->dlg_out_entries_lock);
LM_DBG("Done: link_dlg_out\n");
return;
}
/*!
* \brief Link a dialog structure
* \param dlg dialog
* \param n extra increments for the reference counter
*/
void link_dlg(struct dlg_cell *dlg, int n) {
struct dlg_entry *d_entry;
LM_DBG("Linking new dialog with h_entry: %u", dlg->h_entry);
d_entry = &(d_table->entries[dlg->h_entry]);
dlg_lock(d_table, d_entry);
dlg->h_id = d_entry->next_id++;
if (d_entry->first == 0) {
d_entry->first = d_entry->last = dlg;
} else {
d_entry->last->next = dlg;
dlg->prev = d_entry->last;
d_entry->last = dlg;
}
ref_dlg_unsafe(dlg, 1 + n);
dlg_unlock(d_table, d_entry);
return;
}
/*!
* \brief Refefence a dialog with locking
* \see ref_dlg_unsafe
* \param dlg dialog
* \param cnt increment for the reference counter
*/
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);
}
/*!
* \brief Unreference a dialog with locking
* \see unref_dlg_unsafe
* \param dlg dialog
* \param cnt decrement for the reference counter
*/
void unref_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);
unref_dlg_unsafe(dlg, cnt, d_entry);
dlg_unlock(d_table, d_entry);
}
/*!
* Small logging helper functions for next_state_dlg.
* \param event logged event
* \param dlg dialog data
* \see next_state_dlg
*/
static inline void log_next_state_dlg(const int event, const struct dlg_cell * dlg) {
LM_CRIT("bogus event %d in state %d for dlg %p [%u:%u] with clid '%.*s' and tags "
"'%.*s'\n", event, dlg->state, dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg->from_tag.len, dlg->from_tag.s);
}
/*!
* \brief Update a dialog state according a event and the old state
*
* This functions implement the main state machine that update a dialog
* state according a processed event and the current state. If necessary
* it will delete the processed dialog. The old and new state are also
* saved for reference.
* \param dlg updated dialog
* \param event current event
* \param old_state old dialog state
* \param new_state new dialog state
* \param unref set to 1 when the dialog was deleted, 0 otherwise
*/
void next_state_dlg(struct dlg_cell *dlg, int event,
int *old_state, int *new_state, int *unref, str * to_tag) {
struct dlg_entry *d_entry;
d_entry = &(d_table->entries[dlg->h_entry]);
*unref = 0;
dlg_lock(d_table, d_entry);
*old_state = dlg->state;
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
struct dlg_cell_out *dlg_out;
dlg_out = d_entry_out->first;
int found = -1;
switch (event) {
case DLG_EVENT_TDEL:
switch (dlg->state) {
case DLG_STATE_UNCONFIRMED:
case DLG_STATE_EARLY:
dlg->state = DLG_STATE_DELETED;
unref_dlg_unsafe(dlg, 1, d_entry);
*unref = 1;
break;
case DLG_STATE_CONFIRMED:
unref_dlg_unsafe(dlg, 1, d_entry);
break;
case DLG_STATE_DELETED:
*unref = 1;
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_RPL1xx:
switch (dlg->state) {
case DLG_STATE_UNCONFIRMED:
case DLG_STATE_EARLY:
dlg->state = DLG_STATE_EARLY;
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_RPL3xx:
switch (dlg->state) {
case DLG_STATE_UNCONFIRMED:
case DLG_STATE_EARLY:
dlg->state = DLG_STATE_DELETED;
*unref = 1;
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_RPL2xx:
switch (dlg->state) {
case DLG_STATE_DELETED:
if (dlg->dflags & DLG_FLAG_HASBYE) {
LM_CRIT("bogus event %d in state %d (with BYE) "
"for dlg %p [%u:%u] with clid '%.*s' and tags '%.*s' \n",
event, dlg->state, dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg->from_tag.len, dlg->from_tag.s);
break;
}
ref_dlg_unsafe(dlg, 1);
case DLG_STATE_UNCONFIRMED:
case DLG_STATE_EARLY:
dlg->state = DLG_STATE_CONFIRMED;
//TODO: check that the callbacks for confirmed are run
break;
case DLG_STATE_CONFIRMED:
//check the to_tag passed parameter exists
if (to_tag) {
//compare the to_tag passed parameter to the dlg_out to_tag entry of the dlg parameter (There should be only 1 dlg_out entry)
if (dlg_out->to_tag.len == to_tag->len && memcmp(dlg_out->to_tag.s, to_tag->s, dlg_out->to_tag.len) == 0) {
//this parameter matches the existing dlg_out and is therefore a retransmission, so break
break;
} else {
LM_ERR("It looks like this is a concurrently confirmed call!!\n");
LM_ERR("Error checking now so not putting into DLG_STATE_CONCURRENTLY_CONFIRMED\n");
LM_ERR("This is event DLG_EVENT_RPL2XX and the current dlg state is DLG_STATE_CONFIRMED\n");
LM_ERR("There should only be one dlg out here as the state is CONFIRMED but we are checking anyway!\n");
LM_ERR("To tag passed in the 2XX: [%.*s]", to_tag->len, to_tag->s);
LM_ERR("Now printing dlgouts totags - there should be only one!\n");
while (dlg_out) {
LM_ERR("dlg_out to_tag: [%.*s]\n", dlg_out->to_tag.len, dlg_out->to_tag.s);
dlg_out = dlg_out->next;
}
//The parameter does not match so this is a concurrently confirmed call
//dlg->state = DLG_STATE_CONCURRENTLY_CONFIRMED;
}
} else {
//to_tag parameter does not exist so break
break;
}
case DLG_STATE_CONCURRENTLY_CONFIRMED:
//check the to_tag passed parameter exists
if (to_tag) {
//compare the to_tag passed parameter to all the dlg_out to_tag entry of the dlg parameter (There could be multiple)
while (dlg_out) {
if (dlg_out->to_tag.len == to_tag->len && memcmp(dlg_out->to_tag.s, to_tag->s, dlg_out->to_tag.len) == 0) {
//this parameter matches the existing dlg_out and is therefore a retransmission
found = 1;
}
dlg_out = dlg_out->next;
}
if (found == -1) {
//The parameter does not match so this is another concurrently confirmed call (we would have breaked by now if it matched)
dlg->state = DLG_STATE_CONCURRENTLY_CONFIRMED;
}
} else {
//to_tag parameter does not exist so break
break;
}
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_REQACK:
switch (dlg->state) {
case DLG_STATE_CONFIRMED:
break;
case DLG_STATE_DELETED:
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_REQBYE:
switch (dlg->state) {
case DLG_STATE_CONFIRMED:
dlg->dflags |= DLG_FLAG_HASBYE;
dlg->state = DLG_STATE_DELETED;
*unref = 1;
break;
case DLG_STATE_EARLY:
case DLG_STATE_DELETED:
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_REQPRACK:
switch (dlg->state) {
case DLG_STATE_EARLY:
//Richard added this - think it is necessary as can received PRACK in early state!
break;
default:
log_next_state_dlg(event, dlg);
}
break;
case DLG_EVENT_REQ:
switch (dlg->state) {
case DLG_STATE_EARLY:
case DLG_STATE_CONFIRMED:
break;
default:
log_next_state_dlg(event, dlg);
}
break;
default:
LM_CRIT("unknown event %d in state %d "
"for dlg %p [%u:%u] with clid '%.*s' and tags '%.*s'\n",
event, dlg->state, dlg, dlg->h_entry, dlg->h_id,
dlg->callid.len, dlg->callid.s,
dlg->from_tag.len, dlg->from_tag.s);
}
*new_state = dlg->state;
dlg_unlock(d_table, d_entry);
LM_DBG("dialog %p changed from state %d to "
"state %d, due event %d\n", dlg, *old_state, *new_state, event);
}
/**
*
*/
int dlg_set_toroute(struct dlg_cell *dlg, str * route) {
if (dlg == NULL || route == NULL || route->len <= 0)
return 0;
if (dlg->toroute_name.s != NULL) {
shm_free(dlg->toroute_name.s);
dlg->toroute_name.s = NULL;
dlg->toroute_name.len = 0;
}
dlg->toroute_name.s = (char*) shm_malloc((route->len + 1) * sizeof (char));
if (dlg->toroute_name.s == NULL) {
LM_ERR("no more shared memory\n");
return -1;
}
memcpy(dlg->toroute_name.s, route->s, route->len);
dlg->toroute_name.len = route->len;
dlg->toroute_name.s[dlg->toroute_name.len] = '\0';
dlg->toroute = route_lookup(&main_rt, dlg->toroute_name.s);
return 0;
}
/*!
* \brief Takes the did of the dialog and appends an "x" to it to make a different did for concurrent calls
* \param dlg_cell - dlg_cell whose did we use
* \param new_did - empty container for new_did
* \return void
*/
void create_concurrent_did(struct dlg_cell *dlg, str * new_did) {
int len = dlg->did.len + 1 + 1;
new_did->s = shm_malloc(len);
if (new_did->s == 0) {
LM_ERR("no more shm mem (%d)\n", len);
return;
}
memset(new_did->s, 0, len);
memcpy(new_did->s, dlg->did.s, dlg->did.len);
new_did->s[dlg->did.len] = 'x';
new_did->len = dlg->did.len + 1;
}
/*!
* \brief Update the did of the dlg_out structure
* \param dlg_cell_out - structure to update
* \param new_did - new did to use
* \return 1 success, 0 failure
*/
int update_dlg_out_did(struct dlg_cell_out *dlg_out, str * new_did) {
//update the did of the dlg_out
if (dlg_out->did.s) {
if (dlg_out->did.len < new_did->len) {
shm_free(dlg_out->did.s);
dlg_out->did.s = (char*) shm_malloc(new_did->len);
if (dlg_out->did.s == NULL)
goto error;
}
} else {
dlg_out->did.s = (char*) shm_malloc(new_did->len);
if (dlg_out->did.s == NULL)
goto error;
}
memcpy(dlg_out->did.s, new_did->s, new_did->len);
dlg_out->did.len = new_did->len;
return 0;
error:
LM_ERR("not more shm mem\n");
return -1;
}
/*!
* \brief Update the did of the dlg structure
* \param dlg_cell - structure to update
* \param new_did - new did to use
* \return 1 success, 0 failure
*/
int update_dlg_did(struct dlg_cell *dlg, str * new_did) {
//update the did of the dlg_out
if (dlg->did.s) {
if (dlg->did.len < new_did->len) {
shm_free(dlg->did.s);
dlg->did.s = (char*) shm_malloc(new_did->len);
if (dlg->did.s == NULL)
goto error;
}
} else {
dlg->did.s = (char*) shm_malloc(new_did->len);
if (dlg->did.s == NULL)
goto error;
}
memcpy(dlg->did.s, new_did->s, new_did->len);
dlg->did.len = new_did->len;
return 0;
error:
LM_ERR("not more shm mem\n");
return -1;
}
/**************************** MI functions ******************************/
/*!
* \brief Helper method that output a dialog via the MI interface
* \see mi_print_dlg
* \param rpl MI node that should be filled
* \param dlg printed dialog
* \param with_context if 1 then the dialog context will be also printed
* \return 0 on success, -1 on failure
*/
static inline int internal_mi_print_dlg_out(struct mi_node *rpl,
struct dlg_cell_out * dlg_out) {
struct mi_node* node = NULL;
struct mi_node* node1 = NULL;
struct mi_attr* attr = NULL;
node = add_mi_node_child(rpl, 0, "dialog_out", 10, 0, 0);
if (node == 0)
goto error;
attr = addf_mi_attr(node, 0, "hash", 4, "%u:%u",
dlg_out->h_entry, dlg_out->h_id);
if (attr == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "to_tag", 6,
dlg_out->to_tag.s, dlg_out->to_tag.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "did", 3,
dlg_out->did.s, dlg_out->did.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "callee_contact", 14,
dlg_out->callee_contact.s,
dlg_out->callee_contact.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "caller_cseq", 11,
dlg_out->caller_cseq.s,
dlg_out->caller_cseq.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "callee_cseq", 11,
dlg_out->callee_cseq.s,
dlg_out->callee_cseq.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "callee_route_set", 16,
dlg_out->callee_route_set.s,
dlg_out->callee_route_set.len);
if (node1 == 0)
goto error;
if (dlg_out->callee_bind_addr) {
node1 = add_mi_node_child(node, 0,
"callee_bind_addr", 16,
dlg_out->callee_bind_addr->sock_str.s,
dlg_out->callee_bind_addr->sock_str.len);
} else {
node1 = add_mi_node_child(node, 0,
"callee_bind_addr", 16, 0, 0);
}
return 0;
error:
LM_ERR("failed to add node\n");
return -1;
}
/*!
* \brief Helper method that output a dialog via the MI interface
* \see mi_print_dlg
* \param rpl MI node that should be filled
* \param dlg printed dialog
* \param with_context if 1 then the dialog context will be also printed
* \return 0 on success, -1 on failure
*/
static inline int internal_mi_print_dlg(struct mi_node *rpl,
struct dlg_cell *dlg, int with_context) {
struct mi_node* node = NULL;
struct mi_node* node1 = NULL;
struct mi_attr* attr = NULL;
int len;
char* p;
node = add_mi_node_child(rpl, 0, "dialog", 6, 0, 0);
if (node == 0)
goto error;
attr = addf_mi_attr(node, 0, "hash", 4, "%u:%u",
dlg->h_entry, dlg->h_id);
if (attr == 0)
goto error;
p = int2str((unsigned long) dlg->state, &len);
node1 = add_mi_node_child(node, MI_DUP_VALUE, "state", 5, p, len);
if (node1 == 0)
goto error;
p = int2str((unsigned long) dlg->ref, &len);
node1 = add_mi_node_child(node, MI_DUP_VALUE, "ref_count", 9, p, len);
if (node1 == 0)
goto error;
p = int2str((unsigned long) dlg->start_ts, &len);
node1 = add_mi_node_child(node, MI_DUP_VALUE, "timestart", 9, p, len);
if (node1 == 0)
goto error;
p = int2str((unsigned long) dlg->tl.timeout, &len);
node1 = add_mi_node_child(node, MI_DUP_VALUE, "timeout", 7, p, len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "callid", 6,
dlg->callid.s, dlg->callid.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "from_uri", 8,
dlg->from_uri.s, dlg->from_uri.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "from_tag", 8,
dlg->from_tag.s, dlg->from_tag.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "did", 3,
dlg->did.s, dlg->did.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "caller_contact", 14,
dlg->caller_contact.s,
dlg->caller_contact.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "first_req_cseq", 14,
dlg->first_req_cseq.s,
dlg->first_req_cseq.len);
if (node1 == 0)
goto error;
node1 = add_mi_node_child(node, MI_DUP_VALUE, "caller_route_set", 16,
dlg->caller_route_set.s,
dlg->caller_route_set.len);
if (node1 == 0)
goto error;
if (dlg->caller_bind_addr) {
node1 = add_mi_node_child(node, 0,
"caller_bind_addr", 16,
dlg->caller_bind_addr->sock_str.s,
dlg->caller_bind_addr->sock_str.len);
} else {
node1 = add_mi_node_child(node, 0,
"caller_bind_addr", 16, 0, 0);
}
if (with_context) {
node1 = add_mi_node_child(node, 0, "context", 7, 0, 0);
if (node1 == 0)
goto error;
run_dlg_callbacks(DLGCB_MI_CONTEXT,
dlg,
NULL,
NULL,
DLG_DIR_NONE,
(void *) node1);
}
struct dlg_cell_out *dlg_out;
struct dlg_entry_out *d_entry_out = &(dlg->dlg_entry_out);
dlg_out = d_entry_out->first;
while (dlg_out) {
if (internal_mi_print_dlg_out(rpl, dlg_out) != 0)
goto error;
dlg_out = dlg_out->next;
}
return 0;
error:
LM_ERR("failed to add node\n");
return -1;
}
/*!
* \brief Output a dialog via the MI interface
* \param rpl MI node that should be filled
* \param dlg printed dialog
* \param with_context if 1 then the dialog context will be also printed
* \return 0 on success, -1 on failure
*/
int mi_print_dlg(struct mi_node *rpl, struct dlg_cell *dlg, int with_context) {
return internal_mi_print_dlg(rpl, dlg, with_context);
}
/*!
* \brief Helper function that output all dialogs via the MI interface
* \see mi_print_dlgs
* \param rpl MI node that should be filled
* \param with_context if 1 then the dialog context will be also printed
* \return 0 on success, -1 on failure
*/
static int internal_mi_print_dlgs(struct mi_node *rpl, int with_context) {
struct dlg_cell *dlg;
unsigned int i;
LM_DBG("printing %i dialogs\n", d_table->size);
for (i = 0; i < d_table->size; i++) {
dlg_lock(d_table, &(d_table->entries[i]));
for (dlg = d_table->entries[i].first; dlg; dlg = dlg->next) {
if (internal_mi_print_dlg(rpl, dlg, with_context) != 0)
goto error;
}
dlg_unlock(d_table, &(d_table->entries[i]));
}
return 0;
error:
dlg_unlock(d_table, &(d_table->entries[i]));
LM_ERR("failed to print dialog\n");
return -1;
}
static inline struct mi_root * process_mi_params(struct mi_root *cmd_tree, struct dlg_cell **dlg_p) {
struct mi_node* node;
struct dlg_entry *d_entry;
struct dlg_cell *dlg;
str *callid;
str *from_tag;
unsigned int h_entry;
node = cmd_tree->node.kids;
if (node == NULL) {
/* no parameters at all */
*dlg_p = NULL;
return NULL;
}
/* we have params -> get callid and fromtag */
callid = &node->value;
LM_DBG("callid='%.*s'\n", callid->len, callid->s);
node = node->next;
if (!node || !node->value.s || !node->value.len) {
from_tag = NULL;
} else {
from_tag = &node->value;
LM_DBG("from_tag='%.*s'\n", from_tag->len, from_tag->s);
if (node->next != NULL)
return init_mi_tree(400, MI_SSTR(MI_MISSING_PARM));
}
h_entry = core_hash(callid, 0, d_table->size);
d_entry = &(d_table->entries[h_entry]);
dlg_lock(d_table, d_entry);
for (dlg = d_entry->first; dlg; dlg = dlg->next) {
if (match_downstream_dialog(dlg, callid, from_tag) == 1) {
if (dlg->state == DLG_STATE_DELETED) {
*dlg_p = NULL;
break;
} else {
*dlg_p = dlg;
dlg_unlock(d_table, d_entry);
return 0;
}
}
}
dlg_unlock(d_table, d_entry);
return init_mi_tree(404, MI_SSTR("Nu such dialog"));
}
/*!
* \brief Output all dialogs via the MI interface
* \param cmd_tree MI command tree
* \param param unused
* \return mi node with the dialog information, or NULL on failure
*/
struct mi_root * mi_print_dlgs(struct mi_root *cmd_tree, void *param) {
struct mi_root* rpl_tree = NULL;
struct mi_node* rpl = NULL;
struct dlg_cell* dlg = NULL;
rpl_tree = process_mi_params(cmd_tree, &dlg);
if (rpl_tree)
//param error
return rpl_tree;
rpl_tree = init_mi_tree(200, MI_SSTR(MI_OK));
if (rpl_tree == 0)
return 0;
rpl = &rpl_tree->node;
if (dlg == NULL) {
if (internal_mi_print_dlgs(rpl, 0) != 0)
goto error;
} else {
if (internal_mi_print_dlg(rpl, dlg, 0) != 0)
goto error;
}
return rpl_tree;
error:
free_mi_tree(rpl_tree);
return NULL;
}
/*!
* \brief Print a dialog context via the MI interface
* \param cmd_tree MI command tree
* \param param unused
* \return mi node with the dialog information, or NULL on failure
*/
struct mi_root * mi_print_dlgs_ctx(struct mi_root *cmd_tree, void *param) {
struct mi_root* rpl_tree = NULL;
struct mi_node* rpl = NULL;
struct dlg_cell* dlg = NULL;
rpl_tree = process_mi_params(cmd_tree, &dlg);
if (rpl_tree)
/* param error */
return rpl_tree;
rpl_tree = init_mi_tree(200, MI_SSTR(MI_OK));
if (rpl_tree == 0)
return 0;
rpl = &rpl_tree->node;
if (dlg == NULL) {
if (internal_mi_print_dlgs(rpl, 1) != 0)
goto error;
} else {
if (internal_mi_print_dlg(rpl, dlg, 1) != 0)
goto error;
}
return rpl_tree;
error:
free_mi_tree(rpl_tree);
return NULL;
}
time_t api_get_dlg_expires(str *callid, str *ftag, str *ttag) {
struct dlg_cell *dlg;
time_t expires = 0;
time_t start;
if (!callid || !ftag || !ttag) {
LM_ERR("Missing callid, from tag or to tag\n");
return 0;
}
unsigned int direction = DLG_DIR_NONE;
dlg = get_dlg(callid, ftag, ttag, &direction);
if (!dlg) return 0;
if (dlg->state != DLG_STATE_CONFIRMED || !dlg->start_ts) {
/* Dialog not started yet so lets assume start time is now.*/
start = time(0);
} else {
start = dlg->start_ts;
}
expires = start + dlg->lifetime;
unref_dlg(dlg, 1);
return expires;
}
char* state_to_char(unsigned int state) {
switch (state) {
case DLG_STATE_UNCONFIRMED:
return "Unconfirmed";
case DLG_STATE_EARLY:
return "Early";
case DLG_STATE_CONFIRMED:
return "Confirmed";
case DLG_STATE_DELETED:
return "Deleted";
default:
return "Unknown";
}
}
|