Loading...
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 | /*
*
* oFono - Open Source Telephony
*
* Copyright (C) 2008-2011 Intel Corporation. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* This program 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 St, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <string.h>
#include <stdlib.h>
#include <glib.h>
#include <ell/ell.h>
#include <ofono/types.h>
#include "simutil.h"
#include "util.h"
#include "smsutil.h"
struct sim_eons {
struct sim_eons_operator_info *pnn_list;
GSList *opl_list;
gboolean pnn_valid;
int pnn_max;
};
struct spdi_operator {
char mcc[OFONO_MAX_MCC_LENGTH + 1];
char mnc[OFONO_MAX_MNC_LENGTH + 1];
};
struct opl_operator {
char mcc[OFONO_MAX_MCC_LENGTH + 1];
char mnc[OFONO_MAX_MNC_LENGTH + 1];
guint16 lac_tac_low;
guint16 lac_tac_high;
guint8 id;
};
#define MF 1
#define DF 2
#define EF 4
#define BINARY 0
#define RECORD 1
#define CYCLIC 3
#define ALW 0
#define PIN 1
#define PIN2 2
#define ADM 4
#define NEV 15
#define ROOTMF 0x3F00
static struct sim_ef_info ef_db[] = {
{ 0x2F05, ROOTMF, ROOTMF, EF, BINARY, 0, ALW, PIN },
{ 0x2FE2, ROOTMF, ROOTMF, EF, BINARY, 10, ALW, NEV },
{ 0x4F20, 0x5F50, 0x5F50, EF, BINARY, 0, PIN, ADM },
{ 0x5F50, 0x7F10, 0x7F10, DF, 0, 0, PIN, ADM },
{ 0x6F05, 0x7F20, 0x7FFF, EF, BINARY, 0, ALW, PIN },
{ 0x6F07, 0x7F20, 0x7FFF, EF, BINARY, 9, PIN, ADM },
{ 0x6F11, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, PIN },
{ 0x6F13, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, PIN },
{ 0x6F14, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, ADM },
{ 0x6F15, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, PIN },
{ 0x6F16, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, ADM },
{ 0x6F17, 0x7F20, 0x7FFF, EF, RECORD, 0, PIN, PIN },
{ 0x6F18, 0x7F20, 0x7FFF, EF, BINARY, 10, PIN, ADM },
{ 0x6F19, 0x7F20, 0x7FFF, EF, RECORD, 0, PIN, PIN },
{ 0x6F38, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, ADM },
{ 0x6F3A, 0x7F10, 0x7F10, EF, RECORD, 0, PIN, PIN },
{ 0x6F3B, 0x7F10, 0x7FFF, EF, RECORD, 0, PIN, PIN2 },
{ 0x6F40, 0x7F10, 0x7FFF, EF, RECORD, 0, PIN, PIN },
{ 0x6F45, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, PIN },
{ 0x6F46, 0x7F20, 0x7FFF, EF, BINARY, 17, ALW, ADM },
{ 0x6F48, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, ADM },
{ 0x6F49, 0x7F10, 0x7FFF, EF, RECORD, 0, PIN, ADM },
{ 0x6F4D, 0x7F20, 0x7FFF, EF, RECORD, 0, PIN, PIN2 },
{ 0x6F50, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, PIN },
{ 0x6F56, 0x0000, 0x7FFF, EF, BINARY, 0, PIN, PIN2 },
{ 0x6F57, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, PIN2 },
{ 0x6FAD, 0x7F20, 0x7FFF, EF, BINARY, 0, ALW, ADM },
{ 0x6FAE, 0x7F20, 0x0000, EF, BINARY, 1, ALW, ADM },
{ 0x6FB7, 0x7F20, 0x7FFF, EF, BINARY, 0, ALW, ADM },
{ 0x6FC5, 0x7F20, 0x7FFF, EF, RECORD, 0, ALW, ADM },
{ 0x6FC6, 0x7F20, 0x7FFF, EF, RECORD, 0, ALW, ADM },
{ 0x6FC7, 0x7F20, 0x7FFF, EF, RECORD, 0, PIN, PIN },
{ 0x6FC9, 0x7F20, 0x7FFF, EF, RECORD, 0, PIN, PIN },
{ 0x6FCA, 0x7F20, 0x7FFF, EF, RECORD, 0, PIN, PIN },
{ 0x6FCB, 0x7F20, 0x7FFF, EF, RECORD, 16, PIN, PIN },
{ 0x6FCD, 0x7F20, 0x7FFF, EF, BINARY, 0, PIN, ADM },
{ 0x6FDE, 0x7F20, 0x7FFF, EF, BINARY, 0, ALW, ADM },
{ 0x7F10, ROOTMF, ROOTMF, DF, 0, 0, 0, 0 },
{ 0x7F20, ROOTMF, ROOTMF, DF, 0, 0, 0, 0 },
{ 0x7FFF, 0x0000, ROOTMF, DF, 0, 0, 0, 0 }
};
void simple_tlv_iter_init(struct simple_tlv_iter *iter,
const unsigned char *pdu, unsigned int len)
{
iter->pdu = pdu;
iter->max = len;
iter->pos = 0;
iter->tag = 0;
iter->len = 0;
iter->data = NULL;
}
gboolean simple_tlv_iter_next(struct simple_tlv_iter *iter)
{
const unsigned char *pdu = iter->pdu + iter->pos;
const unsigned char *end = iter->pdu + iter->max;
unsigned char tag;
unsigned short len;
if (pdu == end)
return FALSE;
tag = *pdu;
pdu++;
/*
* ISO 7816-4, Section 5.2.1:
*
* The tag field consists of a single byte encoding a tag number from
* 1 to 254. The values 00 and FF are invalid for tag fields.
*
* The length field consists of one or three consecutive bytes.
* - If the first byte is not set to FF, then the length field
* consists of a single byte encoding a number from zero to
* 254 and denoted N.
* - If the first byte is set to FF, then the length field
* continues on the subsequent two bytes with any value
* encoding a number from zero to 65535 and denoted N
*
* If N is zero, there is no value field, i.e. data object is empty.
*/
if (pdu == end)
return FALSE;
len = *pdu++;
if (len == 0xFF) {
if ((pdu + 2) > end)
return FALSE;
len = (pdu[0] << 8) | pdu[1];
pdu += 2;
}
if (pdu + len > end)
return FALSE;
iter->tag = tag;
iter->len = len;
iter->data = pdu;
iter->pos = pdu + len - iter->pdu;
return TRUE;
}
unsigned char simple_tlv_iter_get_tag(struct simple_tlv_iter *iter)
{
return iter->tag;
}
unsigned short simple_tlv_iter_get_length(struct simple_tlv_iter *iter)
{
return iter->len;
}
const unsigned char *simple_tlv_iter_get_data(struct simple_tlv_iter *iter)
{
return iter->data;
}
void comprehension_tlv_iter_init(struct comprehension_tlv_iter *iter,
const unsigned char *pdu,
unsigned int len)
{
iter->pdu = pdu;
iter->max = len;
iter->pos = 0;
iter->tag = 0;
iter->cr = FALSE;
iter->data = 0;
}
/* Comprehension TLVs defined in Section 7 of ETSI TS 101.220 */
gboolean comprehension_tlv_iter_next(struct comprehension_tlv_iter *iter)
{
const unsigned char *pdu = iter->pdu + iter->pos;
const unsigned char *end = iter->pdu + iter->max;
unsigned short tag;
unsigned short len;
gboolean cr;
if (pdu == end)
return FALSE;
if (*pdu == 0x00 || *pdu == 0xFF || *pdu == 0x80)
return FALSE;
cr = bit_field(*pdu, 7, 1);
tag = bit_field(*pdu, 0, 7);
pdu++;
/*
* ETSI TS 101.220, Section 7.1.1.2
*
* If byte 1 of the tag is equal to 0x7F, then the tag is encoded
* on the following two bytes, with bit 8 of the 2nd byte of the tag
* being the CR flag.
*/
if (tag == 0x7F) {
if ((pdu + 2) > end)
return FALSE;
cr = bit_field(pdu[0], 7, 1);
tag = ((pdu[0] & 0x7f) << 8) | pdu[1];
if (tag < 0x0001 || tag > 0x7fff)
return FALSE;
pdu += 2;
}
if (pdu == end)
return FALSE;
len = *pdu++;
if (len >= 0x80) {
unsigned int extended_bytes = len - 0x80;
unsigned int i;
if (extended_bytes == 0 || extended_bytes > 3)
return FALSE;
if ((pdu + extended_bytes) > end)
return FALSE;
if (pdu[0] == 0)
return FALSE;
for (len = 0, i = 0; i < extended_bytes; i++)
len = (len << 8) | *pdu++;
}
if (pdu + len > end)
return FALSE;
iter->tag = tag;
iter->cr = cr;
iter->len = len;
iter->data = pdu;
iter->pos = pdu + len - iter->pdu;
return TRUE;
}
unsigned short comprehension_tlv_iter_get_tag(
struct comprehension_tlv_iter *iter)
{
return iter->tag;
}
gboolean comprehension_tlv_get_cr(struct comprehension_tlv_iter *iter)
{
return iter->cr;
}
unsigned int comprehension_tlv_iter_get_length(
struct comprehension_tlv_iter *iter)
{
return iter->len;
}
const unsigned char *comprehension_tlv_iter_get_data(
struct comprehension_tlv_iter *iter)
{
return iter->data;
}
void comprehension_tlv_iter_copy(struct comprehension_tlv_iter *from,
struct comprehension_tlv_iter *to)
{
to->max = from->max;
to->pos = from->pos;
to->pdu = from->pdu;
to->tag = from->tag;
to->cr = from->cr;
to->len = from->len;
to->data = from->data;
}
void ber_tlv_iter_init(struct ber_tlv_iter *iter, const unsigned char *pdu,
unsigned int len)
{
iter->pdu = pdu;
iter->max = len;
iter->pos = 0;
}
unsigned int ber_tlv_iter_get_tag(struct ber_tlv_iter *iter)
{
return iter->tag;
}
enum ber_tlv_data_type ber_tlv_iter_get_class(struct ber_tlv_iter *iter)
{
return iter->class;
}
enum ber_tlv_data_encoding_type
ber_tlv_iter_get_encoding(struct ber_tlv_iter *iter)
{
return iter->encoding;
}
unsigned char ber_tlv_iter_get_short_tag(struct ber_tlv_iter *iter)
{
if (iter->tag > 30)
return 0;
return iter->tag | (iter->encoding << 5) | (iter->class << 6);
}
unsigned int ber_tlv_iter_get_length(struct ber_tlv_iter *iter)
{
return iter->len;
}
const unsigned char *ber_tlv_iter_get_data(struct ber_tlv_iter *iter)
{
return iter->data;
}
/* BER TLV structure is defined in ISO/IEC 7816-4 */
gboolean ber_tlv_iter_next(struct ber_tlv_iter *iter)
{
const unsigned char *pdu = iter->pdu + iter->pos;
const unsigned char *end = iter->pdu + iter->max;
unsigned int tag;
unsigned int len;
enum ber_tlv_data_type class;
enum ber_tlv_data_encoding_type encoding;
while ((pdu < end) && (*pdu == 0x00 || *pdu == 0xff))
pdu++;
if (pdu == end)
return FALSE;
class = bit_field(*pdu, 6, 2);
encoding = bit_field(*pdu, 5, 1);
tag = bit_field(*pdu, 0, 5);
pdu++;
/*
* ISO 7816-4, Section 5.2.2.1:
* "If bits 5 to 1 of the first byte of the tag are not
* all set to 1, then they encode a tag number from zero
* to thirty and the tag field consists of a single byte.
*
* Otherwise, the tag field continues on one or more
* subsequent bytes
* - Bit 8 of each subsequent byte shall be set to 1,
* unless it is the last subsequent byte
* - Bits 7 to 1 of the first subsequent byte shall not be
* all set to 0
* - Bits 7 to 1 of the first subsequent byte, followed by
* bits 7 to 1 of each further subsequent byte, up to
* and including bits 7 to 1 of the last subsequent
* byte encode a tag number.
*/
if (tag == 0x1f) {
if (pdu == end)
return FALSE;
/* First byte of the extended tag cannot contain 0 */
if ((*pdu & 0x7f) == 0)
return FALSE;
tag = 0;
while ((pdu < end) && (*pdu & 0x80)) {
tag = (tag << 7) | (*pdu & 0x7f);
pdu++;
}
if (pdu == end)
return FALSE;
tag = (tag << 7) | *pdu;
pdu++;
}
if (pdu == end)
return FALSE;
len = *pdu++;
if (len >= 0x80) {
unsigned int extended_bytes = len - 0x80;
unsigned int i;
if (extended_bytes == 0 || extended_bytes > 4)
return FALSE;
if ((pdu + extended_bytes) > end)
return FALSE;
if (pdu[0] == 0)
return FALSE;
for (len = 0, i = 0; i < extended_bytes; i++)
len = (len << 8) | *pdu++;
}
if (pdu + len > end)
return FALSE;
iter->tag = tag;
iter->class = class;
iter->encoding = encoding;
iter->len = len;
iter->data = pdu;
iter->pos = pdu + len - iter->pdu;
return TRUE;
}
void ber_tlv_iter_recurse(struct ber_tlv_iter *iter,
struct ber_tlv_iter *recurse)
{
recurse->pdu = iter->data;
recurse->max = iter->len;
recurse->pos = 0;
}
void ber_tlv_iter_recurse_simple(struct ber_tlv_iter *iter,
struct simple_tlv_iter *container)
{
simple_tlv_iter_init(container, iter->data, iter->len);
}
void ber_tlv_iter_recurse_comprehension(struct ber_tlv_iter *iter,
struct comprehension_tlv_iter *recurse)
{
comprehension_tlv_iter_init(recurse, iter->data, iter->len);
}
static const guint8 *ber_tlv_find_by_tag(const guint8 *pdu, guint8 in_tag,
int in_len, int *out_len)
{
struct ber_tlv_iter iter;
ber_tlv_iter_init(&iter, pdu, in_len);
while (ber_tlv_iter_next(&iter)) {
if (ber_tlv_iter_get_short_tag(&iter) != in_tag)
continue;
if (out_len)
*out_len = ber_tlv_iter_get_length(&iter);
return ber_tlv_iter_get_data(&iter);
}
return NULL;
}
#define MAX_BER_TLV_HEADER 8
gboolean ber_tlv_builder_init(struct ber_tlv_builder *builder,
unsigned char *pdu, unsigned int size)
{
if (size < MAX_BER_TLV_HEADER)
return FALSE;
builder->pdu = pdu;
builder->pos = 0;
builder->max = size;
builder->parent = NULL;
builder->tag = 0xff;
builder->len = 0;
return TRUE;
}
#define BTLV_LEN_FIELD_SIZE_NEEDED(a) \
((a) <= 0x7f ? 1 : \
((a) <= 0xff ? 2 : \
((a) <= 0xffff ? 3 : \
((a) <= 0xffffff ? 4 : 5))))
#define BTLV_TAG_FIELD_SIZE_NEEDED(a) \
((a) <= 0x1e ? 1 : \
((a) <= 0x7f ? 2 : 3))
static void ber_tlv_builder_write_header(struct ber_tlv_builder *builder)
{
int tag_size = BTLV_TAG_FIELD_SIZE_NEEDED(builder->tag);
int len_size = BTLV_LEN_FIELD_SIZE_NEEDED(builder->len);
int offset = MAX_BER_TLV_HEADER - tag_size - len_size;
unsigned char *pdu = builder->pdu + builder->pos;
/* Pad with stuff bytes */
memset(pdu, 0xff, offset);
/* Write the tag */
pdu[offset++] = (builder->class << 6) |
(builder->encoding << 5) |
(tag_size == 1 ? builder->tag : 0x1f);
if (tag_size == 3)
pdu[offset++] = 0x80 | (builder->tag >> 7);
if (tag_size > 2)
pdu[offset++] = builder->tag & 0x7f;
/* Write the length */
if (len_size > 1) {
int i;
pdu[offset++] = 0x80 + len_size - 1;
for (i = len_size - 2; i >= 0; i--)
pdu[offset++] = (builder->len >> (i * 8)) & 0xff;
} else
pdu[offset++] = builder->len;
}
gboolean ber_tlv_builder_next(struct ber_tlv_builder *builder,
enum ber_tlv_data_type class,
enum ber_tlv_data_encoding_type encoding,
unsigned int new_tag)
{
if (builder->tag != 0xff) {
ber_tlv_builder_write_header(builder);
builder->pos += MAX_BER_TLV_HEADER + builder->len;
}
if (ber_tlv_builder_set_length(builder, 0) == FALSE)
return FALSE;
builder->class = class;
builder->encoding = encoding;
builder->tag = new_tag;
return TRUE;
}
/*
* Resize the TLV because the content of Value field needs more space.
* If this TLV is part of another TLV, resize that one too.
*/
gboolean ber_tlv_builder_set_length(struct ber_tlv_builder *builder,
unsigned int new_len)
{
unsigned int new_pos = builder->pos + MAX_BER_TLV_HEADER + new_len;
if (new_pos > builder->max)
return FALSE;
if (builder->parent)
ber_tlv_builder_set_length(builder->parent, new_pos);
builder->len = new_len;
return TRUE;
}
unsigned char *ber_tlv_builder_get_data(struct ber_tlv_builder *builder)
{
return builder->pdu + builder->pos + MAX_BER_TLV_HEADER;
}
gboolean ber_tlv_builder_recurse(struct ber_tlv_builder *builder,
struct ber_tlv_builder *recurse)
{
unsigned char *end = builder->pdu + builder->max;
unsigned char *data = ber_tlv_builder_get_data(builder);
if (ber_tlv_builder_init(recurse, data, end - data) == FALSE)
return FALSE;
recurse->parent = builder;
return TRUE;
}
gboolean ber_tlv_builder_recurse_comprehension(struct ber_tlv_builder *builder,
struct comprehension_tlv_builder *recurse)
{
unsigned char *end = builder->pdu + builder->max;
unsigned char *data = ber_tlv_builder_get_data(builder);
if (comprehension_tlv_builder_init(recurse, data, end - data) == FALSE)
return FALSE;
recurse->parent = builder;
return TRUE;
}
void ber_tlv_builder_optimize(struct ber_tlv_builder *builder,
unsigned char **out_pdu, unsigned int *out_len)
{
unsigned int len;
unsigned char *pdu;
ber_tlv_builder_write_header(builder);
len = builder->pos + MAX_BER_TLV_HEADER + builder->len;
for (pdu = builder->pdu; *pdu == 0xff; pdu++)
len--;
if (out_pdu)
*out_pdu = pdu;
if (out_len)
*out_len = len;
}
gboolean comprehension_tlv_builder_init(
struct comprehension_tlv_builder *builder,
unsigned char *pdu, unsigned int size)
{
if (size < 2)
return FALSE;
builder->pdu = pdu;
builder->pos = 0;
builder->max = size;
builder->parent = NULL;
builder->len = 0;
builder->pdu[0] = 0;
return TRUE;
}
#define CTLV_TAG_FIELD_SIZE(a) \
bit_field((a), 0, 7) == 0x7f ? 3 : 1 \
#define CTLV_LEN_FIELD_SIZE(a) \
(a) >= 0x80 ? (a) - 0x7f : 1 \
gboolean comprehension_tlv_builder_next(
struct comprehension_tlv_builder *builder,
gboolean cr, unsigned short tag)
{
unsigned char *tlv = builder->pdu + builder->pos;
unsigned int prev_size = 0;
unsigned int new_size;
/* Tag is invalid when we start, means we've just been inited */
if (tlv[0] != 0) {
unsigned int tag_size = CTLV_TAG_FIELD_SIZE(tlv[0]);
prev_size = builder->len + tag_size;
prev_size += CTLV_LEN_FIELD_SIZE(tlv[tag_size]);
}
new_size = (tag < 0x7f ? 1 : 3) + 1;
if (builder->pos + prev_size + new_size > builder->max)
return FALSE;
builder->pos += prev_size;
if (tag >= 0x7f) {
builder->pdu[builder->pos + 0] = 0x7f;
builder->pdu[builder->pos + 1] = (cr ? 0x80 : 0) | (tag >> 8);
builder->pdu[builder->pos + 2] = tag & 0xff;
} else
builder->pdu[builder->pos + 0] = (cr ? 0x80 : 0x00) | tag;
builder->len = 0;
builder->pdu[builder->pos + new_size - 1] = 0; /* Length */
return TRUE;
}
/*
* Resize the TLV because the content of Value field needs more space.
* If this TLV is part of another TLV, resize that one too.
*/
gboolean comprehension_tlv_builder_set_length(
struct comprehension_tlv_builder *builder,
unsigned int new_len)
{
unsigned char *tlv = builder->pdu + builder->pos;
unsigned int tag_size = CTLV_TAG_FIELD_SIZE(tlv[0]);
unsigned int len_size, new_len_size;
unsigned int new_ctlv_len;
unsigned int len;
len_size = CTLV_LEN_FIELD_SIZE(tlv[tag_size]);
new_len_size = BTLV_LEN_FIELD_SIZE_NEEDED(new_len);
new_ctlv_len = tag_size + new_len_size + new_len;
/* Check there is enough space */
if (builder->pos + new_ctlv_len > builder->max)
return FALSE;
if (builder->parent)
ber_tlv_builder_set_length(builder->parent,
builder->pos + new_ctlv_len);
len = MIN(builder->len, new_len);
if (len > 0 && new_len_size != len_size)
memmove(tlv + tag_size + new_len_size,
tlv + tag_size + len_size, len);
builder->len = new_len;
/* Write new length */
if (new_len_size > 1) {
int i;
unsigned int offset = tag_size;
tlv[offset++] = 0x80 + new_len_size - 1;
for (i = new_len_size - 2; i >= 0; i--)
tlv[offset++] = (builder->len >> (i * 8)) & 0xff;
} else
tlv[tag_size] = builder->len;
return TRUE;
}
unsigned char *comprehension_tlv_builder_get_data(
struct comprehension_tlv_builder *builder)
{
unsigned char *tlv = builder->pdu + builder->pos;
unsigned int tag_size = CTLV_TAG_FIELD_SIZE(*tlv);
unsigned int len_size = CTLV_LEN_FIELD_SIZE(tlv[tag_size]);
return tlv + tag_size + len_size;
}
static char *sim_network_name_parse(const unsigned char *buffer, int length,
gboolean *add_ci)
{
char *ret = NULL;
unsigned char dcs;
int i;
gboolean ci = FALSE;
unsigned char *unpacked_buf;
long num_char, written;
int spare_bits;
if (length < 2)
return NULL;
dcs = *buffer++;
length--;
/*
* "The MS should add the letters for the Country's Initials and a
* separator (e.g. a space)"
*/
if (is_bit_set(dcs, 4))
ci = TRUE;
switch (dcs & (7 << 4)) {
case 0x00:
spare_bits = dcs & 0x07;
num_char = (length * 8 - spare_bits) / 7;
unpacked_buf = unpack_7bit(buffer, length, 0, false,
num_char, &written, 0);
if (unpacked_buf == NULL)
break;
ret = convert_gsm_to_utf8(unpacked_buf, written, NULL, NULL, 0);
l_free(unpacked_buf);
break;
case 0x10:
if ((length % 2) == 1) {
if (buffer[length - 1] != 0xff)
return NULL;
length = length - 1;
}
for (i = 0; i < length; i += 2)
if (buffer[i] == 0xff && buffer[i + 1] == 0xff)
break;
ret = l_utf8_from_ucs2be(buffer, length);
break;
}
if (add_ci)
*add_ci = ci;
return ret;
}
void sim_parse_mcc_mnc(const guint8 *bcd, char *mcc, char *mnc)
{
static const char digit_lut[] = "0123456789*#abd\0";
guint8 digit;
digit = (bcd[0] >> 0) & 0xf;
*mcc++ = digit_lut[digit];
digit = (bcd[0] >> 4) & 0xf;
*mcc++ = digit_lut[digit];
digit = (bcd[1] >> 0) & 0xf;
*mcc++ = digit_lut[digit];
digit = (bcd[2] >> 0) & 0xf;
*mnc++ = digit_lut[digit];
digit = (bcd[2] >> 4) & 0xf;
*mnc++ = digit_lut[digit];
digit = (bcd[1] >> 4) & 0xf;
*mnc++ = digit_lut[digit];
}
static inline int to_semi_oct(char in)
{
int digit;
switch (in) {
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
digit = in - '0';
break;
case '*':
digit = 10;
break;
case '#':
digit = 11;
break;
case 'C':
case 'c':
digit = 12;
break;
case '?':
digit = 13;
break;
case 'E':
case 'e':
digit = 14;
break;
default:
digit = -1;
break;
}
return digit;
}
void sim_encode_mcc_mnc(guint8 *out, const char *mcc, const char *mnc)
{
out[0] = to_semi_oct(mcc[0]);
out[0] |= to_semi_oct(mcc[1]) << 4;
out[1] = mcc[2] ? to_semi_oct(mcc[2]) : 0xf;
out[1] |= (mnc[2] ? to_semi_oct(mnc[2]) : 0xf) << 4;
out[2] = to_semi_oct(mnc[0]);
out[2] |= to_semi_oct(mnc[1]) << 4;
}
static gint spdi_operator_compare(gconstpointer a, gconstpointer b)
{
const struct spdi_operator *opa = a;
const struct spdi_operator *opb = b;
gint r = strcmp(opa->mcc, opb->mcc);
if (r)
return r;
return strcmp(opa->mnc, opb->mnc);
}
struct sim_spdi {
GSList *operators;
};
struct sim_spdi *sim_spdi_new(const guint8 *tlv, int length)
{
const guint8 *plmn_list_tlv;
const guint8 *plmn_list;
struct sim_spdi *spdi;
struct spdi_operator *oper;
int tlv_length;
int list_length;
if (length < 7)
return NULL;
plmn_list_tlv = ber_tlv_find_by_tag(tlv, 0xA3, length, &tlv_length);
if (plmn_list_tlv == NULL)
return NULL;
plmn_list = ber_tlv_find_by_tag(plmn_list_tlv, 0x80, tlv_length,
&list_length);
if (plmn_list == NULL)
return NULL;
spdi = g_new0(struct sim_spdi, 1);
for (list_length /= 3; list_length--; plmn_list += 3) {
if ((plmn_list[0] & plmn_list[1] & plmn_list[2]) == 0xff)
continue;
oper = g_new0(struct spdi_operator, 1);
sim_parse_mcc_mnc(plmn_list, oper->mcc, oper->mnc);
spdi->operators = g_slist_insert_sorted(spdi->operators, oper,
spdi_operator_compare);
}
return spdi;
}
gboolean sim_spdi_lookup(struct sim_spdi *spdi,
const char *mcc, const char *mnc)
{
struct spdi_operator spdi_op;
if (spdi == NULL)
return FALSE;
g_strlcpy(spdi_op.mcc, mcc, sizeof(spdi_op.mcc));
g_strlcpy(spdi_op.mnc, mnc, sizeof(spdi_op.mnc));
return g_slist_find_custom(spdi->operators, &spdi_op,
spdi_operator_compare) != NULL;
}
void sim_spdi_free(struct sim_spdi *spdi)
{
if (spdi == NULL)
return;
g_slist_free_full(spdi->operators, g_free);
g_free(spdi);
}
static void pnn_operator_free(struct sim_eons_operator_info *oper)
{
if (oper == NULL)
return;
l_free(oper->info);
l_free(oper->shortname);
l_free(oper->longname);
}
struct sim_eons *sim_eons_new(int pnn_records)
{
struct sim_eons *eons = g_new0(struct sim_eons, 1);
eons->pnn_list = g_new0(struct sim_eons_operator_info, pnn_records);
eons->pnn_max = pnn_records;
return eons;
}
gboolean sim_eons_pnn_is_empty(struct sim_eons *eons)
{
return !eons->pnn_valid;
}
void sim_eons_add_pnn_record(struct sim_eons *eons, int record,
const guint8 *tlv, int length)
{
const unsigned char *name;
int namelength;
struct sim_eons_operator_info *oper = &eons->pnn_list[record-1];
name = ber_tlv_find_by_tag(tlv, 0x43, length, &namelength);
if (name == NULL || !namelength)
return;
oper->longname = sim_network_name_parse(name, namelength,
&oper->long_ci);
name = ber_tlv_find_by_tag(tlv, 0x45, length, &namelength);
if (name && namelength)
oper->shortname = sim_network_name_parse(name, namelength,
&oper->short_ci);
name = ber_tlv_find_by_tag(tlv, 0x80, length, &namelength);
if (name && namelength)
oper->info = sim_string_to_utf8(name, namelength);
eons->pnn_valid = TRUE;
}
static struct opl_operator *opl_operator_alloc(const guint8 *record)
{
struct opl_operator *oper = g_new0(struct opl_operator, 1);
sim_parse_mcc_mnc(record, oper->mcc, oper->mnc);
record += 3;
oper->lac_tac_low = (record[0] << 8) | record[1];
record += 2;
oper->lac_tac_high = (record[0] << 8) | record[1];
record += 2;
oper->id = record[0];
return oper;
}
void sim_eons_add_opl_record(struct sim_eons *eons,
const guint8 *contents, int length)
{
struct opl_operator *oper;
oper = opl_operator_alloc(contents);
if (oper->id > eons->pnn_max) {
g_free(oper);
return;
}
eons->opl_list = g_slist_prepend(eons->opl_list, oper);
}
void sim_eons_optimize(struct sim_eons *eons)
{
eons->opl_list = g_slist_reverse(eons->opl_list);
}
void sim_eons_free(struct sim_eons *eons)
{
int i;
if (eons == NULL)
return;
for (i = 0; i < eons->pnn_max; i++)
pnn_operator_free(eons->pnn_list + i);
g_free(eons->pnn_list);
g_slist_free_full(eons->opl_list, g_free);
g_free(eons);
}
static const struct sim_eons_operator_info *
sim_eons_lookup_common(struct sim_eons *eons,
const char *mcc, const char *mnc,
gboolean have_lac, guint16 lac)
{
GSList *l;
const struct opl_operator *opl;
int i;
for (l = eons->opl_list; l; l = l->next) {
opl = l->data;
for (i = 0; i < OFONO_MAX_MCC_LENGTH; i++)
if (mcc[i] != opl->mcc[i] &&
!(opl->mcc[i] == 'b' && mcc[i]))
break;
if (i < OFONO_MAX_MCC_LENGTH)
continue;
for (i = 0; i < OFONO_MAX_MNC_LENGTH; i++)
if (mnc[i] != opl->mnc[i] &&
!(opl->mnc[i] == 'b' && mnc[i]))
break;
if (i < OFONO_MAX_MNC_LENGTH)
continue;
if (opl->lac_tac_low == 0 && opl->lac_tac_high == 0xfffe)
break;
if (have_lac == FALSE)
continue;
if ((lac >= opl->lac_tac_low) && (lac <= opl->lac_tac_high))
break;
}
if (l == NULL)
return NULL;
opl = l->data;
/* 0 is not a valid record id */
if (opl->id == 0)
return NULL;
return &eons->pnn_list[opl->id - 1];
}
const struct sim_eons_operator_info *sim_eons_lookup(struct sim_eons *eons,
const char *mcc,
const char *mnc)
{
return sim_eons_lookup_common(eons, mcc, mnc, FALSE, 0);
}
const struct sim_eons_operator_info *sim_eons_lookup_with_lac(
struct sim_eons *eons,
const char *mcc,
const char *mnc,
guint16 lac)
{
return sim_eons_lookup_common(eons, mcc, mnc, TRUE, lac);
}
/*
* Extract extended BCD format defined in 3GPP 11.11, 31.102. The format
* is different from what is defined in 3GPP 24.008 and 23.040 (sms).
*
* Here the digits with values 'C', 'D' and 'E' are treated differently,
* for more details see 31.102 Table 4.4
*
* 'C' - DTMF Control Digit Separator, represented as 'c' by this function
* 'D' - Wild Value, represented as a '?' by this function
* 'E' - RFU, used to be used as a Shift Operator in 11.11
* 'F' - Endmark
*
* Note that a second or subsequent 'C' BCD value will be interpreted as a
* 3 second pause.
*/
void sim_extract_bcd_number(const unsigned char *buf, int len, char *out)
{
static const char digit_lut[] = "0123456789*#c?e\0";
unsigned char oct;
int i;
for (i = 0; i < len; i++) {
oct = buf[i];
out[i*2] = digit_lut[oct & 0x0f];
out[i*2+1] = digit_lut[(oct & 0xf0) >> 4];
}
out[i*2] = '\0';
}
void sim_encode_bcd_number(const char *number, unsigned char *out)
{
while (number[0] != '\0' && number[1] != '\0') {
*out = to_semi_oct(*number++);
*out++ |= to_semi_oct(*number++) << 4;
}
if (*number)
*out = to_semi_oct(*number) | 0xf0;
}
gboolean sim_adn_parse(const unsigned char *data, int length,
struct ofono_phone_number *ph, char **identifier)
{
int number_len;
int ton_npi;
const unsigned char *alpha;
int alpha_length;
if (length < 14)
return FALSE;
alpha = data;
alpha_length = length - 14;
data += alpha_length;
number_len = *data++;
ton_npi = *data++;
if (number_len > 11 || ton_npi == 0xff)
return FALSE;
ph->type = ton_npi;
/* BCD coded, however the TON/NPI is given by the first byte */
number_len -= 1;
sim_extract_bcd_number(data, number_len, ph->number);
if (identifier == NULL)
return TRUE;
/* Alpha-Identifier field */
if (alpha_length > 0)
*identifier = sim_string_to_utf8(alpha, alpha_length);
else
*identifier = NULL;
return TRUE;
}
void sim_adn_build(unsigned char *data, int length,
const struct ofono_phone_number *ph,
const char *identifier)
{
int number_len = strlen(ph->number);
unsigned char *alpha = NULL;
int alpha_written = 0;
int alpha_length;
alpha_length = length - 14;
/* Alpha-Identifier field */
if (alpha_length > 0) {
if (identifier)
alpha = utf8_to_sim_string(identifier, alpha_length,
&alpha_written);
if (alpha) {
memcpy(data, alpha, alpha_written);
g_free(alpha);
}
memset(data + alpha_written, 0xff,
alpha_length - alpha_written);
data += alpha_length;
}
number_len = (number_len + 1) / 2;
*data++ = number_len + 1;
*data++ = ph->type;
sim_encode_bcd_number(ph->number, data);
memset(data + number_len, 0xff, 10 - number_len);
data += 10;
/* CCP1 unused */
*data++ = 0xff;
/* Ext1 unused */
*data++ = 0xff;
}
static int find_ef_by_id(const void *key, const void *value)
{
unsigned short id = GPOINTER_TO_UINT(key);
const struct sim_ef_info *info = value;
return id - info->id;
}
struct sim_ef_info *sim_ef_db_lookup(unsigned short id)
{
struct sim_ef_info *result;
unsigned int nelem = sizeof(ef_db) / sizeof(struct sim_ef_info);
result = bsearch(GUINT_TO_POINTER((unsigned int) id), ef_db, nelem,
sizeof(struct sim_ef_info), find_ef_by_id);
return result;
}
unsigned int sim_ef_db_get_path_2g(unsigned short id, unsigned char out_path[])
{
struct sim_ef_info *info;
unsigned int nelem = sizeof(ef_db) / sizeof(struct sim_ef_info);
unsigned char path[6];
int i = 0;
int j;
info = bsearch(GUINT_TO_POINTER((unsigned int) id), ef_db, nelem,
sizeof(struct sim_ef_info), find_ef_by_id);
if (info == NULL)
return 0;
path[i++] = info->parent2g & 0xff;
path[i++] = info->parent2g >> 8;
while (info->parent2g != ROOTMF) {
info = bsearch(GUINT_TO_POINTER((unsigned int) info->parent2g),
ef_db, nelem, sizeof(struct sim_ef_info),
find_ef_by_id);
if (info == NULL)
return 0;
path[i++] = info->parent2g & 0xff;
path[i++] = info->parent2g >> 8;
}
for (j = 0; j < i; j++)
out_path[j] = path[i - j - 1];
return i;
}
unsigned int sim_ef_db_get_path_3g(unsigned short id, unsigned char out_path[])
{
struct sim_ef_info *info;
unsigned int nelem = sizeof(ef_db) / sizeof(struct sim_ef_info);
unsigned char path[6];
int i = 0;
int j;
info = bsearch(GUINT_TO_POINTER((unsigned int) id), ef_db, nelem,
sizeof(struct sim_ef_info), find_ef_by_id);
if (info == NULL)
return 0;
path[i++] = info->parent3g & 0xff;
path[i++] = info->parent3g >> 8;
while (info->parent3g != ROOTMF) {
info = bsearch(GUINT_TO_POINTER((unsigned int) info->parent3g),
ef_db, nelem, sizeof(struct sim_ef_info),
find_ef_by_id);
if (info == NULL)
return 0;
path[i++] = info->parent3g & 0xff;
path[i++] = info->parent3g >> 8;
}
for (j = 0; j < i; j++)
out_path[j] = path[i - j - 1];
return i;
}
gboolean sim_parse_3g_get_response(const unsigned char *data, int len,
int *file_len, int *record_len,
int *structure, unsigned char *access,
unsigned short *efid)
{
const unsigned char *fcp;
int fcp_length;
const unsigned char *tlv;
int tlv_length;
int i;
int flen, rlen, str;
unsigned short id;
unsigned char acc[3];
struct sim_ef_info *info;
fcp = ber_tlv_find_by_tag(data, 0x62, len, &fcp_length);
if (fcp == NULL)
return FALSE;
/*
* Find the file size tag 0x80 according to
* ETSI 102.221 Section 11.1.1.3.2
*/
tlv = ber_tlv_find_by_tag(fcp, 0x80, fcp_length, &tlv_length);
if (tlv == NULL || tlv_length < 2)
return FALSE;
flen = tlv[0];
for (i = 1; i < tlv_length; i++)
flen = (flen << 8) | tlv[i];
tlv = ber_tlv_find_by_tag(fcp, 0x83, fcp_length, &tlv_length);
if (tlv == NULL || tlv_length != 2)
return FALSE;
id = (tlv[0] << 8) | tlv[1];
tlv = ber_tlv_find_by_tag(fcp, 0x82, fcp_length, &tlv_length);
if (tlv == NULL || (tlv_length != 2 && tlv_length != 5))
return FALSE;
if (tlv[1] != 0x21)
return FALSE;
switch (tlv[0] & 0x3) {
case 1: /* Transparent */
str = 0x00;
break;
case 2: /* Linear Fixed */
str = 0x01;
break;
case 6: /* Cyclic */
str = 0x03;
break;
default:
return FALSE;
};
/* For cyclic or linear fixed we need record size & num records */
if (str != 0x00 && tlv_length != 5)
return FALSE;
/*
* strictly speaking the record length is 16 bit, but the valid
* range is 0x01 to 0xFF according to 102.221
*/
if (str != 0x00)
rlen = tlv[3];
else
rlen = 0;
/*
* The 3G response data contains references to EFarr which actually
* contains the security attributes. These are usually not carried
* along with the response data unlike in 2G. Instead of querying
* this, we simply look it up in our database. We fudge it somewhat
* and guess if the file isn't found.
*/
info = sim_ef_db_lookup(id);
if (str == 0x03)
acc[1] = 0x1f;
else
acc[1] = 0xff;
acc[2] = 0x44;
if (info == NULL)
acc[0] = 0x11;
else
acc[0] = (info->perm_read << 4) | info->perm_update;
if (file_len)
*file_len = flen;
if (record_len)
*record_len = rlen;
if (efid)
*efid = id;
if (structure)
*structure = str;
if (access)
memcpy(access, acc, 3);
return TRUE;
}
gboolean sim_parse_2g_get_response(const unsigned char *response, int len,
int *file_len, int *record_len,
int *structure, unsigned char *access,
unsigned char *file_status)
{
if (len < 14 || response[6] != 0x04)
return FALSE;
if ((response[13] == 0x01 || response[13] == 0x03) && len < 15)
return FALSE;
*file_len = (response[2] << 8) | response[3];
*structure = response[13];
access[0] = response[8];
access[1] = response[9];
access[2] = response[10];
*file_status = response[11];
if (response[13] == 0x01 || response[13] == 0x03)
*record_len = response[14];
else
*record_len = 0;
return TRUE;
}
gboolean sim_ust_is_available(unsigned char *efust, unsigned char len,
enum sim_ust_service index)
{
if (index >= len * 8u)
return FALSE;
return (efust[index / 8] >> (index % 8)) & 1;
}
gboolean sim_est_is_active(unsigned char *efest, unsigned char len,
enum sim_est_service index)
{
if (index >= len * 8u)
return FALSE;
return (efest[index / 8] >> (index % 8)) & 1;
}
gboolean sim_sst_is_available(unsigned char *efsst, unsigned char len,
enum sim_sst_service index)
{
if (index >= len * 4u)
return FALSE;
return (efsst[index / 4] >> ((index % 4) * 2)) & 1;
}
gboolean sim_sst_is_active(unsigned char *efsst, unsigned char len,
enum sim_sst_service index)
{
if (index >= len * 4u)
return FALSE;
return (efsst[index / 4] >> (((index % 4) * 2) + 1)) & 1;
}
gboolean sim_cphs_is_active(unsigned char *cphs, enum sim_cphs_service index)
{
if (index >= 2 * 4u)
return FALSE;
return ((cphs[index / 4] >> ((index % 4) * 2)) & 3) == 3;
}
void sim_app_record_free(struct sim_app_record *app)
{
l_free(app->label);
g_free(app);
}
GSList *sim_parse_app_template_entries(const unsigned char *buffer, int len)
{
GSList *ret = NULL;
const unsigned char *dataobj;
int dataobj_len;
/* Find all the application entries */
while ((dataobj = ber_tlv_find_by_tag(buffer, 0x61, len,
&dataobj_len)) != NULL) {
struct sim_app_record app;
const unsigned char *aid, *label;
int label_len;
/* Find the aid (mandatory) */
aid = ber_tlv_find_by_tag(dataobj, 0x4f, dataobj_len,
&app.aid_len);
if (!aid || app.aid_len < 0x01 || app.aid_len > 0x10)
goto error;
memcpy(app.aid, aid, app.aid_len);
app.type = (app.aid[5] << 8) | app.aid[6];
/* Find the label (optional) */
label = ber_tlv_find_by_tag(dataobj, 0x50, dataobj_len,
&label_len);
if (label) {
/*
* Label field uses the extra complicated
* encoding in 102.221 Annex A
*/
app.label = sim_string_to_utf8(label, label_len);
if (app.label == NULL)
goto error;
} else
app.label = NULL;
ret = g_slist_prepend(ret, g_memdup(&app, sizeof(app)));
len -= (dataobj - buffer) + dataobj_len;
buffer = dataobj + dataobj_len;
}
return ret;
error:
while (ret) {
GSList *t = ret;
struct sim_app_record *app = ret->data;
l_free(app->label);
g_free(app);
ret = ret->next;
g_slist_free_1(t);
}
return NULL;
}
static int build_authenticate(unsigned char *buffer, const unsigned char *rand,
const unsigned char *autn)
{
int pos = 0;
buffer[pos++] = 0x00;
buffer[pos++] = 0x88;
buffer[pos++] = 0x00;
buffer[pos++] = autn ? 0x81 : 0x80;
buffer[pos++] = autn ? 0x22 : 0x11;
buffer[pos++] = 0x10;
memcpy(buffer + pos, rand, 16);
pos += 16;
if (autn) {
buffer[pos++] = 0x10;
memcpy(buffer + pos, autn, 16);
pos += 16;
}
buffer[pos++] = 0x00;
return pos;
}
int sim_build_umts_authenticate(unsigned char *buffer, int len,
const unsigned char *rand, const unsigned char *autn)
{
if (len < 40 || !rand || !autn)
return FALSE;
return build_authenticate(buffer, rand, autn);
}
int sim_build_gsm_authenticate(unsigned char *buffer, int len,
const unsigned char *rand)
{
if (len < 22 || !rand)
return FALSE;
return build_authenticate(buffer, rand, NULL);
}
gboolean sim_parse_umts_authenticate(const unsigned char *buffer,
int len, const unsigned char **res, const unsigned char **ck,
const unsigned char **ik, const unsigned char **auts,
const unsigned char **kc)
{
if (len < 16 || !buffer)
return FALSE;
switch (buffer[0]) {
case 0xdb:
/* 'DB' + '08' + RES(16) + '10' + CK(32) + '10' + IK(32) = 43 */
if (len < 43)
goto umts_end;
/* success */
if (buffer[1] != 0x08)
goto umts_end;
*res = buffer + 2;
if (buffer[10] != 0x10)
goto umts_end;
*ck = buffer + 11;
if (buffer[27] != 0x10)
goto umts_end;
*ik = buffer + 28;
if (len >= 53 && kc) {
if (buffer[44] != 0x08)
goto umts_end;
*kc = buffer + 45;
} else {
*kc = NULL;
}
*auts = NULL;
break;
case 0xdc:
/* 'DC' + '0E' + AUTS(14) = 16 */
if (len < 16)
goto umts_end;
/* sync error */
if (buffer[1] != 0x0e)
goto umts_end;
*auts = buffer + 2;
break;
default:
goto umts_end;
}
return TRUE;
umts_end:
return FALSE;
}
gboolean sim_parse_gsm_authenticate(const unsigned char *buffer, int len,
const unsigned char **sres, const unsigned char **kc)
{
if (len < 14 || !buffer)
goto gsm_end;
if (buffer[0] != 0x04)
goto gsm_end;
*sres = buffer + 1;
if (buffer[5] != 0x08)
goto gsm_end;
*kc = buffer + 6;
return TRUE;
gsm_end:
return FALSE;
}
|