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 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742
|
/* File: blxmsp.c
* Author: Gemma Barson, 2010-09-02
* Copyright (c) 2010 - 2012 Genome Research Ltd
* ---------------------------------------------------------------------------
* SeqTools is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 3
* of the License, or (at your option) any later version.
*
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
* or see the on-line version at http://www.gnu.org/copyleft/gpl.txt
* ---------------------------------------------------------------------------
* This file is part of the SeqTools sequence analysis package,
* written by
* Gemma Barson (Sanger Institute, UK) <gb10@sanger.ac.uk>
*
* based on original code by
* Erik Sonnhammer (SBC, Sweden) <Erik.Sonnhammer@sbc.su.se>
*
* and utilizing code taken from the AceDB and ZMap packages, written by
* Richard Durbin (Sanger Institute, UK) <rd@sanger.ac.uk>
* Jean Thierry-Mieg (CRBM du CNRS, France) <mieg@kaa.crbm.cnrs-mop.fr>
* Ed Griffiths (Sanger Institute, UK) <edgrif@sanger.ac.uk>
* Roy Storey (Sanger Institute, UK) <rds@sanger.ac.uk>
* Malcolm Hinsley (Sanger Institute, UK) <mh17@sanger.ac.uk>
*
* Description: See blxmsp.h
*----------------------------------------------------------------------------
*/
#include <seqtoolsUtils/blxmsp.hpp>
#include <seqtoolsUtils/utilities.hpp>
#include <string.h>
#include <algorithm>
using namespace std;
#define POLYA_TAIL_BASES_TO_CHECK -1 /* number of bases to check when looking for a polyA tail (-1
means check all of the unaligned sequence) */
/* Globals */
static int g_MaxMspLen = 0; /* max length in display coords of all MSPs in the detail-view */
static BlxDataType *g_DefaultDataType = NULL; /* data type containing default values; used if sequences do not have a data-type specified */
/* The config value keys for each flag in BlxDataType.
* Use NULL if you don't want the value to be configurable via the config file.
* THIS ARRAY MUST BE UPDATED IF YOU ADD ITEMS TO THE MspFlag ENUM */
static const char* g_MspFlagConfigKeys[] =
{
"dummy", /* dummy value for MSPFLAG_MIN */
"link-features-by-name",
"squash-linked-features",
"squash-identical-features",
"strand-specific",
"show-reverse-strand",
"dummy" /* dummy value for MSPFLAG_NUM_FLAGS */
};
static void addBlxSequences(const char *name, const char *name_orig, const char *idTag,
BlxStrand strand, BlxDataType *dataType, const char *source,
GArray *featureLists[], MSP **lastMsp, MSP **mspList, GList **seqList,
GList *columnList, char *sequence,
MSP *msp, GHashTable *lookupTable, BlxSequence *blxSeq, GError **error);
static void findSequenceExtents(BlxSequence *blxSeq);
static MSP* createMissingMsp(const BlxMspType newType,
const int newStart,
const int newEnd,
const char *qname,
const int newFrame,
BlxStyle *newStyle,
BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error);
/* Get/set the max MSP length */
int getMaxMspLen()
{
return g_MaxMspLen;
}
void setMaxMspLen(const int len)
{
g_MaxMspLen = len;
}
/* Type determination methods */
gboolean typeIsExon(const BlxMspType mspType)
{
return (mspType == BLXMSP_CDS || mspType == BLXMSP_UTR || mspType == BLXMSP_EXON);
}
gboolean typeIsIntron(const BlxMspType mspType)
{
return (mspType == BLXMSP_INTRON);
}
gboolean typeIsTranscript(const BlxMspType mspType)
{
return (mspType == BLXMSP_TRANSCRIPT);
}
gboolean typeIsMatch(const BlxMspType mspType)
{
return (mspType == BLXMSP_MATCH);
}
gboolean typeIsVariation(const BlxMspType mspType)
{
return (mspType == BLXMSP_VARIATION);
}
gboolean typeIsRegion(const BlxMspType mspType)
{
return (mspType == BLXMSP_REGION);
}
gboolean typeIsBasic(const BlxMspType mspType)
{
return (mspType == BLXMSP_BASIC);
}
/* types that are drawn as simple boxes */
gboolean typeIsBoxFeature(const BlxMspType mspType)
{
return (typeIsExon(mspType) || typeIsBasic(mspType));
}
/* This returns true if the given type should be shown in the detail-view */
gboolean typeShownInDetailView(const BlxMspType mspType)
{
return (mspType == BLXMSP_MATCH || mspType == BLXMSP_CDS || mspType == BLXMSP_UTR || mspType == BLXMSP_BASIC);
}
/* This returns true if the given sequence should be added to the detail-view tree (note that
* this is slightly different to what is shown because an exon is added but its child cds/utrs
* are what is shown */
gboolean typeAddedToDetailView(const BlxMspType mspType)
{
return (mspType == BLXMSP_MATCH || mspType == BLXMSP_EXON || mspType == BLXMSP_BASIC);
}
/* This returns true if the given sequence should be shown in the detail-view */
gboolean blxSequenceShownInDetailView(const BlxSequence *blxSeq)
{
return (blxSeq->type == BLXSEQUENCE_MATCH || blxSeq->type == BLXSEQUENCE_TRANSCRIPT);
}
/* This returns true if the given sequence should be shown in the big picture grids */
gboolean blxSequenceShownInGrid(const BlxSequence *blxSeq)
{
return (blxSeq->type == BLXSEQUENCE_MATCH);
}
gboolean mspIsExon(const MSP* const msp)
{
return (msp && typeIsExon(msp->type));
}
/* Determine whether the given msp is in a visible layer */
gboolean mspLayerIsVisible(const MSP* const msp)
{
gboolean result = TRUE;
/* Currently only applicable to exons. Show plain exons OR their CDS/UTR sections,
* but not both. The plan is to add some options to toggle layers on and off, but for
* now just hard code this. */
if (msp->type == BLXMSP_EXON)
{
result = FALSE;
}
return result;
}
/* Determine whether the given MSP is in a coding region or untranslated region. For
* exons, this is determined by the exon type. For introns, we have to look at the
* adjacent exons to determine whether to show them as CDS or UTR - only show it as
* CDS if there is a CDS exon on both sides of the intron. */
static const GdkColor* mspGetIntronColor(const MSP* const msp,
GArray *defaultColors,
const int defaultColorId,
const BlxSequence *blxSeq,
const gboolean selected,
const gboolean usePrintColors,
const gboolean fill,
const int exonFillColorId,
const int exonLineColorId,
const int cdsFillColorId,
const int cdsLineColorId,
const int utrFillColorId,
const int utrLineColorId)
{
const GdkColor *result = NULL;
/* Find the nearest exons before and after this MSP */
const MSP *prevExon = NULL;
const MSP *nextExon = NULL;
GList *mspItem = blxSeq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP *curMsp = (const MSP *)(mspItem->data);
if (mspIsExon(curMsp) && mspLayerIsVisible(curMsp))
{
const int curOffset = mspGetQStart(curMsp) - mspGetQStart(msp);
if (curOffset < 0 && (!prevExon || curOffset > mspGetQStart(prevExon) - mspGetQStart(msp)))
{
/* Current MSP is before our MSP and is the smallest offset so far */
prevExon = curMsp;
}
else if (curOffset > 0 && (!nextExon || curOffset < mspGetQStart(nextExon) - mspGetQStart(msp)))
{
/* Current MSP is after our MSP and is the smallest offset so far */
nextExon = curMsp;
}
}
}
gboolean prevIsUtr = prevExon && prevExon->type == BLXMSP_UTR;
gboolean nextIsUtr = nextExon && nextExon->type == BLXMSP_UTR;
/* if either exon is UTR, the intron is UTR */
if (prevIsUtr)
{
result = mspGetColor(prevExon, defaultColors, defaultColorId, blxSeq, selected, usePrintColors, fill, exonFillColorId, exonLineColorId, cdsFillColorId, cdsLineColorId, utrFillColorId, utrLineColorId);
}
else if (nextIsUtr)
{
result = mspGetColor(nextExon, defaultColors, defaultColorId, blxSeq, selected, usePrintColors, fill, exonFillColorId, exonLineColorId, cdsFillColorId, cdsLineColorId, utrFillColorId, utrLineColorId);
}
else if (prevExon)
{
/* Both exons (or the sole exon, if only one exists) are CDS, so the intron is CDS */
result = mspGetColor(prevExon, defaultColors, defaultColorId, blxSeq, selected, usePrintColors, fill, exonFillColorId, exonLineColorId, cdsFillColorId, cdsLineColorId, utrFillColorId, utrLineColorId);
}
else if (nextExon)
{
/* This is the only exon and it is CDS, so make the intron CDS */
result = mspGetColor(nextExon, defaultColors, defaultColorId, blxSeq, selected, usePrintColors, fill, exonFillColorId, exonLineColorId, cdsFillColorId, cdsLineColorId, utrFillColorId, utrLineColorId);
}
else
{
/* No exon exists adjacent to this intron: default to generic exon color for want of anything better to do. */
if (fill)
result = getGdkColor(exonFillColorId, defaultColors, selected, usePrintColors);
else
result = getGdkColor(exonLineColorId, defaultColors, selected, usePrintColors);
}
return result;
}
gboolean mspIsIntron(const MSP* const msp)
{
return (msp && msp->type == BLXMSP_INTRON);
}
gboolean mspIsBlastMatch(const MSP* const msp)
{
return (msp && (msp->type == BLXMSP_MATCH));
}
gboolean mspIsPolyASite(const MSP* const msp)
{
return (msp && msp->type == BLXMSP_POLYA_SITE);
}
gboolean mspIsVariation(const MSP* const msp)
{
return (msp && typeIsVariation(msp->type));
}
gboolean mspIsZeroLenVariation(const MSP* const msp)
{
gboolean result = mspIsVariation(msp);
if (result)
{
const char *seq = mspGetMatchSeq(msp);
result = (seq && seq[0] == '-');
}
return result;
}
gboolean mspIsBoxFeature(const MSP* const msp)
{
return (msp && typeIsBoxFeature(msp->type));
}
/* Whether the msp has a Target name (i.e. Subject sequence name) */
gboolean mspHasSName(const MSP* const msp)
{
return TRUE;
}
/* Whether the MSP requires subject sequence coords to be set. Only matches
* and box features have coords on the subject sequence. (to do: is this optional for exons?) */
gboolean mspHasSCoords(const MSP* const msp)
{
return mspIsBoxFeature(msp) || mspIsBlastMatch(msp);
}
/* Whether the MSP requires subject sequence strand to be set. Only matches
* require strand on the subject sequence, although exons may have them set. */
gboolean mspHasSStrand(const MSP* const msp)
{
return mspIsBlastMatch(msp);
}
/* Whether the MSP requires the actual sequence data for the subject sequence. Only
* matches require the sequence data. */
gboolean mspHasSSeq(const MSP* const msp)
{
return mspIsBlastMatch(msp);
}
/***********************************************************
* MSP data access functions *
***********************************************************/
/* Get the range of coords of the alignment on the reference sequence */
const IntRange* mspGetRefCoords(const MSP* const msp)
{
return &msp->qRange;
}
/* Get the range of coords of the alignment on the match sequence */
const IntRange* mspGetMatchCoords(const MSP* const msp)
{
return &msp->sRange;
}
/* Return the length of the range of alignment coords on the ref seq */
int mspGetQRangeLen(const MSP* const msp)
{
return msp->qRange.length();
}
/* Return the length of the range of alignment coords on the match seq */
int mspGetSRangeLen(const MSP* const msp)
{
return msp->sRange.length();
}
/* Get the start (5 prime) coord of the alignment on the reference sequence. This is
* the lowest value coord if the strand is forwards or the highest if it is reverse. */
int mspGetQStart(const MSP* const msp)
{
return (mspGetRefStrand(msp) == BLXSTRAND_REVERSE ? msp->qRange.max() : msp->qRange.min());
}
/* Get the end (3 prime) coord of the alignment on the reference sequence. This is
* the highest value coord if the strand is forwards or the lowest if it is reverse. */
int mspGetQEnd(const MSP* const msp)
{
return (mspGetRefStrand(msp) == BLXSTRAND_REVERSE ? msp->qRange.min() : msp->qRange.max());
}
/* Get the start coord of the alignment on the match sequence. This is
* the lowest value coord if the match strand is the same direction as the ref seq strand,
* or the highest value coord otherwise. */
int mspGetSStart(const MSP* const msp)
{
return (mspGetMatchStrand(msp) == mspGetRefStrand(msp) ? msp->sRange.min() : msp->sRange.max());
}
/* Get the end coord of the alignment on the match sequence. This is
* the highest value coord if the match strand is in the same direction as the ref seq strand,
* or the lowest value coord otherwise. */
int mspGetSEnd(const MSP* const msp)
{
return (mspGetMatchStrand(msp) == mspGetRefStrand(msp) ? msp->sRange.max() : msp->sRange.min());
}
/* Return the match sequence name. (Gets it from the BlxSequence if the MSP itself doesn't have
* a name) */
const char *mspGetSName(const MSP* const msp)
{
const char *result = NULL;
if (msp)
{
if (msp->sname && msp->sname[0] != 0)
{
result = msp->sname;
}
else if (msp->sSequence)
{
result = blxSequenceGetName(msp->sSequence);
}
}
return result;
}
/* Return the match sequence name original name. */
const char *mspGetSNameOrig(const MSP* const msp)
{
const char *result = NULL;
if (msp)
{
if (msp->sname_orig && *(msp->sname_orig))
{
result = msp->sname_orig;
}
}
return result;
}
/* Return the length of the match sequence that the given MSP lies on */
int mspGetMatchSeqLen(const MSP* const msp)
{
return blxSequenceGetLength(msp->sSequence);
}
/* Return the reading frame of the ref sequence that the given MSP is a match against */
int mspGetRefFrame(const MSP* const msp, const BlxSeqType seqType)
{
int result = UNSET_INT;
if (seqType == BLXSEQ_DNA)
{
/* Ignore the frame in the msp. For DNA matches we only have one frame on each strand. */
result = 1;
}
else
{
result = msp->qFrame;
}
return result;
}
/* Return the reference sequence name that this msp aligns against */
const char* mspGetRefName(const MSP* const msp)
{
return msp->qname;
}
/* Return the strand of the ref sequence that the given MSP is a match against */
BlxStrand mspGetRefStrand(const MSP* const msp)
{
BlxStrand result = msp->qStrand;
/* If not strand specific, always return the forward strand */
if (!mspGetFlag(msp, MSPFLAG_STRAND_SPECIFIC))
result = BLXSTRAND_FORWARD;
return result;
}
/* Return the strand of the match sequence that the given MSP is a match on */
BlxStrand mspGetMatchStrand(const MSP* const msp)
{
BlxStrand result = (msp->sSequence ? msp->sSequence->strand : BLXSTRAND_NONE);
/* If not strand specific, always return the forward strand */
if (!mspGetFlag(msp, MSPFLAG_STRAND_SPECIFIC))
result = BLXSTRAND_FORWARD;
return result;
}
/* Get the match sequence for the given MSP */
const char* mspGetMatchSeq(const MSP* const msp)
{
return (msp ? blxSequenceGetSequence(msp->sSequence) : NULL);
}
/* Get the source of the MSP */
const char* mspGetSource(const MSP* const msp)
{
return blxSequenceGetSource(msp->sSequence);
}
/* Utility to return a pointer to the style's BlxColor for the given flags */
static BlxColor *styleGetBlxColor(BlxStyle *style,
const bool fill,
const bool utr)
{
BlxColor *blxColor = NULL;
if (fill)
{
if (utr)
blxColor = &style->fillColorUtr;
else
blxColor = &style->fillColor;
}
else
{
if (utr)
blxColor = &style->lineColorUtr;
else
blxColor = &style->lineColor;
}
return blxColor ;
}
/* Return the color matching the given properties from the given style. Returns null if not
* found. defaultColorId here is the color to use if transparent.
* Note that this function may alter BlxColor structs to override transparent colors with
* alternative colors if allowTransparency is false. It will only do this once for each BlxColor
* and will set the overridden flag in the color to indicate that a color has been set. */
static const GdkColor *styleGetColor(BlxStyle *style,
const gboolean selected,
const gboolean usePrintColors,
const gboolean fill,
const gboolean utr,
GArray *defaultColors,
const int defaultColorId,
bool allowTransparency)
{
GdkColor *result = NULL;
BlxColor *blxColor = styleGetBlxColor(style, fill, utr);
/* If it's transparent, use the background color instead, unless
* selected is true in which case we need to use the highlight color */
if (blxColor && blxColor->transparent && !selected)
{
if (allowTransparency)
{
/* We don't really handle transparency. Instead we return the background color,
* so that it appears transparent */
result = getGdkColor(defaultColorId, defaultColors, selected, usePrintColors);
blxColor = NULL ;
}
else if (blxColorOverridden(blxColor, selected, usePrintColors))
{
/* The transparent color has already been overridden so we can use the override color
* which has already been set for it */
}
else
{
/* It's a bit ambiguous what to do here. We've been told not to make it transparent
* (probably because in the detail view empty boxes are not much use). For now,
* if the fill is transparent then replace it with a lighter version of the
* border colour. If the border is transparent then replace with a darker version of the
* fill colour. */
const BlxColor *source = styleGetBlxColor(style, !fill, utr) ;
if (!blxColorOverrideTransparency(blxColor, source, fill, selected, usePrintColors))
{
blxColor = NULL; // indicates not found if it failed
}
}
}
if (blxColor)
{
result = blxColorGetColor(blxColor, selected, usePrintColors) ;
}
return result;
}
/* Get the color for drawing the given MSP (If 'selected' is true, returns
* the color when the MSP is selected.). Returns the fill color if 'fill' is
* true, otherwise the line color. If allowTransparency is true then the returned color is the
* same as the background if transparent; otherwise it is replaced with one of the default colors. */
const GdkColor* mspGetColor(const MSP* const msp,
GArray *defaultColors,
const int defaultColorId,
const BlxSequence *blxSeq,
const gboolean selected,
const gboolean usePrintColors,
const gboolean fill,
const int exonFillColorId,
const int exonLineColorId,
const int cdsFillColorId,
const int cdsLineColorId,
const int utrFillColorId,
const int utrLineColorId,
const bool allowTransparency)
{
const GdkColor *result = NULL;
if (msp->style)
{
result = styleGetColor(msp->style, selected, usePrintColors, fill, msp->type == BLXMSP_UTR, defaultColors, defaultColorId, allowTransparency);
}
if (!result)
{
/* Use the default color for this MSP's type */
switch (msp->type)
{
case BLXMSP_BASIC: /* fall through */
case BLXMSP_EXON:
result = getGdkColor(fill ? exonFillColorId : exonLineColorId, defaultColors, selected, usePrintColors);
break;
case BLXMSP_CDS:
result = getGdkColor(fill ? cdsFillColorId : cdsLineColorId, defaultColors, selected, usePrintColors);
break;
case BLXMSP_UTR:
result = getGdkColor(fill ? utrFillColorId : utrLineColorId, defaultColors, selected, usePrintColors);
break;
/* to do: mspGetIntronColor() is non-trivial, because it has to work out the color
* from the adjacent exons. Since mspGetColor() is called many times on re-draw, it
* would be better to work out whether an intron is CDS or UTR during initialisation
* and use different types (e.g. BLXMSP_INTRON_CDS) that can be queried here to quickly
* determine what color to use. */
case BLXMSP_INTRON:
result = mspGetIntronColor(msp, defaultColors, defaultColorId, blxSeq, selected, usePrintColors, fill, exonFillColorId, exonLineColorId, cdsFillColorId, cdsLineColorId, utrFillColorId, utrLineColorId);
break;
default:
break;
};
}
return result;
}
/* Get functions from msps for various sequence properties. Result is owned by the sequence
* and should not be free'd. Returns NULL if the property is not set. */
const char *mspGetColumn(const MSP* const msp, const BlxColumnId columnId)
{
return (msp ? blxSequenceGetColumn(msp->sSequence, columnId) : NULL);
}
const char *mspGetOrganism(const MSP* const msp)
{
return (msp ? blxSequenceGetOrganism(msp->sSequence) : NULL);
}
const char *mspGetOrganismAbbrev(const MSP* const msp)
{
return (msp ? blxSequenceGetOrganismAbbrev(msp->sSequence) : NULL);
}
const char *mspGetGeneName(const MSP* const msp)
{
return (msp ? blxSequenceGetGeneName(msp->sSequence) : NULL);
}
const char *mspGetTissueType(const MSP* const msp)
{
return (msp ? blxSequenceGetTissueType(msp->sSequence) : NULL);
}
const char *mspGetStrain(const MSP* const msp)
{
return (msp ? blxSequenceGetStrain(msp->sSequence) : NULL);
}
/* Return the coords of an MSP as a string. The result should be free'd with g_free */
char *mspGetCoordsAsString(const MSP* const msp)
{
char *result = NULL;
if (msp)
{
GString *resultStr = g_string_new("");
/* If the s coords are unset then they are not relevant, so exclude them */
if (!msp->sRange.isSet())
g_string_append_printf(resultStr, "%d,%d", msp->qRange.min(), msp->qRange.max());
else
g_string_append_printf(resultStr, "%d,%d[%d,%d]", msp->qRange.min(), msp->qRange.max(), msp->sRange.min(), msp->sRange.max());
result = g_string_free(resultStr, FALSE);
}
return result;
}
/* Return the path in the given tree model that this MSP lies in */
gchar* mspGetTreePath(const MSP* const msp, BlxModelId modelId)
{
return msp->treePaths[modelId];
}
///* Returns true if a feature-series by the given name exists in the feature-series array and
// * and, if so, sets index_out with its index. */
//static gboolean fsArrayFindByName(GArray *fsArray, FeatureSeries *fs, int *index_out)
//{
// gboolean result = FALSE;
//
// if (fsArray)
// {
// int i = 0;
// for ( ; i < fsArray->len; ++i)
// {
// FeatureSeries *compareFs = &g_array_index(fsArray, FeatureSeries, i);
//
// if (!fsSortByNameCompareFunc(fs, compareFs))
// {
// result = TRUE;
// *index_out = i;
// break;
// }
// }
// }
//
// return result;
//}
/* Comparison function to sort two Feature Series by the order number stored in the FeatureSeries
* struct. Returns -1 if the first item is before the second, 1 if the second is first, or 0 if
* they are equal. */
gint fsSortByOrderCompareFunc(gconstpointer fs1_in, gconstpointer fs2_in)
{
int result = 0;
FeatureSeries *fs1 = (FeatureSeries *)fs1_in;
FeatureSeries *fs2 = (FeatureSeries *)fs2_in;
if (fs1->order < fs2->order)
result = -1;
else if (fs1->order > fs2->order)
result = 1;
return result;
}
/* Comparison function to sort two Features Series by name. */
gint fsSortByNameCompareFunc(gconstpointer fs1_in, gconstpointer fs2_in)
{
FeatureSeries *fs1 = (FeatureSeries *)fs1_in;
FeatureSeries *fs2 = (FeatureSeries *)fs2_in;
/*printf("%s - %s : %d\n", fs1->name, fs2->name, strcmp(fs1->name, fs2->name));*/
return strcmp(fs1->name, fs2->name);
}
/* Insert the given MSP into the Feature Series of the given name. If the Feature Series
* does not exist yet, create it. Also, if the Feature Series array does not exist yet, create
* that too. */
//void insertFS(MSP *msp, char *series)
//{
// if (!fsArr)
// {
// fsArr = g_array_sized_new(TRUE, FALSE, sizeof(FeatureSeries), 50);
// }
//
// static int orderNum = 0; /* will increment this each time we add a feature series to the array */
//
// FeatureSeries *fs = new FeatureSeries;
// fs->on = 1;
// fs->y = 0.0;
// fs->xy = (msp->type == BLXMSP_XY_PLOT ? 1 : 0);
//
// fs->name = g_strdup(series);
//
// int i;
// if (fsArrayFindByName(fsArr, fs, &i))
// {
// msp->fs = &g_array_index(fsArr, FeatureSeries, i);
// g_free(fs->name);
// g_free(fs);
// }
// else
// {
// /* Remember the order we added them so we can sort by it again later. */
// orderNum++;
// fs->order = orderNum;
//
// g_array_append_val(fsArr, *fs);
// // g_array_sort(fsArr, fsSortByNameCompareFunc);
//
// msp->fs = fs;
// }
//}
//
/* Get the MSP at the given index in the given array. Returns null if out of bounds */
MSP* mspArrayIdx(const GArray* const array, const int idx)
{
MSP *msp = NULL;
if (idx >= 0 && idx < (int)array->len)
msp = g_array_index(array, MSP*, idx);
return msp;
}
/* Check if the given character is a polyA character (i.e. 'a', or if the strand is reverse 't') */
static gboolean isPolyAChar(const char c, const BlxStrand strand)
{
gboolean result = FALSE;
if (strand == BLXSTRAND_FORWARD)
result = (c == 'a' || c == 'A');
else
result = (c == 't' || c == 'T');
return result;
}
/* Get the number of bases to check when looking for a polyA tail. We may want to make this configurable? */
static int getNumPolyATailBasesToCheck()
{
static int result = POLYA_TAIL_BASES_TO_CHECK;
return result;
}
/* Returns true if there is a polyA site at the 3' end of this MSP's alignment range. */
gboolean mspHasPolyATail(const MSP* const msp)
{
gboolean found = FALSE;
/* Only matches have polyA tails. */
if (mspIsBlastMatch(msp))
{
const char *seq = mspGetMatchSeq(msp);
if (seq)
{
const int numRequired = getNumPolyATailBasesToCheck();
const int minRequired = 3; /* check at least 3 bases */
const int len = strlen(seq);
BlxStrand sStrand = mspGetMatchStrand(msp);
BlxStrand qStrand = mspGetRefStrand(msp);
int sCoord = mspGetSEnd(msp);
if (qStrand == sStrand)
{
++sCoord; /* next coord after alignment block end */
int sMax = mspGetSStart(msp);
if (numRequired > 0) /* -1 means check all of the unaligned sequence */
sMax = sCoord + numRequired;
if (sMax <= len && sMax - sCoord >= minRequired)
{
found = TRUE;
for ( ; sCoord <= sMax; ++sCoord)
{
if (!isPolyAChar(seq[sCoord - 1], qStrand))
{
found = FALSE;
break;
}
}
}
}
else
{
--sCoord; /* next coord after alignment block end */
int sMin = 1;
if (numRequired > 0)
sMin = sCoord - numRequired;
if (sMin >= 1 && sCoord - sMin >= minRequired)
{
found = TRUE;
for ( ; sCoord >= sMin; --sCoord)
{
if (!isPolyAChar(seq[sCoord - 1], qStrand))
{
found = FALSE;
break;
}
}
}
}
}
}
return found;
}
/* Returns true if the given MSP coord (in ref seq nucleotide coords) is inside a polyA tail, if
* this MSP has one. */
gboolean mspCoordInPolyATail(const int coord, const MSP* const msp)
{
gboolean result = mspHasPolyATail(msp);
/* See if the coord is outside the 3' end of the alignment range (i.e. is greater than the
* max coord if we're on the forward strand or less than the min coord if on the reverse). */
//result &= ((mspGetRefStrand(msp) == BLXSTRAND_FORWARD && coord > msp->displayRange.max) ||
// (mspGetRefStrand(msp) == BLXSTRAND_REVERSE && coord < msp->displayRange.min));
result &= coord > msp->displayRange.max();
return result;
}
/***********************************************************
* BlxSequence *
***********************************************************/
/* Append the contents of the given text to the GString, if the text is non-null,
* including the given separator before the text is appended. Pass the separator
* as an empty string if no separation is required. */
static void appendTextIfNonNull(GString *gstr, const char *separator, const char *text)
{
if (text)
{
g_assert(separator);
g_string_append_printf(gstr, "%s%s", separator, text);
}
}
/* Return summary info about a given BlxSequence (e.g. for displaying in the status bar). The
* result should be free'd with g_free. */
char* blxSequenceGetSummaryInfo(const BlxSequence* const blxSeq, GList *columnList)
{
char *result = NULL;
if (blxSeq)
{
GString *resultStr = g_string_new("");
const char *separator = "";
/* Loop through all the columns, appending any that should be shown
* to the result string */
GList *item = columnList;
for ( ; item; item = item->next)
{
BlxColumnInfo *columnInfo = (BlxColumnInfo*)(item->data);
if (columnInfo->showSummary)
{
const char *valueText = blxSequenceGetValueAsString(blxSeq, columnInfo->columnId);
if (valueText)
{
appendTextIfNonNull(resultStr, separator, valueText);
/* The first item has no separator, but subsequence items do,
* so set the separator after the first item has been added. */
separator = "; ";
}
}
}
result = g_string_free(resultStr, FALSE);
}
return result;
}
/* Return the full name of a BlxSequence (including prefix and variant) */
const char *blxSequenceGetName(const BlxSequence *seq)
{
const char *result = NULL;
if (seq)
{
result = blxSequenceGetValueAsString(seq, BLXCOL_SEQNAME);
if (!result && seq->idTag)
result = seq->idTag;
if (!result)
g_warning("Sequence does not have a name specified.\n");
}
return result;
}
/* Return the Source text of a BlxSequence, if it has one (note that it gets
* this from the first MSP and does no checking whether other MSPs have the
* same source or not). */
const char *blxSequenceGetSource(const BlxSequence *seq)
{
const char *result = NULL;
if (seq)
result = blxSequenceGetValueAsString(seq, BLXCOL_SOURCE);
return result;
}
/* Return the fetch method of a BlxSequence. If 'bulk' is true,
* get the bulk-fetch method, otherwise the user-fetch method.
* 'index' indicates which method to choose if multiple methods
* are available; 0 is the first (preferred) method, 1 the second
* etc. If no fetch method is set, return the given default method
* instead (for index==0 only). Pass 'defaultMethod' as 0 if N/A. */
GQuark blxSequenceGetFetchMethod(const BlxSequence *seq,
const gboolean bulk,
const gboolean optionalColumns,
const int index,
const GArray *defaultMethods)
{
GQuark result = 0;
if (seq && seq->dataType)
{
GArray *array = NULL;
if (bulk && optionalColumns)
array = seq->dataType->optionalFetch;
else if (bulk)
array = seq->dataType->bulkFetch;
else
array = seq->dataType->userFetch;
if (array && index >= 0 && index < (int)array->len)
result = g_array_index(array, GQuark, index);
}
if (!result && defaultMethods && index >= 0 && index < (int)defaultMethods->len)
{
result = g_array_index(defaultMethods, GQuark, index);
}
return result;
}
/* Return the length of the given blxsequence's sequence data */
int blxSequenceGetLength(const BlxSequence *seq)
{
int result = 0;
if (seq)
{
const char *sequence = blxSequenceGetSequence(seq);
if (sequence)
result = strlen(sequence);
}
return result;
}
/* Get the start extent of the alignments from this match sequence on the
* given reference sequence strand */
int blxSequenceGetStart(const BlxSequence *seq, const BlxStrand strand)
{
int result = UNSET_INT;
if (strand == BLXSTRAND_REVERSE && seq->qRangeRev.isSet())
result = seq->qRangeRev.min();
else if (seq->qRangeFwd.isSet())
result = seq->qRangeFwd.min();
return result;
}
/* Get the end extend of the sequence on the ref sequence */
int blxSequenceGetEnd(const BlxSequence *seq, const BlxStrand strand)
{
int result = UNSET_INT;
if (strand == BLXSTRAND_REVERSE && seq->qRangeRev.isSet())
result = seq->qRangeRev.max();
else if (seq->qRangeFwd.isSet())
result = seq->qRangeFwd.max();
return result;
}
/* Get the sequence data for the given blxsequence */
const char *blxSequenceGetSequence(const BlxSequence *seq)
{
const char *result = blxSequenceGetValueAsString(seq, BLXCOL_SEQUENCE);
return result;
}
/* This returns true if the given sequence object requires sequence data
* (i.e. the actual dna or peptide sequence string) */
gboolean blxSequenceRequiresSeqData(const BlxSequence *seq)
{
return (seq &&
(seq->type == BLXSEQUENCE_MATCH ||
seq->type == BLXSEQUENCE_VARIATION ||
seq->type == BLXSEQUENCE_REGION));
}
/* This returns true if the given sequence object requires optional data such
* as organism and tissue-type, if this data is available. */
gboolean blxSequenceRequiresOptionalData(const BlxSequence *seq)
{
return (seq && seq->type == BLXSEQUENCE_MATCH);
}
/* This returns true if the given sequence object requires the data for
* the given column */
gboolean blxSequenceRequiresColumnData(const BlxSequence *seq, const BlxColumnId columnId)
{
gboolean result = FALSE;
if (seq)
{
if (columnId == BLXCOL_ORGANISM || columnId == BLXCOL_TISSUE_TYPE ||
columnId == BLXCOL_GENE_NAME || columnId == BLXCOL_STRAIN ||
columnId >= BLXCOL_NUM_COLUMNS)
{
result = blxSequenceRequiresOptionalData(seq);
}
else if (columnId == BLXCOL_SEQUENCE)
{
result = blxSequenceRequiresSeqData(seq);
}
}
return result;
}
/* Get the value for the given column */
GValue* blxSequenceGetValue(const BlxSequence *seq, const int columnId)
{
GValue *result = NULL;
if (seq && seq->values && columnId < (int)seq->values->len)
result = &g_array_index(seq->values, GValue, columnId);
return result;
}
void blxSequenceSetValue(const BlxSequence *seq, const int columnId, GValue *value_in)
{
if (seq && seq->values)
{
GValue *value = blxSequenceGetValue(seq, columnId);
g_value_reset(value);
g_value_copy(value_in, value);
}
}
/* Clear the idTag stored in the BlxSequence. This gets done after importing a GFF file is
* complete because we don't want the IDs to clash with further files which may be imported
* later. If the name is not set, this sets the name to the ID before clearing the ID (really we
* should probably be trying to construct a unique name from the source, type, strand and coords,
* but we don't currently store the GFF type). */
static void blxSequenceClearGFFIds(BlxSequence *seq)
{
if (seq)
{
if (!blxSequenceGetName(seq))
{
if (seq->idTag)
blxSequenceSetValueFromString(seq, BLXCOL_SEQNAME, seq->idTag);
else
blxSequenceSetValueFromString(seq, BLXCOL_SEQNAME, "<no name>");
}
if (seq->idTag)
{
g_free(seq->idTag);
seq->idTag = NULL;
}
}
}
/* Set the value for the given column. The given string is converted to
* the relevant value type */
void blxSequenceSetValueFromString(const BlxSequence *seq, const int columnId, const char *inputStr)
{
if (inputStr && seq && seq->values)
{
GValue *value = blxSequenceGetValue(seq, columnId);
if (value)
{
g_value_reset(value);
if (G_VALUE_HOLDS_STRING(value))
{
g_value_take_string(value, g_strdup(inputStr));
}
else if (G_VALUE_HOLDS_INT(value))
{
const int tmp = atoi(inputStr);
g_value_set_int(value, tmp);
}
else if (G_VALUE_HOLDS_DOUBLE(value))
{
const gdouble tmp = g_strtod(inputStr, NULL);
g_value_set_double(value, tmp);
}
else
{
g_warning("Tried to set value of unknown type for column '%d'\n", columnId);
}
}
}
}
/* Get the string value for the given column. Returns null if the
* value is not a string type. */
const char* blxSequenceGetValueAsString(const BlxSequence *seq, const int columnId)
{
const char *result = NULL;
GValue *value = blxSequenceGetValue(seq, columnId);
if (value)
{
if (G_VALUE_HOLDS_STRING(value))
result = g_value_get_string(value);
else if (G_VALUE_HOLDS_INT(value))
result = convertIntToString(g_value_get_int(value));
else if (G_VALUE_HOLDS_DOUBLE(value))
result = convertDoubleToString(g_value_get_double(value), 2);
}
/* Return null if it's an empty value (i.e. if it's unset) */
if (result && *result == 0)
result = NULL;
return result;
}
/* Get the relevant data about a sequence for the given column ID (at the moment
* this only supports string data) */
const char* blxSequenceGetColumn(const BlxSequence* const blxSeq, const BlxColumnId columnId)
{
const char *result = NULL;
GValue *value = blxSequenceGetValue(blxSeq, columnId);
if (value && G_VALUE_HOLDS_STRING(value))
{
result = g_value_get_string(value);
}
return result;
}
const char *blxSequenceGetOrganism(const BlxSequence *seq)
{
return blxSequenceGetValueAsString(seq, BLXCOL_ORGANISM);
}
const char *blxSequenceGetOrganismAbbrev(const BlxSequence *seq)
{
return (seq ? seq->organismAbbrev : NULL);
}
const char *blxSequenceGetGeneName(const BlxSequence *seq)
{
return blxSequenceGetValueAsString(seq, BLXCOL_GENE_NAME);
}
const char *blxSequenceGetTissueType(const BlxSequence *seq)
{
return blxSequenceGetValueAsString(seq, BLXCOL_TISSUE_TYPE);
}
const char *blxSequenceGetStrain(const BlxSequence *seq)
{
return blxSequenceGetValueAsString(seq, BLXCOL_STRAIN);
}
/* Return the sequence data as a string in fasta format.
* Result should be free'd with g_free, unless the name
* or sequence couldn't be found, in which case the result
* is null */
char *blxSequenceGetFasta(const BlxSequence *seq)
{
char *result = NULL;
if (seq)
{
const char *name = blxSequenceGetName(seq);
const char *sequence = blxSequenceGetSequence(seq);
if (name && sequence)
{
result = g_strdup_printf(">%s\n%s", name, sequence);
}
}
return result;
}
/* Return all the stored info about a blx sequenece (description, organism, tissue type etc.)
* in a single string. The result should be free'd by the caller using g_free. If 'allowNewlines'
* is true the data is separated with newline characters, otherwise with tabs (i.e. pass as false
* if returned string is to be shown as a single line). The dataLoaded flag should be passed as
* false if the optional data has not been loaded yet. */
char *blxSequenceGetInfo(BlxSequence *blxSeq, const gboolean allowNewlines, GList *columnList)
{
char *result = NULL;
if (blxSeq)
{
GString *resultStr = g_string_new("");
char separator = allowNewlines ? '\n' : '\t';
char strand = blxSeq->strand == BLXSTRAND_REVERSE ? '-' : '+';
/* Loop through all the columns, appending them to the result string */
GList *item = columnList;
const int titleWidth = 17; /* if title is less than this width then it will be padded */
for ( ; item; item = item->next)
{
BlxColumnInfo *columnInfo = (BlxColumnInfo*)(item->data);
const char *valueText = blxSequenceGetValueAsString(blxSeq, columnInfo->columnId);
const char *text = valueText ? valueText : "";
if (columnInfo->columnId == BLXCOL_SEQNAME)
g_string_append_printf(resultStr, "%-*s %s%c%c", titleWidth, columnInfo->title, text, strand, separator);
else
g_string_append_printf(resultStr, "%-*s %s%c", titleWidth, columnInfo->title, text, separator);
}
/* Loop through the child features and show their coords */
const char *title = "Coords";
g_string_append_printf(resultStr, "%-*s ", titleWidth, title);
GList *mspItem = blxSeq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP* const msp = (const MSP*)(mspItem->data);
/* Don't show 'exon' msps because we show the exon's
* individual 'cds' and 'utr' instead */
if (msp->type != BLXMSP_EXON)
{
char *coordsStr = mspGetCoordsAsString(msp);
g_string_append_printf(resultStr, "%s ", coordsStr ? coordsStr : "");
if (coordsStr)
g_free(coordsStr);
}
}
result = g_string_free(resultStr, FALSE);
}
return result;
}
/* Find a BlxSequence by its full name (must be an exact match but is case insensitive) */
static BlxSequence* blxSequenceFindByName(const char *name, GList *allSeqs)
{
BlxSequence *result = NULL;
GList *listItem = allSeqs;
for ( ; listItem; listItem = listItem->next)
{
BlxSequence *curSeq = (BlxSequence*)(listItem->data);
const char *curName = blxSequenceGetName(curSeq);
if (name && stringsEqual(curName, name, FALSE))
{
result = curSeq;
break;
}
}
return result;
}
/* Get the "parent" sequence of the given protein variant. Assumes the variant
* contains a dash '-' in the name followed by the variant number as a digit.
* e.g. SW:P51531-2.2. The function looks for a sequence with the same name but
* with this dash and the following digit(s) (up to the end of the name or the '.'
* if there is one) removed. Returns NULL if no parent was found. */
BlxSequence* blxSequenceGetVariantParent(const BlxSequence *variant, GList *allSeqs)
{
BlxSequence *result = NULL;
const char *variantName = blxSequenceGetName(variant);
if (variantName)
{
char *parentName = g_strdup(variantName);
char *insertPoint = strchr(parentName, '-');
if (insertPoint)
{
/* Replace '-' by terminating char, in case there's nothing else to copy in. */
*insertPoint = '\0';
/* The insert point is where we'll copy into. Create another pointer that we'll increment
* until we find a '.' and then we'll copy from that point. */
char *copyPoint = insertPoint;
++copyPoint;
gboolean foundRestartPoint = FALSE; /* set to true when we find where to start copying from again */
while (copyPoint && *copyPoint != '\0')
{
if (foundRestartPoint)
{
*insertPoint = *copyPoint;
++insertPoint;
}
else if (*copyPoint == '.')
{
foundRestartPoint = TRUE;
*insertPoint = *copyPoint;
++insertPoint;
}
++copyPoint;
}
*insertPoint = '\0';
result = blxSequenceFindByName(parentName, allSeqs);
g_free(parentName);
}
}
return result;
}
/* Destroy all of the BlxSequences */
void destroyBlxSequenceList(GList **seqList)
{
GList *seqItem = *seqList;
for ( ; seqItem; seqItem = seqItem->next)
{
BlxSequence *blxSeq = (BlxSequence*)(seqItem->data);
destroyBlxSequence(blxSeq);
}
g_list_free(*seqList);
*seqList = NULL;
}
/* Frees all memory used by a BlxSequence */
void destroyBlxSequence(BlxSequence *seq)
{
if (seq)
{
if (seq->values)
{
/* Free all column values */
int i = 0;
for ( ; i < (int)seq->values->len; ++i)
{
GValue *value = &g_array_index(seq->values, GValue, i);
g_value_unset(value);
}
}
if (seq->idTag)
g_free(seq->idTag);
delete seq;
}
}
/* Destroy an msp and remove it from the BlxSequence and msp lists */
static void destroyMspFull(MSP *msp, BlxSequence *seq, GArray *featureLists[], MSP **lastMsp, MSP **mspList)
{
/* Remove from the feature list */
GArray *array = featureLists[msp->type];
unsigned int i = 0;
for ( ; i < array->len; ++i)
{
MSP *curMsp = g_array_index(array, MSP*, i);
if (curMsp == msp)
{
array = g_array_remove_index(array, i);
break;
}
}
featureLists[msp->type] = array;
/* Remove from mspList */
MSP *curMsp = *mspList;
MSP *prevMsp = NULL;
for ( ; curMsp; curMsp = curMsp->next)
{
if (msp == curMsp)
{
if (!prevMsp)
*mspList = curMsp->next; /* Remove msp from start of list */
else
prevMsp->next = curMsp->next; /* Remove link to msp */
if (*lastMsp == msp)
*lastMsp = prevMsp; /* Update pointer to last msp */
break;
}
prevMsp = curMsp;
}
/* Remove from the BlxSequence, if given */
if (seq && seq->mspList)
{
GList *item = seq->mspList;
for ( ; item; item = item->next)
{
MSP *curMsp = (MSP*)(item->data);
if (curMsp == msp)
{
seq->mspList = g_list_remove_link(seq->mspList, item);
break;
}
}
}
destroyMspData(msp);
}
/* destroy a blxsequence and it's msps, and remove them from the feature lists */
static void destroyBlxSequenceFull(BlxSequence *seq, GArray *featureLists[], MSP **lastMsp, MSP **mspList, GList **seqList)
{
/* destroy each msp */
GList *mspItem = seq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
MSP *msp = (MSP*)(mspItem->data);
destroyMspFull(msp, NULL, featureLists, lastMsp, mspList); /* don't remove from
seq->mspList because we
destroy this anyway */
}
g_list_free(seq->mspList);
/* Remove BlxSequence from seqList */
*seqList = g_list_remove(*seqList, seq);
destroyBlxSequence(seq);
}
/* Set the value for a particular column (by column name) */
void blxSequenceSetColumn(BlxSequence *seq, const char *colName, const char *value, GList *columnList)
{
if (!colName || !value)
return;
gboolean found = FALSE;
/* Loop through the column list and find the one with this name */
GList *item = columnList;
for ( ; item && !found; item = item->next)
{
BlxColumnInfo *columnInfo = (BlxColumnInfo*)(item->data);
if (stringsEqual(colName, columnInfo->title, FALSE))
{
blxSequenceSetValueFromString(seq, columnInfo->columnId, value);
found = TRUE;
}
}
if (!found)
g_warning("Unrecognised column '%s'\n", colName);
}
/* Utility to create a BlxSequence with the given name. */
BlxSequence* createEmptyBlxSequence()
{
BlxSequence *seq = new BlxSequence;
seq->type = BLXSEQUENCE_UNSET;
seq->dataType = NULL;
seq->idTag = NULL;
seq->mspList = NULL;
seq->sequenceReqd = FALSE;
seq->values = NULL;
seq->organismAbbrev = NULL;
return seq;
}
/* Copies all fields in a sequence. Copies all MSPs apart from CDSs whose name does not match the
* given quark */
static void copyBlxSequenceNamedCds(const BlxSequence *src,
const GQuark cdsQuark,
GArray *featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
GError *tmpError = NULL;
/* We must give the new BlxSequence a unique id - use the cds name */
const char *idTag = g_quark_to_string(cdsQuark);
/* We'll copy these values directly from the source */
const char *source = blxSequenceGetSource(src);
const BlxStrand sStrand = src->strand;
BlxDataType *dataType = src->dataType;
/* Copy all MSPs except CDSs whose name does not match cdsQuark */
GList *mspItem = src->mspList;
for ( ; mspItem && !tmpError; mspItem = mspItem->next)
{
const MSP* msp = (const MSP*)(mspItem->data);
if (msp->type != BLXMSP_CDS || g_quark_from_string(msp->sname) == cdsQuark)
{
MSP *newMsp = copyMsp(msp, featureLists, lastMsp, mspList, FALSE, FALSE);
/* Add the new msp to the new blx sequence (this creates it if it does not exist
* i.e. the first time we get here for this idTag) */
addBlxSequence(newMsp->sname, newMsp->sname_orig, idTag, sStrand, dataType,
source, seqList, columnList,
NULL, newMsp, lookupTable, NULL, &tmpError);
}
}
if (tmpError)
g_propagate_error(error, tmpError);
}
BlxDataType* createBlxDataType()
{
BlxDataType *result = new BlxDataType;
result->name = 0;
result->bulkFetch = NULL;
result->userFetch = NULL;
/* Loop through the flags, setting them all to false initially */
int flag = MSPFLAG_MIN;
for ( ; flag < MSPFLAG_NUM_FLAGS; ++flag)
{
result->flags[flag] = FALSE;
}
/* Set any specific flags that we want to be true by default */
result->flags[MSPFLAG_SQUASH_LINKED_FEATURES] = TRUE;
result->flags[MSPFLAG_STRAND_SPECIFIC] = TRUE;
result->flags[MSPFLAG_SHOW_REVERSE_STRAND] = TRUE;
return result;
}
void destroyBlxDataType(BlxDataType **blxDataType)
{
if (!blxDataType)
return;
delete *blxDataType;
*blxDataType = NULL;
}
/* The following functions get the data type values as strings */
const char* getDataTypeName(BlxDataType *blxDataType)
{
return blxDataType ? g_quark_to_string(blxDataType->name) : NULL;
}
/* does the work for compareFuncMspPos and compareFuncMspArray */
static gint compareMsps(const MSP* const msp1, const MSP* const msp2)
{
gint result = 0;
if (result == 0)
{
if (msp1->qRange.min() == msp2->qRange.min())
{
/* Sort by type. Lower type numbers should appear first. */
result = msp2->type - msp1->type;
}
else
{
result = msp1->qRange.min() - msp2->qRange.min();
}
}
return result;
}
/* Compare the start position in the ref seq of two MSPs. Returns a negative value if a < b; zero
* if a = b; positive value if a > b. Secondarily sorts by type in the order that types appear in
* the BlxMspType enum. Note that this sorts first by strand. */
gint compareFuncMspPos(gconstpointer a, gconstpointer b)
{
gint result = 0;
const MSP* const msp1 = (const MSP*)a;
const MSP* const msp2 = (const MSP*)b;
/* First, sort by strand */
result = (int)msp1->qStrand - (int)msp2->qStrand;
if (!result)
result = compareMsps(msp1, msp2);
return result;
}
/* Same as compareFuncMspPos but accepts pointers to MSP pointers (which is
* what the GArray of MSPs holds). Note that this does NOT sort first by strand,
* unlike compareFuncMspPos. This is important for the detail-view filtering
* functions. */
gint compareFuncMspArray(gconstpointer a, gconstpointer b)
{
const MSP* const msp1 = *((const MSP**)a);
const MSP* const msp2 = *((const MSP**)b);
return compareMsps(msp1, msp2);
}
/* returns true if the given msp should be output when piping features to dotter */
static gboolean outputMsp(const MSP* const msp, IntRange *range1, IntRange *range2)
{
return ((msp->type == BLXMSP_FS_SEG || mspIsBoxFeature(msp) || mspIsIntron(msp) || mspIsBlastMatch(msp)) &&
(rangesOverlap(&msp->qRange, range1) || rangesOverlap(&msp->qRange, range2))
);
}
/* Counts the number of msps that should be output when piping to dotter */
static int countMspsToOutput(const BlxSequence* const blxSeq, IntRange *range1, IntRange *range2)
{
int numMsps = 0;
GList *mspItem = blxSeq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP* const msp = (const MSP*)(mspItem->data);
if (outputMsp(msp, range1, range2))
++numMsps;
}
return numMsps;
}
/* write data for the given transcript to the given output pipe. */
void writeTranscriptToOutput(GIOChannel *ioChannel,
const BlxSequence* const blxSeq,
IntRange *range,
const IntRange* const refSeqRange,
GError **error)
{
g_return_if_fail(blxSeq && blxSeq->type == BLXSEQUENCE_TRANSCRIPT);
/* Count how many exons are within range */
int numMsps = 0;
GList *mspItem = blxSeq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP* msp = (const MSP*)(mspItem->data);
/* Only output exons. Also, if an exon has child msps then ignore it and only output the children */
if (mspIsBoxFeature(msp) && !msp->childMsps)
{
/* It's possible that some exons may be out of bounds: clip them, or if completely out
* of range ignore this exon. */
if (msp->qRange.min() < refSeqRange->max() && msp->qRange.max() > refSeqRange->min())
{
++numMsps;
}
}
}
if (numMsps < 1)
return;
char *tmpStr = g_strdup_printf("%d %d %d",
blxSeq->type,
blxSeq->strand,
numMsps); /* output number of msps so we know how many to read in */
gsize bytes_written = 0;
GError *tmpError = NULL;
g_io_channel_write_chars(ioChannel, tmpStr, -1, &bytes_written, &tmpError);
g_free(tmpStr);
const char* transcriptName = blxSequenceGetName(blxSeq);
stringProtect(ioChannel, transcriptName, &tmpError);
stringProtect(ioChannel, blxSeq->idTag, &tmpError);
if (!tmpError)
g_io_channel_write_unichar(ioChannel, '\n', &tmpError);
mspItem = blxSeq->mspList;
int i = 0; /* keeps track of current transcript coord */
for ( ; mspItem && !tmpError; mspItem = mspItem->next)
{
const MSP* msp = (const MSP*)(mspItem->data);
/* Only output exons. Also, if an exon has child msps then ignore it: we will come across
* the child msps themselves in the list so we don't want to output both the parent and the
* child msps. */
if (mspIsBoxFeature(msp) && !msp->childMsps)
{
/* It's possible that some exons may be out of bounds: clip them, or if completely out
* of range ignore this exon. */
if (msp->qRange.min() < refSeqRange->max() && msp->qRange.max() > refSeqRange->min())
{
const int start = i + 1;
const int end = start + msp->qRange.length() - 1;
char *tmpStr = g_strdup_printf("%d %f %f %d %d %d %d %d %d %d",
msp->type,
msp->score,
msp->id,
msp->phase,
// msp->fsColor,
start,
end,
msp->sRange.min(),
msp->sRange.max(),
msp->qStrand,
msp->qFrame);
g_io_channel_write_chars(ioChannel, tmpStr, -1, NULL, &tmpError);
g_free(tmpStr);
stringProtect(ioChannel, transcriptName, &tmpError);
stringProtect(ioChannel, msp->sname, &tmpError);
stringProtect(ioChannel, msp->desc, &tmpError);
if (!tmpError)
g_io_channel_write_unichar(ioChannel, '\n', &tmpError);
i = end;
}
}
}
if (tmpError)
{
prefixError(tmpError, "Error piping transcript to dotter: ");
g_propagate_error(error, tmpError);
}
}
/* write data from the given blxsequence to the given output pipe. if the ranges
* are given, only outputs blxsequences that overlap either range */
void writeBlxSequenceToOutput(GIOChannel *ioChannel, const BlxSequence *blxSeq,
IntRange *range1, IntRange *range2,
GError **error)
{
GError *tmpError = NULL;
gboolean outputSeq = (blxSeq && (blxSeq->type == BLXSEQUENCE_TRANSCRIPT || blxSeq->type == BLXSEQUENCE_MATCH));
int numMsps = countMspsToOutput(blxSeq, range1, range2);
outputSeq &= numMsps > 0; /* only output the sequence if it has some valid msps */
if (outputSeq)
{
char *tmpStr = g_strdup_printf("%d %d %d",
blxSeq->type,
blxSeq->strand,
numMsps); /* output number of msps so we know how many to read in */
g_io_channel_write_chars(ioChannel, tmpStr, -1, NULL, &tmpError);
g_free(tmpStr);
stringProtect(ioChannel, blxSequenceGetName(blxSeq), &tmpError);
stringProtect(ioChannel, blxSeq->idTag, &tmpError);
if (!tmpError)
g_io_channel_write_unichar(ioChannel, '\n', &tmpError);
/* now output the msps */
GList *mspItem = blxSeq->mspList;
for ( ; mspItem && !tmpError; mspItem = mspItem->next)
{
const MSP* const msp = (const MSP*)(mspItem->data);
if (outputMsp(msp, range1, range2))
{
writeMspToOutput(ioChannel, msp, &tmpError);
}
}
}
if (tmpError)
g_propagate_error(error, tmpError);
}
/* increment the given char pointer until it is not whitespace */
static void nextChar(char **curChar)
{
while (**curChar == ' ')
++(*curChar);
}
/* read in a blxsequence from the given text. */
BlxSequence* readBlxSequenceFromText(char *text, int *numMsps)
{
DEBUG_ENTER("readBlxSequenceFromText(text=%s)", text);
char *curChar = text;
GError *error = NULL;
BlxSequence *blxSeq = createEmptyBlxSequence();
if (error)
{
reportAndClearIfError(&error, G_LOG_LEVEL_CRITICAL);
DEBUG_EXIT("readBlxSequenceFromText returning NULL");
return NULL;
}
nextChar(&curChar);
blxSeq->type = (BlxSequenceType)strtol(curChar, &curChar, 10);
nextChar(&curChar);
blxSeq->strand = (BlxStrand)strtol(curChar, &curChar, 10);
nextChar(&curChar);
*numMsps = strtol(curChar, &curChar, 10);
nextChar(&curChar);
char *fullName = stringUnprotect(&curChar, NULL);
blxSequenceSetValueFromString(blxSeq, BLXCOL_SEQNAME, fullName);
g_free(fullName);
blxSeq->idTag = stringUnprotect(&curChar, NULL);
DEBUG_EXIT("readBlxSequenceFromText returning numMsps=%d", *numMsps);
return blxSeq;
}
/* write data from the given msp to the given output pipe. */
void writeMspToOutput(GIOChannel *ioChannel, const MSP* const msp, GError **error)
{
GError *tmpError = NULL;
char *tmpStr = g_strdup_printf("%d %f %f %d %d %d %d %d %d %d",
msp->type,
msp->score,
msp->id,
msp->phase,
// msp->fsColor,
msp->qRange.min(),
msp->qRange.max(),
msp->sRange.min(),
msp->sRange.max(),
msp->qStrand,
msp->qFrame);
g_io_channel_write_chars(ioChannel, tmpStr, -1, NULL, &tmpError);
g_free(tmpStr);
stringProtect(ioChannel, msp->qname, &tmpError);
stringProtect(ioChannel, msp->sname, &tmpError);
stringProtect(ioChannel, msp->desc, &tmpError);
if (!tmpError)
g_io_channel_write_unichar(ioChannel, '\n', &tmpError);
if (tmpError)
g_propagate_error(error, tmpError);
}
/* Read in an msp from the given text. the text is in the format as written by writeMspToFile */
void readMspFromText(MSP *msp, char *text)
{
//DEBUG_ENTER("readMspFromText(text=%s)", text);
char *curChar = text;
nextChar(&curChar);
msp->type = (BlxMspType)strtol(curChar, &curChar, 10);
nextChar(&curChar);
msp->score = g_strtod(curChar, &curChar);
nextChar(&curChar);
msp->id = g_strtod(curChar, &curChar);
nextChar(&curChar);
msp->phase = strtol(curChar, &curChar, 10);
// nextChar(&curChar);
// msp->fsColor = strtol(curChar, &curChar, 10);
/* ref seq range */
nextChar(&curChar);
const int qStart = strtol(curChar, &curChar, 10);
nextChar(&curChar);
const int qEnd = strtol(curChar, &curChar, 10);
msp->qRange.set(qStart, qEnd);
/* match seq range */
nextChar(&curChar);
const int sStart = strtol(curChar, &curChar, 10);
nextChar(&curChar);
const int sEnd = strtol(curChar, &curChar, 10);
msp->sRange.set(sStart, sEnd);
nextChar(&curChar);
msp->qStrand = (BlxStrand)strtol(curChar, &curChar, 10);
nextChar(&curChar);
msp->qFrame = strtol(curChar, &curChar, 10);
nextChar(&curChar);
msp->qname = stringUnprotect(&curChar, NULL);
msp->sname = stringUnprotect(&curChar, NULL);
msp->desc = stringUnprotect(&curChar, NULL);
//DEBUG_EXIT("readMspFromText returning");
}
/* Insert the given MSP into the given list */
static void insertMsp(MSP *msp, MSP **mspList, MSP **lastMsp)
{
/* Add it to the list */
if (!*mspList)
{
/* Nothing in list yet: make this the first entry */
*mspList = msp;
}
if (*lastMsp)
{
/* Tag it on to the end of the list */
(*lastMsp)->next = msp;
}
/* Make the 'lastMsp' pointer point to the new end of the list */
*lastMsp = msp;
}
/* Allocate memory for an MSP and initialise all its fields to relevant 'empty' values.
* Add it into the given MSP list and make the end pointer ('lastMsp') point to the new
* end of the list. NB the msplist is obsolete and is being replaced by featureLists, but we don't
* add it to a feature list yet because we don't know its type. Returns a pointer to the newly-created MSP */
MSP* createEmptyMsp(MSP **lastMsp, MSP **mspList)
{
MSP *msp = new MSP;
int i = 0;
for ( ; i < BLXMODEL_NUM_MODELS; ++i)
msp->treePaths[i] = NULL;
msp->next = NULL;
msp->childMsps = NULL;
msp->type = BLXMSP_INVALID;
msp->score = 0.0;
msp->id = 0.0;
msp->phase = 0;
msp->qname = NULL;
msp->qFrame = UNSET_INT;
msp->sSequence = NULL;
msp->sname = msp->sname_orig = NULL;
msp->desc = NULL;
msp->style = NULL;
msp->fs = NULL;
msp->fsShape = BLXCURVE_BADSHAPE;
msp->xy = NULL;
msp->gaps = NULL;
insertMsp(msp, mspList, lastMsp);
return msp;
}
static void freeStringPointer(char **ptr)
{
if (*ptr)
{
g_free(*ptr);
*ptr = NULL;
}
}
/* Destroy all of the MSPs in the given list */
void destroyMspList(MSP **mspList)
{
/* Free the allocated sequences and names */
MSP *msp = NULL;
for (msp = *mspList; msp; msp = msp->next)
{
destroyMspData(msp);
}
/* Now free the MSPs themselves. */
MSP *fmsp = NULL;
for (msp = *mspList; msp; )
{
fmsp = msp;
msp = msp->next;
delete fmsp;
}
*mspList = NULL;
return ;
}
/* Free all of the memory used by an MSP */
void destroyMspData(MSP *msp)
{
freeStringPointer(&msp->qname);
freeStringPointer(&msp->sname);
freeStringPointer(&msp->sname_orig);
freeStringPointer(&msp->desc);
if (msp->gaps)
{
/* free the child msp list */
if (msp->childMsps)
{
g_list_free(msp->childMsps);
msp->childMsps = NULL;
}
/* free memory allocated for the gap ranges */
GSList *item = msp->gaps;
for ( ; item; item = item->next)
{
CoordRange *range = (CoordRange*)(item->data);
delete range;
}
g_slist_free(msp->gaps);
msp->gaps = NULL;
}
if (msp->xy)
{
g_array_free(msp->xy, TRUE);
msp->xy = NULL;
}
}
/* Allocates memory for an MSP and initialise all its fields to the given values.
* For backwards compatibility, adds it into the given MSP list and makes the end pointer
* ('lastMsp') point to the new end of the list. We will hopefully get rid of mspList eventually
* and replace it by featureLists. The new msp is added to the relevant list in the featureLists
* array according to its type. Returns a pointer to the newly-created MSP. Also creates a BlxSequence
* for this MSP's sequence name (or adds the MSP to the existing one, if it exists already),
* and adds that BlxSequence to the given seqList. Takes ownership of 'sequence'. */
MSP* createNewMsp(GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
const BlxMspType mspType,
BlxDataType *dataType,
const char *source,
const gdouble score,
const gdouble percentId,
const int phase,
const char *idTag,
const char *qName,
const int qStart,
const int qEnd,
const BlxStrand qStrand,
const int qFrame,
const char *sName,
const char *sName_orig,
const int sStart,
const int sEnd,
BlxStrand sStrand,
char *sequence,
const GQuark filename,
GHashTable *lookupTable,
BlxSequence *blxSeq,
GError **error)
{
MSP *msp = createEmptyMsp(lastMsp, mspList);
msp->type = mspType;
msp->score = score;
msp->id = percentId;
msp->phase = phase;
msp->filename = filename;
msp->qname = qName ? g_strdup(qName) : NULL;
msp->qFrame = qFrame;
msp->qStrand = qStrand;
msp->sname = sName ? g_strdup(sName) : NULL;
msp->sname_orig = sName_orig ? g_strdup(sName_orig) : NULL;
msp->qRange.set(qStart, qEnd);
msp->sRange.set(sStart, sEnd);
/* For exons, introns and basic features, the s strand is not applicable. We always want the exon
* to be in the same direction as the ref sequence, so set the match seq strand to be
* the same as the ref seq strand */
if (mspIsBoxFeature(msp) || mspIsIntron(msp))
{
sStrand = qStrand;
}
/* Add it to the relevant feature list. */
featureLists[msp->type] = g_array_append_val(featureLists[msp->type], msp);
/* For main feature types, add a new (or add to an existing) BlxSequence */
if (typeIsBasic(mspType) ||
typeIsExon(mspType) ||
typeIsIntron(mspType) ||
typeIsMatch(mspType) ||
typeIsVariation(mspType) ||
typeIsRegion(mspType))
{
addBlxSequences(msp->sname, msp->sname_orig, idTag, sStrand, dataType, source,
featureLists, lastMsp, mspList, seqList,
columnList, sequence, msp, lookupTable, blxSeq, error);
}
if (error && *error)
{
prefixError(*error, "Error creating MSP (ref seq='%s' [%d - %d], match seq = '%s' [%d - %d]). ",
qName, qStart, qEnd, sName, sStart, sEnd);
}
return msp;
}
/* Make a copy of an MSP. If addToParent is true it also copies the pointer to the parent
* BlxSequence and adds the new msp to that BlxSequence's mspList. Otherwise it's parent is null.
* If added to the parent, it will be added in sorted order if 'sort' is true, or random order
* if 'sort' is false (this is to avoid having to sort it every time if the caller intends to
* re-sort the list later anyway) */
MSP* copyMsp(const MSP* const src,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
const gboolean addToParent,
const gboolean sort)
{
MSP *msp = createEmptyMsp(lastMsp, mspList);
msp->type = src->type;
msp->score = UNSET_INT;
msp->id = UNSET_INT;
msp->phase = src->phase;
msp->qname = src->qname ? g_strdup(src->qname) : NULL;
msp->qFrame = src->qFrame;
msp->qStrand = src->qStrand;
msp->sname = src->sname ? g_strdup(src->sname) : NULL;
msp->sname_orig = src->sname_orig ? g_strdup(src->sname_orig) : NULL;
msp->qRange.set(src->qRange);
msp->sRange.set(src->sRange);
/* For matches, exons and introns, add (or add to if already exists) a BlxSequence */
if (addToParent && src->sSequence)
{
if (sort)
src->sSequence->mspList = g_list_insert_sorted(src->sSequence->mspList, msp, compareFuncMspPos);
else
src->sSequence->mspList = g_list_prepend(src->sSequence->mspList, msp);
msp->sSequence = src->sSequence;
}
/* Add it to the relevant feature list. */
featureLists[msp->type] = g_array_append_val(featureLists[msp->type], msp);
return msp;
}
/* Set the given child list in the given exon. Takes ownership of the child list
* (and frees it if exon is null).
* Exons and UTRs don't have phase, but we want to display them in the same reading frame
* as the CDS in the same exon, if there is one; this function copies it to its siblings. */
static void setExonChildList(MSP *exon,
GList *childList,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
MSP **spanningCds)
{
if (!exon)
{
g_list_free(childList);
return;
}
/* Take ownership of the child list */
if (exon->childMsps)
g_list_free(exon->childMsps);
exon->childMsps = childList;
/* Loop through and see if there's a CDS */
GError *tmpError = NULL;
int frame = UNSET_INT;
int phase = UNSET_INT;
gboolean found = FALSE;
GList *childItem = exon->childMsps;
for ( ; childItem; childItem = childItem->next)
{
MSP *cds = (MSP*)(childItem->data);
if (cds->type == BLXMSP_CDS)
{
frame = cds->qFrame;
phase = cds->phase;
found = TRUE;
/* Hack to support invalid gff from zmap where a single cds object spans the entire
* length rather than having separate cds objects for each exon. Trim the cds to the
* exon and "save" the cds to check against later exons. We should only have one cds in
* this case (we should verify this but don't at the moment). */
if (rangesOverlap(&cds->qRange, &exon->qRange) &&
(cds->qRange.min() < exon->qRange.min() || cds->qRange.max() > exon->qRange.max()))
{
/* Replace the original cds with a new one truncated to this exon */
int start = max(cds->qRange.min(), exon->qRange.min());
int end = min(cds->qRange.max(), exon->qRange.max());
MSP *newCds = createMissingMsp(BLXMSP_CDS, start, end, cds->qname, cds->qFrame, cds->style, cds->sSequence,
featureLists, lastMsp, mspList, seqList, columnList, lookupTable, &tmpError);
reportAndClearIfError(&tmpError, G_LOG_LEVEL_WARNING);
*spanningCds = cds;
exon->childMsps = g_list_remove(exon->childMsps, cds);
exon->childMsps = g_list_insert_sorted(exon->childMsps, newCds, compareFuncMspPos);
}
break;
}
}
if (found)
{
/* Update the exon */
exon->qFrame = frame;
exon->phase = phase;
/* Loop through and update the other msps (i.e. exon and UTR get the same frame/phase info
as the CDS) */
for (childItem = exon->childMsps; childItem; childItem = childItem->next)
{
MSP *msp = (MSP*)(childItem->data);
msp->qFrame = frame;
msp->phase = phase;
}
}
}
/* Utility to create the msp for the createMissingExonCdsUtr function. */
static MSP* createMissingMsp(const BlxMspType newType,
const int newStart,
const int newEnd,
const char *qname,
const int newFrame,
BlxStyle *newStyle,
BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
MSP *result = NULL;
if (newType != BLXMSP_INVALID)
{
/* Create the new exon/cds/utr */
DEBUG_OUT("Creating MSP for transcript '%s' of type %d.\n", blxSequenceGetName(blxSeq), newType);
GError *tmpError = NULL;
result = createNewMsp(featureLists, lastMsp, mspList, seqList, columnList, newType, NULL, blxSequenceGetSource(blxSeq),
UNSET_INT, UNSET_INT, UNSET_INT, blxSeq->idTag,
qname, newStart, newEnd, blxSeq->strand, newFrame,
blxSequenceGetName(blxSeq), blxSequenceGetName(blxSeq),
UNSET_INT, UNSET_INT, blxSeq->strand, NULL,
0, lookupTable, blxSeq, &tmpError);
result->style = newStyle;
if (tmpError)
{
prefixError(tmpError, "Error constructing missing exon/cds/utr [type='%d']", newType);
g_propagate_error(error, tmpError);
}
}
return result;
}
/* We have an exon and one or more child CDS/UTRs. Check whether there is a gap
* at the startor end of the exon and, if so, construct a CDS/UTR to fill it. */
static void createMissingCdsUtr(MSP *exon,
GList **childList,
BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
MSP *startMsp = (MSP*)(g_list_first(*childList)->data);
MSP *endMsp = (MSP*)(g_list_last(*childList)->data);
if (exon->qRange.min() < startMsp->qRange.min())
{
const BlxMspType type = (startMsp->type == BLXMSP_CDS ? BLXMSP_UTR : BLXMSP_CDS);
MSP *result = createMissingMsp(type, exon->qRange.min(), startMsp->qRange.min() - 1, exon->qname, exon->qFrame, exon->style, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
*childList = g_list_append(*childList, result);
}
if (exon->qRange.max() > endMsp->qRange.max())
{
const BlxMspType type = (endMsp->type == BLXMSP_CDS ? BLXMSP_UTR : BLXMSP_CDS);
MSP *result = createMissingMsp(type, endMsp->qRange.max() + 1, exon->qRange.max(), exon->qname, exon->qFrame, exon->style, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
*childList = g_list_append(*childList, result);
}
}
/* Create a UTR that spans the given exon, and add it to the given childList */
static void createMissingUtr(MSP *exon,
GList **childList,
BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
MSP *result = createMissingMsp(BLXMSP_UTR, exon->qRange.min(), exon->qRange.max(), exon->qname, exon->qFrame, exon->style, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
*childList = g_list_append(*childList, result);
}
/* Create an exon that spans the given child CDSs/UTRs. Must not be called with
* an empty childList. */
static MSP* createMissingExon(GList *childList,
BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
/* Get the max and min extent of the children. They should be in order
* of increasing coords and should not overlap etc. */
MSP *startMsp = (MSP*)(g_list_first(childList)->data);
MSP *endMsp = (MSP*)(g_list_last(childList)->data);
MSP *result = createMissingMsp(BLXMSP_EXON, startMsp->qRange.min(), endMsp->qRange.max(), startMsp->qname, startMsp->qFrame, startMsp->style, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
return result;
}
/* Utility used by constructExonData to create a missing exon/cds/utr given
* two others out of the three - i.e. if we have an overlapping exon and cds we can
* construct the corresponding utr. If created, the new msp is added to the given
* BlxSequence and the MSP list. If a CDS is given and no UTR exists, assume the exon
* spans the entire CDS (and similarly if a UTR is given but no CDS exists) */
static void createMissingExonCdsUtr(MSP **exon,
GList **childList,
BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
if (*exon && g_list_length(*childList) > 0)
{
/* We have an exon and one or more CDS/UTRs. Check if there any other
* child CDS/UTRs that we need to create. */
createMissingCdsUtr(*exon, childList, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
}
else if (*exon)
{
/* We have an exon but no children. Assume the exon is a single UTR */
createMissingUtr(*exon, childList, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
}
else if (g_list_length(*childList) > 0)
{
/* We have children but no exon; create the exon from the children */
*exon = createMissingExon(*childList, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, error);
}
}
/* Construct any missing exon data, i.e.
* - if we have a transcript and exons we can construct the introns;
* - if we have exons and CDSs we can construct the UTRs */
static void constructExonData(BlxSequence *blxSeq,
GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable)
{
GError *tmpError = NULL;
const MSP *prevMsp = NULL;
const MSP *prevExon = NULL;
MSP *curExon = NULL; /* the current exon we're looking at */
GList *curChildMsps = NULL; /* the child CDS/UTRs of the current exon */
MSP *spanningCds = NULL; /* hack to support invalid GFF used by zmap where a single CDS
* spanning the entire range is given, rather than a separate CDS
* feature for each exon */
/* Loop through all MSPs on this sequence (which must be sorted by position on the
* ref seq - createNewMsp automatically sorts them for us) and create any missing
* exon/cds/utr/introns. */
GList *mspItem = blxSeq->mspList;
gboolean finished = FALSE;
while (!finished)
{
MSP *msp = mspItem ? (MSP*)(mspItem->data) : NULL;
/* Only consider exons and introns */
if (mspIsExon(msp) || mspIsIntron(msp) || !msp)
{
/* See if there was a gap between this exon and the previous one. There's a gap if
* we have two exons with space between them, or if we're at the first or last exon
* and there's a gap to the end of the transcript. */
gboolean foundGap = FALSE;
if (msp && mspIsIntron(msp))
{
/* An intron IS a gap! */
foundGap = TRUE;
}
else if (msp && prevMsp)
{
/* We have a previous msp; there's a gap if the previous msp is an exon
* and if there is a gap between it and the current exon */
foundGap = mspIsExon(prevMsp) && !rangesOverlap(&prevMsp->qRange, &msp->qRange) && !rangesAdjacent(&prevMsp->qRange, &msp->qRange);
}
else if (msp)
{
/* No previous msp; check if we're at the first exon and if so whether
* there's a gap between it and the start of the transcript */
foundGap = blxSequenceGetStart(blxSeq, blxSeq->strand) < msp->qRange.min();
}
if (foundGap || msp == NULL)
{
/* We've found a gap between exons, or reached the end. First, see if the current exon/cds or utr
* is missing and construct it if possible. Also do this if we're at the last MSP. */
createMissingExonCdsUtr(&curExon, &curChildMsps, blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, &tmpError);
reportAndClearIfError(&tmpError, G_LOG_LEVEL_CRITICAL);
IntRange newRange;
if (prevExon && curExon && !mspIsIntron(msp) && !mspIsIntron(prevMsp))
{
/* Create an intron to span the gap */
newRange.set(prevExon->qRange.max() + 1, curExon->qRange.min() - 1);
}
else if (!prevExon && curExon && blxSequenceGetStart(blxSeq, blxSeq->strand) < curExon->qRange.min() &&
!mspIsIntron(msp) && !mspIsIntron(prevMsp))
{
/* Create an intron at the start */
newRange.set(blxSequenceGetStart(blxSeq, blxSeq->strand), curExon->qRange.min() - 1);
}
else if (msp == NULL && curExon && blxSequenceGetEnd(blxSeq, blxSeq->strand) > curExon->qRange.max() &&
!mspIsIntron(prevMsp))
{
/* Create an intron at the end */
newRange.set(curExon->qRange.max() + 1, blxSequenceGetEnd(blxSeq, blxSeq->strand));
}
if (curExon && newRange.isSet())
{
createNewMsp(featureLists, lastMsp, mspList, seqList, columnList, BLXMSP_INTRON, NULL, blxSequenceGetSource(blxSeq),
curExon->score, curExon->id, 0, blxSeq->idTag,
curExon->qname, newRange.min(), newRange.max(), blxSeq->strand, curExon->qFrame,
blxSequenceGetName(blxSeq), blxSequenceGetName(blxSeq),
UNSET_INT, UNSET_INT, blxSeq->strand, NULL,
0, lookupTable, blxSeq, &tmpError);
reportAndClearIfError(&tmpError, G_LOG_LEVEL_CRITICAL);
}
/* We're done with this exon, so set the exon's list of child msps
* and reset the pointers */
setExonChildList(curExon, curChildMsps, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, &spanningCds);
prevExon = curExon;
curExon = NULL;
curChildMsps = NULL;
}
if (msp && msp->type == BLXMSP_EXON)
{
curExon = msp;
/* If there's a spanning cds, add it to the child list for each exon */
if (spanningCds)
curChildMsps = g_list_append(curChildMsps, spanningCds);
}
else if (msp && (msp->type == BLXMSP_CDS || msp->type == BLXMSP_UTR))
{
curChildMsps = g_list_append(curChildMsps, msp);
}
/* Remember the last MSP we saw */
prevMsp = msp;
/* Proceed to the next MSP. We allow an extra loop with a NULL mspItem at the end, and then finish. */
if (mspItem)
mspItem = mspItem->next;
else
finished = TRUE;
}
else
{
/* Something that's not an exon/intron. Skip this BlxSequence. */
finished = TRUE;
}
}
if (spanningCds)
destroyMspFull(spanningCds, blxSeq, featureLists, lastMsp, mspList);
}
/* Construct any missing transcript data, i.e.
* - if we have multiple CDSs, copy the transcript so we can show each variant;
* - if we have a transcript and exons we can construct the introns;
* - if we have exons and CDSs we can construct the UTRs */
static void constructTranscriptData(GArray* featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
GHashTable *lookupTable,
GError **error)
{
GError *tmpError = NULL;
/* Loop through all transcripts */
GList *seqItem = *seqList;
while (seqItem)
{
BlxSequence *blxSeq = (BlxSequence*)(seqItem->data);
if (blxSeq->type != BLXSEQUENCE_TRANSCRIPT)
{
seqItem = seqItem->next;
continue;
}
/* Get a list of all CDS names in the transcript */
GList *cdsList = blxSequenceConstructCdsList(blxSeq);
const int numVariants = g_list_length(cdsList);
if (numVariants <= 1)
{
/* Only one variant so process it as it is */
findSequenceExtents(blxSeq);
constructExonData(blxSeq, featureLists, lastMsp, mspList, seqList, columnList, lookupTable);
seqItem = seqItem->next;
}
else
{
/* More than one variant: create copies of the transcript for each variant */
GList *cdsItem = cdsList;
for ( ; cdsItem && !tmpError; cdsItem = cdsItem->next)
{
GQuark cdsQuark = GPOINTER_TO_INT(cdsItem->data);
/* The copy is added to the end of seqList so it will be processed later as we continue
* to loop through the list */
copyBlxSequenceNamedCds(blxSeq, cdsQuark, featureLists, lastMsp, mspList, seqList, columnList, lookupTable, &tmpError);
}
/* We have made copies for each CDS but we don't need the original transcript so delete
* it. This removes the current seqItem from seqList so we have to increment the pointer
* before we delete it. */
seqItem = seqItem->next;
destroyBlxSequenceFull(blxSeq, featureLists, lastMsp, mspList, seqList);
}
g_list_free(cdsList);
}
if (tmpError)
g_propagate_error(error, tmpError);
}
/* Adjust the MSP's q coords (as parsed from the input file) by the given offset i.e. to convert
* them to real coords */
static void adjustMspCoordsByOffset(MSP *msp, const int offset)
{
if (offset != 0)
{
/* Convert the input coords (which are 1-based within the ref sequence section
* that we're dealing with) to "real" coords (i.e. coords that the user will see). */
msp->qRange.set(msp->qRange.min() + offset,
msp->qRange.max() + offset);
/* Gap coords are also 1-based, so convert those too */
GSList *rangeItem = msp->gaps;
for ( ; rangeItem; rangeItem = rangeItem->next)
{
CoordRange *curRange = (CoordRange*)(rangeItem->data);
curRange->qStart += offset;
curRange->qEnd += offset;
}
}
}
/* Find the first/last base in an entire sequence, if not already set. For transcripts, the
* range should already be set from the parent transcript item. For matches, get the start/end
* of the first/last MSP in the sequence */
static void findSequenceExtents(BlxSequence *blxSeq)
{
int start = findMspListQExtent(blxSeq->mspList, TRUE, BLXSTRAND_FORWARD);
int end = findMspListQExtent(blxSeq->mspList, FALSE, BLXSTRAND_FORWARD);
//if (start != UNSET_INT && end != UNSET_INT)
blxSeq->qRangeFwd.set(start, end);
start = findMspListQExtent(blxSeq->mspList, TRUE, BLXSTRAND_REVERSE);
end = findMspListQExtent(blxSeq->mspList, FALSE, BLXSTRAND_REVERSE);
//if (start != UNSET_INT && end != UNSET_INT)
blxSeq->qRangeRev.set(start, end);
}
/* Get the offset required from the given base to give the coord that is the first base in
* the first codon of reading frame 1 (or the last codon in reading frame 3 for the reverse strand) */
static int getOffsetToCodonStart(const int coord, const int numFrames, const BlxStrand strand)
{
int offset = 0;
if (strand == BLXSTRAND_FORWARD)
{
/* If the sequence is
* 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 ...
* then the calculated base below will be
* 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, ...
* so we have to offset the coords by the following values to get to a base1 coord
* 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2, ...
*/
int base = ((coord - 1) % numFrames); /* 0, 1 or 2 */
offset = numFrames - base; /* 3, 2 or 1 */
if (offset >= numFrames)
offset -= numFrames; /* 0, 2 or 1 */
}
else
{
/* I'm not sure if there is a convention for where the reading frame starts in the reverse
* strand, so I've made up my own convention. It essentially means that we want the first
* coord in the reversed sequence to be the last base in the last reading frame, i.e. base 3 in frame 3.
*
* If the forward strand coords are
* 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
* then the have the following base numbers for each frame
* frame 1: 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2
* frame 2: 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1
* frame 3: 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3 (I've included up to coord 11 so we end at base 3 in frame 3)
*
* Looking at frame 1 in reverse we have
* 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1
* 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1
*
* Base 3 in frame 3 is base 2 in frame 1, so this is where we want to start. The offsets we need
* to get to a frame1-base2 coord are:
* 0, 2, 1, 0, 2, 1, 0, 2, 1, 0, 2
*/
int base = (coord + 1) % numFrames; /* 0, 2 or 1 */
offset = base;
}
return offset;
}
/* Calculate the reference sequence reading frame that the given MSP belongs to, if not
* already set. Requires either the phase to be set, or the frame to already be set; otherwise
* assumes a phase of 0 and gives a warning. */
static void calcReadingFrame(MSP *msp, const BlxSeqType seqType, const int numFrames, const IntRange* const refSeqRange)
{
/* For matches and exons, calculate frame if the phase is known, because the old code that
* used to pass the reading frame in exblx files seemed to occasionally pass an incorrect reading frame. */
if (!mspIsIntron(msp))
{
/* Get the first coord of the first complete codon. This is the start coord (5' end) of the match
* plus (or minus) the phase (if non-zero), which initially gets stored in the qFrame field in the MSP... */
const int direction = (msp->qStrand == BLXSTRAND_FORWARD ? 1 : -1);
const int coord = mspGetQStart(msp) + (direction * msp->phase);
/* Find the reading frame that this coord belongs in. This is the same as the base number within
* reading frame 1. */
int frame = UNSET_INT;
const gboolean invertCoords = (mspGetRefStrand(msp) == BLXSTRAND_REVERSE);
convertDnaIdxToDisplayIdx(coord, seqType, 1, numFrames, invertCoords, refSeqRange, &frame);
if (frame > 0)
{
if (msp->qFrame > 0 && mspIsExon(msp))
{
/* Frame is already set. This means we have the old exblx file format, which does not provide phase for exons
* so we must use the reading frame that was passed in the file. However, this used to assume that the first base
* in the ref seq was base 1 in reading frame 1, which is not always the case (we now calculate the correct reading frame
* based on mod3 of the coord). Therefore, we must offset the given frame if the first coord is not base1 in frame1. */
const int startCoord = (msp->qStrand == BLXSTRAND_REVERSE ? refSeqRange->max() : refSeqRange->min());
const int offset = getOffsetToCodonStart(startCoord, numFrames, msp->qStrand);
msp->qFrame += offset;
if (msp->qFrame > numFrames)
{
msp->qFrame -= numFrames;
}
if (msp->qFrame != frame && seqType == BLXSEQ_PEPTIDE)
{
g_warning("MSP '%s' (q=%d-%d; s=%d-%d) has reading frame '%d' but calculated frame was '%d'\n", mspGetSName(msp), msp->qRange.min(), msp->qRange.max(), msp->sRange.min(), msp->sRange.max(), msp->qFrame, frame);
}
}
else
{
/* We either have the new file format which provides phase or it's not an exon so phase
* is not applicable, so we can trust the calculated value. */
msp->qFrame = frame;
}
}
if (msp->qFrame == UNSET_INT)
{
g_warning("Reading frame could not be calculated for MSP '%s' (q=%d-%d; s=%d-%d) - setting to 1.\n", mspGetSName(msp), msp->qRange.min(), msp->qRange.max(), msp->sRange.min(), msp->sRange.max());
msp->qFrame = 1;
}
}
}
/* Should be called after all parsed data has been added to a BlxSequence. Calculates summary
* data and the introns etc. */
void finaliseBlxSequences(GArray* featureLists[],
MSP **mspList,
GList **seqList,
GList *columnList,
const int offset,
const BlxSeqType seqType,
const int numFrames,
const IntRange* const refSeqRange,
const gboolean calcFrame,
GHashTable *lookupTable)
{
GError *tmpError = NULL;
/* Loop through all MSPs and adjust their coords by the offest, then calculate their reading
* frame. Also find the last MSP in the list. */
MSP *msp = *mspList;
MSP *lastMsp = msp;
while (msp)
{
adjustMspCoordsByOffset(msp, offset);
if (calcFrame)
calcReadingFrame(msp, seqType, numFrames, refSeqRange);
msp = msp->next;
if (msp)
lastMsp = msp;
}
/* Loop through all BlxSequences */
GList *seqItem = *seqList;
for ( ; seqItem; seqItem = seqItem->next)
{
/* So far we only have the forward strand version of each sequence. We must complement any
* that need the reverse strand */
BlxSequence *blxSeq = (BlxSequence*)(seqItem->data);
if (blxSeq &&
blxSeq->strand == BLXSTRAND_REVERSE &&
blxSequenceGetFlag(blxSeq, MSPFLAG_STRAND_SPECIFIC) &&
blxSequenceGetFlag(blxSeq, MSPFLAG_SHOW_REVERSE_STRAND) &&
blxSequenceGetSequence(blxSeq))
{
char *sequence = g_strdup(blxSequenceGetSequence(blxSeq));
blxComplement(sequence);
blxSequenceSetValueFromString(blxSeq, BLXCOL_SEQUENCE, sequence);
}
}
/* We need to construct any missing transcript data */
constructTranscriptData(featureLists, &lastMsp, mspList, seqList, columnList, lookupTable, &tmpError);
prefixError(tmpError, "Error constructing transcript data: ");
reportAndClearIfError(&tmpError, G_LOG_LEVEL_CRITICAL);
/* We need to clear GFF ID flags once we've finished importing a file so that they don't clash
* with IDs from any other files that the user may import later. */
for (seqItem = *seqList; seqItem; seqItem = seqItem->next)
blxSequenceClearGFFIds((BlxSequence*)(seqItem->data));
/* Sort msp arrays by start coord (only applicable to msp types that
* appear in the detail-view because the order is only applicable when
* filtering detail-view rows) */
int typeId = 0;
for ( ; typeId < BLXMSP_NUM_TYPES; ++typeId)
{
if (typeShownInDetailView((BlxMspType)typeId))
g_array_sort(featureLists[typeId], compareFuncMspArray);
}
}
/* Given a list of msps, find the min or max q coords (according to the given flag)
* for msps on the given q strand (or on both strands if strand is BLXSTRAND_NONE. */
int findMspListQExtent(GList *mspList, const gboolean findMin, const BlxStrand strand)
{
int result = UNSET_INT;
gboolean first = TRUE;
GList *mspItem = mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP* const msp = (const MSP*)(mspItem->data);
if (msp->qStrand == strand || strand == BLXSTRAND_NONE)
{
if (first)
{
result = findMin ? msp->qRange.min() : msp->qRange.max();
first = FALSE;
}
else if (findMin && msp->qRange.min() < result)
{
result = msp->qRange.min();
}
else if (!findMin && msp->qRange.max() > result)
{
result = msp->qRange.max();
}
}
}
return result;
}
/* Given a list of msps, find the min or max s coords, according to the given flag. */
int findMspListSExtent(GList *mspList, const gboolean findMin)
{
int result = UNSET_INT;
gboolean first = TRUE;
GList *mspItem = mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP* const msp = (const MSP*)(mspItem->data);
if (first)
{
result = findMin ? msp->sRange.min() : msp->sRange.max();
first = FALSE;
}
else if (findMin && msp->sRange.min() < result)
{
result = msp->sRange.min();
}
else if (!findMin && msp->sRange.max() > result)
{
result = msp->sRange.max();
}
}
return result;
}
/* Get the default value for the given flag */
gboolean mspFlagGetDefault(const MspFlag flag)
{
gboolean result = FALSE;
if (flag > MSPFLAG_MIN && flag < MSPFLAG_NUM_FLAGS)
{
/* The defaults are populated when we create a BlxDataType,
* so create a dummy one so that we can access them. This
* is made a global so that we can also change the defaults. */
if (!g_DefaultDataType)
g_DefaultDataType = createBlxDataType();
if (g_DefaultDataType)
result = g_DefaultDataType->flags[flag];
else
g_critical("Program error: Failed to create default data-type struct. Default feature properties may be incorrect.\n");
}
else
{
g_critical("Program error: attempt to use unknown MSP flag '%d'\n", flag);
}
return result;
}
/* Set the default value for the given flag */
void mspFlagSetDefault(const MspFlag flag, const gboolean value)
{
if (flag > MSPFLAG_MIN && flag < MSPFLAG_NUM_FLAGS)
{
/* The defaults are populated when we create a BlxDataType,
* so create a dummy one so that we can access and set them. */
if (!g_DefaultDataType)
g_DefaultDataType = createBlxDataType();
if (g_DefaultDataType)
g_DefaultDataType->flags[flag] = value;
}
else
{
g_critical("Program error: attempt to use unknown MSP flag '%d'\n", flag);
}
}
/* Returns the colinearity of the two msps */
ColinearityType mspIsColinear(const MSP* const msp1, const MSP* const msp2)
{
ColinearityType result = COLINEAR_INVALID;
if (msp1 && msp2 && msp1->qStrand == msp2->qStrand &&
msp1->sSequence && msp2->sSequence &&
msp1->sSequence->strand == msp2->sSequence->strand)
{
if (msp2->sRange.min() < msp1->sRange.max())
result = COLINEAR_NOT;
else if (msp2->sRange.min() == msp1->sRange.max() + 1)
result = COLINEAR_PERFECT;
else
result = COLINEAR_IMPERFECT;
}
return result;
}
/* Return the value of the given boolean flag */
gboolean dataTypeGetFlag(const BlxDataType* const dataType, const MspFlag flag)
{
gboolean result = mspFlagGetDefault(flag);
if (flag > MSPFLAG_MIN && flag < MSPFLAG_NUM_FLAGS)
{
if (dataType)
result = dataType->flags[flag];
}
else
{
g_critical("Program error: attempt to use unknown MSP flag '%d'\n", flag);
}
return result;
}
/* Return the value of the given boolean flag. */
gboolean blxSequenceGetFlag(const BlxSequence* const blxSeq, const MspFlag flag)
{
gboolean result = mspFlagGetDefault(flag);
if (blxSeq)
result = dataTypeGetFlag(blxSeq->dataType, flag);
return result;
}
/* Return the value of the given boolean flag */
gboolean mspGetFlag(const MSP* const msp, const MspFlag flag)
{
gboolean result = mspFlagGetDefault(flag);
if (msp)
result = blxSequenceGetFlag(msp->sSequence, flag);
return result;
}
/* Get the config key to use for the given flag */
const char* mspFlagGetConfigKey(const MspFlag flag)
{
const char *result = NULL;
if (flag > MSPFLAG_MIN && flag < MSPFLAG_NUM_FLAGS)
{
/* To make sure we don't access the array out of bounds, loop
* through from the beginning checking that no values are "dummy".
* The array is terminated with a "dummy" value, so if we find this
* before we find our flag, there must be enum values that haven't
* been added to the array, which is a programming error. */
int i = MSPFLAG_MIN + 1;
for ( ; i <= flag; ++i)
{
if (stringsEqual(g_MspFlagConfigKeys[i], "dummy", FALSE))
{
g_critical("Program error: MSP flag '%d' does not have a config key defined\n", flag);
break;
}
else if (i == flag)
{
result = g_MspFlagConfigKeys[i];
break;
}
}
}
else
{
g_critical("Program error: Tried to use an unknown MSP flag '%d'\n", flag);
}
return result;
}
/* Determine the type of BlxSequence that a particular MSP type belongs to */
static BlxSequenceType getBlxSequenceTypeForMsp(const BlxMspType mspType)
{
BlxSequenceType result = BLXSEQUENCE_UNSET;
if (mspType == BLXMSP_MATCH)
{
result = BLXSEQUENCE_MATCH;
}
else if (typeIsExon(mspType) || typeIsIntron(mspType) || mspType == BLXMSP_TRANSCRIPT)
{
result = BLXSEQUENCE_TRANSCRIPT;
}
else if (typeIsVariation(mspType))
{
result = BLXSEQUENCE_VARIATION;
}
else if (mspType == BLXMSP_REGION)
{
result = BLXSEQUENCE_REGION;
}
return result;
}
/* Utility to get the unique key for a given text string and strand */
static GQuark getLookupKey(const char *text, const BlxStrand strand)
{
char *keyStr = g_strdup_printf("%s%c", text, (strand == BLXSTRAND_FORWARD ? '+' : '-'));
GQuark key = g_quark_from_string(keyStr);
g_free(keyStr);
return key;
}
/* Utility to find a blxsequence with the given name/id/strand in the
* given hash table. Returns null if it is not there. */
static BlxSequence* findBlxSequence(GHashTable *lookupTable,
const char *name,
const char *idTag,
const BlxStrand strand,
const gboolean linkFeaturesByName)
{
BlxSequence *result = NULL;
if (idTag)
{
/* We compare on the id tag and strand, so combine these into a single
* string and convert it to a quark for quicker comparisions.
* (This is the key for the hash table.) */
GQuark key = getLookupKey(idTag, strand);
result = (BlxSequence*)g_hash_table_lookup(lookupTable, GINT_TO_POINTER(key));
}
if (!result && name && linkFeaturesByName)
{
/* No id tag is given but we are asked to link features with the same
* name, so do the comparison using name and strand */
GQuark key = getLookupKey(name, strand);
result = (BlxSequence*)g_hash_table_lookup(lookupTable, GINT_TO_POINTER(key));
}
return result;
}
/* Sort two columns by index */
gint columnIdxCompareFunc(gconstpointer a, gconstpointer b)
{
BlxColumnInfo *col1 = (BlxColumnInfo*)a;
BlxColumnInfo *col2 = (BlxColumnInfo*)b;
return col1->columnIdx - col2->columnIdx;
}
/* Sort two columns by ID */
static gint columnIdCompareFunc(gconstpointer a, gconstpointer b)
{
BlxColumnInfo *col1 = (BlxColumnInfo*)a;
BlxColumnInfo *col2 = (BlxColumnInfo*)b;
return col1->columnId - col2->columnId;
}
/* Create a new sequence with the given name and/or ID tag */
static BlxSequence* createBlxSequence(const char *name,
const char *idTag,
const BlxStrand strand,
BlxDataType *dataType,
const char *source,
GList *columnList)
{
BlxSequence *seq = createEmptyBlxSequence();
/* Set the hard-coded values */
seq->strand = strand;
seq->dataType = dataType;
if (idTag)
seq->idTag = g_strdup(idTag);
/* Allocate the list of values and initialise the value types
* to the relevant type for that column */
//const int numColumns = g_list_length(columnList);
seq->values = g_array_new(FALSE, FALSE, sizeof(GValue));
/* Sort the columns by column ID (NOT column index) so that we
* can easily index on the ID when looking up values in the array */
columnList = g_list_sort(columnList, columnIdCompareFunc);
GList *item = columnList;
for ( ; item; item = item->next)
{
/* Note that we index on columnId, not columnIdx. This is so that
* we can quickly index on the columnId enum. The columnIdx represents
* the display order, which is not relevant here. */
BlxColumnInfo * columnInfo = (BlxColumnInfo*)(item->data);
GType type = columnInfo->type;
/* Bit of a hack; the sequence column type is pointer because we
* pass a pointer to the msp to the cell renderer, but here we want to
* store the actual sequence string */
if (columnInfo->columnId == BLXCOL_SEQUENCE)
type = G_TYPE_STRING;
GValue value = {0};
g_value_init(&value, type);
g_array_append_val(seq->values, value);
}
/* Set the given name and source */
blxSequenceSetValueFromString(seq, BLXCOL_SEQNAME, name ? name : idTag);
blxSequenceSetValueFromString(seq, BLXCOL_SOURCE, source);
/* Make sure we change back to the original sort order (sorted by index) */
columnList = g_list_sort(columnList, columnIdxCompareFunc);
return seq;
}
/* Wrapper for addBlxSequence to add multiple sequences. The idTag might be a comma-separated
* list of parent IDs, in which case we need to add the msp to multiple BlxSequences (creating
* those BlxSequences if they don't exist. */
static void addBlxSequences(const char *name,
const char *name_orig,
const char *idTag,
BlxStrand strand,
BlxDataType *dataType,
const char *source,
GArray *featureLists[],
MSP **lastMsp,
MSP **mspList,
GList **seqList,
GList *columnList,
char *sequence,
MSP *msp_in,
GHashTable *lookupTable,
BlxSequence *blxSeq,
GError **error)
{
GError *tmpError = NULL;
MSP *msp = msp_in;
if (blxSeq)
{
/* Add to existing blx sequence */
addBlxSequence(msp->sname, msp->sname_orig, idTag, strand, dataType, source, seqList, columnList, sequence, msp, lookupTable, blxSeq, &tmpError);
}
else if (idTag)
{
/* For exons and introns, the ID tag we receive is the parent tag, and it may contain
* multiple parent transcripts. In this case we need to add the msp to multiple parent
* BlxSequences */
char **tokens = g_strsplit_set(idTag, ",", -1); /* -1 means do all tokens. */
char **token = tokens;
gboolean usedMsp = FALSE;
while (token && *token && **token && !tmpError)
{
/* If we've already used the passed-in msp, then we need to make a copy of it to
* add to the next BlxSequence (because the msp points to its BlxSequence so can't
* be added to multiple BlxSequences, at least at the moment) */
if (usedMsp)
msp = copyMsp(msp, featureLists, lastMsp, mspList, FALSE, FALSE);
if (!tmpError)
addBlxSequence(msp->sname, msp->sname_orig, *token, strand,
dataType, source, seqList, columnList, sequence, msp, lookupTable, NULL, &tmpError);
usedMsp = TRUE;
++token;
}
g_strfreev(tokens);
}
else
{
addBlxSequence(msp->sname, msp->sname_orig, idTag, strand, dataType, source, seqList, columnList, sequence, msp, lookupTable, NULL, &tmpError);
}
if (tmpError)
g_propagate_error(error, tmpError);
}
/* Add or create a BlxSequence struct, creating the BlxSequence if one does not
* already exist for the MSP's sequence name. Seperate BlxSequence structs are created
* for the forward and reverse strands of the same sequence. The passed-in sequence
* should always be forwards, and we reverse complement it here if we need the
* reverse strand. Returns the new BlxSequence */
BlxSequence* addBlxSequence(const char *name,
const char *name_orig,
const char *idTag,
BlxStrand strand,
BlxDataType *dataType,
const char *source,
GList **seqList,
GList *columnList,
char *sequence,
MSP *msp,
GHashTable *lookupTable,
BlxSequence *blxSeq_in,
GError **error)
{
BlxSequence *blxSeq = blxSeq_in;
if (blxSeq || name || idTag)
{
/* If this is an exon, intron or basic feature the match strand is not applicable. The exon should
* be in the same direction as the ref seq, so use the ref seq strand. */
if (msp && (mspIsBoxFeature(msp) || mspIsIntron(msp)))
{
strand = msp->qStrand;
}
/* See if this sequence already exists. This matches on name (if linkFeaturesByName is
* true) or on tag, and strand. */
gboolean linkFeaturesByName = dataTypeGetFlag(dataType, MSPFLAG_LINK_FEATURES_BY_NAME);
if (!blxSeq)
blxSeq = findBlxSequence(lookupTable, name, idTag, strand, linkFeaturesByName);
if (!blxSeq)
{
/* Create a new BlxSequence, and take ownership of the passed in sequence (if any) */
blxSeq = createBlxSequence(name, idTag, strand, dataType, source, columnList);
/* Add it to the return sequence list (must append it because this function can be
* called from within a loop which relies on new sequences being appended) */
*seqList = g_list_prepend(*seqList, blxSeq);
/* Add an entry to the lookup table (add an entry for both id and name, if given,
* because the next feature may have only one or the other set.) */
if (idTag)
g_hash_table_insert(lookupTable, GINT_TO_POINTER(getLookupKey(idTag, strand)), blxSeq);
if (name && linkFeaturesByName)
g_hash_table_insert(lookupTable, GINT_TO_POINTER(getLookupKey(name, strand)), blxSeq);
}
else
{
if (dataType && !blxSeq->dataType)
blxSeq->dataType = dataType;
else if (dataType && blxSeq->dataType != dataType)
g_warning("Duplicate sequences have different data types [name=%s, ID=%s, strand=%d, orig type=%s, new type=%s].\n", name, idTag, strand, g_quark_to_string(blxSeq->dataType->name), g_quark_to_string(dataType->name));
const char *oldSource = blxSequenceGetSource(blxSeq);
if (source && !oldSource)
blxSequenceSetValueFromString(blxSeq, BLXCOL_SOURCE, source);
else if (source && !stringsEqual(oldSource, source, FALSE))
g_warning("Duplicate sequences have different sources [name=%s, ID=%s, strand=%d, orig source=%s, new source=%s].\n", name, idTag, strand, oldSource, source);
}
if (name && !blxSequenceGetName(blxSeq))
{
/* It's possible that the BlxSequence was created without a name if we found an
* unnamed child exon before we found the parent transcript, so set the name if we have it. */
blxSequenceSetValueFromString(blxSeq, BLXCOL_SEQNAME, name);
/* Add an entry to the lookup table keyed on name, now that we know it */
if (linkFeaturesByName)
g_hash_table_insert(lookupTable, GINT_TO_POINTER(getLookupKey(name, strand)), blxSeq);
}
if (msp)
{
/* Add the MSP to the BlxSequence's list. Keep it sorted by position. */
blxSeq->mspList = g_list_insert_sorted(blxSeq->mspList, msp, compareFuncMspPos);
msp->sSequence = blxSeq;
if (blxSeq->type == BLXSEQUENCE_UNSET)
{
blxSeq->type = getBlxSequenceTypeForMsp(msp->type);
}
else if (blxSeq->type != getBlxSequenceTypeForMsp(msp->type))
{
g_warning("Adding MSP of type %d to parent of type %d (expected parent type to be %d)\n",
msp->type, blxSeq->type, getBlxSequenceTypeForMsp(msp->type));
}
}
/* Add the sequence data */
addBlxSequenceData(blxSeq, sequence, error);
}
else
{
g_set_error(error, BLX_ERROR, 1, "Sequence name or parent ID must be set.\n");
}
return blxSeq;
}
/* Add the given sequence data to a BlxSequence. Validates that the existing sequence data is
* either null or is the same as the new data; sets the given error if not. We claim ownership
* of the given sequence data (either the BlxSequence owns it, or we delete it if it is not
* required). The given sequence should always be the forward strand; we complement it ourselves
* here if this BlxSequence requires the reverse strand. */
void addBlxSequenceData(BlxSequence *blxSeq, char *sequence, GError **error)
{
if (!sequence)
{
return;
}
gboolean sequenceUsed = FALSE;
const char *oldSequence = blxSequenceGetSequence(blxSeq);
if (blxSeq && blxSequenceRequiresSeqData(blxSeq))
{
if (!oldSequence)
{
/* Sequence does not yet exist, so add it */
blxSequenceSetValueFromString(blxSeq, BLXCOL_SEQUENCE, sequence);
sequenceUsed = TRUE;
}
else if (error && *error)
{
/* Sequence already exists. Validate that it's the same as the existing one. */
if (!stringsEqual(sequence, oldSequence, FALSE))
{
g_set_error(error, BLX_ERROR, BLX_ERROR_SEQ_DATA_MISMATCH, "Sequence data for '%s' does not match previously-found data.\n", blxSequenceGetName(blxSeq));
}
}
}
if (!sequenceUsed)
{
g_free(sequence);
}
}
/***********************************************************
* Columns
***********************************************************/
/* Creates a data "column" from the given info and adds it to the columnList. */
void blxColumnCreate(BlxColumnId columnId,
const gboolean createHeader,
const char *title,
GType type,
const char *propertyName,
const int defaultWidth,
const gboolean dataLoaded,
const gboolean showColumn,
const gboolean showSummary,
const gboolean canShowSummary,
const gboolean searchable,
const char *sortName,
const char *emblId,
const char *emblTag,
GList **columnList)
{
/* Create a simple label for the header (unless told not to) */
GtkWidget *headerWidget = NULL;
if (createHeader)
{
headerWidget = createLabel(title, 0.0, 1.0, TRUE, TRUE, TRUE);
gtk_widget_set_size_request(headerWidget, defaultWidth, -1);
}
/* Create the column info */
BlxColumnInfo *columnInfo = new BlxColumnInfo;
static int columnIdx = 0;
columnInfo->columnIdx = columnIdx;
++columnIdx;
columnInfo->columnId = columnId;
columnInfo->headerWidget = headerWidget;
columnInfo->refreshFunc = NULL;
columnInfo->title = title;
columnInfo->propertyName = propertyName;
columnInfo->width = defaultWidth;
columnInfo->sortName = sortName;
columnInfo->emblId = g_quark_from_string(emblId);
columnInfo->emblTag = g_quark_from_string(emblTag);
columnInfo->dataLoaded = TRUE;
columnInfo->showColumn = showColumn;
columnInfo->showSummary = showSummary;
columnInfo->canShowSummary = canShowSummary;
columnInfo->searchable = searchable;
columnInfo->type = type;
/* Place it in the list. List must be sorted in the same order
* as the GtkListStore or gtk_list_store_set fails */
*columnList = g_list_insert_sorted(*columnList, columnInfo, columnIdxCompareFunc);
}
/* Create a list of CDS names in a transcript. If there are multiple names it means we have
* e.g. different start codons and we need to create multiple versions of the transcript */
GList* blxSequenceConstructCdsList(BlxSequence *seq)
{
GList *result = NULL;
/* If none of the CDSs have names, that's fine - we just assume they're all the same. It's
* ambiguous what we should do if some have names and others don't, though. I guess we just have
* to lump all the nameless ones together. */
if (seq && seq->type == BLXSEQUENCE_TRANSCRIPT && seq->mspList && g_list_length(seq->mspList) > 0)
{
GList *mspItem = seq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP *msp = (const MSP*)(mspItem->data);
if (msp->type == BLXMSP_CDS)
{
GQuark name = 0;
if (msp->sname)
name = g_quark_from_string(msp->sname);
if (!g_list_find(result, GINT_TO_POINTER(name)))
result = g_list_append(result, GINT_TO_POINTER(name));
}
}
}
return result;
}
/***********************************************************
* Sequence manipulation *
***********************************************************/
/* Get the spliced sequence for a given transcript. The result should be free'd by the caller
* with g_free. Returns null and sets the error if there was a problem. */
char *blxSequenceGetSplicedSequence(const BlxSequence* const blxSeq,
const char *refSeq,
const IntRange* const refSeqRange,
GError **error)
{
char *result = NULL;
g_return_val_if_fail(blxSeq && blxSeq->type == BLXSEQUENCE_TRANSCRIPT, result);
GString *resultStr = g_string_new(NULL);
const int refSeqLen = strlen(refSeq);
GList *mspItem = blxSeq->mspList;
for ( ; mspItem; mspItem = mspItem->next)
{
const MSP* msp = (const MSP*)(mspItem->data);
/* Ignore msps that have child msps (we just want to export the child msps) */
if (mspIsBoxFeature(msp) && !msp->childMsps)
{
int i = msp->qRange.min() - refSeqRange->min(); /* convert to 0-based index into ref seq */
/* It's possible that some exons may be out of bounds: clip them. */
if (i < 0)
i = 0;
int iMax = msp->qRange.max() - refSeqRange->min();
if (iMax >= refSeqLen)
iMax = refSeqLen - 1;
for ( ; i <= iMax; ++i)
{
if (i > 0 && i < refSeqLen)
g_string_append_c(resultStr, refSeq[i]);
}
}
}
if (resultStr->len > 0)
{
g_string_append_c(resultStr, '\0'); /* make sure it's null terminated */
result = g_string_free(resultStr, FALSE);
/* If the result is empty, set the error. */
if (!result || *result == 0)
{
g_set_error(error, BLX_ERROR, BLX_ERROR_SEQ_SEGMENT, "Failed to find sequence for transcript");
if (result)
{
g_free(result);
result = NULL;
}
}
}
else
{
g_string_free(resultStr, TRUE);
}
return result;
}
|