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
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "LocalAccessible-inl.h"
#include "AccIterator.h"
#include "AccAttributes.h"
#include "ARIAMap.h"
#include "CachedTableAccessible.h"
#include "DocAccessible-inl.h"
#include "EventTree.h"
#include "HTMLImageMapAccessible.h"
#include "Relation.h"
#include "mozilla/ProfilerMarkers.h"
#include "nsAccUtils.h"
#include "nsEventShell.h"
#include "nsIIOService.h"
#include "nsLayoutUtils.h"
#include "nsTextEquivUtils.h"
#include "mozilla/a11y/Role.h"
#include "TreeWalker.h"
#include "xpcAccessibleDocument.h"
#include "AnchorPositioningUtils.h"
#include "nsIDocShell.h"
#include "mozilla/dom/Document.h"
#include "nsPIDOMWindow.h"
#include "nsIContentInlines.h"
#include "nsIEditingSession.h"
#include "nsIFrame.h"
#include "nsIInterfaceRequestorUtils.h"
#include "nsImageFrame.h"
#include "nsIMutationObserver.h"
#include "nsIURI.h"
#include "nsIWebNavigation.h"
#include "nsFocusManager.h"
#include "mozilla/AppShutdown.h"
#include "mozilla/Assertions.h"
#include "mozilla/Components.h" // for mozilla::components
#include "mozilla/EditorBase.h"
#include "mozilla/HTMLEditor.h"
#include "mozilla/PerfStats.h"
#include "mozilla/PresShell.h"
#include "mozilla/ScrollContainerFrame.h"
#include "nsAccessibilityService.h"
#include "mozilla/a11y/DocAccessibleChild.h"
#include "mozilla/dom/AncestorIterator.h"
#include "mozilla/dom/BrowserChild.h"
#include "mozilla/dom/DocumentType.h"
#include "mozilla/dom/Element.h"
#include "mozilla/dom/ElementInlines.h"
#include "mozilla/dom/HTMLSelectElement.h"
#include "mozilla/dom/UserActivation.h"
using namespace mozilla;
using namespace mozilla::a11y;
////////////////////////////////////////////////////////////////////////////////
// Static member initialization
static nsStaticAtom* const kRelationAttrs[] = {
nsGkAtoms::aria_labelledby, nsGkAtoms::aria_describedby,
nsGkAtoms::aria_details, nsGkAtoms::aria_owns,
nsGkAtoms::aria_controls, nsGkAtoms::aria_flowto,
nsGkAtoms::aria_errormessage, nsGkAtoms::_for,
nsGkAtoms::control, nsGkAtoms::popovertarget,
nsGkAtoms::commandfor, nsGkAtoms::aria_activedescendant,
nsGkAtoms::aria_actions};
static const uint32_t kRelationAttrsLen = std::size(kRelationAttrs);
static nsStaticAtom* const kSingleElementRelationIdlAttrs[] = {
nsGkAtoms::popovertarget, nsGkAtoms::commandfor};
////////////////////////////////////////////////////////////////////////////////
// Constructor/desctructor
DocAccessible::DocAccessible(dom::Document* aDocument,
PresShell* aPresShell)
: // XXX don't pass a document to the LocalAccessible constructor so that
// we don't set mDoc until our vtable is fully setup. If we set mDoc
// before setting up the vtable we will call LocalAccessible::AddRef()
// but not the overrides of it for subclasses. It is important to call
// those overrides to avoid confusing leak checking machinary.
HyperTextAccessible(nullptr, nullptr),
// XXX aaronl should we use an algorithm for the initial cache size?
mAccessibleCache(kDefaultCacheLength),
mNodeToAccessibleMap(kDefaultCacheLength),
mDocumentNode(aDocument),
mLoadState(eTreeConstructionPending),
mDocFlags(0),
mViewportCacheDirty(false),
mLoadEventType(0),
mPrevStateBits(0),
mPresShell(aPresShell),
mIPCDoc(nullptr) {
mGenericTypes |= eDocument;
mStateFlags |= eNotNodeMapEntry;
mDoc = this;
MOZ_ASSERT(mPresShell, "should have been given a pres shell");
mPresShell->SetDocAccessible(this);
}
DocAccessible::~DocAccessible() {
NS_ASSERTION(!mPresShell, "LastRelease was never called!?!");
}
////////////////////////////////////////////////////////////////////////////////
// nsISupports
NS_IMPL_CYCLE_COLLECTION_CLASS(DocAccessible)
NS_IMPL_CYCLE_COLLECTION_TRAVERSE_BEGIN_INHERITED(DocAccessible,
LocalAccessible)
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mNotificationController)
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mChildDocuments)
for (const auto& hashEntry : tmp->mDependentIDsHashes.Values()) {
for (const auto& providers : hashEntry->Values()) {
for (int32_t provIdx = providers->Length() - 1; provIdx >= 0; provIdx--) {
NS_CYCLE_COLLECTION_NOTE_EDGE_NAME(
cb, "content of dependent ids hash entry of document accessible");
const auto& provider = (*providers)[provIdx];
cb.NoteXPCOMChild(provider->mContent);
}
}
}
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mAccessibleCache)
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mAnchorJumpElm)
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mInvalidationList)
NS_IMPL_CYCLE_COLLECTION_TRAVERSE(mPendingUpdates)
for (const auto& ar : tmp->mARIAOwnsHash.Values()) {
for (uint32_t i = 0; i < ar->Length(); i++) {
NS_CYCLE_COLLECTION_NOTE_EDGE_NAME(cb, "mARIAOwnsHash entry item");
cb.NoteXPCOMChild(ar->ElementAt(i));
}
}
NS_IMPL_CYCLE_COLLECTION_TRAVERSE_END
NS_IMPL_CYCLE_COLLECTION_UNLINK_BEGIN_INHERITED(DocAccessible, LocalAccessible)
NS_IMPL_CYCLE_COLLECTION_UNLINK(mNotificationController)
NS_IMPL_CYCLE_COLLECTION_UNLINK(mChildDocuments)
tmp->mDependentIDsHashes.Clear();
tmp->mNodeToAccessibleMap.Clear();
NS_IMPL_CYCLE_COLLECTION_UNLINK(mAccessibleCache)
NS_IMPL_CYCLE_COLLECTION_UNLINK(mAnchorJumpElm)
NS_IMPL_CYCLE_COLLECTION_UNLINK(mInvalidationList)
NS_IMPL_CYCLE_COLLECTION_UNLINK(mPendingUpdates)
NS_IMPL_CYCLE_COLLECTION_UNLINK_WEAK_REFERENCE
tmp->mARIAOwnsHash.Clear();
NS_IMPL_CYCLE_COLLECTION_UNLINK_END
NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION(DocAccessible)
NS_INTERFACE_MAP_ENTRY(nsIDocumentObserver)
NS_INTERFACE_MAP_ENTRY(nsIMutationObserver)
NS_INTERFACE_MAP_ENTRY(nsISupportsWeakReference)
NS_INTERFACE_MAP_END_INHERITING(HyperTextAccessible)
NS_IMPL_ADDREF_INHERITED(DocAccessible, HyperTextAccessible)
NS_IMPL_RELEASE_INHERITED(DocAccessible, HyperTextAccessible)
////////////////////////////////////////////////////////////////////////////////
// nsIAccessible
ENameValueFlag DocAccessible::DirectName(nsString& aName) const {
aName.Truncate();
if (mParent) {
mParent->Name(aName); // Allow owning iframe to override the name
}
if (aName.IsEmpty()) {
// Allow name via aria-labelledby or title attribute
LocalAccessible::DirectName(aName);
}
if (aName.IsEmpty()) {
Title(aName); // Try title element
}
if (aName.IsEmpty()) { // Last resort: use URL
URL(aName);
}
if (aName.IsEmpty()) {
aName.SetIsVoid(true);
}
return eNameOK;
}
// LocalAccessible public method
role DocAccessible::NativeRole() const {
nsCOMPtr<nsIDocShell> docShell = nsCoreUtils::GetDocShellFor(mDocumentNode);
if (docShell) {
nsCOMPtr<nsIDocShellTreeItem> sameTypeRoot;
docShell->GetInProcessSameTypeRootTreeItem(getter_AddRefs(sameTypeRoot));
int32_t itemType = docShell->ItemType();
if (sameTypeRoot == docShell) {
// Root of content or chrome tree
if (itemType == nsIDocShellTreeItem::typeChrome) {
return roles::CHROME_WINDOW;
}
if (itemType == nsIDocShellTreeItem::typeContent) {
return roles::DOCUMENT;
}
} else if (itemType == nsIDocShellTreeItem::typeContent) {
return roles::DOCUMENT;
}
}
return roles::PANE; // Fall back;
}
EDescriptionValueFlag DocAccessible::Description(nsString& aDescription) const {
if (mParent) mParent->Description(aDescription);
if (HasOwnContent() && aDescription.IsEmpty()) {
nsTextEquivUtils::GetTextEquivFromIDRefs(this, nsGkAtoms::aria_describedby,
aDescription);
}
return eDescriptionFromARIA;
}
// LocalAccessible public method
uint64_t DocAccessible::NativeState() const {
// Document is always focusable.
uint64_t state =
states::FOCUSABLE; // keep in sync with NativeInteractiveState() impl
if (FocusMgr()->IsFocused(this)) state |= states::FOCUSED;
// Expose stale state until the document is ready (DOM is loaded and tree is
// constructed).
if (!HasLoadState(eReady)) state |= states::STALE;
// Expose state busy until the document and all its subdocuments is completely
// loaded.
if (!HasLoadState(eCompletelyLoaded)) state |= states::BUSY;
nsIFrame* frame = GetFrame();
if (!frame || !frame->IsVisibleConsideringAncestors(
nsIFrame::VISIBILITY_CROSS_CHROME_CONTENT_BOUNDARY)) {
state |= states::INVISIBLE | states::OFFSCREEN;
}
RefPtr<EditorBase> editorBase = GetEditor();
state |= editorBase ? states::EDITABLE : states::READONLY;
// GetFrame() returns the root frame, which is normally what we want. However,
// user-select: none might be set on the body, in which case this won't be
// exposed on the root frame. Therefore, we explicitly use the body frame
// here (if any).
nsIFrame* bodyFrame = mContent ? mContent->GetPrimaryFrame() : nullptr;
if ((state & states::EDITABLE) || (bodyFrame && bodyFrame->IsSelectable())) {
// If the accessible is editable the layout selectable state only disables
// mouse selection, but keyboard (shift+arrow) selection is still possible.
state |= states::SELECTABLE_TEXT;
}
return state;
}
uint64_t DocAccessible::NativeInteractiveState() const {
// Document is always focusable.
return states::FOCUSABLE;
}
bool DocAccessible::NativelyUnavailable() const { return false; }
// LocalAccessible public method
void DocAccessible::ApplyARIAState(uint64_t* aState) const {
// Grab states from content element.
if (mContent) LocalAccessible::ApplyARIAState(aState);
// Allow iframe/frame etc. to have final state override via ARIA.
if (mParent) mParent->ApplyARIAState(aState);
}
Accessible* DocAccessible::FocusedChild() {
// Return an accessible for the current global focus, which does not have to
// be contained within the current document.
return FocusMgr()->FocusedAccessible();
}
void DocAccessible::TakeFocus() const {
// Focus the document.
nsFocusManager* fm = nsFocusManager::GetFocusManager();
RefPtr<dom::Element> newFocus;
dom::AutoHandlingUserInputStatePusher inputStatePusher(true);
fm->MoveFocus(mDocumentNode->GetWindow(), nullptr,
nsFocusManager::MOVEFOCUS_ROOT, 0, getter_AddRefs(newFocus));
}
// HyperTextAccessible method
already_AddRefed<EditorBase> DocAccessible::GetEditor() const {
// Check if document is editable (designMode="on" case). Otherwise check if
// the html:body (for HTML document case) or document element is editable.
if (!mDocumentNode->IsInDesignMode() &&
(!mContent || !mContent->HasFlag(NODE_IS_EDITABLE))) {
return nullptr;
}
nsCOMPtr<nsIDocShell> docShell = mDocumentNode->GetDocShell();
if (!docShell) {
return nullptr;
}
nsCOMPtr<nsIEditingSession> editingSession;
docShell->GetEditingSession(getter_AddRefs(editingSession));
if (!editingSession) return nullptr; // No editing session interface
RefPtr<HTMLEditor> htmlEditor =
editingSession->GetHTMLEditorForWindow(mDocumentNode->GetWindow());
if (!htmlEditor) {
return nullptr;
}
bool isEditable = false;
htmlEditor->GetIsDocumentEditable(&isEditable);
if (isEditable) {
return htmlEditor.forget();
}
return nullptr;
}
// DocAccessible public method
void DocAccessible::URL(nsAString& aURL) const {
aURL.Truncate();
nsCOMPtr<nsISupports> container = mDocumentNode->GetContainer();
nsCOMPtr<nsIWebNavigation> webNav(do_GetInterface(container));
if (MOZ_UNLIKELY(!webNav)) {
return;
}
nsCOMPtr<nsIURI> uri;
webNav->GetCurrentURI(getter_AddRefs(uri));
if (MOZ_UNLIKELY(!uri)) {
return;
}
// Let's avoid treating too long URI in the main process for avoiding
// memory fragmentation as far as possible.
if (uri->SchemeIs("data") || uri->SchemeIs("blob")) {
return;
}
nsCOMPtr<nsIIOService> io = mozilla::components::IO::Service();
if (NS_WARN_IF(!io)) {
return;
}
nsCOMPtr<nsIURI> exposableURI;
if (NS_FAILED(io->CreateExposableURI(uri, getter_AddRefs(exposableURI))) ||
MOZ_UNLIKELY(!exposableURI)) {
return;
}
nsAutoCString theURL;
if (NS_SUCCEEDED(exposableURI->GetSpec(theURL))) {
CopyUTF8toUTF16(theURL, aURL);
}
}
void DocAccessible::Title(nsString& aTitle) const {
mDocumentNode->GetTitle(aTitle);
}
void DocAccessible::MimeType(nsAString& aType) const {
mDocumentNode->GetContentType(aType);
}
void DocAccessible::DocType(nsAString& aType) const {
dom::DocumentType* docType = mDocumentNode->GetDoctype();
if (docType) docType->GetPublicId(aType);
}
// Certain cache domain updates might require updating other cache domains.
// This function takes the given cache domains and returns those cache domains
// plus any other required associated cache domains. Made for use with
// QueueCacheUpdate.
static uint64_t GetCacheDomainsQueueUpdateSuperset(uint64_t aCacheDomains) {
// Text domain updates imply updates to the TextOffsetAttributes and
// TextBounds domains.
if (aCacheDomains & CacheDomain::Text) {
aCacheDomains |= CacheDomain::TextOffsetAttributes;
aCacheDomains |= CacheDomain::TextBounds;
}
// Bounds domain updates imply updates to the TextBounds domain.
if (aCacheDomains & CacheDomain::Bounds) {
aCacheDomains |= CacheDomain::TextBounds;
}
return aCacheDomains;
}
void DocAccessible::QueueCacheUpdate(LocalAccessible* aAcc, uint64_t aNewDomain,
bool aBypassActiveDomains) {
if (!mIPCDoc) {
return;
}
// These strong references aren't necessary because WithEntryHandle is
// guaranteed to run synchronously. However, static analysis complains without
// them.
RefPtr<DocAccessible> self = this;
RefPtr<LocalAccessible> acc = aAcc;
size_t arrayIndex =
mQueuedCacheUpdatesHash.WithEntryHandle(aAcc, [self, acc](auto&& entry) {
if (entry.HasEntry()) {
// This LocalAccessible has already been queued. Return its index in
// the queue array so we can update its queued domains.
return entry.Data();
}
// Add this LocalAccessible to the queue array.
size_t index = self->mQueuedCacheUpdatesArray.Length();
self->mQueuedCacheUpdatesArray.EmplaceBack(std::make_pair(acc, 0));
// Also add it to the hash map so we can avoid processing the same
// LocalAccessible twice.
return entry.Insert(index);
});
// We may need to bypass the active domain restriction when populating domains
// for the first time. In that case, queue cache updates regardless of domain.
if (aBypassActiveDomains) {
auto& [arrayAcc, domain] = mQueuedCacheUpdatesArray[arrayIndex];
MOZ_ASSERT(arrayAcc == aAcc);
domain |= aNewDomain;
Controller()->ScheduleProcessing();
return;
}
// Potentially queue updates for required related domains.
const uint64_t newDomains = GetCacheDomainsQueueUpdateSuperset(aNewDomain);
// Only queue cache updates for domains that are active.
const uint64_t domainsToUpdate =
nsAccessibilityService::GetActiveCacheDomains() & newDomains;
// Avoid queueing cache updates if we have no domains to update.
if (domainsToUpdate == CacheDomain::None) {
return;
}
auto& [arrayAcc, domain] = mQueuedCacheUpdatesArray[arrayIndex];
MOZ_ASSERT(arrayAcc == aAcc);
domain |= domainsToUpdate;
Controller()->ScheduleProcessing();
}
void DocAccessible::QueueCacheUpdateForDependentRelations(
LocalAccessible* aAcc, const nsAttrValue* aOldId) {
if (!mIPCDoc || !aAcc || !aAcc->IsInDocument() || aAcc->IsDefunct()) {
return;
}
dom::Element* el = aAcc->Elm();
if (!el) {
return;
}
// We call this function when we've noticed an ID change, or when an acc
// is getting bound to its document. We need to ensure any existing accs
// that depend on this acc's ID or Element have their relation cache entries
// updated.
RelatedAccIterator iter(this, el, nullptr);
while (LocalAccessible* relatedAcc = iter.Next()) {
if (relatedAcc->IsDefunct() || !relatedAcc->IsInDocument() ||
mInsertedAccessibles.Contains(relatedAcc)) {
continue;
}
QueueCacheUpdate(relatedAcc, CacheDomain::Relations);
}
if (aOldId) {
// If we have an old ID, we need to update any accessibles that depended on
// that ID as well.
nsAutoString id;
aOldId->ToString(id);
if (!id.IsEmpty()) {
auto* providers = GetRelProviders(el, id);
if (providers) {
for (auto& provider : *providers) {
if (LocalAccessible* oldRelatedAcc =
GetAccessible(provider->mContent)) {
QueueCacheUpdate(oldRelatedAcc, CacheDomain::Relations);
}
}
}
}
}
if (const nsIFrame* anchorFrame = nsCoreUtils::GetAnchorForPositionedFrame(
mPresShell, aAcc->GetFrame())) {
// If this accessible is anchored, retrieve the anchor and update its
// relations.
if (LocalAccessible* anchorAcc = GetAccessible(anchorFrame->GetContent())) {
if (!mInsertedAccessibles.Contains(anchorAcc)) {
QueueCacheUpdate(anchorAcc, CacheDomain::Relations);
}
}
}
if (nsIFrame* positionedFrame = nsCoreUtils::GetPositionedFrameForAnchor(
mPresShell, aAcc->GetFrame())) {
// If this accessible is an anchor, retrieve the positioned frame and
// refresh the cache on all its anchors.
if (LocalAccessible* targetAcc =
GetAccessible(positionedFrame->GetContent())) {
RefreshAnchorRelationCacheForTarget(targetAcc);
}
}
}
////////////////////////////////////////////////////////////////////////////////
// LocalAccessible
void DocAccessible::Init() {
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eDocCreate)) {
logging::DocCreate("document initialize", mDocumentNode, this);
}
#endif
// Initialize notification controller.
mNotificationController = new NotificationController(this, mPresShell);
// Mark the DocAccessible as loaded if its DOM document is already loaded at
// this point. This can happen for one of three reasons:
// 1. A11y was started late.
// 2. DOM loading for a document (probably an in-process iframe) completed
// before its Accessible container was created.
// 3. The PresShell for the document was created after DOM loading completed.
// In that case, we tried to create the DocAccessible when DOM loading
// completed, but we can't create a DocAccessible without a PresShell, so
// this failed. The DocAccessible was subsequently created due to a layout
// notification.
if (mDocumentNode->GetReadyStateEnum() ==
dom::Document::READYSTATE_COMPLETE) {
mLoadState |= eDOMLoaded;
// If this happened due to reasons 1 or 2, it isn't *necessary* to fire a
// doc load complete event. If it happened due to reason 3, we need to fire
// doc load complete because clients (especially tests) might be waiting
// for the document to load using this event. We can't distinguish why this
// happened at this point, so just fire it regardless. It won't do any
// harm even if it isn't necessary. We set mLoadEventType here and it will
// be fired in ProcessLoad as usual.
mLoadEventType = nsIAccessibleEvent::EVENT_DOCUMENT_LOAD_COMPLETE;
} else if (mDocumentNode->IsInitialDocument()) {
// The initial about:blank document will never finish loading, so we can
// immediately mark it loaded to avoid waiting for its load.
mLoadState |= eDOMLoaded;
}
AddEventListeners();
}
void DocAccessible::Shutdown() {
if (!mPresShell) { // already shutdown
return;
}
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eDocDestroy)) {
logging::DocDestroy("document shutdown", mDocumentNode, this);
}
#endif
// Mark the document as shutdown before AT is notified about the document
// removal from its container (valid for root documents on ATK and due to
// some reason for MSAA, refer to bug 757392 for details).
MOZ_DIAGNOSTIC_ASSERT(!IsDefunct(),
"Already marked defunct. Reentrant shutdown!");
mStateFlags |= eIsDefunct;
if (mNotificationController) {
mNotificationController->Shutdown();
mNotificationController = nullptr;
}
RemoveEventListeners();
if (mParent) {
DocAccessible* parentDocument = mParent->Document();
if (parentDocument) parentDocument->RemoveChildDocument(this);
mParent->RemoveChild(this);
MOZ_ASSERT(!mParent, "Parent has to be null!");
}
mPresShell->SetDocAccessible(nullptr);
mPresShell = nullptr; // Avoid reentrancy
// Walk the array backwards because child documents remove themselves from the
// array as they are shutdown.
int32_t childDocCount = mChildDocuments.Length();
for (int32_t idx = childDocCount - 1; idx >= 0; idx--) {
mChildDocuments[idx]->Shutdown();
}
mChildDocuments.Clear();
// mQueuedCacheUpdates* can contain a reference to this document (ex. if the
// doc is scrollable and we're sending a scroll position update). Clear the
// map here to avoid creating ref cycles.
mQueuedCacheUpdatesArray.Clear();
mQueuedCacheUpdatesHash.Clear();
// XXX thinking about ordering?
if (mIPCDoc) {
MOZ_ASSERT(IPCAccessibilityActive());
mIPCDoc->Shutdown();
MOZ_ASSERT(!mIPCDoc);
}
mDependentIDsHashes.Clear();
mDependentElementsMap.Clear();
mNodeToAccessibleMap.Clear();
mAnchorJumpElm = nullptr;
mInvalidationList.Clear();
mPendingUpdates.Clear();
for (auto iter = mAccessibleCache.Iter(); !iter.Done(); iter.Next()) {
LocalAccessible* accessible = iter.Data();
MOZ_ASSERT(accessible);
if (accessible) {
// This might have been focused with FocusManager::ActiveItemChanged. In
// that case, we must notify FocusManager so that it clears the active
// item. Otherwise, it will hold on to a defunct Accessible. Normally,
// this happens in UnbindFromDocument, but we don't call that when the
// whole document shuts down.
if (FocusMgr()->WasLastFocused(accessible)) {
FocusMgr()->ActiveItemChanged(nullptr);
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eFocus)) {
logging::ActiveItemChangeCausedBy("doc shutdown", accessible);
}
#endif
}
if (!accessible->IsDefunct()) {
// Unlink parent to avoid its cleaning overhead in shutdown.
accessible->mParent = nullptr;
accessible->Shutdown();
}
}
iter.Remove();
}
HyperTextAccessible::Shutdown();
MOZ_ASSERT(GetAccService());
GetAccService()->NotifyOfDocumentShutdown(this, mDocumentNode);
mDocumentNode = nullptr;
}
nsIFrame* DocAccessible::GetFrame() const {
nsIFrame* root = nullptr;
if (mPresShell) {
root = mPresShell->GetRootFrame();
}
return root;
}
nsINode* DocAccessible::GetNode() const { return mDocumentNode; }
// DocAccessible protected member
nsRect DocAccessible::RelativeBounds(nsIFrame** aRelativeFrame) const {
*aRelativeFrame = GetFrame();
dom::Document* document = mDocumentNode;
dom::Document* parentDoc = nullptr;
nsRect bounds;
while (document) {
PresShell* presShell = document->GetPresShell();
if (!presShell) {
return nsRect();
}
nsRect scrollPort;
ScrollContainerFrame* sf = presShell->GetRootScrollContainerFrame();
if (sf) {
scrollPort = sf->GetScrollPortRect();
} else {
nsIFrame* rootFrame = presShell->GetRootFrame();
if (!rootFrame) return nsRect();
scrollPort = rootFrame->GetRect();
}
if (parentDoc) { // After first time thru loop
// XXXroc bogus code! scrollPort is relative to the viewport of
// this document, but we're intersecting rectangles derived from
// multiple documents and assuming they're all in the same coordinate
// system. See bug 514117.
bounds.IntersectRect(scrollPort, bounds);
} else { // First time through loop
bounds = scrollPort;
}
document = parentDoc = document->GetInProcessParentDocument();
}
return bounds;
}
// DocAccessible protected member
nsresult DocAccessible::AddEventListeners() {
SelectionMgr()->AddDocSelectionListener(mPresShell);
// Add document observer.
mDocumentNode->AddObserver(this);
return NS_OK;
}
// DocAccessible protected member
nsresult DocAccessible::RemoveEventListeners() {
// Remove listeners associated with content documents
NS_ASSERTION(mDocumentNode, "No document during removal of listeners.");
if (mDocumentNode) {
mDocumentNode->RemoveObserver(this);
}
if (mScrollWatchTimer) {
mScrollWatchTimer->Cancel();
mScrollWatchTimer = nullptr;
NS_RELEASE_THIS(); // Kung fu death grip
}
SelectionMgr()->RemoveDocSelectionListener(mPresShell);
return NS_OK;
}
void DocAccessible::ScrollTimerCallback(nsITimer* aTimer, void* aClosure) {
DocAccessible* docAcc = reinterpret_cast<DocAccessible*>(aClosure);
if (docAcc) {
// Dispatch a scroll-end for all entries in table. They have not
// been scrolled in at least `kScrollEventInterval`.
for (auto iter = docAcc->mLastScrollingDispatch.Iter(); !iter.Done();
iter.Next()) {
docAcc->DispatchScrollingEvent(iter.Key(),
nsIAccessibleEvent::EVENT_SCROLLING_END);
iter.Remove();
}
if (docAcc->mScrollWatchTimer) {
docAcc->mScrollWatchTimer = nullptr;
NS_RELEASE(docAcc); // Release kung fu death grip
}
}
}
void DocAccessible::HandleScroll(nsINode* aTarget) {
nsINode* target = aTarget;
LocalAccessible* targetAcc = GetAccessible(target);
if (!targetAcc && target->IsInNativeAnonymousSubtree()) {
// The scroll event for textareas comes from a native anonymous div. We need
// the closest non-anonymous ancestor to get the right Accessible.
target = target->GetClosestNativeAnonymousSubtreeRootParentOrHost();
targetAcc = GetAccessible(target);
}
// Regardless of our scroll timer, we need to send a cache update
// to ensure the next Bounds() query accurately reflects our position
// after scrolling.
if (targetAcc) {
QueueCacheUpdate(targetAcc, CacheDomain::ScrollPosition);
}
const uint32_t kScrollEventInterval = 100;
// If we haven't dispatched a scrolling event for a target in at least
// kScrollEventInterval milliseconds, dispatch one now.
mLastScrollingDispatch.WithEntryHandle(target, [&](auto&& lastDispatch) {
const TimeStamp now = TimeStamp::Now();
if (!lastDispatch ||
(now - lastDispatch.Data()).ToMilliseconds() >= kScrollEventInterval) {
// We can't fire events on a document whose tree isn't constructed yet.
if (HasLoadState(eTreeConstructed)) {
DispatchScrollingEvent(target, nsIAccessibleEvent::EVENT_SCROLLING);
}
lastDispatch.InsertOrUpdate(now);
}
});
// If timer callback is still pending, push it 100ms into the future.
// When scrolling ends and we don't fire HandleScroll anymore, the
// timer callback will fire and dispatch an EVENT_SCROLLING_END.
if (!mScrollWatchTimer) {
// Can only fail on OOM and in that case we'd crash.
mScrollWatchTimer = NS_NewTimer();
NS_ADDREF_THIS(); // Kung fu death grip
}
mScrollWatchTimer->InitWithNamedFuncCallback(
ScrollTimerCallback, this, kScrollEventInterval, nsITimer::TYPE_ONE_SHOT,
"a11y::DocAccessible::ScrollPositionDidChange"_ns);
}
std::pair<nsPoint, nsRect> DocAccessible::ComputeScrollData(
const LocalAccessible* aAcc, bool aShouldScaleByResolution) {
nsPoint scrollPoint;
nsRect scrollRange;
if (nsIFrame* frame = aAcc->GetFrame()) {
ScrollContainerFrame* sf = aAcc == this
? mPresShell->GetRootScrollContainerFrame()
: frame->GetScrollTargetFrame();
// If there is no scrollable frame, it's likely a scroll in a popup, like
// <select>. Return a scroll offset and range of 0. The scroll info
// is currently only used on Android, and popups are rendered natively
// there.
if (sf) {
scrollPoint = sf->GetScrollPosition();
scrollRange = sf->GetScrollRange();
if (aShouldScaleByResolution) {
scrollPoint = scrollPoint * mPresShell->GetResolution();
scrollRange.ScaleRoundOut(mPresShell->GetResolution());
}
}
}
return {scrollPoint, scrollRange};
}
////////////////////////////////////////////////////////////////////////////////
// nsIDocumentObserver
NS_IMPL_NSIDOCUMENTOBSERVER_CORE_STUB(DocAccessible)
NS_IMPL_NSIDOCUMENTOBSERVER_LOAD_STUB(DocAccessible)
// When a reflected element IDL attribute changes, we might get the following
// synchronous calls:
// 1. AttributeWillChange for the element.
// 2. AttributeWillChange for the content attribute.
// 3. AttributeChanged for the content attribute.
// 4. AttributeChanged for the element.
// Since the content attribute value is "" for any element, we won't always get
// 2 or 3. Even if we do, they might occur after the element has already
// changed, which means we can't detect any relevant state changes there; e.g.
// mPrevStateBits. Thus, we need 1 and 4, and we must ignore 2 and 3. To
// facilitate this, sIsAttrElementChanging will be set to true for 2 and 3.
static bool sIsAttrElementChanging = false;
void DocAccessible::AttributeWillChange(dom::Element* aElement,
int32_t aNameSpaceID,
nsAtom* aAttribute,
AttrModType aModType) {
if (sIsAttrElementChanging) {
// See the comment above the definition of sIsAttrElementChanging.
return;
}
LocalAccessible* accessible = GetAccessible(aElement);
if (!accessible) {
if (aElement != mContent) return;
accessible = this;
}
// Update dependent IDs cache. Take care of elements that are accessible
// because dependent IDs cache doesn't contain IDs from non accessible
// elements. We do this for attribute additions as well because there might
// be an ElementInternals default value.
RemoveDependentIDsFor(accessible, aAttribute);
RemoveDependentElementsFor(accessible, aAttribute);
if (aAttribute == nsGkAtoms::id) {
if (accessible->IsActiveDescendant()) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::ACTIVE, false);
FireDelayedEvent(event);
}
RelocateARIAOwnedIfNeeded(aElement);
}
if (aAttribute == nsGkAtoms::aria_activedescendant) {
if (LocalAccessible* activeDescendant = accessible->CurrentItem()) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(activeDescendant, states::ACTIVE, false);
FireDelayedEvent(event);
}
}
if ((aModType == AttrModType::Modification ||
aModType == AttrModType::Removal)) {
// If this is a modification or removal of aria-actions, and the
// accessible's name is calculated by the subtree, there may be a change to
// the name of the accessible.
// If this is a modification or removal of an id, an aria-actions relation
// might be severed, and thus change the name of any ancestors.
// XXX: We don't track the actual changes, so the name change event might
// be fired for not actual name change, but better to fire an event than to
// not.
MaybeHandleChangeToAriaActions(accessible, aAttribute);
}
// If attribute affects accessible's state, store the old state so we can
// later compare it against the state of the accessible after the attribute
// change.
if (accessible->AttributeChangesState(aAttribute)) {
mPrevStateBits = accessible->State();
} else {
mPrevStateBits = 0;
}
}
void DocAccessible::AttributeChanged(dom::Element* aElement,
int32_t aNameSpaceID, nsAtom* aAttribute,
AttrModType aModType,
const nsAttrValue* aOldValue) {
if (sIsAttrElementChanging) {
// See the comment above the definition of sIsAttrElementChanging.
return;
}
NS_ASSERTION(!IsDefunct(),
"Attribute changed called on defunct document accessible!");
// Proceed even if the element is not accessible because element may become
// accessible if it gets certain attribute.
if (UpdateAccessibleOnAttrChange(aElement, aAttribute)) return;
// Update the accessible tree on aria-hidden change. Make sure to not create
// a tree under aria-hidden='true'.
if (aAttribute == nsGkAtoms::aria_hidden) {
if (aria::IsValidARIAHidden(aElement)) {
ContentRemoved(aElement);
} else {
ContentInserted(aElement, aElement->GetNextSibling());
}
return;
}
if (aAttribute == nsGkAtoms::slot &&
!aElement->GetFlattenedTreeParentNode() && aElement != mContent) {
// Element is inside a shadow host but is no longer slotted.
mDoc->ContentRemoved(aElement);
return;
}
LocalAccessible* accessible = GetAccessible(aElement);
if (!accessible) {
if (mContent == aElement) {
// The attribute change occurred on the root content of this
// DocAccessible, so handle it as an attribute change on this.
accessible = this;
} else {
if (aModType == AttrModType::Addition &&
aria::AttrCharacteristicsFor(aAttribute) & ATTR_GLOBAL) {
// The element doesn't have an Accessible, but a global ARIA attribute
// was just added, which means we should probably create an Accessible.
ContentInserted(aElement, aElement->GetNextSibling());
return;
}
// The element doesn't have an Accessible, so ignore the attribute
// change.
return;
}
}
MOZ_ASSERT(accessible->IsBoundToParent() || accessible->IsDoc(),
"DOM attribute change on an accessible detached from the tree");
if (aAttribute == nsGkAtoms::id) {
dom::Element* elm = accessible->Elm();
RelocateARIAOwnedIfNeeded(elm);
ARIAActiveDescendantIDMaybeMoved(accessible);
QueueCacheUpdate(accessible, CacheDomain::DOMNodeIDAndClass);
QueueCacheUpdateForDependentRelations(accessible, aOldValue);
}
// The activedescendant universal property redirects accessible focus events
// to the element with the id that activedescendant points to. Make sure
// the tree up to date before processing. In other words, when a node has just
// been inserted, the tree won't be up to date yet, so we must always schedule
// an async notification so that a newly inserted node will be present in
// the tree.
if (aAttribute == nsGkAtoms::aria_activedescendant) {
mNotificationController
->ScheduleNotification<DocAccessible, LocalAccessible>(
this, &DocAccessible::ARIAActiveDescendantChanged, accessible);
}
// Defer to accessible any needed actions like changing states or emiting
// events.
accessible->DOMAttributeChanged(aNameSpaceID, aAttribute, aModType, aOldValue,
mPrevStateBits);
// Update dependent IDs cache. We handle elements with accessibles.
// If the accessible or element with the ID doesn't exist yet the cache will
// be updated when they are added.
if (IsAdditionOrModification(aModType)) {
AddDependentIDsFor(accessible, aAttribute);
AddDependentElementsFor(accessible, aAttribute);
// If this is a modification or addition of aria-actions, and the
// accessible's name is calculated by the subtree, there may be a change to
// the name of the accessible.
// If this is a modification or addition of an id, an aria-actions relation
// might be restored, and thus change the name of any ancestors.
// XXX: We don't track the actual changes, so the name change event might
// be fired for not actual name change, but better to fire an event than to
// not.
// In the case of a modification we may have already queued a name
// change event in the `AttributeWillChange` stage, but we rely on
// EventQueue to quash any duplicates.
MaybeHandleChangeToAriaActions(accessible, aAttribute);
}
}
void DocAccessible::ARIAAttributeDefaultWillChange(dom::Element* aElement,
nsAtom* aAttribute,
AttrModType aModType) {
NS_ASSERTION(!IsDefunct(),
"Attribute changed called on defunct document accessible!");
if (aElement->HasAttr(aAttribute)) {
return;
}
AttributeWillChange(aElement, kNameSpaceID_None, aAttribute, aModType);
}
void DocAccessible::ARIAAttributeDefaultChanged(dom::Element* aElement,
nsAtom* aAttribute,
AttrModType aModType) {
NS_ASSERTION(!IsDefunct(),
"Attribute changed called on defunct document accessible!");
if (aElement->HasAttr(aAttribute)) {
return;
}
AttributeChanged(aElement, kNameSpaceID_None, aAttribute, aModType, nullptr);
}
void DocAccessible::ARIAActiveDescendantChanged(LocalAccessible* aAccessible) {
if (dom::Element* elm = aAccessible->Elm()) {
nsAutoString id;
if (dom::Element* activeDescendantElm =
nsCoreUtils::GetAriaActiveDescendantElement(elm)) {
LocalAccessible* activeDescendant = GetAccessible(activeDescendantElm);
if (activeDescendant) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(activeDescendant, states::ACTIVE, true);
FireDelayedEvent(event);
if (aAccessible->IsActiveWidget()) {
FocusMgr()->ActiveItemChanged(activeDescendant, false);
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eFocus)) {
logging::ActiveItemChangeCausedBy("ARIA activedescedant changed",
activeDescendant);
}
#endif
}
return;
}
}
// aria-activedescendant was cleared or changed to a non-existent node.
// Move focus back to the element itself if it has DOM focus.
if (aAccessible->IsActiveWidget()) {
FocusMgr()->ActiveItemChanged(aAccessible, false);
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eFocus)) {
logging::ActiveItemChangeCausedBy("ARIA activedescedant cleared",
aAccessible);
}
#endif
}
}
}
void DocAccessible::ContentAppended(nsIContent* aFirstNewContent,
const ContentAppendInfo&) {
MaybeHandleChangeToHiddenNameOrDescription(aFirstNewContent);
}
void DocAccessible::ElementStateChanged(dom::Document* aDocument,
dom::Element* aElement,
dom::ElementState aStateMask) {
LocalAccessible* accessible =
aElement == mContent ? this : GetAccessible(aElement);
if (!accessible) {
return;
}
if (aStateMask.HasState(dom::ElementState::READWRITE) &&
!accessible->IsTextField()) {
const bool isEditable =
aElement->State().HasState(dom::ElementState::READWRITE);
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::EDITABLE, isEditable);
FireDelayedEvent(event);
if (accessible == this || aElement->IsHTMLElement(nsGkAtoms::article)) {
// We want <article> to behave like a document in terms of readonly state.
event =
new AccStateChangeEvent(accessible, states::READONLY, !isEditable);
FireDelayedEvent(event);
}
if (aElement->HasAttr(nsGkAtoms::aria_owns)) {
// If this has aria-owns, update children that are relocated into here.
// If we are becoming editable, put them back into their original
// containers, if we are becoming readonly, acquire them.
mNotificationController->ScheduleRelocation(accessible);
}
// If this is a node inside of a newly editable subtree, it needs to be
// un-aria-owned. And inversely, if the node becomes uneditable, allow the
// node to be aria-owned.
RelocateARIAOwnedIfNeeded(aElement);
}
if (aStateMask.HasState(dom::ElementState::CHECKED)) {
LocalAccessible* widget = accessible->ContainerWidget();
if (widget && widget->IsSelect()) {
// Changing selection here changes what we cache for
// the viewport.
SetViewportCacheDirty(true);
AccSelChangeEvent::SelChangeType selChangeType =
aElement->State().HasState(dom::ElementState::CHECKED)
? AccSelChangeEvent::eSelectionAdd
: AccSelChangeEvent::eSelectionRemove;
RefPtr<AccEvent> event =
new AccSelChangeEvent(widget, accessible, selChangeType);
FireDelayedEvent(event);
return;
}
RefPtr<AccEvent> event = new AccStateChangeEvent(
accessible, states::CHECKED,
aElement->State().HasState(dom::ElementState::CHECKED));
FireDelayedEvent(event);
}
if (aStateMask.HasState(dom::ElementState::INVALID)) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::INVALID);
FireDelayedEvent(event);
}
if (aStateMask.HasState(dom::ElementState::REQUIRED)) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::REQUIRED);
FireDelayedEvent(event);
}
if (aStateMask.HasState(dom::ElementState::VISITED)) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::TRAVERSED, true);
FireDelayedEvent(event);
}
// We only expose dom::ElementState::DEFAULT on buttons, but we can get
// notifications for other controls like checkboxes.
if (aStateMask.HasState(dom::ElementState::DEFAULT) &&
accessible->IsButton()) {
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::DEFAULT);
FireDelayedEvent(event);
}
if (aStateMask.HasState(dom::ElementState::INDETERMINATE)) {
RefPtr<AccEvent> event = new AccStateChangeEvent(accessible, states::MIXED);
FireDelayedEvent(event);
}
if (aStateMask.HasState(dom::ElementState::DISABLED) &&
!nsAccUtils::ARIAAttrValueIs(aElement, nsGkAtoms::aria_disabled,
nsGkAtoms::_true, eCaseMatters)) {
// The DOM disabled state has changed and there is no aria-disabled="true"
// taking precedence.
RefPtr<AccEvent> event =
new AccStateChangeEvent(accessible, states::UNAVAILABLE);
FireDelayedEvent(event);
event = new AccStateChangeEvent(accessible, states::ENABLED);
FireDelayedEvent(event);
// This likely changes focusability as well.
event = new AccStateChangeEvent(accessible, states::FOCUSABLE);
FireDelayedEvent(event);
}
}
void DocAccessible::CharacterDataWillChange(nsIContent* aContent,
const CharacterDataChangeInfo&) {}
void DocAccessible::CharacterDataChanged(nsIContent* aContent,
const CharacterDataChangeInfo&) {
MaybeHandleChangeToHiddenNameOrDescription(aContent);
}
void DocAccessible::ContentInserted(nsIContent* aChild,
const ContentInsertInfo&) {
MaybeHandleChangeToHiddenNameOrDescription(aChild);
}
void DocAccessible::ContentWillBeRemoved(nsIContent* aChildNode,
const ContentRemoveInfo&) {
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eTree)) {
logging::MsgBegin("TREE", "DOM content removed; doc: %p", this);
logging::Node("container node", aChildNode->GetParent());
logging::Node("content node", aChildNode);
logging::MsgEnd();
}
#endif
ContentRemoved(aChildNode);
}
void DocAccessible::ParentChainChanged(nsIContent* aContent) {}
////////////////////////////////////////////////////////////////////////////////
// LocalAccessible
#ifdef A11Y_LOG
nsresult DocAccessible::HandleAccEvent(AccEvent* aEvent) {
if (logging::IsEnabled(logging::eDocLoad)) {
logging::DocLoadEventHandled(aEvent);
}
return HyperTextAccessible::HandleAccEvent(aEvent);
}
#endif
////////////////////////////////////////////////////////////////////////////////
// Public members
nsPresContext* DocAccessible::PresContext() const {
return mPresShell->GetPresContext();
}
void* DocAccessible::GetNativeWindow() const {
if (!mPresShell) {
return nullptr;
}
if (nsIWidget* widget = mPresShell->GetRootWidget()) {
return widget->GetNativeData(NS_NATIVE_WINDOW);
}
return nullptr;
}
LocalAccessible* DocAccessible::GetAccessibleByUniqueIDInSubtree(
void* aUniqueID) {
LocalAccessible* child = GetAccessibleByUniqueID(aUniqueID);
if (child) return child;
uint32_t childDocCount = mChildDocuments.Length();
for (uint32_t childDocIdx = 0; childDocIdx < childDocCount; childDocIdx++) {
DocAccessible* childDocument = mChildDocuments.ElementAt(childDocIdx);
child = childDocument->GetAccessibleByUniqueIDInSubtree(aUniqueID);
if (child) return child;
}
return nullptr;
}
LocalAccessible* DocAccessible::GetAccessibleOrContainer(
nsINode* aNode, bool aNoContainerIfPruned) const {
if (!aNode || !aNode->GetComposedDoc()) {
return nullptr;
}
nsINode* start = aNode;
if (auto* shadowRoot = dom::ShadowRoot::FromNode(aNode)) {
// This can happen, for example, when called within
// SelectionManager::ProcessSelectionChanged due to focusing a direct
// child of a shadow root.
// GetFlattenedTreeParent works on children of a shadow root, but not the
// shadow root itself.
start = shadowRoot->GetHost();
if (!start) {
return nullptr;
}
}
for (nsINode* currNode : dom::InclusiveFlatTreeAncestors(*start)) {
// No container if is inside of aria-hidden subtree.
if (aNoContainerIfPruned && currNode->IsElement() &&
aria::IsValidARIAHidden(currNode->AsElement())) {
return nullptr;
}
// Check if node is in zero-sized map
if (aNoContainerIfPruned && currNode->IsHTMLElement(nsGkAtoms::map)) {
if (nsIFrame* frame = currNode->AsContent()->GetPrimaryFrame()) {
if (nsLayoutUtils::GetAllInFlowRectsUnion(frame, frame->GetParent())
.IsEmpty()) {
return nullptr;
}
}
}
if (LocalAccessible* accessible = GetAccessible(currNode)) {
return accessible;
}
}
return nullptr;
}
LocalAccessible* DocAccessible::GetContainerAccessible(nsINode* aNode) const {
return aNode ? GetAccessibleOrContainer(aNode->GetFlattenedTreeParentNode())
: nullptr;
}
LocalAccessible* DocAccessible::GetAccessibleOrDescendant(
nsINode* aNode) const {
LocalAccessible* acc = GetAccessible(aNode);
if (acc) return acc;
if (aNode == mContent || aNode == mDocumentNode->GetRootElement()) {
// If the node is the doc's body or root element, return the doc accessible.
return const_cast<DocAccessible*>(this);
}
acc = GetContainerAccessible(aNode);
if (acc) {
TreeWalker walker(acc, aNode->AsContent(),
TreeWalker::eWalkCache | TreeWalker::eScoped);
return walker.Next();
}
return nullptr;
}
void DocAccessible::BindToDocument(LocalAccessible* aAccessible,
const nsRoleMapEntry* aRoleMapEntry) {
// Put into DOM node cache.
if (aAccessible->IsNodeMapEntry()) {
mNodeToAccessibleMap.InsertOrUpdate(aAccessible->GetNode(), aAccessible);
}
// Put into unique ID cache.
mAccessibleCache.InsertOrUpdate(aAccessible->UniqueID(), RefPtr{aAccessible});
aAccessible->SetRoleMapEntry(aRoleMapEntry);
if (aAccessible->HasOwnContent()) {
AddDependentIDsFor(aAccessible);
AddDependentElementsFor(aAccessible);
nsIContent* content = aAccessible->GetContent();
if (content->IsElement() &&
nsAccUtils::HasARIAAttr(content->AsElement(), nsGkAtoms::aria_owns)) {
mNotificationController->ScheduleRelocation(aAccessible);
}
}
if (mIPCDoc && HasLoadState(eTreeConstructed)) {
// Child process and not in initial tree construction phase.
// We need to track inserted accessibles so we don't mark them as moved
// before their initial show event.
// If this is the initial tree construction, we will push the tree to the
// parent process before we process moves, so we will always need to mark a
// relocated accessible as moved.
mInsertedAccessibles.EnsureInserted(aAccessible);
}
QueueCacheUpdateForDependentRelations(aAccessible);
}
void DocAccessible::UnbindFromDocument(LocalAccessible* aAccessible) {
NS_ASSERTION(mAccessibleCache.GetWeak(aAccessible->UniqueID()),
"Unbinding the unbound accessible!");
// Fire focus event on accessible having DOM focus if last focus was removed
// from the tree.
if (FocusMgr()->WasLastFocused(aAccessible)) {
FocusMgr()->ActiveItemChanged(nullptr);
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eFocus)) {
logging::ActiveItemChangeCausedBy("tree shutdown", aAccessible);
}
#endif
}
// Remove an accessible from node-to-accessible map if it exists there.
if (aAccessible->IsNodeMapEntry() &&
mNodeToAccessibleMap.Get(aAccessible->GetNode()) == aAccessible) {
mNodeToAccessibleMap.Remove(aAccessible->GetNode());
}
aAccessible->mStateFlags |= eIsNotInDocument;
// Update XPCOM part.
xpcAccessibleDocument* xpcDoc = GetAccService()->GetCachedXPCDocument(this);
if (xpcDoc) xpcDoc->NotifyOfShutdown(aAccessible);
void* uniqueID = aAccessible->UniqueID();
NS_ASSERTION(!aAccessible->IsDefunct(), "Shutdown the shutdown accessible!");
aAccessible->Shutdown();
mAccessibleCache.Remove(uniqueID);
}
void DocAccessible::ContentInserted(nsIContent* aStartChildNode,
nsIContent* aEndChildNode) {
// Ignore content insertions until we constructed accessible tree. Otherwise
// schedule tree update on content insertion after layout.
if (!mNotificationController || !HasLoadState(eTreeConstructed)) {
return;
}
// The frame constructor guarantees that only ranges with the same parent
// arrive here in presence of dynamic changes to the page, see
// nsCSSFrameConstructor::IssueSingleInsertNotifications' callers.
nsINode* parent = aStartChildNode->GetFlattenedTreeParentNode();
if (!parent) {
return;
}
LocalAccessible* container = AccessibleOrTrueContainer(parent);
if (!container) {
return;
}
AutoTArray<nsCOMPtr<nsIContent>, 10> list;
for (nsIContent* node = aStartChildNode; node != aEndChildNode;
node = node->GetNextSibling()) {
MOZ_ASSERT(parent == node->GetFlattenedTreeParentNode());
if (PruneOrInsertSubtree(node)) {
list.AppendElement(node);
}
}
mNotificationController->ScheduleContentInsertion(container, list);
}
void DocAccessible::ScheduleTreeUpdate(nsIContent* aContent) {
if (mPendingUpdates.Contains(aContent)) {
return;
}
mPendingUpdates.AppendElement(aContent);
mNotificationController->ScheduleProcessing();
}
void DocAccessible::ProcessPendingUpdates() {
auto updates = std::move(mPendingUpdates);
for (auto update : updates) {
if (update->GetComposedDoc() != mDocumentNode) {
continue;
}
// The pruning logic will take care of avoiding unnecessary notifications.
ContentInserted(update, update->GetNextSibling());
}
}
bool DocAccessible::PruneOrInsertSubtree(nsIContent* aRoot) {
AUTO_PROFILER_MARKER_TEXT("DocAccessible::PruneOrInsertSubtree", A11Y, {},
""_ns);
PerfStats::AutoMetricRecording<PerfStats::Metric::A11Y_PruneOrInsertSubtree>
autoRecording;
// DO NOT ADD CODE ABOVE THIS BLOCK: THIS CODE IS MEASURING TIMINGS.
bool insert = false;
// In the case that we are, or are in, a shadow host, we need to assure
// some accessibles are removed if they are not rendered anymore.
nsIContent* shadowHost =
aRoot->GetShadowRoot() ? aRoot : aRoot->GetContainingShadowHost();
if (shadowHost) {
// Check all explicit children in the host, if they are not slotted
// then remove their accessibles and subtrees.
for (nsIContent* childNode = shadowHost->GetFirstChild(); childNode;
childNode = childNode->GetNextSibling()) {
if (!childNode->GetPrimaryFrame() &&
!nsCoreUtils::CanCreateAccessibleWithoutFrame(childNode)) {
ContentRemoved(childNode);
}
}
// If this is a slot, check to see if its fallback content is rendered,
// if not - remove it.
if (aRoot->IsHTMLElement(nsGkAtoms::slot)) {
for (nsIContent* childNode = aRoot->GetFirstChild(); childNode;
childNode = childNode->GetNextSibling()) {
if (!childNode->GetPrimaryFrame() &&
!nsCoreUtils::CanCreateAccessibleWithoutFrame(childNode)) {
ContentRemoved(childNode);
}
}
}
}
// If we already have an accessible, check if we need to remove it, recreate
// it, or keep it in place.
LocalAccessible* acc = GetAccessible(aRoot);
if (acc) {
MOZ_ASSERT(aRoot == acc->GetContent(),
"LocalAccessible has differing content!");
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eTree)) {
logging::MsgBegin(
"TREE", "inserted content already has accessible; doc: %p", this);
logging::Node("content node", aRoot);
logging::AccessibleInfo("accessible node", acc);
logging::MsgEnd();
}
#endif
nsIFrame* frame = acc->GetFrame();
if (frame) {
acc->MaybeQueueCacheUpdateForStyleChanges();
}
// LocalAccessible has no frame and it's not display:contents. Remove it.
// As well as removing the a11y subtree, we must also remove Accessibles
// for DOM descendants, since some of these might be relocated Accessibles
// and their DOM nodes are now hidden as well.
if (!frame && !nsCoreUtils::CanCreateAccessibleWithoutFrame(aRoot)) {
ContentRemoved(aRoot);
return false;
}
if (!frame && aRoot->IsElement() &&
aRoot->AsElement()->IsDisplayContents() && acc->mOldComputedStyle) {
// This element has probably just become display: contents. We won't be
// notified of a computed style change in this case. Also, the bounds we
// cached previously are now invalid, but our normal bounds change
// notifications won't fire either. Therefore, queue cache updates for
// both.
QueueCacheUpdate(acc, CacheDomain::Style | CacheDomain::Bounds);
}
// If the frame is hidden because its ancestor is specified with
// `content-visibility: hidden`, remove its Accessible.
if (frame && frame->IsHiddenByContentVisibilityOnAnyAncestor(
nsIFrame::IncludeContentVisibility::Hidden)) {
ContentRemoved(aRoot);
return false;
}
// If it's a XULLabel it was probably reframed because a `value` attribute
// was added. The accessible creates its text leaf upon construction, so we
// need to recreate. Remove it, and schedule for reconstruction.
if (acc->IsXULLabel()) {
ContentRemoved(acc);
return true;
}
if (frame && frame->IsReplaced() && frame->AccessibleType() == eImageType &&
!aRoot->IsHTMLElement(nsGkAtoms::img)) {
// This is an image specified using the CSS content property which
// replaces the content of the node. Its frame might be reconstructed,
// which means its alt text might have changed. We expose the alt text
// as the name, so fire a name change event.
// We will schedule this for reinsertion below, and prune any children if
// they exist.
FireDelayedEvent(nsIAccessibleEvent::EVENT_NAME_CHANGE, acc);
} else if (frame &&
(acc->IsImage() != (frame->AccessibleType() == eImageType))) {
// It is a broken image that is being reframed because it either got
// or lost an `alt` tag that would rerender this node as text.
ContentRemoved(aRoot);
return true;
}
// If the frame is an OuterDoc frame but this isn't an OuterDocAccessible,
// we need to recreate the LocalAccessible. This can happen for embed or
// object elements if their embedded content changes to be web content.
if (frame && !acc->IsOuterDoc() &&
frame->AccessibleType() == eOuterDocType) {
ContentRemoved(aRoot);
return true;
}
// If the content is focused, and is being re-framed, reset the selection
// listener for the node because the previous selection listener is on the
// old frame.
if (aRoot->IsElement() && FocusMgr()->HasDOMFocus(aRoot)) {
SelectionMgr()->SetControlSelectionListener(aRoot->AsElement());
}
// If the accessible is a table, or table part, its layout table
// status may have changed. We need to invalidate the associated
// mac table cache, which listens for the following event. We don't
// use this cache when the core cache is enabled, so to minimise event
// traffic only fire this event when that cache is off.
if (acc->IsTable() || acc->IsTableRow() || acc->IsTableCell()) {
LocalAccessible* table = nsAccUtils::TableFor(acc);
if (table && table->IsTable()) {
QueueCacheUpdate(table, CacheDomain::Table);
}
}
// The accessible can be reparented or reordered in its parent.
// We schedule it for reinsertion. For example, a slotted element
// can change its slot attribute to a different slot.
insert = true;
// If the frame is invisible, remove it.
// Normally, layout sends explicit a11y notifications for visibility
// changes (see SendA11yNotifications in RestyleManager). However, if a
// visibility change also reconstructs the frame, we must handle it here.
if (frame && !frame->StyleVisibility()->IsVisible()) {
ContentRemoved(aRoot);
// There might be visible descendants, so we want to walk the subtree.
// However, we know we don't want to reinsert this node, so we set insert
// to false.
insert = false;
}
} else {
// If there is no current accessible, and the node has a frame, or is
// display:contents, schedule it for insertion.
if (aRoot->GetPrimaryFrame() ||
nsCoreUtils::CanCreateAccessibleWithoutFrame(aRoot)) {
// This may be a new subtree, the insertion process will recurse through
// its descendants.
if (!GetAccessibleOrDescendant(aRoot)) {
return true;
}
// Content is not an accessible, but has accessible descendants.
// We schedule this container for insertion strictly for the case where it
// itself now needs an accessible. We will still need to recurse into the
// descendant content to prune accessibles, and in all likelyness to
// insert accessibles since accessible insertions will likeley get missed
// in an existing subtree.
insert = true;
}
}
if (LocalAccessible* container = AccessibleOrTrueContainer(aRoot)) {
AutoTArray<nsCOMPtr<nsIContent>, 10> list;
dom::AllChildrenIterator iter =
dom::AllChildrenIterator(aRoot, nsIContent::eAllChildren, true);
while (nsIContent* childNode = iter.GetNextChild()) {
if (PruneOrInsertSubtree(childNode)) {
list.AppendElement(childNode);
}
}
if (!list.IsEmpty()) {
mNotificationController->ScheduleContentInsertion(container, list);
}
}
return insert;
}
void DocAccessible::RecreateAccessible(nsIContent* aContent) {
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eTree)) {
logging::MsgBegin("TREE", "accessible recreated");
logging::Node("content", aContent);
logging::MsgEnd();
}
#endif
// XXX: we shouldn't recreate whole accessible subtree, instead we should
// subclass hide and show events to handle them separately and implement their
// coalescence with normal hide and show events. Note, in this case they
// should be coalesced with normal show/hide events.
ContentRemoved(aContent);
ContentInserted(aContent, aContent->GetNextSibling());
}
void DocAccessible::ProcessInvalidationList() {
// Invalidate children of container accessible for each element in
// invalidation list. Allow invalidation list insertions while container
// children are recached.
for (uint32_t idx = 0; idx < mInvalidationList.Length(); idx++) {
nsIContent* content = mInvalidationList[idx];
if (!HasAccessible(content) && content->HasID()) {
LocalAccessible* container = GetContainerAccessible(content);
if (container) {
// Check if the node is a target of aria-owns, and if so, don't process
// it here and let DoARIAOwnsRelocation process it.
AttrRelProviders* list = GetRelProviders(
content->AsElement(), nsDependentAtomString(content->GetID()));
bool shouldProcess = !!list;
if (shouldProcess) {
for (uint32_t idx = 0; idx < list->Length(); idx++) {
if (list->ElementAt(idx)->mRelAttr == nsGkAtoms::aria_owns) {
shouldProcess = false;
break;
}
}
if (shouldProcess) {
ProcessContentInserted(container, content);
}
}
}
}
}
mInvalidationList.Clear();
}
void DocAccessible::ProcessQueuedCacheUpdates(uint64_t aInitialDomains) {
AUTO_PROFILER_MARKER_UNTYPED("DocAccessible::ProcessQueuedCacheUpdates", A11Y,
{});
PerfStats::AutoMetricRecording<
PerfStats::Metric::A11Y_ProcessQueuedCacheUpdate>
autoRecording;
// DO NOT ADD CODE ABOVE THIS BLOCK: THIS CODE IS MEASURING TIMINGS.
nsTArray<CacheData> data;
for (auto [acc, domain] : mQueuedCacheUpdatesArray) {
if (acc && acc->IsInDocument() && !acc->IsDefunct()) {
RefPtr<AccAttributes> fields = acc->BundleFieldsForCache(
domain, CacheUpdateType::Update, aInitialDomains);
if (fields->Count()) {
data.AppendElement(CacheData(
acc->IsDoc() ? 0 : reinterpret_cast<uint64_t>(acc->UniqueID()),
fields));
}
}
}
mQueuedCacheUpdatesArray.Clear();
mQueuedCacheUpdatesHash.Clear();
if (mViewportCacheDirty) {
RefPtr<AccAttributes> fields =
BundleFieldsForCache(CacheDomain::Viewport, CacheUpdateType::Update);
if (fields->Count()) {
data.AppendElement(CacheData(0, fields));
}
mViewportCacheDirty = false;
}
if (data.Length()) {
IPCDoc()->SendCache(CacheUpdateType::Update, data);
}
}
void DocAccessible::SendAccessiblesWillMove() {
if (!mIPCDoc) {
return;
}
nsTArray<uint64_t> ids;
for (LocalAccessible* acc : mMovedAccessibles) {
// If acc is defunct or not in a document, it was removed after it was
// moved.
if (!acc->IsDefunct() && acc->IsInDocument()) {
ids.AppendElement(reinterpret_cast<uintptr_t>(acc->UniqueID()));
// acc might have been re-parented. Since we cache bounds relative to the
// parent, we need to update the cache.
QueueCacheUpdate(acc, CacheDomain::Bounds);
}
}
if (!ids.IsEmpty()) {
mIPCDoc->SendAccessiblesWillMove(ids);
}
}
LocalAccessible* DocAccessible::GetAccessibleEvenIfNotInMap(
nsINode* aNode) const {
if (!aNode->IsContent() ||
!aNode->AsContent()->IsHTMLElement(nsGkAtoms::area)) {
return GetAccessible(aNode);
}
// XXX Bug 135040, incorrect when multiple images use the same map.
nsIFrame* frame = aNode->AsContent()->GetPrimaryFrame();
nsImageFrame* imageFrame = do_QueryFrame(frame);
if (imageFrame) {
LocalAccessible* parent = GetAccessible(imageFrame->GetContent());
if (parent) {
if (HTMLImageMapAccessible* imageMap = parent->AsImageMap()) {
return imageMap->GetChildAccessibleFor(aNode);
}
return nullptr;
}
}
return GetAccessible(aNode);
}
////////////////////////////////////////////////////////////////////////////////
// Protected members
void DocAccessible::NotifyOfLoading(bool aIsReloading) {
// Mark the document accessible as loading, if it stays alive then we'll mark
// it as loaded when we receive proper notification.
mLoadState &= ~eDOMLoaded;
if (!IsLoadEventTarget()) return;
if (aIsReloading && !mLoadEventType &&
// We can't fire events on a document whose tree isn't constructed yet.
HasLoadState(eTreeConstructed)) {
// Fire reload and state busy events on existing document accessible while
// event from user input flag can be calculated properly and accessible
// is alive. When new document gets loaded then this one is destroyed.
RefPtr<AccEvent> reloadEvent =
new AccEvent(nsIAccessibleEvent::EVENT_DOCUMENT_RELOAD, this);
nsEventShell::FireEvent(reloadEvent);
}
// Fire state busy change event. Use delayed event since we don't care
// actually if event isn't delivered when the document goes away like a shot.
RefPtr<AccEvent> stateEvent =
new AccStateChangeEvent(this, states::BUSY, true);
FireDelayedEvent(stateEvent);
}
void DocAccessible::DoInitialUpdate() {
AUTO_PROFILER_MARKER_UNTYPED("DocAccessible::DoInitialUpdate", A11Y, {});
PerfStats::AutoMetricRecording<PerfStats::Metric::A11Y_DoInitialUpdate>
autoRecording;
// DO NOT ADD CODE ABOVE THIS BLOCK: THIS CODE IS MEASURING TIMINGS.
if (nsCoreUtils::IsTopLevelContentDocInProcess(mDocumentNode)) {
mDocFlags |= eTopLevelContentDocInProcess;
if (IPCAccessibilityActive()) {
nsIDocShell* docShell = mDocumentNode->GetDocShell();
if (RefPtr<dom::BrowserChild> browserChild =
dom::BrowserChild::GetFrom(docShell)) {
// In content processes, top level content documents are always
// RootAccessibles.
MOZ_ASSERT(IsRoot());
DocAccessibleChild* ipcDoc = IPCDoc();
if (!ipcDoc) {
ipcDoc = new DocAccessibleChild(this, browserChild);
MOZ_RELEASE_ASSERT(browserChild->SendPDocAccessibleConstructor(
ipcDoc, nullptr, 0, mDocumentNode->GetBrowsingContext()));
// trying to recover from this failing is problematic
SetIPCDoc(ipcDoc);
}
}
}
}
// Set up a root element and ARIA role mapping.
UpdateRootElIfNeeded();
// Build initial tree.
CacheChildrenInSubtree(this);
mLoadState |= eTreeConstructed;
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eVerbose)) {
logging::Tree("TREE", "Initial subtree", this);
}
if (logging::IsEnabled(logging::eTreeSize)) {
logging::TreeSize("TREE SIZE", "Initial subtree", this);
}
#endif
// Fire reorder event after the document tree is constructed. Note, since
// this reorder event is processed by parent document then events targeted to
// this document may be fired prior to this reorder event. If this is
// a problem then consider to keep event processing per tab document.
if (!IsRoot()) {
RefPtr<AccReorderEvent> reorderEvent = new AccReorderEvent(LocalParent());
ParentDocument()->FireDelayedEvent(reorderEvent);
}
if (AppShutdown::IsShutdownImpending()) {
return;
}
if (IPCAccessibilityActive()) {
DocAccessibleChild* ipcDoc = IPCDoc();
MOZ_ASSERT(ipcDoc);
if (ipcDoc) {
// Send an initial update for this document and its attributes. Each acc
// contained in this doc will have its initial update sent in
// `InsertIntoIpcTree`.
SendCache(nsAccessibilityService::GetActiveCacheDomains(),
CacheUpdateType::Initial);
for (auto idx = 0U; idx < mChildren.Length(); idx++) {
ipcDoc->InsertIntoIpcTree(mChildren.ElementAt(idx), true);
}
ipcDoc->SendQueuedMutationEvents();
}
}
}
void DocAccessible::ProcessLoad() {
mLoadState |= eCompletelyLoaded;
#ifdef A11Y_LOG
if (logging::IsEnabled(logging::eDocLoad)) {
logging::DocCompleteLoad(this, IsLoadEventTarget());
}
#endif
// Do not fire document complete/stop events for root chrome document
// accessibles because screen readers start working on focus event in the case
// of root chrome documents.
if (!IsLoadEventTarget()) return;
// Fire complete/load stopped if the load event type is given.
if (mLoadEventType) {
RefPtr<AccEvent> loadEvent = new AccEvent(mLoadEventType, this);
FireDelayedEvent(loadEvent);
mLoadEventType = 0;
}
// Fire busy state change event.
RefPtr<AccEvent> stateEvent =
new AccStateChangeEvent(this, states::BUSY, false);
FireDelayedEvent(stateEvent);
}
void DocAccessible::AddDependentIDsFor(LocalAccessible* aRelProvider,
nsAtom* aRelAttr) {
dom::Element* relProviderEl = aRelProvider->Elm();
if (!relProviderEl) return;
for (uint32_t idx = 0; idx < kRelationAttrsLen; idx++) {
nsStaticAtom* relAttr = kRelationAttrs[idx];
if (aRelAttr && aRelAttr != relAttr) continue;
if (relAttr == nsGkAtoms::_for) {
if (!relProviderEl->IsAnyOfHTMLElements(nsGkAtoms::label,
nsGkAtoms::output)) {
continue;
}
} else if (relAttr == nsGkAtoms::control) {
if (!relProviderEl->IsAnyOfXULElements(nsGkAtoms::label,
nsGkAtoms::description)) {
continue;
}
}
AssociatedElementsIterator iter(this, relProviderEl, relAttr);
while (true) {
const nsDependentSubstring id = iter.NextID();
if (id.IsEmpty()) break;
AttrRelProviders* providers = GetOrCreateRelProviders(relProviderEl, id);
if (providers) {
AttrRelProvider* provider = new AttrRelProvider(relAttr, relProviderEl);
if (provider) {
providers->AppendElement(provider);
// We've got here during the children caching. If the referenced
// content is not accessible then store it to pend its container
// children invalidation (this happens immediately after the caching
// is finished).
nsIContent* dependentContent = iter.GetElem(id);
if (dependentContent) {
if (!HasAccessible(dependentContent)) {
mInvalidationList.AppendElement(dependentContent);
}
}
}
}
}
// If the relation attribute is given then we don't have anything else to
// check.
if (aRelAttr) break;
}
// Make sure to schedule the tree update if needed.
mNotificationController->ScheduleProcessing();
}
void DocAccessible::RemoveDependentIDsFor(LocalAccessible* aRelProvider,
nsAtom* aRelAttr) {
dom::Element* relProviderElm = aRelProvider->Elm();
if (!relProviderElm) return;
for (uint32_t idx = 0; idx < kRelationAttrsLen; idx++) {
nsStaticAtom* relAttr = kRelationAttrs[idx];
if (aRelAttr && aRelAttr != kRelationAttrs[idx]) continue;
AssociatedElementsIterator iter(this, relProviderElm, relAttr);
while (true) {
const nsDependentSubstring id = iter.NextID();
if (id.IsEmpty()) break;
AttrRelProviders* providers = GetRelProviders(relProviderElm, id);
if (providers) {
providers->RemoveElementsBy(
[relAttr, relProviderElm](const auto& provider) {
return provider->mRelAttr == relAttr &&
provider->mContent == relProviderElm;
});
RemoveRelProvidersIfEmpty(relProviderElm, id);
}
}
// If the relation attribute is given then we don't have anything else to
// check.
if (aRelAttr) break;
}
}
void DocAccessible::AddDependentElementsFor(LocalAccessible* aRelProvider,
nsAtom* aRelAttr) {
dom::Element* providerEl = aRelProvider->Elm();
if (!providerEl) {
return;
}
for (nsStaticAtom* attr : kSingleElementRelationIdlAttrs) {
if (aRelAttr && aRelAttr != attr) {
continue;
}
if (dom::Element* targetEl =
providerEl->GetExplicitlySetAttrElement(attr)) {
AttrRelProviders& providers =
mDependentElementsMap.LookupOrInsert(targetEl);
AttrRelProvider* provider = new AttrRelProvider(attr, providerEl);
providers.AppendElement(provider);
}
// If the relation attribute was given, we've already handled it. We don't
// have anything else to check.
if (aRelAttr) {
break;
}
}
aria::AttrWithCharacteristicsIterator multipleElementsRelationIter(
ATTR_REFLECT_ELEMENTS);
while (multipleElementsRelationIter.Next()) {
nsStaticAtom* attr = multipleElementsRelationIter.AttrName();
if (aRelAttr && aRelAttr != attr) {
continue;
}
nsTArray<dom::Element*> elements;
nsAccUtils::GetARIAElementsAttr(providerEl, attr, elements);
for (dom::Element* targetEl : elements) {
AttrRelProviders& providers =
mDependentElementsMap.LookupOrInsert(targetEl);
AttrRelProvider* provider = new AttrRelProvider(attr, providerEl);
providers.AppendElement(provider);
}
// If the relation attribute was given, we've already handled it. We don't
// have anything else to check.
if (aRelAttr) {
break;
}
}
}
void DocAccessible::RemoveDependentElementsFor(LocalAccessible* aRelProvider,
nsAtom* aRelAttr) {
dom::Element* providerEl = aRelProvider->Elm();
if (!providerEl) {
return;
}
for (nsStaticAtom* attr : kSingleElementRelationIdlAttrs) {
if (aRelAttr && aRelAttr != attr) {
continue;
}
if (dom::Element* targetEl =
providerEl->GetExplicitlySetAttrElement(attr)) {
if (auto providers = mDependentElementsMap.Lookup(targetEl)) {
providers.Data().RemoveElementsBy([attr,
providerEl](const auto& provider) {
return provider->mRelAttr == attr && provider->mContent == providerEl;
});
if (providers.Data().IsEmpty()) {
providers.Remove();
}
}
}
// If the relation attribute was given, we've already handled it. We don't
// have anything else to check.
if (aRelAttr) {
break;
}
}
aria::AttrWithCharacteristicsIterator multipleElementsRelationIter(
ATTR_REFLECT_ELEMENTS);
while (multipleElementsRelationIter.Next()) {
nsStaticAtom* attr = multipleElementsRelationIter.AttrName();
if (aRelAttr && aRelAttr != attr) {
continue;
}
nsTArray<dom::Element*> elements;
nsAccUtils::GetARIAElementsAttr(providerEl, attr, elements);
for (dom::Element* targetEl : elements) {
if (auto providers = mDependentElementsMap.Lookup(targetEl)) {
providers.Data().RemoveElementsBy([attr,
providerEl](const auto& provider) {
return provider->mRelAttr == attr && provider->mContent == providerEl;
});
if (providers.Data().IsEmpty()) {
providers.Remove();
}
}
}
// If the relation attribute was given, we've already handled it. We don't
// have anything else to check.
if (aRelAttr) {
break;
}
}
}
bool DocAccessible::UpdateAccessibleOnAttrChange(dom::Element* aElement,
nsAtom* aAttribute) {
if (aAttribute == nsGkAtoms::role) {
// It is common for js libraries to set the role on the body element after
// the document has loaded. In this case we just update the role map entry.
if (mContent == aElement) {
SetRoleMapEntryForDoc(aElement);
if (mIPCDoc) {
mIPCDoc->SendRoleChangedEvent(Role(), mRoleMapEntryIndex);
}
return true;
}
// Recreate the accessible when role is changed because we might require a
// different accessible class for the new role or the accessible may expose
// a different sets of interfaces (COM restriction).
RecreateAccessible(aElement);
return true;
}
if (aAttribute == nsGkAtoms::multiple) {
if (dom::HTMLSelectElement* select =
dom::HTMLSelectElement::FromNode(aElement)) {
if (select->Size() <= 1) {
// Adding the 'multiple' attribute to a select that has a size of 1
// creates a listbox as opposed to a combobox with a popup combobox
// list. Removing the attribute does the opposite.
RecreateAccessible(aElement);
return true;
}
}
}
if (aAttribute == nsGkAtoms::size &&
aElement->IsHTMLElement(nsGkAtoms::select)) {
// Changing the size of a select element can potentially change it from a
// combobox button to a listbox with different underlying implementations.
RecreateAccessible(aElement);
return true;
}
if (aAttribute == nsGkAtoms::type) {
// If the input[type] changes, we should recreate the accessible.
RecreateAccessible(aElement);
return true;
}
if (aAttribute == nsGkAtoms::href &&
!nsCoreUtils::HasClickListener(aElement)) {
// If the href is added or removed for a or area elements without click
// listeners, we need to recreate the accessible since the role might have
// changed. Without an href or click listener, the accessible must be a
// generic.
if (aElement->IsHTMLElement(nsGkAtoms::a)) {
LocalAccessible* acc = GetAccessible(aElement);
if (!acc) {
return false;
}
if (acc->IsHTMLLink() != aElement->HasAttr(nsGkAtoms::href)) {
RecreateAccessible(aElement);
return true;
}
} else if (aElement->IsHTMLElement(nsGkAtoms::area)) {
// For area accessibles, we have to recreate the entire image map, since
// the image map accessible manages the tree itself.
LocalAccessible* areaAcc = GetAccessibleEvenIfNotInMap(aElement);
if (!areaAcc || !areaAcc->LocalParent()) {
return false;
}
RecreateAccessible(areaAcc->LocalParent()->GetContent());
return true;
}
}
if (aElement->IsHTMLElement(nsGkAtoms::img) && aAttribute == nsGkAtoms::alt) {
// If alt text changes on an img element, we may want to create or remove an
// accessible for that img.
if (nsAccessibilityService::ShouldCreateImgAccessible(aElement, this)) {
if (GetAccessible(aElement)) {
// If the accessible already exists, there's no need to create one.
return false;
}
ContentInserted(aElement, aElement->GetNextSibling());
} else {
ContentRemoved(aElement);
}
return true;
}
if (aAttribute == nsGkAtoms::popover && aElement->IsHTMLElement()) {
// Changing the popover attribute might change the role.
RecreateAccessible(aElement);
return true;
}
return false;
}
void DocAccessible::UpdateRootElIfNeeded() {
dom::Element* rootEl = mDocumentNode->GetBodyElement();
if (!rootEl) {
rootEl = mDocumentNode->GetRootElement();
}
if (rootEl != mContent) {
mContent = rootEl;
SetRoleMapEntryForDoc(rootEl);
if (mIPCDoc) {
mIPCDoc->SendRoleChangedEvent(Role(), mRoleMapEntryIndex);
}
}
}
/**
* Content insertion helper.
*/
class InsertIterator final {
public:
InsertIterator(LocalAccessible* aContext,
const nsTArray<nsCOMPtr<nsIContent>>* aNodes)
: mChild(nullptr),
mChildBefore(nullptr),
mWalker(aContext),
mNodes(aNodes),
mNodesIdx(0) {
MOZ_ASSERT(aContext, "No context");
MOZ_ASSERT(aNodes, "No nodes to search for accessible elements");
MOZ_COUNT_CTOR(InsertIterator);
}
MOZ_COUNTED_DTOR(InsertIterator)
LocalAccessible* Context() const { return mWalker.Context(); }
LocalAccessible* Child() const { return mChild; }
LocalAccessible* ChildBefore() const { return mChildBefore; }
DocAccessible* Document() const { return mWalker.Document(); }
/**
* Iterates to a next accessible within the inserted content.
*/
bool Next();
void Rejected() {
mChild = nullptr;
mChildBefore = nullptr;
}
private:
LocalAccessible* mChild;
LocalAccessible* mChildBefore;
TreeWalker mWalker;
const nsTArray<nsCOMPtr<nsIContent>>* mNodes;
nsTHashSet<nsPtrHashKey<const nsIContent>> mProcessedNodes;
uint32_t mNodesIdx;
};
bool InsertIterator::Next() {
if (mNodesIdx > 0) {
// If we already processed the first node in the mNodes list,
// check if we can just use the walker to get its next sibling.
LocalAccessible* nextChild = mWalker.Next();
if (nextChild) {
mChildBefore = mChild;
mChild = nextChild;
return true;
}
}
while (mNodesIdx < mNodes->Length()) {
nsIContent* node = mNodes->ElementAt(mNodesIdx++);
// Check to see if we already processed this node with this iterator.
// this can happen if we get two redundant insertions in the case of a
// text and frame insertion.
if (!mProcessedNodes.EnsureInserted(node)) {
continue;
}
LocalAccessible* container = Document()->AccessibleOrTrueContainer(
node->GetFlattenedTreeParentNode(), true);
// Ignore nodes that are not contained by the container anymore.
// The container might be changed, for example, because of the subsequent
// overlapping content insertion (i.e. other content was inserted between
// this inserted content and its container or the content was reinserted
// into different container of unrelated part of tree). To avoid a double
// processing of the content insertion ignore this insertion notification.
// Note, the inserted content might be not in tree at all at this point
// what means there's no container. Ignore the insertion too.
if (container != Context()) {
continue;
}
// HTML comboboxes have no-content list accessible as an intermediate
// containing all options.
if (container->IsHTMLCombobox()) {
container = container->LocalFirstChild();
}
if (!container->IsAcceptableChild(node)) {
continue;
}
#ifdef A11Y_LOG
logging::TreeInfo("traversing an inserted node", logging::eVerbose,
"container", container, "node", node);
#endif
nsIContent* prevNode = mChild ? mChild->GetContent() : nullptr;
if (prevNode && prevNode->GetNextSibling() == node) {
// If inserted nodes are siblings then just move the walker next.
LocalAccessible* nextChild = mWalker.Scope(node);
if (nextChild) {
mChildBefore = mChild;
mChild = nextChild;
return true;
}
} else {
// Otherwise use a new walker to find this node in the container's
// subtree, and retrieve its preceding sibling.
TreeWalker finder(container);
if (finder.Seek(node)) {
mChild = mWalker.Scope(node);
if (mChild) {
MOZ_ASSERT(!mChild->IsRelocated(), "child cannot be aria owned");
mChildBefore = finder.Prev();
return true;
}
}
}
}
return false;
}
void DocAccessible::MaybeFireEventsForChangedPopover(LocalAccessible* aAcc) {
dom::Element* el = aAcc->Elm();
if (!el || !el->IsHTMLElement() || !el->HasAttr(nsGkAtoms::popover)) {
return; // Not a popover.
}
// A popover has just been inserted into or removed from the a11y tree, which
// means it just appeared or disappeared. Fire expanded state changes on its
// popovertarget invokers.
Relation invokers(new RelatedAccIterator(mDoc, el, nsGkAtoms::popovertarget));
// Additionally iterate over any commandfor invokers.
invokers.AppendIter(new RelatedAccIterator(mDoc, el, nsGkAtoms::commandfor));
while (Accessible* invoker = invokers.LocalNext()) {
RefPtr<AccEvent> expandedChangeEvent =
new AccStateChangeEvent(invoker->AsLocal(), states::EXPANDED);
FireDelayedEvent(expandedChangeEvent);
}
}
void DocAccessible::ProcessContentInserted(
LocalAccessible* aContainer, const nsTArray<nsCOMPtr<nsIContent>>* aNodes) {
// Process insertions if the container accessible is still in tree.
if (!aContainer->IsInDocument()) {
return;
}
// If new root content has been inserted then update it.
if (aContainer == this) {
UpdateRootElIfNeeded();
}
InsertIterator iter(aContainer, aNodes);
if (!iter.Next()) {
return;
}
#ifdef A11Y_LOG
logging::TreeInfo("children before insertion", logging::eVerbose, aContainer);
#endif
TreeMutation mt(aContainer);
bool inserted = false;
do {
LocalAccessible* parent = iter.Child()->LocalParent();
if (parent) {
LocalAccessible* previousSibling = iter.ChildBefore();
if (parent != aContainer ||
iter.Child()->LocalPrevSibling() != previousSibling) {
if (previousSibling && previousSibling->LocalParent() != aContainer) {
// previousSibling hasn't been moved into aContainer yet.
// previousSibling should be later in the insertion list, so the tree
// will get adjusted when we process it later.
MOZ_DIAGNOSTIC_ASSERT(parent == aContainer,
"Child moving to new parent, but previous "
"sibling in wrong parent");
continue;
}
#ifdef A11Y_LOG
logging::TreeInfo("relocating accessible", 0, "old parent", parent,
"new parent", aContainer, "child", iter.Child(),
nullptr);
#endif
MoveChild(iter.Child(), aContainer,
previousSibling ? previousSibling->IndexInParent() + 1 : 0);
inserted = true;
}
continue;
}
if (aContainer->InsertAfter(iter.Child(), iter.ChildBefore())) {
#ifdef A11Y_LOG
logging::TreeInfo("accessible was inserted", 0, "container", aContainer,
"child", iter.Child(), nullptr);
#endif
CreateSubtree(iter.Child());
mt.AfterInsertion(iter.Child());
inserted = true;
MaybeFireEventsForChangedPopover(iter.Child());
continue;
}
MOZ_ASSERT_UNREACHABLE("accessible was rejected");
iter.Rejected();
} while (iter.Next());
mt.Done();
#ifdef A11Y_LOG
logging::TreeInfo("children after insertion", logging::eVerbose, aContainer);
#endif
// We might not have actually inserted anything if layout frame reconstruction
// occurred.
if (inserted) {
FireEventsOnInsertion(aContainer);
}
}
void DocAccessible::ProcessContentInserted(LocalAccessible* aContainer,
nsIContent* aNode) {
if (!aContainer->IsInDocument()) {
return;
}
#ifdef A11Y_LOG
logging::TreeInfo("children before insertion", logging::eVerbose, aContainer);
#endif
#ifdef A11Y_LOG
logging::TreeInfo("traversing an inserted node", logging::eVerbose,
"container", aContainer, "node", aNode);
#endif
TreeWalker walker(aContainer);
if (aContainer->IsAcceptableChild(aNode) && walker.Seek(aNode)) {
LocalAccessible* child = GetAccessible(aNode);
if (!child) {
child = GetAccService()->CreateAccessible(aNode, aContainer);
}
if (child) {
TreeMutation mt(aContainer);
if (!aContainer->InsertAfter(child, walker.Prev())) {
return;
}
CreateSubtree(child);
mt.AfterInsertion(child);
mt.Done();
FireEventsOnInsertion(aContainer);
}
}
#ifdef A11Y_LOG
logging::TreeInfo("children after insertion", logging::eVerbose, aContainer);
#endif
}
void DocAccessible::FireEventsOnInsertion(LocalAccessible* aContainer) {
// Check to see if change occurred inside an alert, and fire an EVENT_ALERT
// if it did.
if (aContainer->IsAlert() || aContainer->IsInsideAlert()) {
LocalAccessible* ancestor = aContainer;
do {
if (ancestor->IsAlert()) {
FireDelayedEvent(nsIAccessibleEvent::EVENT_ALERT, ancestor);
break;
}
} while ((ancestor = ancestor->LocalParent()));
}
}
void DocAccessible::ContentRemoved(LocalAccessible* aChild) {
AUTO_PROFILER_MARKER_TEXT("DocAccessible::ContentRemovedAcc", A11Y, {},
""_ns);
PerfStats::AutoMetricRecording<PerfStats::Metric::A11Y_ContentRemovedAcc>
autoRecording;
// DO NOT ADD CODE ABOVE THIS BLOCK: THIS CODE IS MEASURING TIMINGS.
MOZ_DIAGNOSTIC_ASSERT(aChild != this, "Should never be called for the doc");
LocalAccessible* parent = aChild->LocalParent();
MOZ_DIAGNOSTIC_ASSERT(parent, "Unattached accessible from tree");
#ifdef A11Y_LOG
logging::TreeInfo("process content removal", 0, "container", parent, "child",
aChild, nullptr);
#endif
// XXX: event coalescence may kill us
RefPtr<LocalAccessible> kungFuDeathGripChild(aChild);
TreeMutation mt(parent);
mt.BeforeRemoval(aChild);
if (aChild->IsDefunct()) {
MOZ_ASSERT_UNREACHABLE("Event coalescence killed the accessible");
mt.Done();
return;
}
MOZ_DIAGNOSTIC_ASSERT(aChild->LocalParent(), "Alive but unparented #1");
if (aChild->IsRelocated()) {
nsTArray<RefPtr<LocalAccessible>>* owned = mARIAOwnsHash.Get(parent);
MOZ_ASSERT(owned, "IsRelocated flag is out of sync with mARIAOwnsHash");
owned->RemoveElement(aChild);
if (owned->Length() == 0) {
mARIAOwnsHash.Remove(parent);
}
}
MOZ_DIAGNOSTIC_ASSERT(aChild->LocalParent(), "Unparented #2");
UncacheChildrenInSubtree(aChild);
parent->RemoveChild(aChild);
mt.Done();
}
void DocAccessible::ContentRemoved(nsIContent* aContentNode) {
AUTO_PROFILER_MARKER_TEXT("DocAccessible::ContentRemovedNode", A11Y, {},
""_ns);
PerfStats::AutoMetricRecording<PerfStats::Metric::A11Y_ContentRemovedNode>
autoRecording;
// DO NOT ADD CODE ABOVE THIS BLOCK: THIS CODE IS MEASURING TIMINGS.
if (!mRemovedNodes.EnsureInserted(aContentNode)) {
return;
}
// If child node is not accessible then look for its accessible children.
LocalAccessible* acc = GetAccessible(aContentNode);
if (acc) {
ContentRemoved(acc);
}
dom::AllChildrenIterator iter =
dom::AllChildrenIterator(aContentNode, nsIContent::eAllChildren, true);
while (nsIContent* childNode = iter.GetNextChild()) {
ContentRemoved(childNode);
}
// If this node has a shadow root, remove its explicit children too.
// The host node may be removed after the shadow root was attached, and
// before we asynchronously prune the light DOM and construct the shadow DOM.
// If this is a case where the node does not have its own accessible, we will
// not recurse into its current children, so we need to use an
// ExplicitChildIterator in order to get its accessible children in the light
// DOM, since they are not accessible anymore via AllChildrenIterator.
if (aContentNode->GetShadowRoot()) {
for (nsIContent* childNode = aContentNode->GetFirstChild(); childNode;
childNode = childNode->GetNextSibling()) {
ContentRemoved(childNode);
}
}
}
bool DocAccessible::RelocateARIAOwnedIfNeeded(nsIContent* aElement) {
RelatedAccIterator owners(mDoc, aElement, nsGkAtoms::aria_owns);
if (Accessible* owner = owners.Next()) {
mNotificationController->ScheduleRelocation(owner->AsLocal());
return true;
}
return false;
}
void DocAccessible::DoARIAOwnsRelocation(LocalAccessible* aOwner) {
MOZ_ASSERT(aOwner, "aOwner must be a valid pointer");
MOZ_ASSERT(aOwner->Elm(), "aOwner->Elm() must be a valid pointer");
#ifdef A11Y_LOG
logging::TreeInfo("aria owns relocation", logging::eVerbose, aOwner);
#endif
const nsRoleMapEntry* roleMap = aOwner->ARIARoleMap();
if (roleMap && roleMap->role == roles::EDITCOMBOBOX) {
// The READWRITE state of a combobox may sever aria-owns relations
// we fallback to "controls" relations.
QueueCacheUpdate(aOwner, CacheDomain::Relations);
}
nsTArray<RefPtr<LocalAccessible>>* owned =
mARIAOwnsHash.GetOrInsertNew(aOwner);
if (aOwner->Elm()->State().HasState(dom::ElementState::READWRITE)) {
// The container is editable.
PutChildrenBack(owned, 0);
return;
}
AssociatedElementsIterator iter(this, aOwner->Elm(), nsGkAtoms::aria_owns);
uint32_t idx = 0;
while (dom::Element* childEl = iter.NextElem()) {
if (childEl->State().HasState(dom::ElementState::READWRITE)) {
dom::Element* parentEl = childEl->GetFlattenedTreeParentElement();
if (parentEl &&
parentEl->State().HasState(dom::ElementState::READWRITE)) {
// The child is inside of an editable subtree, don't relocate it.
continue;
}
}
LocalAccessible* child = GetAccessible(childEl);
auto insertIdx = aOwner->ChildCount() - owned->Length() + idx;
// Make an attempt to create an accessible if it wasn't created yet.
if (!child) {
// An owned child cannot be an ancestor of the owner.
bool ok = true;
bool check = true;
for (LocalAccessible* parent = aOwner; parent && !parent->IsDoc();
parent = parent->LocalParent()) {
if (check) {
if (parent->Elm()->IsInclusiveDescendantOf(childEl)) {
ok = false;
break;
}
}
// We need to do the DOM descendant check again whenever the DOM
// lineage changes. If parent is relocated, that means the next
// ancestor will have a different DOM lineage.
check = parent->IsRelocated();
}
if (!ok) {
continue;
}
if (aOwner->IsAcceptableChild(childEl)) {
child = GetAccService()->CreateAccessible(childEl, aOwner);
if (child) {
TreeMutation imut(aOwner);
aOwner->InsertChildAt(insertIdx, child);
imut.AfterInsertion(child);
imut.Done();
child->SetRelocated(true);
owned->InsertElementAt(idx, child);
idx++;
// Create subtree before adjusting the insertion index, since subtree
// creation may alter children in the container.
CreateSubtree(child);
FireEventsOnInsertion(aOwner);
}
}
continue;
}
#ifdef A11Y_LOG
logging::TreeInfo("aria owns traversal", logging::eVerbose, "candidate",
child, nullptr);
#endif
if (owned->IndexOf(child) < idx) {
continue; // ignore second entry of same ID
}
// Same child on same position, no change.
if (child->LocalParent() == aOwner) {
int32_t indexInParent = child->IndexInParent();
// The child is being placed in its current index,
// eg. aria-owns='id1 id2 id3' is changed to aria-owns='id3 id2 id1'.
if (indexInParent == static_cast<int32_t>(insertIdx)) {
MOZ_ASSERT(child->IsRelocated(),
"A child, having an index in parent from aria ownded "
"indices range, has to be aria owned");
MOZ_ASSERT(owned->ElementAt(idx) == child,
"Unexpected child in ARIA owned array");
idx++;
continue;
}
// The child is being inserted directly after its current index,
// resulting in a no-move case. This will happen when a parent aria-owns
// its last ordinal child:
// <ul aria-owns='id2'><li id='id1'></li><li id='id2'></li></ul>
if (indexInParent == static_cast<int32_t>(insertIdx) - 1) {
MOZ_ASSERT(!child->IsRelocated(),
"Child should be in its ordinal position");
child->SetRelocated(true);
owned->InsertElementAt(idx, child);
idx++;
continue;
}
}
MOZ_ASSERT(owned->SafeElementAt(idx) != child, "Already in place!");
// A new child is found, check for loops.
if (child->LocalParent() != aOwner) {
// Child is aria-owned by another container, skip.
if (child->IsRelocated()) {
continue;
}
LocalAccessible* parent = aOwner;
while (parent && parent != child && !parent->IsDoc()) {
parent = parent->LocalParent();
}
// A referred child cannot be a parent of the owner.
if (parent == child) {
continue;
}
}
if (MoveChild(child, aOwner, insertIdx)) {
child->SetRelocated(true);
MOZ_ASSERT(owned == mARIAOwnsHash.Get(aOwner));
owned = mARIAOwnsHash.GetOrInsertNew(aOwner);
owned->InsertElementAt(idx, child);
idx++;
}
}
// Put back children that are not seized anymore.
PutChildrenBack(owned, idx);
if (owned->Length() == 0) {
mARIAOwnsHash.Remove(aOwner);
}
}
void DocAccessible::PutChildrenBack(
nsTArray<RefPtr<LocalAccessible>>* aChildren, uint32_t aStartIdx) {
MOZ_ASSERT(aStartIdx <= aChildren->Length(), "Wrong removal index");
for (auto idx = aStartIdx; idx < aChildren->Length(); idx++) {
LocalAccessible* child = aChildren->ElementAt(idx);
if (!child->IsInDocument()) {
continue;
}
// Remove the child from the owner
LocalAccessible* owner = child->LocalParent();
if (!owner) {
NS_ERROR("Cannot put the child back. No parent, a broken tree.");
continue;
}
#ifdef A11Y_LOG
logging::TreeInfo("aria owns put child back", 0, "old parent", owner,
"child", child, nullptr);
#endif
// Unset relocated flag to find an insertion point for the child.
child->SetRelocated(false);
nsIContent* content = child->GetContent();
int32_t idxInParent = -1;
LocalAccessible* origContainer =
AccessibleOrTrueContainer(content->GetFlattenedTreeParentNode());
// This node has probably been detached or removed from the DOM, so we have
// nowhere to move it.
if (!origContainer) {
continue;
}
// If the target container or any of its ancestors aren't in the document,
// there's no need to determine where the child should go for relocation
// since the target tree is going away.
bool origContainerHasOutOfDocAncestor = false;
LocalAccessible* ancestor = origContainer;
while (ancestor) {
if (ancestor->IsDoc()) {
break;
}
if (!ancestor->IsInDocument()) {
origContainerHasOutOfDocAncestor = true;
break;
}
ancestor = ancestor->LocalParent();
}
if (origContainerHasOutOfDocAncestor) {
continue;
}
TreeWalker walker(origContainer);
if (!walker.Seek(content)) {
continue;
}
LocalAccessible* prevChild = walker.Prev();
if (prevChild) {
idxInParent = prevChild->IndexInParent() + 1;
MOZ_DIAGNOSTIC_ASSERT(origContainer == prevChild->LocalParent(),
"Broken tree");
origContainer = prevChild->LocalParent();
} else {
idxInParent = 0;
}
// The child may have already be in its ordinal place for 2 reasons:
// 1. It was the last ordinal child, and the first aria-owned child.
// given: <ul id="list" aria-owns="b"><li id="a"></li><li
// id="b"></li></ul> after load: $("list").setAttribute("aria-owns", "");
// 2. The preceding adopted children were just reclaimed, eg:
// given: <ul id="list"><li id="b"></li></ul>
// after load: $("list").setAttribute("aria-owns", "a b");
// later: $("list").setAttribute("aria-owns", "");
if (origContainer != owner || child->IndexInParent() != idxInParent) {
// Only attempt to move the child if the target container would accept it.
// Otherwise, just allow it to be removed from the tree, since it would
// not be allowed in normal tree creation.
if (origContainer->IsAcceptableChild(child->GetContent())) {
DebugOnly<bool> moved = MoveChild(child, origContainer, idxInParent);
MOZ_ASSERT(moved, "Failed to put child back.");
}
} else {
MOZ_ASSERT(!child->LocalPrevSibling() ||
!child->LocalPrevSibling()->IsRelocated(),
"No relocated child should appear before this one");
MOZ_ASSERT(!child->LocalNextSibling() ||
child->LocalNextSibling()->IsRelocated(),
"No ordinal child should appear after this one");
}
}
aChildren->RemoveLastElements(aChildren->Length() - aStartIdx);
}
void DocAccessible::TrackMovedAccessible(LocalAccessible* aAcc) {
MOZ_ASSERT(aAcc->mDoc == this);
// If an Accessible is inserted and moved during the same tick, don't track
// it as a move because it hasn't been shown yet.
if (!mInsertedAccessibles.Contains(aAcc)) {
mMovedAccessibles.EnsureInserted(aAcc);
}
// When we move an Accessible, we're also moving its descendants.
if (aAcc->IsOuterDoc()) {
// Don't descend into other documents.
return;
}
for (uint32_t c = 0, count = aAcc->ContentChildCount(); c < count; ++c) {
TrackMovedAccessible(aAcc->ContentChildAt(c));
}
}
bool DocAccessible::MoveChild(LocalAccessible* aChild,
LocalAccessible* aNewParent,
int32_t aIdxInParent) {
MOZ_ASSERT(aChild, "No child");
MOZ_ASSERT(aChild->LocalParent(), "No parent");
// We can't guarantee MoveChild works correctly for accessibilities storing
// children outside mChildren.
MOZ_ASSERT(
aIdxInParent <= static_cast<int32_t>(aNewParent->mChildren.Length()),
"Wrong insertion point for a moving child");
LocalAccessible* curParent = aChild->LocalParent();
if (!aNewParent->IsAcceptableChild(aChild->GetContent())) {
return false;
}
#ifdef A11Y_LOG
logging::TreeInfo("move child", 0, "old parent", curParent, "new parent",
aNewParent, "child", aChild, nullptr);
#endif
// Forget aria-owns info in case of ARIA owned element. The caller is expected
// to update it if needed.
if (aChild->IsRelocated()) {
aChild->SetRelocated(false);
nsTArray<RefPtr<LocalAccessible>>* owned = mARIAOwnsHash.Get(curParent);
MOZ_ASSERT(owned, "IsRelocated flag is out of sync with mARIAOwnsHash");
owned->RemoveElement(aChild);
if (owned->Length() == 0) {
mARIAOwnsHash.Remove(curParent);
}
}
if (curParent == aNewParent) {
MOZ_ASSERT(aChild->IndexInParent() != aIdxInParent, "No move case");
curParent->RelocateChild(aIdxInParent, aChild);
if (mIPCDoc) {
TrackMovedAccessible(aChild);
}
#ifdef A11Y_LOG
logging::TreeInfo("move child: parent tree after", logging::eVerbose,
curParent);
#endif
return true;
}
// If the child cannot be re-inserted into the tree, then make sure to remove
// it from its present parent and then shutdown it.
bool hasInsertionPoint =
(aIdxInParent >= 0) &&
(aIdxInParent <= static_cast<int32_t>(aNewParent->mChildren.Length()));
TreeMutation rmut(curParent);
rmut.BeforeRemoval(aChild, hasInsertionPoint && TreeMutation::kNoShutdown);
curParent->RemoveChild(aChild);
rmut.Done();
// No insertion point for the child.
if (!hasInsertionPoint) {
return true;
}
TreeMutation imut(aNewParent);
aNewParent->InsertChildAt(aIdxInParent, aChild);
if (mIPCDoc) {
TrackMovedAccessible(aChild);
}
imut.AfterInsertion(aChild);
imut.Done();
#ifdef A11Y_LOG
logging::TreeInfo("move child: old parent tree after", logging::eVerbose,
curParent);
logging::TreeInfo("move child: new parent tree after", logging::eVerbose,
aNewParent);
#endif
return true;
}
void DocAccessible::CacheChildrenInSubtree(LocalAccessible* aRoot,
LocalAccessible** aFocusedAcc) {
// If the accessible is focused then report a focus event after all related
// mutation events.
if (aFocusedAcc && !*aFocusedAcc &&
FocusMgr()->HasDOMFocus(aRoot->GetContent())) {
*aFocusedAcc = aRoot;
}
LocalAccessible* root =
aRoot->IsHTMLCombobox() ? aRoot->LocalFirstChild() : aRoot;
if (root->KidsFromDOM()) {
TreeMutation mt(root, TreeMutation::kNoEvents);
TreeWalker walker(root);
while (LocalAccessible* child = walker.Next()) {
if (child->IsBoundToParent()) {
MoveChild(child, root, root->mChildren.Length());
continue;
}
root->AppendChild(child);
mt.AfterInsertion(child);
CacheChildrenInSubtree(child, aFocusedAcc);
}
mt.Done();
}
// Fire events for ARIA elements.
if (!aRoot->HasARIARole()) {
return;
}
roles::Role role = aRoot->ARIARole();
if (!aRoot->IsDoc()) {
if (role == roles::DIALOG || role == roles::NON_NATIVE_DOCUMENT) {
// XXX: we should delay document load complete event if the ARIA document
// has aria-busy.
FireDelayedEvent(nsIAccessibleEvent::EVENT_DOCUMENT_LOAD_COMPLETE, aRoot);
} else if (role == roles::MENUPOPUP && HasLoadState(eCompletelyLoaded)) {
FireDelayedEvent(nsIAccessibleEvent::EVENT_MENUPOPUP_START, aRoot);
} else if (role == roles::ALERT && HasLoadState(eCompletelyLoaded)) {
FireDelayedEvent(nsIAccessibleEvent::EVENT_ALERT, aRoot);
}
}
}
void DocAccessible::UncacheChildrenInSubtree(LocalAccessible* aRoot) {
MaybeFireEventsForChangedPopover(aRoot);
if (aRoot->ARIARole() == roles::MENUPOPUP) {
nsEventShell::FireEvent(nsIAccessibleEvent::EVENT_MENUPOPUP_END, aRoot);
}
aRoot->mStateFlags |= eIsNotInDocument;
RemoveDependentIDsFor(aRoot);
RemoveDependentElementsFor(aRoot);
// The parent of the removed subtree is about to be cleared, so we must do
// this here rather than in LocalAccessible::UnbindFromParent because we need
// the ancestry for this to work.
if (aRoot->IsTable() || aRoot->IsTableCell()) {
CachedTableAccessible::Invalidate(aRoot);
}
// Put relocated children back in their original places instead of removing
// them from the tree.
nsTArray<RefPtr<LocalAccessible>>* owned = mARIAOwnsHash.Get(aRoot);
if (owned) {
PutChildrenBack(owned, 0);
MOZ_ASSERT(owned->IsEmpty(),
"Owned Accessibles should be cleared after PutChildrenBack.");
mARIAOwnsHash.Remove(aRoot);
owned = nullptr;
}
const uint32_t count = aRoot->ContentChildCount();
for (uint32_t idx = 0; idx < count; ++idx) {
LocalAccessible* child = aRoot->ContentChildAt(idx);
MOZ_ASSERT(!child->IsRelocated(),
"No children should be relocated here. They should all have "
"been relocated by PutChildrenBack.");
// Removing this accessible from the document doesn't mean anything about
// accessibles for subdocuments, so skip removing those from the tree.
if (!child->IsDoc()) {
UncacheChildrenInSubtree(child);
}
}
if (aRoot->IsNodeMapEntry() &&
mNodeToAccessibleMap.Get(aRoot->GetNode()) == aRoot) {
mNodeToAccessibleMap.Remove(aRoot->GetNode());
}
}
void DocAccessible::ShutdownChildrenInSubtree(LocalAccessible* aAccessible) {
AUTO_PROFILER_MARKER_TEXT("DocAccessible::ShutdownChildrenInSubtree", A11Y,
{}, ""_ns);
PerfStats::AutoMetricRecording<
PerfStats::Metric::A11Y_ShutdownChildrenInSubtree>
autoRecording;
// DO NOT ADD CODE ABOVE THIS BLOCK: THIS CODE IS MEASURING TIMINGS.
MOZ_ASSERT(!nsAccessibilityService::IsShutdown());
// Traverse through children and shutdown them before this accessible. When
// child gets shutdown then it removes itself from children array of its
// parent. Use jdx index to process the cases if child is not attached to the
// parent and as result doesn't remove itself from its children.
uint32_t count = aAccessible->ContentChildCount();
for (uint32_t idx = 0, jdx = 0; idx < count; idx++) {
LocalAccessible* child = aAccessible->ContentChildAt(jdx);
if (!child->IsBoundToParent()) {
NS_ERROR("Parent refers to a child, child doesn't refer to parent!");
jdx++;
}
// Don't cross document boundaries. The outerdoc shutdown takes care about
// its subdocument.
if (!child->IsDoc()) {
ShutdownChildrenInSubtree(child);
if (nsAccessibilityService::IsShutdown()) {
// If XPCOM is the only consumer (devtools & mochitests), shutting down
// the child's subtree can cause a11y to shut down because the last
// xpcom accessibles will be removed. In that case, return early, our
// work is done.
return;
}
}
}
UnbindFromDocument(aAccessible);
}
bool DocAccessible::IsLoadEventTarget() const {
return mDocumentNode->GetBrowsingContext()->IsContent();
}
void DocAccessible::SetIPCDoc(DocAccessibleChild* aIPCDoc) {
MOZ_ASSERT(!mIPCDoc || !aIPCDoc, "Clobbering an attached IPCDoc!");
mIPCDoc = aIPCDoc;
}
void DocAccessible::DispatchScrollingEvent(nsINode* aTarget,
uint32_t aEventType) {
LocalAccessible* acc = GetAccessible(aTarget);
if (!acc) {
return;
}
nsIFrame* frame = acc->GetFrame();
if (!frame) {
// Although the accessible had a frame at scroll time, it may now be gone
// because of display: contents.
return;
}
auto [scrollPoint, scrollRange] = ComputeScrollData(acc);
int32_t appUnitsPerDevPixel =
mPresShell->GetPresContext()->AppUnitsPerDevPixel();
LayoutDeviceIntPoint scrollPointDP = LayoutDevicePoint::FromAppUnitsToNearest(
scrollPoint, appUnitsPerDevPixel);
LayoutDeviceIntRect scrollRangeDP =
LayoutDeviceRect::FromAppUnitsToNearest(scrollRange, appUnitsPerDevPixel);
RefPtr<AccEvent> event =
new AccScrollingEvent(aEventType, acc, scrollPointDP.x, scrollPointDP.y,
scrollRangeDP.width, scrollRangeDP.height);
nsEventShell::FireEvent(event);
}
void DocAccessible::ARIAActiveDescendantIDMaybeMoved(
LocalAccessible* aAccessible) {
LocalAccessible* widget = nullptr;
if (aAccessible->IsActiveDescendant(&widget) && widget) {
// The active descendant might have just been inserted and may not be in the
// tree yet. Therefore, schedule this async to ensure the tree is up to
// date.
mNotificationController
->ScheduleNotification<DocAccessible, LocalAccessible>(
this, &DocAccessible::ARIAActiveDescendantChanged, widget);
}
}
void DocAccessible::SetRoleMapEntryForDoc(dom::Element* aElement) {
const nsRoleMapEntry* entry = aria::GetRoleMap(aElement);
if (!entry || entry->role == roles::APPLICATION ||
entry->role == roles::DIALOG ||
// Role alert isn't valid on the body element according to the ARIA spec,
// but it's useful for our UI; e.g. the WebRTC sharing indicator.
(entry->role == roles::ALERT && !mDocumentNode->IsContentDocument())) {
SetRoleMapEntry(entry);
return;
}
// No other ARIA roles are valid on body elements.
SetRoleMapEntry(nullptr);
}
LocalAccessible* DocAccessible::GetAccessible(nsINode* aNode) const {
return aNode == mDocumentNode ? const_cast<DocAccessible*>(this)
: mNodeToAccessibleMap.Get(aNode);
}
bool DocAccessible::HasPrimaryAction() const {
if (HyperTextAccessible::HasPrimaryAction()) {
return true;
}
// mContent is normally the body, but there might be a click listener on the
// root.
dom::Element* root = mDocumentNode->GetRootElement();
if (mContent != root) {
return nsCoreUtils::HasClickListener(root);
}
return false;
}
void DocAccessible::ActionNameAt(uint8_t aIndex, nsAString& aName) {
aName.Truncate();
if (aIndex != 0) {
return;
}
if (HasPrimaryAction()) {
aName.AssignLiteral("click");
}
}
void DocAccessible::MaybeHandleChangeToHiddenNameOrDescription(
nsIContent* aChild) {
if (!HasLoadState(eTreeConstructed)) {
return;
}
for (nsIContent* content = aChild; content; content = content->GetParent()) {
if (HasAccessible(content)) {
// This node isn't hidden. Events for name/description dependents will be
// fired elsewhere.
// ... but we do need to handle firing an event for text value changes on
// meters, since inner meter text is never rendered by layout.
if (content->IsHTMLElement(nsGkAtoms::meter)) {
FireDelayedEvent(nsIAccessibleEvent::EVENT_TEXT_VALUE_CHANGE,
GetAccessible(content));
}
break;
}
nsAtom* id = content->GetID();
if (!id) {
continue;
}
auto* providers =
GetRelProviders(content->AsElement(), nsDependentAtomString(id));
if (!providers) {
continue;
}
for (auto& provider : *providers) {
if (provider->mRelAttr != nsGkAtoms::aria_labelledby &&
provider->mRelAttr != nsGkAtoms::aria_describedby) {
continue;
}
LocalAccessible* dependentAcc = GetAccessible(provider->mContent);
if (!dependentAcc) {
continue;
}
FireDelayedEvent(provider->mRelAttr == nsGkAtoms::aria_labelledby
? nsIAccessibleEvent::EVENT_NAME_CHANGE
: nsIAccessibleEvent::EVENT_DESCRIPTION_CHANGE,
dependentAcc);
}
}
}
void DocAccessible::MaybeHandleChangeToAriaActions(LocalAccessible* aAcc,
const nsAtom* aAttribute) {
if (aAttribute == nsGkAtoms::aria_actions &&
nsTextEquivUtils::HasNameRule(aAcc, eNameFromSubtreeIfReqRule)) {
// Search for action targets in subtree, and fire a name change event
// on aAcc if any are found.
AssociatedElementsIterator iter(mDoc, aAcc->Elm(), nsGkAtoms::aria_actions);
while (LocalAccessible* target = iter.Next()) {
if (aAcc->IsAncestorOf(target)) {
mDoc->FireDelayedEvent(nsIAccessibleEvent::EVENT_NAME_CHANGE, aAcc);
break;
}
}
}
if (aAttribute == nsGkAtoms::id) {
RelatedAccIterator iter(mDoc, aAcc->Elm(), nsGkAtoms::aria_actions);
while (LocalAccessible* host = iter.Next()) {
// Search for any ancestor action hosts and fire a name change
// if any are found that calculate their name from the subtree.
if (host->IsAncestorOf(aAcc) &&
nsTextEquivUtils::HasNameRule(host, eNameFromSubtreeIfReqRule)) {
mDoc->FireDelayedEvent(nsIAccessibleEvent::EVENT_NAME_CHANGE, host);
}
}
}
}
void DocAccessible::AttrElementWillChange(dom::Element* aElement,
nsAtom* aAttr) {
MOZ_ASSERT(!sIsAttrElementChanging);
AttributeWillChange(aElement, kNameSpaceID_None, aAttr,
AttrModType::Modification);
// We might get notified about a related content attribute change. Ignore
// it.
sIsAttrElementChanging = true;
}
void DocAccessible::AttrElementChanged(dom::Element* aElement, nsAtom* aAttr) {
MOZ_ASSERT(sIsAttrElementChanging);
// The element has changed and the content attribute change notifications
// (if any) have been sent.
sIsAttrElementChanging = false;
AttributeChanged(aElement, kNameSpaceID_None, aAttr,
AttrModType::Modification, nullptr);
}
bool DocAccessible::ProcessAnchorJump() {
if (!mAnchorJumpElm) {
return true;
}
LocalAccessible* target = GetAccessibleOrContainer(mAnchorJumpElm);
if (!target) {
// This node isn't in the tree.
mAnchorJumpElm = nullptr;
return true;
}
const Accessible* focusedAcc = FocusMgr()->FocusedAccessible();
if (!focusedAcc || (focusedAcc != this && !focusedAcc->IsNonInteractive())) {
// Focus is nowhere or on an interactive element. Ignore the anchor jump for
// now.
return false;
}
nsEventShell::FireEvent(nsIAccessibleEvent::EVENT_SCROLLING_START, target);
// We've processed this anchor jump now. Clear it so it isn't processed again.
mAnchorJumpElm = nullptr;
return true;
}
void DocAccessible::RefreshAnchorRelationCacheForTarget(
LocalAccessible* aTarget) {
nsIFrame* frame = aTarget->GetFrame();
if (!frame || !frame->HasProperty(nsIFrame::AnchorPosReferences())) {
return;
}
AnchorPosReferenceData* referencedAnchors =
frame->GetProperty(nsIFrame::AnchorPosReferences());
for (auto& entry : *referencedAnchors) {
const auto& anchorName = entry.GetKey();
if (const nsIFrame* anchorFrame =
mPresShell->GetAnchorPosAnchor(anchorName, frame)) {
if (LocalAccessible* anchorAcc =
GetAccessible(anchorFrame->GetContent())) {
if (!mInsertedAccessibles.Contains(anchorAcc)) {
QueueCacheUpdate(anchorAcc, CacheDomain::Relations);
}
}
}
}
}
|