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
|
#! /usr/bin/env python
import re, sys, os, random
sys.path.insert(0, os.path.join(os.path.dirname(__file__), '..', '..', '..', '..'))
from rpython.translator.c.gcc.instruction import Insn, Label, InsnCall, InsnRet
from rpython.translator.c.gcc.instruction import InsnFunctionStart, InsnStop
from rpython.translator.c.gcc.instruction import InsnSetLocal, InsnCopyLocal
from rpython.translator.c.gcc.instruction import InsnPrologue, InsnEpilogue
from rpython.translator.c.gcc.instruction import InsnGCROOT, InsnCondJump
from rpython.translator.c.gcc.instruction import InsnStackAdjust, InsnPushed
from rpython.translator.c.gcc.instruction import InsnCannotFollowEsp
from rpython.translator.c.gcc.instruction import LocalVar, somenewvalue
from rpython.translator.c.gcc.instruction import frameloc_esp, frameloc_ebp
from rpython.translator.c.gcc.instruction import LOC_REG, LOC_NOWHERE, LOC_MASK
from rpython.translator.c.gcc.instruction import LOC_EBP_PLUS, LOC_EBP_MINUS
from rpython.translator.c.gcc.instruction import LOC_ESP_PLUS
class FunctionGcRootTracker(object):
skip = 0
COMMENT = "([#;].*)?"
@classmethod
def init_regexp(cls):
cls.r_label = re.compile(cls.LABEL+"[:]\s*$")
cls.r_globl = re.compile(r"\t[.]globl\t"+cls.LABEL+"\s*$")
cls.r_globllabel = re.compile(cls.LABEL+r"=[.][+]%d\s*$"%cls.OFFSET_LABELS)
cls.r_insn = re.compile(r"\t([a-z]\w*)\s")
cls.r_unaryinsn = re.compile(r"\t[a-z]\w*\s+("+cls.OPERAND+")\s*" + cls.COMMENT + "$")
cls.r_binaryinsn = re.compile(r"\t[a-z]\w*\s+(?P<source>"+cls.OPERAND+"),\s*(?P<target>"+cls.OPERAND+")\s*$")
cls.r_jump = re.compile(r"\tj\w+\s+"+cls.LABEL+"\s*" + cls.COMMENT + "$")
cls.r_jmp_switch = re.compile(r"\tjmp\t[*]")
cls.r_jmp_source = re.compile(r"\d*[(](%[\w]+)[,)]")
def __init__(self, funcname, lines, filetag=0):
self.funcname = funcname
self.lines = lines
self.uses_frame_pointer = False
self.r_localvar = self.r_localvarnofp
self.filetag = filetag
# a "stack bottom" function is either pypy_main_function() or a
# callback from C code. In both cases they are identified by
# the presence of pypy_asm_stack_bottom().
self.is_stack_bottom = False
def computegcmaptable(self, verbose=0):
if self.funcname in ['main', '_main']:
return [] # don't analyze main(), its prologue may contain
# strange instructions
self.findlabels()
self.parse_instructions()
try:
self.trim_unreachable_instructions()
self.find_noncollecting_calls()
if not self.list_collecting_call_insns():
return []
self.findframesize()
self.fixlocalvars()
self.trackgcroots()
self.extend_calls_with_labels()
finally:
if verbose > 2:
self.dump()
return self.gettable()
def replace_symbols(self, operand):
return operand
def gettable(self):
"""Returns a list [(label_after_call, callshape_tuple)]
See format_callshape() for more details about callshape_tuple.
"""
table = []
for insn in self.list_collecting_call_insns():
if not hasattr(insn, 'framesize'):
continue # calls that never end up reaching a RET
if self.is_stack_bottom:
retaddr = LOC_NOWHERE # end marker for asmgcroot.py
elif self.uses_frame_pointer:
retaddr = frameloc_ebp(self.WORD, self.WORD)
else:
retaddr = frameloc_esp(insn.framesize, self.WORD)
shape = [retaddr]
# the first gcroots are always the ones corresponding to
# the callee-saved registers
for reg in self.CALLEE_SAVE_REGISTERS:
shape.append(LOC_NOWHERE)
gcroots = []
for localvar, tag in insn.gcroots.items():
if isinstance(localvar, LocalVar):
loc = localvar.getlocation(insn.framesize,
self.uses_frame_pointer,
self.WORD)
elif localvar in self.REG2LOC:
loc = self.REG2LOC[localvar]
else:
assert False, "%s: %s" % (self.funcname,
localvar)
assert isinstance(loc, int)
if tag is None:
gcroots.append(loc)
else:
regindex = self.CALLEE_SAVE_REGISTERS.index(tag)
shape[1 + regindex] = loc
if LOC_NOWHERE in shape and not self.is_stack_bottom:
reg = self.CALLEE_SAVE_REGISTERS[shape.index(LOC_NOWHERE) - 1]
raise AssertionError("cannot track where register %s is saved"
% (reg,))
gcroots.sort()
shape.extend(gcroots)
table.append((insn.global_label, tuple(shape)))
return table
def findlabels(self):
self.labels = {} # {name: Label()}
for lineno, line in enumerate(self.lines):
match = self.r_label.match(line)
label = None
if match:
label = match.group(1)
else:
# labels used by: j* NNNf
match = self.r_rel_label.match(line)
if match:
label = "rel %d" % lineno
if label:
assert label not in self.labels, "duplicate label: %s" % label
self.labels[label] = Label(label, lineno)
def trim_unreachable_instructions(self):
reached = set([self.insns[0]])
prevlen = 0
while len(reached) > prevlen:
prevlen = len(reached)
for insn in self.insns:
if insn not in reached:
for previnsn in insn.previous_insns:
if previnsn in reached:
# this instruction is reachable too
reached.add(insn)
break
# now kill all unreachable instructions
i = 0
while i < len(self.insns):
if self.insns[i] in reached:
i += 1
else:
del self.insns[i]
# the remaining instructions must have their 'previous_insns' list
# trimmed of dead previous instructions
all_remaining_insns = set(self.insns)
assert self.insns[0].previous_insns == ()
for insn in self.insns[1:]:
insn.previous_insns = [previnsn for previnsn in insn.previous_insns
if previnsn in all_remaining_insns]
def find_noncollecting_calls(self):
cannot_collect = {}
for line in self.lines:
match = self.r_gcnocollect_marker.search(line)
if match:
name = match.group(1)
cannot_collect[name] = True
#
self.cannot_collect = dict.fromkeys(
[self.function_names_prefix + name for name in cannot_collect])
def append_instruction(self, insn):
# Add the instruction to the list, and link it to the previous one.
previnsn = self.insns[-1]
self.insns.append(insn)
if (isinstance(insn, (InsnSetLocal, InsnCopyLocal)) and
insn.target == self.tested_for_zero):
self.tested_for_zero = None
try:
lst = insn.previous_insns
except AttributeError:
lst = insn.previous_insns = []
if not isinstance(previnsn, InsnStop):
lst.append(previnsn)
def parse_instructions(self):
self.insns = [InsnFunctionStart(self.CALLEE_SAVE_REGISTERS, self.WORD)]
self.tested_for_zero = None
ignore_insns = False
for lineno, line in enumerate(self.lines):
if lineno < self.skip:
continue
self.currentlineno = lineno
insn = []
if line.startswith('\trep;'):
line = '\t'+line[5:].lstrip()
match = self.r_insn.match(line)
if self.r_bottom_marker.match(line):
self.is_stack_bottom = True
elif match:
if not ignore_insns:
opname = match.group(1)
#
try:
cf = self.OPS_WITH_PREFIXES_CHANGING_FLAGS[opname]
except KeyError:
cf = self.find_missing_changing_flags(opname)
if cf:
self.tested_for_zero = None
#
try:
meth = getattr(self, 'visit_' + opname)
except AttributeError:
self.find_missing_visit_method(opname)
meth = getattr(self, 'visit_' + opname)
line = line.rsplit(';', 1)[0]
insn = meth(line)
elif self.r_gcroot_marker.match(line):
insn = self._visit_gcroot_marker(line)
elif line == '\t/* ignore_in_trackgcroot */\n':
ignore_insns = True
elif line == '\t/* end_ignore_in_trackgcroot */\n':
ignore_insns = False
else:
match = self.r_label.match(line)
if match:
insn = self.labels[match.group(1)]
if isinstance(insn, list):
for i in insn:
self.append_instruction(i)
else:
self.append_instruction(insn)
del self.currentlineno
@classmethod
def find_missing_visit_method(cls, opname):
# only for operations that are no-ops as far as we are concerned
prefix = opname
while prefix not in cls.IGNORE_OPS_WITH_PREFIXES:
prefix = prefix[:-1]
if not prefix:
raise UnrecognizedOperation(opname)
setattr(cls, 'visit_' + opname, cls.visit_nop)
@classmethod
def find_missing_changing_flags(cls, opname):
prefix = opname
while prefix and prefix not in cls.OPS_WITH_PREFIXES_CHANGING_FLAGS:
prefix = prefix[:-1]
cf = cls.OPS_WITH_PREFIXES_CHANGING_FLAGS.get(prefix, False)
cls.OPS_WITH_PREFIXES_CHANGING_FLAGS[opname] = cf
return cf
def list_collecting_call_insns(self):
return [insn for insn in self.insns if isinstance(insn, InsnCall)
if insn.name not in self.cannot_collect]
def findframesize(self):
# the 'framesize' attached to an instruction is the number of bytes
# in the frame at this point. This doesn't count the return address
# which is the word immediately following the frame in memory.
# The 'framesize' is set to an odd value if it is only an estimate
# (see InsnCannotFollowEsp).
def walker(insn, size_delta):
check = deltas.setdefault(insn, size_delta)
assert check == size_delta, (
"inconsistent frame size at instruction %s" % (insn,))
if isinstance(insn, InsnStackAdjust):
size_delta -= insn.delta
if not hasattr(insn, 'framesize'):
yield size_delta # continue walking backwards
for insn in self.insns:
if isinstance(insn, (InsnRet, InsnEpilogue, InsnGCROOT)):
deltas = {}
self.walk_instructions_backwards(walker, insn, 0)
size_at_insn = []
for insn1, delta1 in deltas.items():
if hasattr(insn1, 'framesize'):
size_at_insn.append(insn1.framesize + delta1)
if not size_at_insn:
continue
size_at_insn = size_at_insn[0]
for insn1, delta1 in deltas.items():
size_at_insn1 = size_at_insn - delta1
if hasattr(insn1, 'framesize'):
assert insn1.framesize == size_at_insn1, (
"inconsistent frame size at instruction %s" %
(insn1,))
else:
insn1.framesize = size_at_insn1
# trim: instructions with no framesize are removed from self.insns,
# and from the 'previous_insns' lists
if 0: # <- XXX disabled because it seems bogus, investigate more
assert hasattr(self.insns[0], 'framesize')
old = self.insns[1:]
del self.insns[1:]
for insn in old:
if hasattr(insn, 'framesize'):
self.insns.append(insn)
insn.previous_insns = [previnsn for previnsn in insn.previous_insns
if hasattr(previnsn, 'framesize')]
def fixlocalvars(self):
def fixvar(localvar):
if localvar is None:
return None
elif isinstance(localvar, (list, tuple)):
return [fixvar(var) for var in localvar]
match = self.r_localvar_esp.match(localvar)
if match:
if localvar == self.TOP_OF_STACK_MINUS_WORD:
# for pushl and popl, by
hint = None # default ebp addressing is
else: # a bit nicer
hint = 'esp'
ofs_from_esp = int(match.group(1) or '0')
if self.format == 'msvc':
ofs_from_esp += int(match.group(2) or '0')
localvar = ofs_from_esp - insn.framesize
assert localvar != 0 # that's the return address
return LocalVar(localvar, hint=hint)
elif self.uses_frame_pointer:
match = self.r_localvar_ebp.match(localvar)
if match:
ofs_from_ebp = int(match.group(1) or '0')
if self.format == 'msvc':
ofs_from_ebp += int(match.group(2) or '0')
localvar = ofs_from_ebp - self.WORD
assert localvar != 0 # that's the return address
return LocalVar(localvar, hint='ebp')
return localvar
for insn in self.insns:
if not hasattr(insn, 'framesize'):
continue
for name in insn._locals_:
localvar = getattr(insn, name)
setattr(insn, name, fixvar(localvar))
def trackgcroots(self):
def walker(insn, loc):
source = insn.source_of(loc, tag)
if source is somenewvalue:
pass # done
else:
yield source
for insn in self.insns:
for loc, tag in insn.requestgcroots(self).items():
self.walk_instructions_backwards(walker, insn, loc)
def dump(self):
for insn in self.insns:
size = getattr(insn, 'framesize', '?')
print >> sys.stderr, '%4s %s' % (size, insn)
def walk_instructions_backwards(self, walker, initial_insn, initial_state):
pending = []
seen = set()
def schedule(insn, state):
for previnsn in insn.previous_insns:
key = previnsn, state
if key not in seen:
seen.add(key)
pending.append(key)
schedule(initial_insn, initial_state)
while pending:
insn, state = pending.pop()
for prevstate in walker(insn, state):
schedule(insn, prevstate)
def extend_calls_with_labels(self):
# walk backwards, because inserting the global labels in self.lines
# is going to invalidate the lineno of all the InsnCall objects
# after the current one.
for call in self.list_collecting_call_insns()[::-1]:
if hasattr(call, 'framesize'):
self.create_global_label(call)
def create_global_label(self, call):
# we need a globally-declared label just after the call.
# Reuse one if it is already there (e.g. from a previous run of this
# script); otherwise invent a name and add the label to tracker.lines.
label = None
# this checks for a ".globl NAME" followed by "NAME:"
match = self.r_globl.match(self.lines[call.lineno+1])
if match:
label1 = match.group(1)
match = self.r_globllabel.match(self.lines[call.lineno+2])
if match:
label2 = match.group(1)
if label1 == label2:
label = label2
if label is None:
k = call.lineno
if self.format == 'msvc':
# Some header files (ws2tcpip.h) define STDCALL functions
funcname = self.funcname.split('@')[0]
else:
funcname = self.funcname
while 1:
label = '__gcmap_%s__%s_%d' % (self.filetag, funcname, k)
if label not in self.labels:
break
k += 1
self.labels[label] = None
if self.format == 'msvc':
self.lines.insert(call.lineno+1, '%s::\n' % (label,))
self.lines.insert(call.lineno+1, 'PUBLIC\t%s\n' % (label,))
else:
# These global symbols are not directly labels pointing to the
# code location because such global labels in the middle of
# functions confuse gdb. Instead, we add to the global symbol's
# value a big constant, which is subtracted again when we need
# the original value for gcmaptable.s. That's a hack.
self.lines.insert(call.lineno+1, '%s=.+%d\n' % (label,
self.OFFSET_LABELS))
self.lines.insert(call.lineno+1, '\t.hidden\t%s\n' % (label,))
self.lines.insert(call.lineno+1, '\t.globl\t%s\n' % (label,))
call.global_label = label
@classmethod
def compress_callshape(cls, shape):
# For a single shape, this turns the list of integers into a list of
# bytes and reverses the order of the entries. The length is
# encoded by inserting a 0 marker after the gc roots coming from
# shape[N:] and before the N values coming from shape[N-1] to
# shape[0] (for N == 5 on 32-bit or 7 on 64-bit platforms).
# In practice it seems that shapes contain many integers
# whose value is up to a few thousands, which the algorithm below
# compresses down to 2 bytes. Very small values compress down to a
# single byte.
# Callee-save regs plus ret addr
min_size = len(cls.CALLEE_SAVE_REGISTERS) + 1
assert len(shape) >= min_size
shape = list(shape)
assert 0 not in shape[min_size:]
shape.insert(min_size, 0)
result = []
for loc in shape:
assert loc >= 0
flag = 0
while loc >= 0x80:
result.append(int(loc & 0x7F) | flag)
flag = 0x80
loc >>= 7
result.append(int(loc) | flag)
result.reverse()
return result
@classmethod
def decompress_callshape(cls, bytes):
# For tests. This logic is copied in asmgcroot.py.
result = []
n = 0
while n < len(bytes):
value = 0
while True:
b = bytes[n]
n += 1
value += b
if b < 0x80:
break
value = (value - 0x80) << 7
result.append(value)
result.reverse()
assert result[5] == 0
del result[5]
return result
# ____________________________________________________________
BASE_FUNCTIONS_NOT_RETURNING = {
'abort': None,
'pypy_debug_catch_fatal_exception': None,
'RPyAbort': None,
'RPyAssertFailed': None,
}
def _visit_gcroot_marker(self, line):
match = self.r_gcroot_marker.match(line)
loc = match.group(1)
return InsnGCROOT(self.replace_symbols(loc))
def visit_nop(self, line):
return []
IGNORE_OPS_WITH_PREFIXES = dict.fromkeys([
'cmp', 'test', 'set', 'sahf', 'lahf', 'cld', 'std',
'rep', 'movs', 'movhp', 'lods', 'stos', 'scas', 'cwde', 'prefetch',
# floating-point operations cannot produce GC pointers
'f',
'cvt', 'ucomi', 'comi', 'subs', 'subp', 'adds', 'addp', 'xorp',
'movap', 'movd', 'movlp', 'movup', 'sqrt', 'rsqrt', 'movhlp', 'movlhp',
'mins', 'minp', 'maxs', 'maxp', 'unpck', 'pxor', 'por', # sse2
'shufps', 'shufpd',
# arithmetic operations should not produce GC pointers
'inc', 'dec', 'not', 'neg', 'or', 'and', 'sbb', 'adc',
'shl', 'shr', 'sal', 'sar', 'rol', 'ror', 'mul', 'imul', 'div', 'idiv',
'bswap', 'bt', 'rdtsc', 'rounds',
'pabs', 'pack', 'padd', 'palign', 'pand', 'pavg', 'pcmp', 'pextr',
'phadd', 'phsub', 'pinsr', 'pmadd', 'pmax', 'pmin', 'pmovmsk',
'pmul', 'por', 'psadb', 'pshuf', 'psign', 'psll', 'psra', 'psrl',
'psub', 'punpck', 'pxor', 'pmovzx', 'pmovsx', 'pblend',
# all vectors don't produce pointers
'v',
# sign-extending moves should not produce GC pointers
'cbtw', 'cwtl', 'cwtd', 'cltd', 'cltq', 'cqto',
# zero-extending moves should not produce GC pointers
'movz',
# locked operations should not move GC pointers, at least so far
'lock', 'pause',
# non-temporal moves should be reserved for areas containing
# raw data, not GC pointers
'movnt', 'mfence', 'lfence', 'sfence',
# bit manipulations
'andn', 'bextr', 'blsi', 'blsmask', 'blsr', 'tzcnt', 'lzcnt',
# uh, this can occur with a 'call' on the following line...
'rex64',
# movbe, converts from big-endian, so most probably not GC pointers
'movbe',
# xchgb, byte-sized, so not GC pointers
'xchgb',
])
# a partial list is hopefully good enough for now; it's all to support
# only one corner case, tested in elf64/track_zero.s
OPS_WITH_PREFIXES_CHANGING_FLAGS = dict.fromkeys([
'cmp', 'test', 'lahf', 'cld', 'std', 'rep',
'ucomi', 'comi',
'add', 'sub', 'xor',
'inc', 'dec', 'not', 'neg', 'or', 'and', 'sbb', 'adc',
'shl', 'shr', 'sal', 'sar', 'rol', 'ror', 'mul', 'imul', 'div', 'idiv',
'bt', 'call', 'int',
'jmp', # not really changing flags, but we shouldn't assume
# anything about the operations on the following lines
], True)
visit_movb = visit_nop
visit_movw = visit_nop
visit_addb = visit_nop
visit_addw = visit_nop
visit_subb = visit_nop
visit_subw = visit_nop
visit_xorb = visit_nop
visit_xorw = visit_nop
def _visit_add(self, line, sign=+1):
match = self.r_binaryinsn.match(line)
source = match.group("source")
target = match.group("target")
if target == self.ESP:
count = self.extract_immediate(source)
if count is None:
# strange instruction - I've seen 'subl %eax, %esp'
return InsnCannotFollowEsp()
return InsnStackAdjust(sign * count)
elif self.r_localvar.match(target):
return InsnSetLocal(target, [source, target])
else:
return []
def _visit_sub(self, line):
return self._visit_add(line, sign=-1)
def unary_insn(self, line):
match = self.r_unaryinsn.match(line)
target = match.group(1)
if self.r_localvar.match(target):
return InsnSetLocal(target)
else:
return []
def binary_insn(self, line):
match = self.r_binaryinsn.match(line)
if not match:
raise UnrecognizedOperation(line)
source = match.group("source")
target = match.group("target")
if self.r_localvar.match(target):
return InsnSetLocal(target, [source])
elif target == self.ESP:
raise UnrecognizedOperation(line)
else:
return []
def _visit_and(self, line):
match = self.r_binaryinsn.match(line)
target = match.group("target")
if target == self.ESP:
# only for andl $-16, %esp used to align the stack in main().
# main() should not be seen at all. But on e.g. MSVC we see
# the instruction somewhere else too...
return InsnCannotFollowEsp()
else:
return self.binary_insn(line)
def _visit_lea(self, line):
match = self.r_binaryinsn.match(line)
target = match.group("target")
if target == self.ESP:
# only for leal -12(%ebp), %esp in function epilogues
source = match.group("source")
match = self.r_localvar_ebp.match(source)
if match:
if not self.uses_frame_pointer:
raise UnrecognizedOperation('epilogue without prologue')
ofs_from_ebp = int(match.group(1) or '0')
assert ofs_from_ebp <= 0
framesize = self.WORD - ofs_from_ebp
else:
match = self.r_localvar_esp.match(source)
# leal 12(%esp), %esp
if match:
return InsnStackAdjust(int(match.group(1)))
framesize = None # strange instruction
return InsnEpilogue(framesize)
else:
return self.binary_insn(line)
def insns_for_copy(self, source, target):
source = self.replace_symbols(source)
target = self.replace_symbols(target)
if target == self.ESP:
raise UnrecognizedOperation('%s -> %s' % (source, target))
elif self.r_localvar.match(target):
if self.r_localvar.match(source):
# eg, movl %eax, %ecx: possibly copies a GC root
return [InsnCopyLocal(source, target)]
else:
# eg, movl (%eax), %edi or mov %esp, %edi: load a register
# from "outside". If it contains a pointer to a GC root,
# it will be announced later with the GCROOT macro.
return [InsnSetLocal(target, [source])]
else:
# eg, movl %ebx, (%edx) or mov %ebp, %esp: does not write into
# a general register
return []
def _visit_mov(self, line):
match = self.r_binaryinsn.match(line)
source = match.group("source")
target = match.group("target")
if source == self.ESP and target == self.EBP:
return self._visit_prologue()
elif source == self.EBP and target == self.ESP:
return self._visit_epilogue()
if source == self.ESP and self.funcname.startswith('VALGRIND_'):
return [] # in VALGRIND_XXX functions, there is a dummy-looking
# mov %esp, %eax. Shows up only when compiling with
# gcc -fno-unit-at-a-time.
return self.insns_for_copy(source, target)
def _visit_push(self, line):
match = self.r_unaryinsn.match(line)
source = match.group(1)
return self.insns_for_copy(source, self.TOP_OF_STACK_MINUS_WORD) + \
[InsnPushed(-self.WORD)]
def _visit_pop(self, target):
return [InsnStackAdjust(+self.WORD)] + \
self.insns_for_copy(self.TOP_OF_STACK_MINUS_WORD, target)
def _visit_prologue(self):
# For the prologue of functions that use %ebp as frame pointer.
# First, find the latest InsnStackAdjust; if it's not a PUSH,
# then consider that this 'mov %rsp, %rbp' is actually unrelated
i = -1
while not isinstance(self.insns[i], InsnStackAdjust):
i -= 1
if not isinstance(self.insns[i], InsnPushed):
return []
#
self.uses_frame_pointer = True
self.r_localvar = self.r_localvarfp
return [InsnPrologue(self.WORD)]
def _visit_epilogue(self):
if not self.uses_frame_pointer:
raise UnrecognizedOperation('epilogue without prologue')
return [InsnEpilogue(self.WORD)]
def visit_leave(self, line):
return self._visit_epilogue() + self._visit_pop(self.EBP)
def visit_ret(self, line):
return InsnRet(self.CALLEE_SAVE_REGISTERS)
def visit_rep(self, line):
# 'rep ret' or 'rep; ret': bad reasons for this bogus 'rep' here
if line.split()[:2] == ['rep', 'ret']:
return self.visit_ret(line)
return []
def visit_ud2(self, line):
return InsnStop("ud2") # unreachable instruction
def visit_jmp(self, line):
tablelabels = []
match = self.r_jmp_switch.match(line)
if match:
# this is a jmp *Label(%index) or jmp *%addr, used for
# table-based switches. Assume that the table is coming
# after a .section .rodata and a label, and is a list of
# lines looking like .long LABEL or .long 0 or .long L2-L1,
# ending in a .text or .section .text.hot.
lineno = self.currentlineno + 1
if '.section' not in self.lines[lineno]:
pass # bah, probably a tail-optimized indirect call...
else:
assert '.rodata' in self.lines[lineno]
lineno += 1
while '.align' in self.lines[lineno]:
lineno += 1
match = self.r_label.match(self.lines[lineno])
assert match, repr(self.lines[lineno])
tablelabels.append(match.group(1))
elif self.r_unaryinsn_star.match(line):
# maybe a jmp similar to the above, but stored in a
# registry:
# movl L9341(%eax), %eax
# jmp *%eax
operand = self.r_unaryinsn_star.match(line).group(1)
def walker(insn, locs):
sources = []
for loc in locs:
for s in insn.all_sources_of(loc):
# if the source looks like 8(%eax,%edx,4)
# %eax is the real source, %edx is an offset.
match = self.r_jmp_source.match(s)
if match and not self.r_localvar_esp.match(s):
sources.append(match.group(1))
else:
sources.append(s)
for source in sources:
label_match = re.compile(self.LABEL).match(source)
if label_match:
tablelabels.append(label_match.group(0))
return
yield tuple(sources)
insn = InsnStop()
insn.previous_insns = [self.insns[-1]]
self.walk_instructions_backwards(walker, insn, (operand,))
# Remove probable tail-calls
tablelabels = [label for label in tablelabels
if label in self.labels]
assert len(tablelabels) <= 1
if tablelabels:
tablelin = self.labels[tablelabels[0]].lineno + 1
while not self.r_jmptable_end.match(self.lines[tablelin]):
# skip empty lines
if (not self.lines[tablelin].strip()
or self.lines[tablelin].startswith(';')):
tablelin += 1
continue
match = self.r_jmptable_item.match(self.lines[tablelin])
if not match:
raise NoPatternMatch(repr(self.lines[tablelin]))
label = match.group(1)
if label != '0':
self.register_jump_to(label)
tablelin += 1
return InsnStop("jump table")
if self.r_unaryinsn_star.match(line):
# that looks like an indirect tail-call.
# tail-calls are equivalent to RET for us
return InsnRet(self.CALLEE_SAVE_REGISTERS)
try:
self.conditional_jump(line)
except KeyError:
# label not found: check if it's a tail-call turned into a jump
match = self.r_unaryinsn.match(line)
target = match.group(1)
assert not target.startswith('.')
# tail-calls are equivalent to RET for us
return InsnRet(self.CALLEE_SAVE_REGISTERS)
return InsnStop("jump")
def register_jump_to(self, label, lastinsn=None):
if lastinsn is None:
lastinsn = self.insns[-1]
if not isinstance(lastinsn, InsnStop):
self.labels[label].previous_insns.append(lastinsn)
def conditional_jump(self, line, je=False, jne=False):
match = self.r_jump.match(line)
if not match:
match = self.r_jump_rel_label.match(line)
if not match:
raise UnrecognizedOperation(line)
# j* NNNf
label = match.group(1)
label += ":"
i = self.currentlineno + 1
while True:
if self.lines[i].startswith(label):
label = "rel %d" % i
break
i += 1
else:
label = match.group(1)
prefix = []
lastinsn = None
postfix = []
if self.tested_for_zero is not None:
if je:
# generate pseudo-code...
prefix = [InsnCopyLocal(self.tested_for_zero, '%tmp'),
InsnSetLocal(self.tested_for_zero)]
postfix = [InsnCopyLocal('%tmp', self.tested_for_zero)]
lastinsn = prefix[-1]
elif jne:
postfix = [InsnSetLocal(self.tested_for_zero)]
self.register_jump_to(label, lastinsn)
return prefix + [InsnCondJump(label)] + postfix
visit_jmpl = visit_jmp
# The various conditional jumps and cmov* operations
for name in '''
e g ge l le a ae b be p s o c
'''.split():
# NB. visit_je() and visit_jne() are overridden below
locals()['visit_j' + name] = conditional_jump
locals()['visit_jn' + name] = conditional_jump
locals()['visit_cmov' + name] = binary_insn
locals()['visit_cmov' + name + 'l'] = binary_insn
locals()['visit_cmovn' + name] = binary_insn
locals()['visit_cmovn' + name + 'l'] = binary_insn
def visit_je(self, line):
return self.conditional_jump(line, je=True)
def visit_jne(self, line):
return self.conditional_jump(line, jne=True)
def _visit_test(self, line):
match = self.r_binaryinsn.match(line)
source = match.group("source")
target = match.group("target")
if source == target:
self.tested_for_zero = source
return []
def _visit_xchg(self, line):
# support the format used in VALGRIND_DISCARD_TRANSLATIONS
# which is to use a marker no-op "xchgl %ebx, %ebx"
match = self.r_binaryinsn.match(line)
source = match.group("source")
target = match.group("target")
if source == target:
return []
# ignore the 'rpy_fastgil' atomic exchange, or any locked
# atomic exchange at all (involving memory)
if not source.startswith('%'):
return []
raise UnrecognizedOperation(line)
def visit_call(self, line):
match = self.r_unaryinsn.match(line)
if match is None:
assert self.r_unaryinsn_star.match(line) # indirect call
return [InsnCall('<indirect>', self.currentlineno),
InsnSetLocal(self.EAX)] # the result is there
target = match.group(1)
if self.format in ('msvc',):
# On win32, the address of a foreign function must be
# computed, the optimizer may store it in a register. We
# could ignore this, except when the function need special
# processing (not returning, __stdcall...)
def find_register(target):
reg = []
def walker(insn, locs):
sources = []
for loc in locs:
for s in insn.all_sources_of(loc):
sources.append(s)
for source in sources:
m = re.match("DWORD PTR " + self.LABEL, source)
if m:
reg.append(m.group(1))
if reg:
return
yield tuple(sources)
insn = InsnStop()
insn.previous_insns = [self.insns[-1]]
self.walk_instructions_backwards(walker, insn, (target,))
return reg
if match and self.r_localvarfp.match(target):
sources = find_register(target)
if sources:
target, = sources
if target.endswith('@PLT'):
# In -fPIC mode, all functions calls have this suffix
target = target[:-4]
if target in self.FUNCTIONS_NOT_RETURNING:
return [InsnStop(target)]
if self.format == 'mingw32' and target == '__alloca':
# in functions with large stack requirements, windows
# needs a call to _alloca(), to turn reserved pages
# into committed memory.
# With mingw32 gcc at least, %esp is not used before
# this call. So we don't bother to compute the exact
# stack effect.
return [InsnCannotFollowEsp()]
if target in self.labels:
lineoffset = self.labels[target].lineno - self.currentlineno
if lineoffset >= 0:
assert lineoffset in (1,2)
return [InsnStackAdjust(-4)]
if target.startswith('__x86.get_pc_thunk.'):
# special case, found on x86-32: these static functions
# contain only a simple load of some non-GC pointer to
# a specific register (not necessarily EAX)
reg = '%e' + target.split('.')[-1]
return [InsnSetLocal(reg)]
insns = [InsnCall(target, self.currentlineno),
InsnSetLocal(self.EAX)] # the result is there
if self.format in ('mingw32', 'msvc'):
# handle __stdcall calling convention:
# Stack cleanup is performed by the called function,
# Function name is decorated with "@N" where N is the stack size
if '@' in target and not target.startswith('@'):
insns.append(InsnStackAdjust(int(target.rsplit('@', 1)[1])))
# Some (intrinsic?) functions use the "fastcall" calling convention
# XXX without any declaration, how can we guess the stack effect?
if target in ['__alldiv', '__allrem', '__allmul', '__alldvrm',
'__aulldiv', '__aullrem', '__aullmul', '__aulldvrm']:
insns.append(InsnStackAdjust(16))
return insns
# __________ debugging output __________
@classmethod
def format_location(cls, loc):
# A 'location' is a single number describing where a value is stored
# across a call. It can be in one of the CALLEE_SAVE_REGISTERS, or
# in the stack frame at an address relative to either %esp or %ebp.
# The last two bits of the location number are used to tell the cases
# apart; see format_location().
assert loc >= 0
kind = loc & LOC_MASK
if kind == LOC_REG:
if loc == LOC_NOWHERE:
return '?'
reg = (loc >> 2) - 1
return '%' + cls.CALLEE_SAVE_REGISTERS[reg].replace("%", "")
else:
offset = loc & ~ LOC_MASK
if cls.WORD == 8:
offset <<= 1
if kind == LOC_EBP_PLUS:
result = '(%' + cls.EBP.replace("%", "") + ')'
elif kind == LOC_EBP_MINUS:
result = '(%' + cls.EBP.replace("%", "") + ')'
offset = -offset
elif kind == LOC_ESP_PLUS:
result = '(%' + cls.ESP.replace("%", "") + ')'
else:
assert 0, kind
if offset != 0:
result = str(offset) + result
return result
@classmethod
def format_callshape(cls, shape):
# A 'call shape' is a tuple of locations in the sense of
# format_location(). They describe where in a function frame
# interesting values are stored, when this function executes a 'call'
# instruction.
#
# shape[0] is the location that stores the fn's own return
# address (not the return address for the currently
# executing 'call')
#
# shape[1..N] is where the fn saved its own caller's value of a
# certain callee save register. (where N is the number
# of callee save registers.)
#
# shape[>N] are GC roots: where the fn has put its local GCPTR
# vars
#
num_callee_save_regs = len(cls.CALLEE_SAVE_REGISTERS)
assert isinstance(shape, tuple)
# + 1 for the return address
assert len(shape) >= (num_callee_save_regs + 1)
result = [cls.format_location(loc) for loc in shape]
return '{%s | %s | %s}' % (result[0],
', '.join(result[1:(num_callee_save_regs+1)]),
', '.join(result[(num_callee_save_regs+1):]))
class FunctionGcRootTracker32(FunctionGcRootTracker):
WORD = 4
visit_mov = FunctionGcRootTracker._visit_mov
visit_movl = FunctionGcRootTracker._visit_mov
visit_pushl = FunctionGcRootTracker._visit_push
visit_leal = FunctionGcRootTracker._visit_lea
visit_addl = FunctionGcRootTracker._visit_add
visit_subl = FunctionGcRootTracker._visit_sub
visit_andl = FunctionGcRootTracker._visit_and
visit_and = FunctionGcRootTracker._visit_and
visit_xchgl = FunctionGcRootTracker._visit_xchg
visit_testl = FunctionGcRootTracker._visit_test
# used in "xor reg, reg" to create a NULL GC ptr
visit_xorl = FunctionGcRootTracker.binary_insn
visit_orl = FunctionGcRootTracker.binary_insn # unsure about this one
# occasionally used on 32-bits to move floats around
visit_movq = FunctionGcRootTracker.visit_nop
def visit_pushw(self, line):
return [InsnStackAdjust(-2)] # rare but not impossible
def visit_popl(self, line):
match = self.r_unaryinsn.match(line)
target = match.group(1)
return self._visit_pop(target)
class FunctionGcRootTracker64(FunctionGcRootTracker):
WORD = 8
# Regex ignores destination
r_save_xmm_register = re.compile(r"\tmovaps\s+%xmm(\d+)")
def _maybe_32bit_dest(func):
def wrapper(self, line):
# Using a 32-bit reg as a destination in 64-bit mode zero-extends
# to 64-bits, so sometimes gcc uses a 32-bit operation to copy a
# statically known pointer to a register
# %eax -> %rax
new_line = re.sub(r"%e(ax|bx|cx|dx|di|si|bp)$", r"%r\1", line)
# %r10d -> %r10
new_line = re.sub(r"%r(\d+)d$", r"%r\1", new_line)
return func(self, new_line)
return wrapper
visit_addl = FunctionGcRootTracker.visit_nop
visit_subl = FunctionGcRootTracker.visit_nop
visit_leal = FunctionGcRootTracker.visit_nop
visit_cltq = FunctionGcRootTracker.visit_nop
visit_movq = FunctionGcRootTracker._visit_mov
# just a special assembler mnemonic for mov
visit_movabsq = FunctionGcRootTracker._visit_mov
visit_mov = _maybe_32bit_dest(FunctionGcRootTracker._visit_mov)
visit_movl = visit_mov
visit_xorl = _maybe_32bit_dest(FunctionGcRootTracker.binary_insn)
visit_pushq = FunctionGcRootTracker._visit_push
visit_addq = FunctionGcRootTracker._visit_add
visit_subq = FunctionGcRootTracker._visit_sub
visit_leaq = FunctionGcRootTracker._visit_lea
visit_xorq = FunctionGcRootTracker.binary_insn
visit_xchgl = FunctionGcRootTracker._visit_xchg
visit_xchgq = FunctionGcRootTracker._visit_xchg
visit_testq = FunctionGcRootTracker._visit_test
# FIXME: similar to visit_popl for 32-bit
def visit_popq(self, line):
match = self.r_unaryinsn.match(line)
target = match.group(1)
return self._visit_pop(target)
def visit_jmp(self, line):
# On 64-bit, %al is used when calling varargs functions to specify an
# upper-bound on the number of xmm registers used in the call. gcc
# uses %al to compute an indirect jump that looks like:
#
# jmp *[some register]
# movaps %xmm7, [stack location]
# movaps %xmm6, [stack location]
# movaps %xmm5, [stack location]
# movaps %xmm4, [stack location]
# movaps %xmm3, [stack location]
# movaps %xmm2, [stack location]
# movaps %xmm1, [stack location]
# movaps %xmm0, [stack location]
#
# The jmp is always to somewhere in the block of "movaps"
# instructions, according to how many xmm registers need to be saved
# to the stack. The point of all this is that we can safely ignore
# jmp instructions of that form.
if (self.currentlineno + 8) < len(self.lines) and self.r_unaryinsn_star.match(line):
matches = [self.r_save_xmm_register.match(self.lines[self.currentlineno + 1 + i]) for i in range(8)]
if all(m and int(m.group(1)) == (7 - i) for i, m in enumerate(matches)):
return []
return FunctionGcRootTracker.visit_jmp(self, line)
class ElfFunctionGcRootTracker32(FunctionGcRootTracker32):
format = 'elf'
function_names_prefix = ''
ESP = '%esp'
EBP = '%ebp'
EAX = '%eax'
CALLEE_SAVE_REGISTERS = ['%ebx', '%esi', '%edi', '%ebp']
REG2LOC = dict((_reg, LOC_REG | ((_i+1)<<2))
for _i, _reg in enumerate(CALLEE_SAVE_REGISTERS))
OPERAND = r'(?:[-\w$%+.:@"]+(?:[(][\w%,]+[)])?|[(][\w%,]+[)])'
LABEL = r'([a-zA-Z_$.][a-zA-Z0-9_$.]*)(?:@[@a-zA-Z0-9_$.]*)?'
OFFSET_LABELS = 2**30
TOP_OF_STACK_MINUS_WORD = '-4(%esp)'
r_functionstart = re.compile(r"\t.type\s+"+LABEL+",\s*[@]function\s*$")
r_functionend = re.compile(r"\t.size\s+"+LABEL+",\s*[.]-"+LABEL+"\s*$")
LOCALVAR = r"%eax|%edx|%ecx|%ebx|%esi|%edi|%ebp|-?\d*[(]%esp[)]"
LOCALVARFP = LOCALVAR + r"|-?\d*[(]%ebp[)]"
r_localvarnofp = re.compile(LOCALVAR)
r_localvarfp = re.compile(LOCALVARFP)
r_localvar_esp = re.compile(r"(-?\d*)[(]%esp[)]")
r_localvar_ebp = re.compile(r"(-?\d*)[(]%ebp[)]")
r_rel_label = re.compile(r"(\d+):\s*$")
r_jump_rel_label = re.compile(r"\tj\w+\s+"+"(\d+)f"+"\s*$")
r_unaryinsn_star= re.compile(r"\t[a-z]\w*\s+[*]("+OPERAND+")\s*$")
r_jmptable_item = re.compile(r"\t.long\t"+LABEL+"(-\"[A-Za-z0-9$]+\")?\s*$")
r_jmptable_end = re.compile(r"\t.text|\t.section\s+.text|\t\.align|"+LABEL)
r_gcroot_marker = re.compile(r"\t/[*] GCROOT ("+LOCALVARFP+") [*]/")
r_gcnocollect_marker = re.compile(r"\t/[*] GC_NOCOLLECT ("+OPERAND+") [*]/")
r_bottom_marker = re.compile(r"\t/[*] GC_STACK_BOTTOM [*]/")
FUNCTIONS_NOT_RETURNING = {
'_exit': None,
'__assert_fail': None,
'___assert_rtn': None,
'L___assert_rtn$stub': None,
'L___eprintf$stub': None,
'__stack_chk_fail': None,
}
for _name in FunctionGcRootTracker.BASE_FUNCTIONS_NOT_RETURNING:
FUNCTIONS_NOT_RETURNING[_name] = None
def __init__(self, lines, filetag=0):
match = self.r_functionstart.match(lines[0])
funcname = match.group(1)
match = self.r_functionend.match(lines[-1])
assert funcname == match.group(1)
assert funcname == match.group(2)
super(ElfFunctionGcRootTracker32, self).__init__(
funcname, lines, filetag)
def extract_immediate(self, value):
if not value.startswith('$'):
return None
return int(value[1:])
ElfFunctionGcRootTracker32.init_regexp()
class ElfFunctionGcRootTracker64(FunctionGcRootTracker64):
format = 'elf64'
function_names_prefix = ''
ESP = '%rsp'
EBP = '%rbp'
EAX = '%rax'
CALLEE_SAVE_REGISTERS = ['%rbx', '%r12', '%r13', '%r14', '%r15', '%rbp']
REG2LOC = dict((_reg, LOC_REG | ((_i+1)<<2))
for _i, _reg in enumerate(CALLEE_SAVE_REGISTERS))
OPERAND = r'(?:[-\w$%+.:@"]+(?:[(][\w%,]+[)])?|[(][\w%,]+[)])'
LABEL = r'([a-zA-Z_$.][a-zA-Z0-9_$.]*)(?:@[@a-zA-Z0-9_$.]*)?'
OFFSET_LABELS = 2**30
TOP_OF_STACK_MINUS_WORD = '-8(%rsp)'
r_functionstart = re.compile(r"\t.type\s+"+LABEL+",\s*[@]function\s*$")
r_functionend = re.compile(r"\t.size\s+"+LABEL+",\s*[.]-"+LABEL+"\s*$")
LOCALVAR = r"%rax|%rbx|%rcx|%rdx|%rdi|%rsi|%rbp|%r8|%r9|%r10|%r11|%r12|%r13|%r14|%r15|-?\d*[(]%rsp[)]"
LOCALVARFP = LOCALVAR + r"|-?\d*[(]%rbp[)]"
r_localvarnofp = re.compile(LOCALVAR)
r_localvarfp = re.compile(LOCALVARFP)
r_localvar_esp = re.compile(r"(-?\d*)[(]%rsp[)]")
r_localvar_ebp = re.compile(r"(-?\d*)[(]%rbp[)]")
r_rel_label = re.compile(r"(\d+):\s*$")
r_jump_rel_label = re.compile(r"\tj\w+\s+"+"(\d+)f"+"\s*$")
r_unaryinsn_star= re.compile(r"\t[a-z]\w*\s+[*]("+OPERAND+")\s*$")
r_jmptable_item = re.compile(r"\t.(?:quad|long)\t"+LABEL+"(-\"[A-Za-z0-9$]+\"|-"+LABEL+")?\s*$")
r_jmptable_end = re.compile(r"\t.text|\t.section\s+.text|\t\.align|"+LABEL)
r_gcroot_marker = re.compile(r"\t/[*] GCROOT ("+LOCALVARFP+") [*]/")
r_gcnocollect_marker = re.compile(r"\t/[*] GC_NOCOLLECT ("+OPERAND+") [*]/")
r_bottom_marker = re.compile(r"\t/[*] GC_STACK_BOTTOM [*]/")
FUNCTIONS_NOT_RETURNING = {
'_exit': None,
'__assert_fail': None,
'___assert_rtn': None,
'L___assert_rtn$stub': None,
'L___eprintf$stub': None,
'__stack_chk_fail': None,
}
for _name in FunctionGcRootTracker.BASE_FUNCTIONS_NOT_RETURNING:
FUNCTIONS_NOT_RETURNING[_name] = None
def __init__(self, lines, filetag=0):
match = self.r_functionstart.match(lines[0])
funcname = match.group(1)
match = self.r_functionend.match(lines[-1])
assert funcname == match.group(1)
assert funcname == match.group(2)
super(ElfFunctionGcRootTracker64, self).__init__(
funcname, lines, filetag)
def extract_immediate(self, value):
if not value.startswith('$'):
return None
return int(value[1:])
ElfFunctionGcRootTracker64.init_regexp()
class DarwinFunctionGcRootTracker32(ElfFunctionGcRootTracker32):
format = 'darwin'
function_names_prefix = '_'
r_functionstart = re.compile(r"_(\w+):\s*$")
OFFSET_LABELS = 0
def __init__(self, lines, filetag=0):
match = self.r_functionstart.match(lines[0])
funcname = '_' + match.group(1)
FunctionGcRootTracker32.__init__(self, funcname, lines, filetag)
class DarwinFunctionGcRootTracker64(ElfFunctionGcRootTracker64):
format = 'darwin64'
function_names_prefix = '_'
LABEL = ElfFunctionGcRootTracker64.LABEL
r_jmptable_item = re.compile(r"\t.(?:long|quad)\t"+LABEL+"(-\"?[A-Za-z0-9$]+\"?)?\s*$")
r_functionstart = re.compile(r"_(\w+):\s*$")
OFFSET_LABELS = 0
def __init__(self, lines, filetag=0):
match = self.r_functionstart.match(lines[0])
funcname = '_' + match.group(1)
FunctionGcRootTracker64.__init__(self, funcname, lines, filetag)
class Mingw32FunctionGcRootTracker(DarwinFunctionGcRootTracker32):
format = 'mingw32'
function_names_prefix = '_'
FUNCTIONS_NOT_RETURNING = {
'_exit': None,
'__assert': None,
}
for _name in FunctionGcRootTracker.BASE_FUNCTIONS_NOT_RETURNING:
FUNCTIONS_NOT_RETURNING['_' + _name] = None
class MsvcFunctionGcRootTracker(FunctionGcRootTracker32):
format = 'msvc'
function_names_prefix = '_'
ESP = 'esp'
EBP = 'ebp'
EAX = 'eax'
CALLEE_SAVE_REGISTERS = ['ebx', 'esi', 'edi', 'ebp']
REG2LOC = dict((_reg, LOC_REG | ((_i+1)<<2))
for _i, _reg in enumerate(CALLEE_SAVE_REGISTERS))
TOP_OF_STACK_MINUS_WORD = 'DWORD PTR [esp-4]'
OPERAND = r'(?:(:?WORD|DWORD|BYTE) PTR |OFFSET )?[_\w?:@$]*(?:[-+0-9]+)?(:?\[[-+*\w0-9]+\])?'
LABEL = r'([a-zA-Z_$@.][a-zA-Z0-9_$@.]*)'
OFFSET_LABELS = 0
r_segmentstart = re.compile(r"[_A-Z]+\tSEGMENT$")
r_segmentend = re.compile(r"[_A-Z]+\tENDS$")
r_functionstart = re.compile(r"; Function compile flags: ")
r_codestart = re.compile(LABEL+r"\s+PROC\s*(:?;.+)?\n$")
r_functionend = re.compile(LABEL+r"\s+ENDP\s*$")
r_symboldefine = re.compile(r"([_A-Za-z0-9$]+) = ([-0-9]+)\s*;.+\n")
LOCALVAR = r"eax|edx|ecx|ebx|esi|edi|ebp|DWORD PTR [-+]?\d*\[esp[-+]?\d*\]"
LOCALVARFP = LOCALVAR + r"|DWORD PTR -?\d*\[ebp\]"
r_localvarnofp = re.compile(LOCALVAR)
r_localvarfp = re.compile(LOCALVARFP)
r_localvar_esp = re.compile(r"DWORD PTR ([-+]?\d+)?\[esp([-+]?\d+)?\]")
r_localvar_ebp = re.compile(r"DWORD PTR ([-+]?\d+)?\[ebp([-+]?\d+)?\]")
r_rel_label = re.compile(r"$1") # never matches
r_jump_rel_label = re.compile(r"$1") # never matches
r_unaryinsn_star= re.compile(r"\t[a-z]\w*\s+DWORD PTR ("+OPERAND+")\s*$")
r_jmptable_item = re.compile(r"\tDD\t"+LABEL+"(-\"[A-Za-z0-9$]+\")?\s*$")
r_jmptable_end = re.compile(r"[^\t\n;]")
r_gcroot_marker = re.compile(r"$1") # never matches
r_gcroot_marker_var = re.compile(r"DWORD PTR .+_constant_always_one_.+pypy_asm_gcroot")
r_gcnocollect_marker = re.compile(r"\spypy_asm_gc_nocollect\(("+OPERAND+")\);")
r_bottom_marker = re.compile(r"; .+\spypy_asm_stack_bottom\(\);")
FUNCTIONS_NOT_RETURNING = {
'__exit': None,
'__assert': None,
'__wassert': None,
'__imp__abort': None,
'__imp___wassert': None,
'DWORD PTR __imp__abort': None,
'DWORD PTR __imp___wassert': None,
}
for _name in FunctionGcRootTracker.BASE_FUNCTIONS_NOT_RETURNING:
FUNCTIONS_NOT_RETURNING['_' + _name] = None
@classmethod
def init_regexp(cls):
super(MsvcFunctionGcRootTracker, cls).init_regexp()
cls.r_binaryinsn = re.compile(r"\t[a-z]\w*\s+(?P<target>"+cls.OPERAND+r"),\s*(?P<source>"+cls.OPERAND+r")\s*(?:;.+)?$")
cls.r_jump = re.compile(r"\tj\w+\s+(?:SHORT |DWORD PTR )?"+cls.LABEL+"\s*$")
def __init__(self, lines, filetag=0):
self.defines = {}
for i, line in enumerate(lines):
if self.r_symboldefine.match(line):
match = self.r_symboldefine.match(line)
name = match.group(1)
value = int(match.group(2))
self.defines[name] = value
continue
match = self.r_codestart.match(line)
if match:
self.skip = i
break
funcname = match.group(1)
super(MsvcFunctionGcRootTracker, self).__init__(
funcname, lines, filetag)
def replace_symbols(self, operand):
for name, value in self.defines.items():
operand = operand.replace(name, str(value))
return operand
for name in '''
push pop mov lea
xor sub add
'''.split():
locals()['visit_' + name] = getattr(FunctionGcRootTracker32,
'visit_' + name + 'l')
visit_int = FunctionGcRootTracker32.visit_nop
# probably not GC pointers
visit_cdq = FunctionGcRootTracker32.visit_nop
def visit_npad(self, line):
# MASM has a nasty bug: it implements "npad 5" with "add eax, 0"
# which is a not no-op because it clears flags.
# I've seen this instruction appear between "test" and "jne"...
# see http://www.masm32.com/board/index.php?topic=13122
match = self.r_unaryinsn.match(line)
arg = match.group(1)
if arg == "5":
# replace with "npad 3; npad 2"
self.lines[self.currentlineno] = "\tnpad\t3\n" "\tnpad\t2\n"
return []
def extract_immediate(self, value):
try:
return int(value)
except ValueError:
return None
def _visit_gcroot_marker(self, line=None):
# two possible patterns:
# 1. mov reg, DWORD PTR _always_one_
# imul target, reg
# 2. mov reg, DWORD PTR _always_one_
# imul reg, target
assert self.lines[self.currentlineno].startswith("\tmov\t")
mov = self.r_binaryinsn.match(self.lines[self.currentlineno])
assert re.match("DWORD PTR .+_always_one_", mov.group("source"))
reg = mov.group("target")
self.lines[self.currentlineno] = ";" + self.lines[self.currentlineno]
# the 'imul' must appear in the same block; the 'reg' must not
# appear in the instructions between
imul = None
lineno = self.currentlineno + 1
stop = False
while not stop:
line = self.lines[lineno]
if line == '\n':
stop = True
elif line.startswith("\tjmp\t"):
stop = True
elif self.r_gcroot_marker_var.search(line):
stop = True
elif (line.startswith("\tmov\t%s," % (reg,)) or
line.startswith("\tmovsx\t%s," % (reg,)) or
line.startswith("\tmovzx\t%s," % (reg,))):
# mov reg, <arg>
stop = True
elif line.startswith("\txor\t%s, %s" % (reg, reg)):
# xor reg, reg
stop = True
elif line.startswith("\timul\t"):
imul = self.r_binaryinsn.match(line)
imul_arg1 = imul.group("target")
imul_arg2 = imul.group("source")
if imul_arg1 == reg or imul_arg2 == reg:
break
# the register may not appear in other instructions
elif reg in line:
assert False, (line, lineno)
lineno += 1
else:
# No imul, the returned value is not used in this function
return []
if reg == imul_arg2:
self.lines[lineno] = ";" + self.lines[lineno]
return InsnGCROOT(self.replace_symbols(imul_arg1))
else:
assert reg == imul_arg1
self.lines[lineno] = "\tmov\t%s, %s\n" % (imul_arg1, imul_arg2)
if imul_arg2.startswith('OFFSET '):
# ignore static global variables
pass
else:
self.lines[lineno] += "\t; GCROOT\n"
return []
def insns_for_copy(self, source, target):
if self.r_gcroot_marker_var.match(source):
return self._visit_gcroot_marker()
if self.lines[self.currentlineno].endswith("\t; GCROOT\n"):
insns = [InsnGCROOT(self.replace_symbols(source))]
else:
insns = []
return insns + super(MsvcFunctionGcRootTracker, self).insns_for_copy(source, target)
MsvcFunctionGcRootTracker.init_regexp()
class AssemblerParser(object):
def __init__(self, verbose=0, shuffle=False):
self.verbose = verbose
self.shuffle = shuffle
self.gcmaptable = []
def process(self, iterlines, newfile, filename='?'):
for in_function, lines in self.find_functions(iterlines):
if in_function:
tracker = self.process_function(lines, filename)
lines = tracker.lines
self.write_newfile(newfile, lines, filename.split('.')[0])
if self.verbose == 1:
sys.stderr.write('\n')
def write_newfile(self, newfile, lines, grist):
newfile.writelines(lines)
def process_function(self, lines, filename):
tracker = self.FunctionGcRootTracker(
lines, filetag=getidentifier(filename))
if self.verbose == 1:
sys.stderr.write('.')
elif self.verbose > 1:
print >> sys.stderr, '[trackgcroot:%s] %s' % (filename,
tracker.funcname)
table = tracker.computegcmaptable(self.verbose)
if self.verbose > 1:
for label, state in table:
print >> sys.stderr, label, '\t', tracker.format_callshape(state)
table = compress_gcmaptable(table)
if self.shuffle and random.random() < 0.5:
self.gcmaptable[:0] = table
else:
self.gcmaptable.extend(table)
return tracker
class ElfAssemblerParser(AssemblerParser):
format = "elf"
FunctionGcRootTracker = ElfFunctionGcRootTracker32
def find_functions(self, iterlines):
functionlines = []
in_function = False
for line in iterlines:
match = self.FunctionGcRootTracker.r_functionstart.match(line)
if match and not match.group(1).startswith('__x86.get_pc_thunk.'):
assert not in_function, (
"missed the end of the previous function")
yield False, functionlines
in_function = True
functionlines = []
functionlines.append(line)
if self.FunctionGcRootTracker.r_functionend.match(line):
assert in_function, (
"missed the start of the current function")
yield True, functionlines
in_function = False
functionlines = []
if in_function and ".get_pc_thunk.bx" in functionlines[0]:
in_function = False # xxx? ignore this rare unclosed stub at
# the end of the file
assert not in_function, (
"missed the end of the previous function")
yield False, functionlines
class ElfAssemblerParser64(ElfAssemblerParser):
format = "elf64"
FunctionGcRootTracker = ElfFunctionGcRootTracker64
class DarwinAssemblerParser(AssemblerParser):
format = "darwin"
FunctionGcRootTracker = DarwinFunctionGcRootTracker32
r_textstart = re.compile(r"\t.text\s*$")
# see
# http://developer.apple.com/documentation/developertools/Reference/Assembler/040-Assembler_Directives/asm_directives.html
OTHERSECTIONS = ['section', 'zerofill',
'const', 'static_const', 'cstring',
'literal4', 'literal8', 'literal16',
'constructor', 'desctructor',
'symbol_stub',
'data', 'static_data',
'non_lazy_symbol_pointer', 'lazy_symbol_pointer',
'dyld', 'mod_init_func', 'mod_term_func',
'const_data'
]
r_sectionstart = re.compile(r"\t\.("+'|'.join(OTHERSECTIONS)+").*$")
sections_doesnt_end_function = {'cstring': True, 'const': True}
def find_functions(self, iterlines):
functionlines = []
in_text = False
in_function = False
for n, line in enumerate(iterlines):
if self.r_textstart.match(line):
in_text = True
elif self.r_sectionstart.match(line):
sectionname = self.r_sectionstart.match(line).group(1)
if (in_function and
sectionname not in self.sections_doesnt_end_function):
yield in_function, functionlines
functionlines = []
in_function = False
in_text = False
elif in_text and self.FunctionGcRootTracker.r_functionstart.match(line):
yield in_function, functionlines
functionlines = []
in_function = True
functionlines.append(line)
if functionlines:
yield in_function, functionlines
class DarwinAssemblerParser64(DarwinAssemblerParser):
format = "darwin64"
FunctionGcRootTracker = DarwinFunctionGcRootTracker64
class Mingw32AssemblerParser(DarwinAssemblerParser):
format = "mingw32"
r_sectionstart = re.compile(r"^_loc()")
FunctionGcRootTracker = Mingw32FunctionGcRootTracker
class MsvcAssemblerParser(AssemblerParser):
format = "msvc"
FunctionGcRootTracker = MsvcFunctionGcRootTracker
def find_functions(self, iterlines):
functionlines = []
in_function = False
in_segment = False
ignore_public = False
self.inline_functions = {}
for line in iterlines:
if line.startswith('; File '):
filename = line[:-1].split(' ', 2)[2]
ignore_public = ('wspiapi.h' in filename.lower())
if ignore_public:
# this header define __inline functions, that are
# still marked as PUBLIC in the generated assembler
if line.startswith(';\tCOMDAT '):
funcname = line[:-1].split(' ', 1)[1]
self.inline_functions[funcname] = True
elif line.startswith('PUBLIC\t'):
funcname = line[:-1].split('\t')[1]
self.inline_functions[funcname] = True
if self.FunctionGcRootTracker.r_segmentstart.match(line):
in_segment = True
elif self.FunctionGcRootTracker.r_functionstart.match(line):
assert not in_function, (
"missed the end of the previous function")
in_function = True
if in_segment:
yield False, functionlines
functionlines = []
functionlines.append(line)
if self.FunctionGcRootTracker.r_segmentend.match(line):
yield False, functionlines
in_segment = False
functionlines = []
elif self.FunctionGcRootTracker.r_functionend.match(line):
assert in_function, (
"missed the start of the current function")
yield True, functionlines
in_function = False
functionlines = []
assert not in_function, (
"missed the end of the previous function")
yield False, functionlines
def write_newfile(self, newfile, lines, grist):
newlines = []
for line in lines:
# truncate long comments
if line.startswith(";"):
line = line[:-1][:500] + '\n'
# Workaround a bug in the .s files generated by msvc
# compiler: every string or float constant is exported
# with a name built after its value, and will conflict
# with other modules.
if line.startswith("PUBLIC\t"):
symbol = line[:-1].split()[1]
if symbol.startswith('__real@'):
line = '; ' + line
elif symbol.startswith("__mask@@"):
line = '; ' + line
elif symbol.startswith("??_C@"):
line = '; ' + line
elif symbol == "__$ArrayPad$":
line = '; ' + line
elif symbol in self.inline_functions:
line = '; ' + line
# The msvc compiler writes "fucomip ST(1)" when the correct
# syntax is "fucomip ST, ST(1)"
if line == "\tfucomip\tST(1)\n":
line = "\tfucomip\tST, ST(1)\n"
# Because we insert labels in the code, some "SHORT" jumps
# are now longer than 127 bytes. We turn them all into
# "NEAR" jumps. Note that the assembler allocates space
# for a near jump, but still generates a short jump when
# it can.
line = line.replace('\tjmp\tSHORT ', '\tjmp\t')
line = line.replace('\tjne\tSHORT ', '\tjne\t')
line = line.replace('\tje\tSHORT ', '\tje\t')
newlines.append(line)
if line == "\t.model\tflat\n":
newlines.append("\tassume fs:nothing\n")
newfile.writelines(newlines)
PARSERS = {
'elf': ElfAssemblerParser,
'elf64': ElfAssemblerParser64,
'darwin': DarwinAssemblerParser,
'darwin64': DarwinAssemblerParser64,
'mingw32': Mingw32AssemblerParser,
'msvc': MsvcAssemblerParser,
}
class GcRootTracker(object):
def __init__(self, verbose=0, shuffle=False, format='elf'):
self.verbose = verbose
self.shuffle = shuffle # to debug the sorting logic in asmgcroot.py
self.format = format
self.gcmaptable = []
def dump_raw_table(self, output):
print 'raw table'
for entry in self.gcmaptable:
print >> output, entry
def reload_raw_table(self, input):
firstline = input.readline()
assert firstline == 'raw table\n'
for line in input:
entry = eval(line)
assert type(entry) is tuple
self.gcmaptable.append(entry)
def dump(self, output):
def _globalname(name, disp=""):
return tracker_cls.function_names_prefix + name
def _variant(**kwargs):
txt = kwargs[self.format]
print >> output, "\t%s" % txt
if self.format in ('elf64', 'darwin64'):
word_decl = '.quad'
else:
word_decl = '.long'
tracker_cls = PARSERS[self.format].FunctionGcRootTracker
# The pypy_asm_stackwalk() function
if self.format == 'msvc':
print >> output, """\
/* See description in asmgcroot.py */
__declspec(naked)
long pypy_asm_stackwalk(void *callback)
{
__asm {
mov\tedx, DWORD PTR [esp+4]\t; 1st argument, which is the callback
mov\tecx, DWORD PTR [esp+8]\t; 2nd argument, which is gcrootanchor
mov\teax, esp\t\t; my frame top address
push\teax\t\t\t; ASM_FRAMEDATA[6]
push\tebp\t\t\t; ASM_FRAMEDATA[5]
push\tedi\t\t\t; ASM_FRAMEDATA[4]
push\tesi\t\t\t; ASM_FRAMEDATA[3]
push\tebx\t\t\t; ASM_FRAMEDATA[2]
; Add this ASM_FRAMEDATA to the front of the circular linked
; list. Let's call it 'self'.
mov\teax, DWORD PTR [ecx+4]\t\t; next = gcrootanchor->next
push\teax\t\t\t\t\t\t\t\t\t; self->next = next
push\tecx ; self->prev = gcrootanchor
mov\tDWORD PTR [ecx+4], esp\t\t; gcrootanchor->next = self
mov\tDWORD PTR [eax+0], esp\t\t\t\t\t; next->prev = self
call\tedx\t\t\t\t\t\t; invoke the callback
; Detach this ASM_FRAMEDATA from the circular linked list
pop\tesi\t\t\t\t\t\t\t; prev = self->prev
pop\tedi\t\t\t\t\t\t\t; next = self->next
mov\tDWORD PTR [esi+4], edi\t\t; prev->next = next
mov\tDWORD PTR [edi+0], esi\t\t; next->prev = prev
pop\tebx\t\t\t\t; restore from ASM_FRAMEDATA[2]
pop\tesi\t\t\t\t; restore from ASM_FRAMEDATA[3]
pop\tedi\t\t\t\t; restore from ASM_FRAMEDATA[4]
pop\tebp\t\t\t\t; restore from ASM_FRAMEDATA[5]
pop\tecx\t\t\t\t; ignored ASM_FRAMEDATA[6]
; the return value is the one of the 'call' above,
; because %eax (and possibly %edx) are unmodified
ret
}
}
"""
elif self.format in ('elf64', 'darwin64'):
if self.format == 'elf64': # gentoo patch: hardened systems
print >> output, "\t.section .note.GNU-stack,\"\",%progbits"
print >> output, "\t.text"
print >> output, "\t.globl %s" % _globalname('pypy_asm_stackwalk')
_variant(elf64='.type pypy_asm_stackwalk, @function',
darwin64='')
print >> output, "%s:" % _globalname('pypy_asm_stackwalk')
s = """\
/* See description in asmgcroot.py */
.cfi_startproc
/* %rdi is the 1st argument, which is the callback */
/* %rsi is the 2nd argument, which is gcrootanchor */
movq\t%rsp, %rax\t/* my frame top address */
pushq\t%rax\t\t/* ASM_FRAMEDATA[8] */
pushq\t%rbp\t\t/* ASM_FRAMEDATA[7] */
pushq\t%r15\t\t/* ASM_FRAMEDATA[6] */
pushq\t%r14\t\t/* ASM_FRAMEDATA[5] */
pushq\t%r13\t\t/* ASM_FRAMEDATA[4] */
pushq\t%r12\t\t/* ASM_FRAMEDATA[3] */
pushq\t%rbx\t\t/* ASM_FRAMEDATA[2] */
/* Add this ASM_FRAMEDATA to the front of the circular linked */
/* list. Let's call it 'self'. */
movq\t8(%rsi), %rax\t/* next = gcrootanchor->next */
pushq\t%rax\t\t\t\t/* self->next = next */
pushq\t%rsi\t\t\t/* self->prev = gcrootanchor */
movq\t%rsp, 8(%rsi)\t/* gcrootanchor->next = self */
movq\t%rsp, 0(%rax)\t\t\t/* next->prev = self */
.cfi_def_cfa_offset 80\t/* 9 pushes + the retaddr = 80 bytes */
/* note: the Mac OS X 16 bytes aligment must be respected. */
call\t*%rdi\t\t/* invoke the callback */
/* Detach this ASM_FRAMEDATA from the circular linked list */
popq\t%rsi\t\t/* prev = self->prev */
popq\t%rdi\t\t/* next = self->next */
movq\t%rdi, 8(%rsi)\t/* prev->next = next */
movq\t%rsi, 0(%rdi)\t/* next->prev = prev */
popq\t%rbx\t\t/* restore from ASM_FRAMEDATA[2] */
popq\t%r12\t\t/* restore from ASM_FRAMEDATA[3] */
popq\t%r13\t\t/* restore from ASM_FRAMEDATA[4] */
popq\t%r14\t\t/* restore from ASM_FRAMEDATA[5] */
popq\t%r15\t\t/* restore from ASM_FRAMEDATA[6] */
popq\t%rbp\t\t/* restore from ASM_FRAMEDATA[7] */
popq\t%rcx\t\t/* ignored ASM_FRAMEDATA[8] */
/* the return value is the one of the 'call' above, */
/* because %rax is unmodified */
ret
.cfi_endproc
"""
if self.format == 'darwin64':
# obscure. gcc there seems not to support .cfi_...
# hack it out...
s = re.sub(r'([.]cfi_[^/\n]+)([/\n])',
r'/* \1 disabled on darwin */\2', s)
print >> output, s
_variant(elf64='.size pypy_asm_stackwalk, .-pypy_asm_stackwalk',
darwin64='')
else:
print >> output, "\t.text"
print >> output, "\t.globl %s" % _globalname('pypy_asm_stackwalk')
_variant(elf='.type pypy_asm_stackwalk, @function',
darwin='',
mingw32='')
print >> output, "%s:" % _globalname('pypy_asm_stackwalk')
print >> output, """\
/* See description in asmgcroot.py */
movl\t4(%esp), %edx\t/* 1st argument, which is the callback */
movl\t8(%esp), %ecx\t/* 2nd argument, which is gcrootanchor */
movl\t%esp, %eax\t/* my frame top address */
pushl\t%eax\t\t/* ASM_FRAMEDATA[6] */
pushl\t%ebp\t\t/* ASM_FRAMEDATA[5] */
pushl\t%edi\t\t/* ASM_FRAMEDATA[4] */
pushl\t%esi\t\t/* ASM_FRAMEDATA[3] */
pushl\t%ebx\t\t/* ASM_FRAMEDATA[2] */
/* Add this ASM_FRAMEDATA to the front of the circular linked */
/* list. Let's call it 'self'. */
movl\t4(%ecx), %eax\t/* next = gcrootanchor->next */
pushl\t%eax\t\t\t\t/* self->next = next */
pushl\t%ecx\t\t\t/* self->prev = gcrootanchor */
movl\t%esp, 4(%ecx)\t/* gcrootanchor->next = self */
movl\t%esp, 0(%eax)\t\t\t/* next->prev = self */
/* note: the Mac OS X 16 bytes aligment must be respected. */
call\t*%edx\t\t/* invoke the callback */
/* Detach this ASM_FRAMEDATA from the circular linked list */
popl\t%esi\t\t/* prev = self->prev */
popl\t%edi\t\t/* next = self->next */
movl\t%edi, 4(%esi)\t/* prev->next = next */
movl\t%esi, 0(%edi)\t/* next->prev = prev */
popl\t%ebx\t\t/* restore from ASM_FRAMEDATA[2] */
popl\t%esi\t\t/* restore from ASM_FRAMEDATA[3] */
popl\t%edi\t\t/* restore from ASM_FRAMEDATA[4] */
popl\t%ebp\t\t/* restore from ASM_FRAMEDATA[5] */
popl\t%ecx\t\t/* ignored ASM_FRAMEDATA[6] */
/* the return value is the one of the 'call' above, */
/* because %eax (and possibly %edx) are unmodified */
ret
"""
_variant(elf='.size pypy_asm_stackwalk, .-pypy_asm_stackwalk',
darwin='',
mingw32='')
if self.format == 'msvc':
for label, state, is_range in self.gcmaptable:
label = label[1:]
print >> output, "extern void* %s;" % label
shapes = {}
shapelines = []
shapeofs = 0
# write the tables
if self.format == 'msvc':
print >> output, """\
static struct { void* addr; long shape; } __gcmap[%d] = {
""" % (len(self.gcmaptable),)
for label, state, is_range in self.gcmaptable:
label = label[1:]
try:
n = shapes[state]
except KeyError:
n = shapes[state] = shapeofs
bytes = [str(b) for b in tracker_cls.compress_callshape(state)]
shapelines.append('\t%s,\t/* %s */\n' % (
', '.join(bytes),
shapeofs))
shapeofs += len(bytes)
if is_range:
n = ~ n
print >> output, '{ &%s, %d},' % (label, n)
print >> output, """\
};
void* __gcmapstart = __gcmap;
void* __gcmapend = __gcmap + %d;
char __gccallshapes[] = {
""" % (len(self.gcmaptable),)
output.writelines(shapelines)
print >> output, """\
};
"""
else:
print >> output, """\
.data
.align 4
.globl __gcmapstart
__gcmapstart:
""".replace("__gcmapstart", _globalname("__gcmapstart"))
for label, state, is_range in self.gcmaptable:
try:
n = shapes[state]
except KeyError:
n = shapes[state] = shapeofs
bytes = [str(b) for b in tracker_cls.compress_callshape(state)]
shapelines.append('\t/*%d*/\t.byte\t%s\n' % (
shapeofs,
', '.join(bytes)))
shapeofs += len(bytes)
if is_range:
n = ~ n
print >> output, '\t%s\t%s-%d' % (
word_decl,
label,
tracker_cls.OFFSET_LABELS)
print >> output, '\t%s\t%d' % (word_decl, n)
print >> output, """\
.globl __gcmapend
__gcmapend:
""".replace("__gcmapend", _globalname("__gcmapend"))
_variant(elf='.section\t.rodata',
elf64='.section\t.rodata',
darwin='.const',
darwin64='.const',
mingw32='')
print >> output, """\
.globl __gccallshapes
__gccallshapes:
""".replace("__gccallshapes", _globalname("__gccallshapes"))
output.writelines(shapelines)
print >> output, """\
#if defined(__linux__) && defined(__ELF__)
.section .note.GNU-stack,"",%progbits
#endif
"""
def process(self, iterlines, newfile, filename='?'):
parser = PARSERS[format](verbose=self.verbose, shuffle=self.shuffle)
for in_function, lines in parser.find_functions(iterlines):
if in_function:
tracker = parser.process_function(lines, filename)
lines = tracker.lines
parser.write_newfile(newfile, lines, filename.split('.')[0])
if self.verbose == 1:
sys.stderr.write('\n')
if self.shuffle and random.random() < 0.5:
self.gcmaptable[:0] = parser.gcmaptable
else:
self.gcmaptable.extend(parser.gcmaptable)
class UnrecognizedOperation(Exception):
pass
class NoPatternMatch(Exception):
pass
# __________ table compression __________
def compress_gcmaptable(table):
# Compress ranges table[i:j] of entries with the same state
# into a single entry whose label is the start of the range.
# The last element in the table is never compressed in this
# way for debugging reasons, to avoid that a random address
# in memory gets mapped to the last element in the table
# just because it's the closest address.
# To be on the safe side, compress_gcmaptable() should be called
# after each function processed -- otherwise the result depends on
# the linker not rearranging the functions in memory, which is
# fragile (and wrong e.g. with "make profopt").
i = 0
limit = len(table) - 1 # only process entries table[:limit]
while i < len(table):
label1, state = table[i]
is_range = False
j = i + 1
while j < limit and table[j][1] == state:
is_range = True
j += 1
# now all entries in table[i:j] have the same state
yield (label1, state, is_range)
i = j
def getidentifier(s):
def mapchar(c):
if c.isalnum():
return c
else:
return '_'
if s.endswith('.s'):
s = s[:-2]
s = ''.join([mapchar(c) for c in s])
while s.endswith('__'):
s = s[:-1]
return s
if __name__ == '__main__':
verbose = 0
shuffle = False
output_raw_table = False
if sys.platform == 'darwin':
if sys.maxint > 2147483647:
format = 'darwin64'
else:
format = 'darwin'
elif sys.platform == 'win32':
format = 'mingw32'
else:
if sys.maxint > 2147483647:
format = 'elf64'
else:
format = 'elf'
while len(sys.argv) > 1:
if sys.argv[1] == '-v':
del sys.argv[1]
verbose = sys.maxint
elif sys.argv[1] == '-r':
del sys.argv[1]
shuffle = True
elif sys.argv[1] == '-t':
del sys.argv[1]
output_raw_table = True
elif sys.argv[1].startswith('-f'):
format = sys.argv[1][2:]
del sys.argv[1]
elif sys.argv[1].startswith('-'):
print >> sys.stderr, "unrecognized option:", sys.argv[1]
sys.exit(1)
else:
break
tracker = GcRootTracker(verbose=verbose, shuffle=shuffle, format=format)
for fn in sys.argv[1:]:
f = open(fn, 'r')
firstline = f.readline()
f.seek(0)
assert firstline, "file %r is empty!" % (fn,)
if firstline == 'raw table\n':
tracker.reload_raw_table(f)
f.close()
else:
assert fn.endswith('.s'), fn
lblfn = fn[:-2] + '.lbl.s'
g = open(lblfn, 'w')
try:
tracker.process(f, g, filename=fn)
except:
g.close()
os.unlink(lblfn)
raise
g.close()
f.close()
if output_raw_table:
tracker.dump_raw_table(sys.stdout)
if not output_raw_table:
tracker.dump(sys.stdout)
|