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
|
/* Copyright (C) 2018 Wildfire Games.
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
/*
* Win32 stack trace and symbol engine.
*/
#include "precompiled.h"
#include "lib/sysdep/os/win/wdbg_sym.h"
#include <cstdlib>
#include <cstdio>
#include <set>
#include "lib/byte_order.h" // movzx_le64
#include "lib/module_init.h"
#include "lib/sysdep/cpu.h"
#include "lib/debug_stl.h"
#include "lib/app_hooks.h"
#include "lib/external_libraries/dbghelp.h"
#include "lib/sysdep/os/win/wdbg.h"
#include "lib/sysdep/os/win/wutil.h"
#include "lib/sysdep/os/win/winit.h"
WINIT_REGISTER_CRITICAL_INIT(wdbg_sym_Init);
static WUTIL_FUNC(pRtlCaptureContext, VOID, (PCONTEXT));
static Status wdbg_sym_Init()
{
WUTIL_IMPORT_KERNEL32(RtlCaptureContext, pRtlCaptureContext);
return INFO::OK;
}
//----------------------------------------------------------------------------
// dbghelp
//----------------------------------------------------------------------------
// global for convenience (we only support a single process)
static HANDLE hProcess;
// for StackWalk64; taken from PE header by InitDbghelp.
static WORD machine;
static Status InitDbghelp()
{
hProcess = GetCurrentProcess();
dbghelp_ImportFunctions();
// set options
// notes:
// - can be done before SymInitialize; we do so in case
// any of the options affect it.
// - do not set directly - that would zero any existing flags.
DWORD opts = pSymGetOptions();
//opts |= SYMOPT_DEBUG; // lots of debug spew in output window
opts |= SYMOPT_DEFERRED_LOADS; // the "fastest, most efficient way"
opts |= SYMOPT_LOAD_LINES;
opts |= SYMOPT_UNDNAME;
pSymSetOptions(opts);
// initialize dbghelp.
// .. request symbols from all currently active modules be loaded.
const BOOL fInvadeProcess = TRUE;
// .. use default *symbol* search path. we don't use this to locate
// our PDB file because its absolute path is stored inside the EXE.
const PWSTR UserSearchPath = 0;
WinScopedPreserveLastError s; // SymInitializeW
const BOOL ok = pSymInitializeW(hProcess, UserSearchPath, fInvadeProcess);
WARN_IF_FALSE(ok);
HMODULE hModule = GetModuleHandle(0);
IMAGE_NT_HEADERS* const header = pImageNtHeader(hModule);
machine = header->FileHeader.Machine;
return INFO::OK;
}
// ensure dbghelp is initialized exactly once.
// call every time before dbghelp functions are used.
// (on-demand initialization allows handling exceptions raised before
// winit.cpp init functions are called)
//
// NB: this may take SECONDS if OS symbols are installed and
// symserv wants to access the internet.
static void sym_init()
{
static ModuleInitState initState;
ModuleInit(&initState, InitDbghelp);
}
static STACKFRAME64 PopulateStackFrame(CONTEXT& context)
{
STACKFRAME64 sf;
memset(&sf, 0, sizeof(sf));
sf.AddrPC.Mode = AddrModeFlat;
sf.AddrFrame.Mode = AddrModeFlat;
sf.AddrStack.Mode = AddrModeFlat;
#if ARCH_AMD64
sf.AddrPC.Offset = context.Rip;
sf.AddrFrame.Offset = context.Rbp;
sf.AddrStack.Offset = context.Rsp;
#else
sf.AddrPC.Offset = context.Eip;
sf.AddrFrame.Offset = context.Ebp;
sf.AddrStack.Offset = context.Esp;
#endif
return sf;
}
static IMAGEHLP_STACK_FRAME PopulateImageStackFrame(const STACKFRAME64& sf)
{
IMAGEHLP_STACK_FRAME isf;
memset(&isf, 0, sizeof(isf));
// apparently only PC, FP and SP are necessary, but
// we copy everything to be safe.
isf.InstructionOffset = sf.AddrPC.Offset;
isf.ReturnOffset = sf.AddrReturn.Offset;
isf.FrameOffset = sf.AddrFrame.Offset;
isf.StackOffset = sf.AddrStack.Offset;
isf.BackingStoreOffset = sf.AddrBStore.Offset;
isf.FuncTableEntry = (ULONG64)sf.FuncTableEntry;
// (note: array of different types, can't copy directly)
for(int i = 0; i < 4; i++)
isf.Params[i] = sf.Params[i];
// isf.Reserved - already zeroed
isf.Virtual = sf.Virtual;
// isf.Reserved2 - already zeroed
return isf;
}
struct SYMBOL_INFO_PACKAGEW2 : public SYMBOL_INFO_PACKAGEW
{
SYMBOL_INFO_PACKAGEW2()
{
si.SizeOfStruct = sizeof(si);
si.MaxNameLen = MAX_SYM_NAME;
}
};
#pragma pack(push, 1)
// note: we can't derive from TI_FINDCHILDREN_PARAMS because its members
// aren't guaranteed to precede ours (although they do in practice).
struct TI_FINDCHILDREN_PARAMS2
{
TI_FINDCHILDREN_PARAMS2(DWORD numChildren)
{
p.Start = 0;
p.Count = std::min(numChildren, maxChildren);
}
static const DWORD maxChildren = 300;
TI_FINDCHILDREN_PARAMS p;
DWORD childrenStorage[maxChildren-1];
};
#pragma pack(pop)
// actual implementation; made available so that functions already under
// the lock don't have to unlock (slow) to avoid recursive locking.
static Status ResolveSymbol_lk(void* ptr_of_interest, wchar_t* sym_name, wchar_t* file, int* line)
{
sym_init();
const DWORD64 addr = (DWORD64)ptr_of_interest;
size_t successes = 0;
WinScopedPreserveLastError s; // SymFromAddrW, SymGetLineFromAddrW64
// get symbol name (if requested)
if(sym_name)
{
sym_name[0] = '\0';
SYMBOL_INFO_PACKAGEW2 sp;
SYMBOL_INFOW* sym = &sp.si;
if(pSymFromAddrW(hProcess, addr, 0, sym))
{
wcscpy_s(sym_name, DEBUG_SYMBOL_CHARS, sym->Name);
successes++;
}
}
// get source file and/or line number (if requested)
if(file || line)
{
if (file)
file[0] = '\0';
if (line)
*line = 0;
IMAGEHLP_LINEW64 line_info = { sizeof(IMAGEHLP_LINEW64) };
DWORD displacement; // unused but required by pSymGetLineFromAddr64!
if(pSymGetLineFromAddrW64(hProcess, addr, &displacement, &line_info))
{
if(file)
{
// strip full path down to base name only.
// this loses information, but that isn't expected to be a
// problem and is balanced by not having to do this from every
// call site (full path is too long to display nicely).
const wchar_t* basename = path_name_only(line_info.FileName);
wcscpy_s(file, DEBUG_FILE_CHARS, basename);
successes++;
}
if(line)
{
*line = line_info.LineNumber;
successes++;
}
}
}
if(addr == 0 && GetLastError() == ERROR_MOD_NOT_FOUND)
SetLastError(0);
if(GetLastError() == ERROR_INVALID_ADDRESS)
SetLastError(0);
return (successes != 0)? INFO::OK : ERR::FAIL;
}
// file is the base name only, not path (see rationale in wdbg_sym).
// the PDB implementation is rather slow (~500us).
Status debug_ResolveSymbol(void* ptr_of_interest, wchar_t* sym_name, wchar_t* file, int* line)
{
WinScopedLock lock(WDBG_SYM_CS);
return ResolveSymbol_lk(ptr_of_interest, sym_name, file, line);
}
//----------------------------------------------------------------------------
// stack walk
//----------------------------------------------------------------------------
Status debug_CaptureContext(void* pcontext)
{
// there are 4 ways to do so, in order of preference:
// - RtlCaptureContext (only available on WinXP or above)
// - assembly language subroutine (complicates the build system)
// - intentionally raise an SEH exception and capture its context
// (causes annoying "first chance exception" messages and
// can't co-exist with WinScopedLock's destructor)
// - GetThreadContext while suspended (a bit tricky + slow).
// note: it used to be common practice to query the current thread
// context, but WinXP SP2 and above require it be suspended.
if(!pRtlCaptureContext)
return ERR::NOT_SUPPORTED; // NOWARN
CONTEXT* context = (CONTEXT*)pcontext;
cassert(sizeof(CONTEXT) <= DEBUG_CONTEXT_SIZE);
memset(context, 0, sizeof(CONTEXT));
context->ContextFlags = CONTEXT_FULL;
pRtlCaptureContext(context);
return INFO::OK;
}
static Status CallStackWalk(STACKFRAME64& sf, CONTEXT& context)
{
WinScopedLock lock(WDBG_SYM_CS);
SetLastError(0); // StackWalk64 doesn't always SetLastError
const HANDLE hThread = GetCurrentThread();
if(!pStackWalk64(machine, hProcess, hThread, &sf, &context, 0, pSymFunctionTableAccess64, pSymGetModuleBase64, 0))
return ERR::FAIL; // NOWARN (no stack frames left)
// (the frame pointer can be zero despite StackWalk64 returning TRUE.)
if(sf.AddrFrame.Offset == 0)
return ERR::FAIL; // NOWARN (no stack frames left)
// huge WTF in x64 debug builds (dbghelp 6.12.0002.633):
// AddrFrame.Offset doesn't match the correct RBP value.
// StackWalk64 updates the context [http://bit.ly/lo1aqZ] and
// its Rbp is correct, so we'll use that.
#if ARCH_AMD64
sf.AddrFrame.Offset = context.Rbp;
#endif
return INFO::OK;
}
// NB: CaptureStackBackTrace may be faster (http://msinilo.pl/blog/?p=40),
// but wasn't known during development.
Status wdbg_sym_WalkStack(StackFrameCallback cb, uintptr_t cbData, CONTEXT& context, const wchar_t* lastFuncToSkip)
{
sym_init();
STACKFRAME64 sf = PopulateStackFrame(context);
wchar_t func[DEBUG_SYMBOL_CHARS];
Status ret = ERR::SYM_NO_STACK_FRAMES_FOUND;
for(;;) // each stack frame:
{
if(CallStackWalk(sf, context) != INFO::OK)
return ret;
if(lastFuncToSkip)
{
void* const pc = (void*)(uintptr_t)sf.AddrPC.Offset;
if(debug_ResolveSymbol(pc, func, 0, 0) == INFO::OK)
{
if(wcsstr(func, lastFuncToSkip)) // this was the last one to skip
lastFuncToSkip = 0;
continue;
}
}
ret = cb(&sf, cbData);
RETURN_STATUS_FROM_CALLBACK(ret);
}
}
void* debug_GetCaller(void* pcontext, const wchar_t* lastFuncToSkip)
{
struct StoreAddress
{
static Status Func(const STACKFRAME64* sf, uintptr_t cbData)
{
const uintptr_t funcAddress = sf->AddrPC.Offset;
// store funcAddress in our `output parameter'
memcpy((void*)cbData, &funcAddress, sizeof(funcAddress));
return INFO::OK;
}
};
void* func;
wdbg_assert(pcontext != 0);
Status ret = wdbg_sym_WalkStack(&StoreAddress::Func, (uintptr_t)&func, *(CONTEXT*)pcontext, lastFuncToSkip);
return (ret == INFO::OK)? func : 0;
}
//-----------------------------------------------------------------------------
// helper routines for symbol value dump
//-----------------------------------------------------------------------------
// infinite recursion has never happened, but we check for it anyway.
static const size_t maxIndirection = 255;
static const size_t maxLevel = 255;
struct DumpState
{
size_t level;
size_t indirection;
uintptr_t moduleBase;
LPSTACKFRAME64 stackFrame;
DumpState(uintptr_t moduleBase, LPSTACKFRAME64 stackFrame)
: level(0), indirection(0), moduleBase(moduleBase), stackFrame(stackFrame)
{
}
};
//----------------------------------------------------------------------------
static size_t out_chars_left;
static wchar_t* out_pos;
// (only warn once until next out_init to avoid flood of messages.)
static bool out_have_warned_of_overflow;
// some top-level (*) symbols cause tons of output - so much that they may
// single-handedly overflow the buffer (e.g. pointer to a tree of huge UDTs).
// we can't have that, so there is a limit in place as to how much a
// single top-level symbol can output. after that is reached, dumping is
// aborted for that symbol but continues for the subsequent top-level symbols.
//
// this is implemented as follows: dump_sym_cb latches the current output
// position; each dump_sym (through which all symbols go) checks if the
// new position exceeds the limit and aborts if so.
// slight wrinkle: since we don't want each level of UDTs to successively
// realize the limit has been hit and display the error message, we
// return ERR::SYM_SINGLE_SYMBOL_LIMIT once and thereafter INFO::SYM_SUPPRESS_OUTPUT.
//
// * example: local variables, as opposed to child symbols in a UDT.
static wchar_t* out_latched_pos;
static bool out_have_warned_of_limit;
static void out_init(wchar_t* buf, size_t max_chars)
{
out_pos = buf;
out_chars_left = max_chars;
out_have_warned_of_overflow = false;
out_have_warned_of_limit = false;
}
static void out(const wchar_t* fmt, ...)
{
va_list args;
va_start(args, fmt);
// use vswprintf, not vswprintf_s, because we want to gracefully
// handle buffer overflows
int len = vswprintf(out_pos, out_chars_left, fmt, args);
va_end(args);
// success
if(len >= 0)
{
out_pos += len;
// make sure out_chars_left remains nonnegative
if((size_t)len > out_chars_left)
{
DEBUG_WARN_ERR(ERR::LOGIC); // apparently wrote more than out_chars_left
len = (int)out_chars_left;
}
out_chars_left -= len;
}
// no more room left
else
{
// the buffer really is full yet out_chars_left may not be 0
// (since it isn't updated if vswprintf returns -1).
// must be set so subsequent calls don't try to squeeze stuff in.
out_chars_left = 0;
// write a warning into the output buffer (once) so it isn't
// abruptly cut off (which looks like an error)
if(!out_have_warned_of_overflow)
{
out_have_warned_of_overflow = true;
// with the current out_pos / out_chars_left variables, there's
// no way of knowing where the buffer actually ends. no matter;
// we'll just put the warning before out_pos and eat into the
// second newest text.
const wchar_t text[] = L"(no more room in buffer)";
wcscpy_s(out_pos-ARRAY_SIZE(text), ARRAY_SIZE(text), text); // safe
}
}
}
static void out_erase(size_t num_chars)
{
// don't do anything if end of buffer was hit (prevents repeatedly
// scribbling over the last few bytes).
if(out_have_warned_of_overflow)
return;
out_chars_left += (ssize_t)num_chars;
out_pos -= num_chars;
*out_pos = '\0';
// make sure it's 0-terminated in case there is no further output.
}
// (see above)
static void out_latch_pos()
{
out_have_warned_of_limit = false;
out_latched_pos = out_pos;
}
// (see above)
static Status out_check_limit()
{
if(out_have_warned_of_limit)
return INFO::SYM_SUPPRESS_OUTPUT;
if(out_pos - out_latched_pos > 3000) // ~30 lines
{
out_have_warned_of_limit = true;
return ERR::SYM_SINGLE_SYMBOL_LIMIT; // NOWARN
}
// no limit hit, proceed normally
return INFO::OK;
}
//----------------------------------------------------------------------------
#define INDENT STMT(for(size_t i__ = 0; i__ <= state.level; i__++) out(L" ");)
#define UNINDENT STMT(out_erase((state.level+1)*4);)
// does it look like an ASCII string is located at <addr>?
// set <stride> to 2 to search for WCS-2 strings (of western characters!).
// called by dump_sequence for its string special-case.
//
// algorithm: scan the "string" and count # text chars vs. garbage.
static bool is_string(const u8* p, size_t stride)
{
// note: access violations are caught by dump_sym; output is "?".
int score = 0;
for(;;)
{
// current character is:
const int c = *p & 0xff; // prevent sign extension
p += stride;
// .. text
if(isalnum(c))
score += 5;
// .. end of string
else if(!c)
break;
// .. garbage
else if(!isprint(c))
score -= 4;
// got enough information either way => done.
// (we don't want to unnecessarily scan huge binary arrays)
if(abs(score) >= 10)
break;
}
return (score > 0);
}
// forward decl; called by dump_sequence and some of dump_sym_*.
static Status dump_sym(DWORD id, const u8* p, DumpState& state);
// from cvconst.h
//
// rationale: we don't provide a get_register routine, since only the
// value of FP is known to dump_frame_cb (via STACKFRAME64).
// displaying variables stored in registers is out of the question;
// all we can do is display FP-relative variables.
enum CV_HREG_e
{
CV_REG_EBP = 22,
CV_AMD64_RBP = 334
};
static void dump_error(Status err)
{
switch(err)
{
case 0:
// no error => no output
break;
case ERR::SYM_SINGLE_SYMBOL_LIMIT:
out(L"(too much output; skipping to next top-level symbol)");
break;
case ERR::SYM_UNRETRIEVABLE_STATIC:
out(L"(unavailable - located in another module)");
break;
case ERR::SYM_UNRETRIEVABLE:
out(L"(unavailable)");
break;
case ERR::SYM_TYPE_INFO_UNAVAILABLE:
out(L"(unavailable - type info request failed (GLE=%d))", GetLastError());
break;
case ERR::SYM_INTERNAL_ERROR:
out(L"(unavailable - internal error)\r\n");
break;
case INFO::SYM_SUPPRESS_OUTPUT:
// not an error; do not output anything. handled by caller.
break;
default:
out(L"(unavailable - unspecified error 0x%X (%d))", err, err);
break;
}
}
// moved out of dump_sequence.
static Status dump_string(const u8* p, size_t el_size)
{
// not char or wchar_t string
if(el_size != sizeof(char) && el_size != sizeof(wchar_t))
return INFO::CANNOT_HANDLE;
// not text
if(!is_string(p, el_size))
return INFO::CANNOT_HANDLE;
wchar_t buf[512];
if(el_size == sizeof(wchar_t))
{
wcsncpy(buf, (const wchar_t*)p, ARRAY_SIZE(buf)); // can't use wcscpy_s because p might be too long
wcscpy_s(buf+ARRAY_SIZE(buf)-4, 4, L"..."); // ensure null-termination
}
// convert to wchar_t
else
{
size_t i;
for(i = 0; i < ARRAY_SIZE(buf)-1; i++)
{
buf[i] = (wchar_t)p[i];
if(buf[i] == '\0')
break;
}
buf[i] = '\0';
}
out(L"\"%ls\"", buf);
return INFO::OK;
}
// moved out of dump_sequence.
static void seq_determine_formatting(size_t el_size, size_t el_count, bool* fits_on_one_line, size_t* num_elements_to_show)
{
if(el_size == sizeof(char))
{
*fits_on_one_line = el_count <= 16;
*num_elements_to_show = std::min((size_t)16u, el_count);
}
else if(el_size <= sizeof(int))
{
*fits_on_one_line = el_count <= 8;
*num_elements_to_show = std::min((size_t)12u, el_count);
}
else
{
*fits_on_one_line = false;
*num_elements_to_show = std::min((size_t)8u, el_count);
}
// make sure empty containers are displayed with [0] {}, otherwise
// the lack of output looks like an error.
if(!el_count)
*fits_on_one_line = true;
}
static Status dump_sequence(DebugStlIterator el_iterator, void* internal, size_t el_count, DWORD el_type_id, size_t el_size, DumpState& state)
{
const u8* el_p = 0; // avoid "uninitialized" warning
// special case: display as a string if the sequence looks to be text.
// do this only if container isn't empty because the otherwise the
// iterator may crash.
if(el_count)
{
el_p = el_iterator(internal, el_size);
Status ret = dump_string(el_p, el_size);
if(ret == INFO::OK)
return ret;
}
// choose formatting based on element size and count
bool fits_on_one_line;
size_t num_elements_to_show;
seq_determine_formatting(el_size, el_count, &fits_on_one_line, &num_elements_to_show);
out(L"[%d] ", el_count);
state.level++;
out(fits_on_one_line? L"{ " : L"\r\n");
for(size_t i = 0; i < num_elements_to_show; i++)
{
if(!fits_on_one_line)
INDENT;
Status err = dump_sym(el_type_id, el_p, state);
el_p = el_iterator(internal, el_size);
// there was no output for this child; undo its indentation (if any),
// skip everything below and proceed with the next child.
if(err == INFO::SYM_SUPPRESS_OUTPUT)
{
if(!fits_on_one_line)
UNINDENT;
continue;
}
dump_error(err); // nop if err == INFO::OK
// add separator unless this is the last element (can't just
// erase below due to additional "...").
if(i != num_elements_to_show-1)
out(fits_on_one_line? L", " : L"\r\n");
if(err == ERR::SYM_SINGLE_SYMBOL_LIMIT)
break;
} // for each child
// indicate some elements were skipped
if(el_count != num_elements_to_show)
out(L" ...");
state.level--;
if(fits_on_one_line)
out(L" }");
return INFO::OK;
}
static const u8* array_iterator(void* internal, size_t el_size)
{
const u8*& pos = *(const u8**)internal;
const u8* cur_pos = pos;
pos += el_size;
return cur_pos;
}
static Status dump_array(const u8* p, size_t el_count, DWORD el_type_id, size_t el_size, DumpState& state)
{
const u8* iterator_internal_pos = p;
return dump_sequence(array_iterator, &iterator_internal_pos,
el_count, el_type_id, el_size, state);
}
static Status CanHandleDataKind(DWORD dataKind)
{
switch(dataKind)
{
case DataIsMember:
// address is already correct (udt_dump_normal retrieved the offset;
// we do it that way so we can check it against the total
// UDT size for safety) and SymFromIndex would fail
return INFO::SKIPPED;
case DataIsUnknown:
WARN_RETURN(ERR::FAIL);
case DataIsStaticMember:
// this symbol is defined as static in another module =>
// there's nothing we can do.
return ERR::SYM_UNRETRIEVABLE_STATIC; // NOWARN
case DataIsLocal:
case DataIsStaticLocal:
case DataIsParam:
case DataIsObjectPtr:
case DataIsFileStatic:
case DataIsGlobal:
case DataIsConstant:
// ok, can handle
return INFO::OK;
}
WARN_RETURN(ERR::LOGIC); // UNREACHABLE
}
static bool IsRelativeToFramePointer(DWORD flags, DWORD reg)
{
if(flags & SYMFLAG_FRAMEREL) // note: this is apparently obsolete
return true;
if((flags & SYMFLAG_REGREL) == 0)
return false;
if(reg == CV_REG_EBP || reg == CV_AMD64_RBP)
return true;
return false;
}
static bool IsUnretrievable(DWORD flags)
{
// note: it is unlikely that the crashdump register context
// contains the correct values for this scope, so symbols
// stored in or relative to a general register are unavailable.
if(flags & SYMFLAG_REGISTER)
return true;
// note: IsRelativeToFramePointer is called first, so if we still
// see this flag, the base register is not the frame pointer.
// since we most probably don't know its value in the current
// scope (see above), the symbol is inaccessible.
if(flags & SYMFLAG_REGREL)
return true;
return false;
}
static Status DetermineSymbolAddress(DWORD id, const SYMBOL_INFOW* sym, const DumpState& state, const u8** pp)
{
DWORD dataKind;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, id, TI_GET_DATAKIND, &dataKind))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
Status ret = CanHandleDataKind(dataKind);
RETURN_STATUS_IF_ERR(ret);
if(ret == INFO::SKIPPED)
return INFO::OK; // pp is already correct
// note: we have not yet observed a non-zero TI_GET_ADDRESSOFFSET or
// TI_GET_ADDRESS, and TI_GET_OFFSET is apparently equal to sym->Address.
// get address
uintptr_t addr = (uintptr_t)sym->Address;
if(IsRelativeToFramePointer(sym->Flags, sym->Register))
addr += (uintptr_t)state.stackFrame->AddrFrame.Offset;
else if(IsUnretrievable(sym->Flags))
return ERR::SYM_UNRETRIEVABLE; // NOWARN
*pp = (const u8*)(uintptr_t)addr;
debug_printf("SYM| %s at %p flags=%X dk=%d sym->addr=%I64X fp=%I64x\n", utf8_from_wstring(sym->Name).c_str(), *pp, sym->Flags, dataKind, sym->Address, state.stackFrame->AddrFrame.Offset);
return INFO::OK;
}
//-----------------------------------------------------------------------------
// dump routines for each dbghelp symbol type
//-----------------------------------------------------------------------------
// these functions return != 0 if they're not able to produce any
// reasonable output at all; the caller (dump_sym_data, dump_sequence, etc.)
// will display the appropriate error message via dump_error.
// called by dump_sym; lock is held.
static Status dump_sym_array(DWORD type_id, const u8* p, DumpState& state)
{
ULONG64 size64 = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_LENGTH, &size64))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const size_t size = (size_t)size64;
// get element count and size
DWORD el_type_id = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_TYPEID, &el_type_id))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
// .. workaround: TI_GET_COUNT returns total struct size for
// arrays-of-struct. therefore, calculate as size / el_size.
ULONG64 el_size_;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, el_type_id, TI_GET_LENGTH, &el_size_))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const size_t el_size = (size_t)el_size_;
ENSURE(el_size != 0);
const size_t num_elements = size/el_size;
ENSURE(num_elements != 0);
return dump_array(p, num_elements, el_type_id, el_size, state);
}
//-----------------------------------------------------------------------------
// if the current value is a printable character, display in that form.
// this isn't only done in btChar because characters are sometimes stored
// in integers.
static void AppendCharacterIfPrintable(u64 data)
{
if(data < 0x100)
{
int c = (int)data;
if(isprint(c))
out(L" ('%hc')", c);
}
}
static Status dump_sym_base_type(DWORD type_id, const u8* p, DumpState& state)
{
DWORD base_type;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_BASETYPE, &base_type))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
ULONG64 size64 = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_LENGTH, &size64))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const size_t size = (size_t)size64;
// single out() call. note: we pass a single u64 for all sizes,
// which will only work on little-endian systems.
// must be declared before goto to avoid W4 warning.
const wchar_t* fmt = L"";
u64 data = movzx_le64(p, size);
// if value is 0xCC..CC (uninitialized mem), we display as hex.
// the output would otherwise be garbage; this makes it obvious.
// note: be very careful to correctly handle size=0 (e.g. void*).
for(size_t i = 0; i < size; i++)
{
if(p[i] != 0xCC)
break;
if(i == size-1)
{
out(L"(uninitialized)");
return INFO::OK;
}
}
switch(base_type)
{
// floating-point
case btFloat:
if(size == sizeof(float))
{
// NB: the C calling convention calls for float arguments to be
// converted to double. passing `data' wouldn't work because it's
// merely a zero-extended 32-bit representation of the float.
float value;
memcpy(&value, p, sizeof(value));
out(L"%f (0x%08I64X)", value, data);
}
else if(size == sizeof(double))
out(L"%g (0x%016I64X)", data, data);
else
DEBUG_WARN_ERR(ERR::LOGIC); // invalid float size
break;
// boolean
case btBool:
ENSURE(size == sizeof(bool));
if(data == 0 || data == 1)
out(L"%ls", data? L"true " : L"false");
else
out(L"(bool)0x%02I64X", data);
break;
// integers (displayed as decimal and hex)
// note: 0x00000000 can get annoying (0 would be nicer),
// but it indicates the variable size and makes for consistently
// formatted structs/arrays. (0x1234 0 0x5678 is ugly)
case btInt:
case btLong:
case btUInt:
case btULong:
if(size == 1)
{
// _TUCHAR
if(state.indirection)
{
state.indirection = 0;
return dump_array(p, 8, type_id, size, state);
}
fmt = L"%I64d (0x%02I64X)";
}
else if(size == 2)
fmt = L"%I64d (0x%04I64X)";
else if(size == 4)
fmt = L"%I64d (0x%08I64X)";
else if(size == 8)
fmt = L"%I64d (0x%016I64X)";
else
DEBUG_WARN_ERR(ERR::LOGIC); // invalid size for integers
out(fmt, data, data);
break;
// character
case btChar:
case btWChar:
ENSURE(size == sizeof(char) || size == sizeof(wchar_t));
// char*, wchar_t*
if(state.indirection)
{
state.indirection = 0;
return dump_array(p, 8, type_id, size, state);
}
out(L"%d", data);
AppendCharacterIfPrintable(data);
break;
// note: void* is sometimes indicated as (pointer, btNoType).
case btVoid:
case btNoType:
// void* - cannot display what it's pointing to (type unknown).
if(state.indirection)
{
out_erase(4); // " -> "
fmt = L"";
}
else
DEBUG_WARN_ERR(ERR::LOGIC); // non-pointer btVoid or btNoType
break;
default:
DEBUG_WARN_ERR(ERR::LOGIC); // unknown type
break;
// unsupported complex types
case btBCD:
case btCurrency:
case btDate:
case btVariant:
case btComplex:
case btBit:
case btBSTR:
case btHresult:
return ERR::SYM_UNSUPPORTED; // NOWARN
}
return INFO::OK;
}
//-----------------------------------------------------------------------------
static Status dump_sym_base_class(DWORD type_id, const u8* p, DumpState& state)
{
DWORD base_class_type_id;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_TYPEID, &base_class_type_id))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
// this is a virtual base class. we can't display those because it'd
// require reading the VTbl, which is difficult given lack of documentation
// and just not worth it.
DWORD vptr_ofs;
if(pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_VIRTUALBASEPOINTEROFFSET, &vptr_ofs))
return ERR::SYM_UNSUPPORTED; // NOWARN
return dump_sym(base_class_type_id, p, state);
}
//-----------------------------------------------------------------------------
static Status dump_sym_data(DWORD id, const u8* p, DumpState& state)
{
SYMBOL_INFO_PACKAGEW2 sp;
SYMBOL_INFOW* sym = &sp.si;
if(!pSymFromIndexW(hProcess, state.moduleBase, id, sym))
RETURN_STATUS_IF_ERR(ERR::SYM_TYPE_INFO_UNAVAILABLE);
out(L"%ls = ", sym->Name);
__try
{
RETURN_STATUS_IF_ERR(DetermineSymbolAddress(id, sym, state, &p));
// display value recursively
return dump_sym(sym->TypeIndex, p, state);
}
__except(EXCEPTION_EXECUTE_HANDLER)
{
return ERR::SYM_INTERNAL_ERROR; // NOWARN
}
}
//-----------------------------------------------------------------------------
static Status dump_sym_enum(DWORD type_id, const u8* p, DumpState& state)
{
ULONG64 size64 = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_LENGTH, &size64))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const size_t size = (size_t)size64;
const i64 enum_value = movsx_le64(p, size);
// get array of child symbols (enumerants).
DWORD numChildren;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_CHILDRENCOUNT, &numChildren))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
TI_FINDCHILDREN_PARAMS2 fcp(numChildren);
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_FINDCHILDREN, &fcp))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
numChildren = fcp.p.Count; // was truncated to maxChildren
const DWORD* children = fcp.p.ChildId;
// for each child (enumerant):
for(size_t i = 0; i < numChildren; i++)
{
DWORD child_data_id = children[i];
// get this enumerant's value. we can't make any assumptions about
// the variant's type or size - no restriction is documented.
// rationale: VariantChangeType is much less tedious than doing
// it manually and guarantees we cover everything. the OLE DLL is
// already pulled in by e.g. OpenGL anyway.
VARIANT v;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, child_data_id, TI_GET_VALUE, &v))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
if(VariantChangeType(&v, &v, 0, VT_I8) != S_OK)
continue;
// it's the one we want - output its name.
if(enum_value == v.llVal)
{
const wchar_t* name;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, child_data_id, TI_GET_SYMNAME, &name))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
out(L"%ls", name);
LocalFree((HLOCAL)name);
return INFO::OK;
}
}
// we weren't able to retrieve a matching enum value, but can still
// produce reasonable output (the numeric value).
// note: could goto here after a SGTI fails, but we fail instead
// to make sure those errors are noticed.
out(L"%I64d", enum_value);
return INFO::OK;
}
//-----------------------------------------------------------------------------
static Status dump_sym_function(DWORD UNUSED(type_id), const u8* UNUSED(p), DumpState& UNUSED(state))
{
return INFO::SYM_SUPPRESS_OUTPUT;
}
//-----------------------------------------------------------------------------
static Status dump_sym_function_type(DWORD UNUSED(type_id), const u8* p, DumpState& state)
{
// this symbol gives class parent, return type, and parameter count.
// unfortunately the one thing we care about, its name,
// isn't exposed via TI_GET_SYMNAME, so we resolve it ourselves.
wchar_t name[DEBUG_SYMBOL_CHARS];
Status err = ResolveSymbol_lk((void*)p, name, 0, 0);
if(state.indirection == 0)
out(L"0x%p ", p);
if(err == INFO::OK)
out(L"(%ls)", name);
return INFO::OK;
}
//-----------------------------------------------------------------------------
// do not follow pointers that we have already displayed. this reduces
// clutter a bit and prevents infinite recursion for cyclical references
// (e.g. via struct S { S* p; } s; s.p = &s;)
// note: allocating memory dynamically would cause trouble if dumping
// the stack from within memory-related code (the allocation hook would
// be reentered, which is not permissible).
static const size_t maxVisited = 1000;
static const u8* visited[maxVisited];
static size_t numVisited;
static void ptr_reset_visited()
{
numVisited = 0;
}
static bool ptr_already_visited(const u8* p)
{
for(size_t i = 0; i < numVisited; i++)
{
if(visited[i] == p)
return true;
}
if(numVisited < maxVisited)
{
visited[numVisited] = p;
numVisited++;
}
// capacity exceeded
else
{
// warn user - but only once (we can't use the regular
// debug_DisplayError and wdbg_assert doesn't have a
// suppress mechanism)
static bool haveComplained;
if(!haveComplained)
{
debug_printf("WARNING: ptr_already_visited: capacity exceeded, increase maxVisited\n");
debug_break();
haveComplained = true;
}
}
return false;
}
static Status dump_sym_pointer(DWORD type_id, const u8* p, DumpState& state)
{
ULONG64 size64 = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_LENGTH, &size64))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const size_t size = (size_t)size64;
// read+output pointer's value.
p = (const u8*)(uintptr_t)movzx_le64(p, size);
out(L"0x%p", p);
// bail if it's obvious the pointer is bogus
// (=> can't display what it's pointing to)
if(debug_IsPointerBogus(p))
return INFO::OK;
// avoid duplicates and circular references
if(ptr_already_visited(p))
{
out(L" (see above)");
return INFO::OK;
}
// display what the pointer is pointing to.
// if the pointer is invalid (despite "bogus" check above),
// dump_data_sym recovers via SEH and prints an error message.
// if the pointed-to value turns out to uninteresting (e.g. void*),
// the responsible dump_sym* will erase "->", leaving only address.
out(L" -> ");
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_TYPEID, &type_id))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
// prevent infinite recursion just to be safe (shouldn't happen)
if(state.indirection >= maxIndirection)
WARN_RETURN(ERR::SYM_NESTING_LIMIT);
state.indirection++;
return dump_sym(type_id, p, state);
}
//-----------------------------------------------------------------------------
static Status dump_sym_typedef(DWORD type_id, const u8* p, DumpState& state)
{
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_TYPEID, &type_id))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
return dump_sym(type_id, p, state);
}
//-----------------------------------------------------------------------------
// determine type and size of the given child in a UDT.
// useful for UDTs that contain typedefs describing their contents,
// e.g. value_type in STL containers.
static Status udt_get_child_type(const wchar_t* child_name, ULONG numChildren, const DWORD* children, const DumpState& state, DWORD* el_type_id, size_t* el_size)
{
const DWORD lastError = GetLastError();
*el_type_id = 0;
*el_size = 0;
for(ULONG i = 0; i < numChildren; i++)
{
const DWORD child_id = children[i];
SYMBOL_INFO_PACKAGEW2 sp;
SYMBOL_INFOW* sym = &sp.si;
if(!pSymFromIndexW(hProcess, state.moduleBase, child_id, sym))
{
// this happens for several UDTs; cause is unknown.
ENSURE(GetLastError() == ERROR_NOT_FOUND);
continue;
}
if(!wcscmp(sym->Name, child_name))
{
*el_type_id = sym->TypeIndex;
*el_size = (size_t)sym->Size;
return INFO::OK;
}
}
SetLastError(lastError);
// (happens if called for containers that are treated as STL but are not)
return ERR::SYM_CHILD_NOT_FOUND; // NOWARN
}
static Status udt_dump_std(const wchar_t* type_name, const u8* p, size_t size, DumpState& state, ULONG numChildren, const DWORD* children)
{
Status err;
// not a C++ standard library object; can't handle it.
if(wcsncmp(type_name, L"std::", 5) != 0)
return INFO::CANNOT_HANDLE;
// check for C++ objects that should be displayed via udt_dump_normal.
// C++03 containers are special-cased and the rest (apart from those here)
// are ignored, because for the most part they are spew.
if(!wcsncmp(type_name, L"std::pair", 9) ||
!wcsncmp(type_name, L"std::tr1::", 10))
return INFO::CANNOT_HANDLE;
// display contents of STL containers
// .. get element type
DWORD el_type_id;
size_t el_size;
err = udt_get_child_type(L"value_type", numChildren, children, state, &el_type_id, &el_size);
if(err != INFO::OK)
goto not_valid_container;
// .. get iterator and # elements
size_t el_count;
DebugStlIterator el_iterator;
u8 it_mem[DEBUG_STL_MAX_ITERATOR_SIZE];
err = debug_stl_get_container_info(type_name, p, size, el_size, &el_count, &el_iterator, it_mem);
if(err != INFO::OK)
goto not_valid_container;
return dump_sequence(el_iterator, it_mem, el_count, el_type_id, el_size, state);
not_valid_container:
// build and display detailed "error" message.
wchar_t buf[100];
const wchar_t* text;
// .. object named std::* but doesn't include a "value_type" child =>
// it's a non-STL C++ stdlib object. wasn't handled by the
// special case above, so we just display its simplified type name
// (the contents are usually spew).
if(err == ERR::SYM_CHILD_NOT_FOUND)
text = L"";
// .. not one of the containers we can analyse.
else if(err == ERR::STL_CNT_UNKNOWN)
text = L"unknown ";
else if(err == ERR::STL_CNT_UNSUPPORTED)
text = L"unsupported ";
// .. container of a known type but contents are invalid.
else if(err == ERR::STL_CNT_INVALID)
text = L"uninitialized/invalid ";
// .. some other error encountered
else
{
wchar_t description[200];
(void)StatusDescription(err, description, ARRAY_SIZE(description));
swprintf_s(buf, ARRAY_SIZE(buf), L"error \"%ls\" while analyzing ", description);
text = buf;
}
// (debug_stl modifies its input string in-place; type_name is
// a const string returned by dbghelp)
wchar_t type_name_buf[DEBUG_SYMBOL_CHARS];
wcscpy_s(type_name_buf, ARRAY_SIZE(type_name_buf), type_name);
out(L"(%ls%ls)", text, debug_stl_simplify_name(type_name_buf));
return INFO::OK;
}
static bool udt_should_suppress(const wchar_t* type_name)
{
// specialized HANDLEs are defined as pointers to structs by
// DECLARE_HANDLE. we only want the numerical value (pointer address),
// so prevent these structs from being displayed.
// note: no need to check for indirection; these are only found in
// HANDLEs (which are pointers).
// removed obsolete defs: HEVENT, HFILE, HUMPD
if(type_name[0] != 'H')
goto not_handle;
#define SUPPRESS_HANDLE(name) if(!wcscmp(type_name, L#name L"__")) return true;
SUPPRESS_HANDLE(HACCEL);
SUPPRESS_HANDLE(HBITMAP);
SUPPRESS_HANDLE(HBRUSH);
SUPPRESS_HANDLE(HCOLORSPACE);
SUPPRESS_HANDLE(HCURSOR);
SUPPRESS_HANDLE(HDC);
SUPPRESS_HANDLE(HENHMETAFILE);
SUPPRESS_HANDLE(HFONT);
SUPPRESS_HANDLE(HGDIOBJ);
SUPPRESS_HANDLE(HGLOBAL);
SUPPRESS_HANDLE(HGLRC);
SUPPRESS_HANDLE(HHOOK);
SUPPRESS_HANDLE(HICON);
SUPPRESS_HANDLE(HIMAGELIST);
SUPPRESS_HANDLE(HIMC);
SUPPRESS_HANDLE(HINSTANCE);
SUPPRESS_HANDLE(HKEY);
SUPPRESS_HANDLE(HKL);
SUPPRESS_HANDLE(HKLOCAL);
SUPPRESS_HANDLE(HMENU);
SUPPRESS_HANDLE(HMETAFILE);
SUPPRESS_HANDLE(HMODULE);
SUPPRESS_HANDLE(HMONITOR);
SUPPRESS_HANDLE(HPALETTE);
SUPPRESS_HANDLE(HPEN);
SUPPRESS_HANDLE(HRGN);
SUPPRESS_HANDLE(HRSRC);
SUPPRESS_HANDLE(HSTR);
SUPPRESS_HANDLE(HTASK);
SUPPRESS_HANDLE(HWINEVENTHOOK);
SUPPRESS_HANDLE(HWINSTA);
SUPPRESS_HANDLE(HWND);
not_handle:
return false;
}
static Status udt_dump_suppressed(const wchar_t* type_name, const u8* UNUSED(p), size_t UNUSED(size), DumpState state, ULONG UNUSED(numChildren), const DWORD* UNUSED(children))
{
if(!udt_should_suppress(type_name))
return INFO::CANNOT_HANDLE;
// the data symbol is pointer-to-UDT. since we won't display its
// contents, leave only the pointer's value.
if(state.indirection)
out_erase(4); // " -> "
// indicate something was deliberately left out
// (otherwise, lack of output may be taken for an error)
out(L" (..)");
return INFO::OK;
}
// (by now) non-trivial heuristic to determine if a UDT should be
// displayed on one line or several. split out of udt_dump_normal.
static bool udt_fits_on_one_line(const wchar_t* type_name, size_t child_count, size_t total_size)
{
// special case: always put CStr* on one line
// (std::*string are displayed directly, but these go through
// udt_dump_normal. we want to avoid the ensuing 3-line output)
if(!wcscmp(type_name, L"CStr") || !wcscmp(type_name, L"CStr8") || !wcscmp(type_name, L"CStrW"))
return true;
// try to get actual number of relevant children
// (typedefs etc. are never displayed, but are included in child_count.
// we have to balance that vs. tons of static members, which aren't
// reflected in total_size).
// .. prevent division by 0.
if(child_count == 0)
child_count = 1;
// special-case a few types that would otherwise be classified incorrectly
// (due to having more or less than expected relevant children)
if(!wcsncmp(type_name, L"std::pair", 9))
child_count = 2;
const size_t avg_size = total_size / child_count;
// (if 0, no worries - child_count will probably be large and
// we return false, which is a safe default)
// small UDT with a few (small) members: fits on one line.
if(child_count <= 3 && avg_size <= sizeof(int))
return true;
return false;
}
static Status udt_dump_normal(const wchar_t* type_name, const u8* p, size_t size, DumpState state, ULONG numChildren, const DWORD* children)
{
// special case: boost::unordered types are complex and may cause a stack overflow
// see http://trac.wildfiregames.com/ticket/1813
// TODO: at least give some info about them
if(!wcsncmp(type_name, L"boost::unordered", 16))
return INFO::CANNOT_HANDLE;
const bool fits_on_one_line = udt_fits_on_one_line(type_name, numChildren, size);
// prevent infinite recursion just to be safe (shouldn't happen)
if(state.level >= maxLevel)
WARN_RETURN(ERR::SYM_NESTING_LIMIT);
state.level++;
out(fits_on_one_line? L"{ " : L"\r\n");
bool displayed_anything = false;
for(ULONG i = 0; i < numChildren; i++)
{
const DWORD child_id = children[i];
// get offset. if not available, skip this child
// (we only display data here, not e.g. typedefs)
DWORD ofs = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, child_id, TI_GET_OFFSET, &ofs))
continue;
if(ofs >= size)
{
debug_printf("INVALID_UDT %s %d %d\n", utf8_from_wstring(type_name).c_str(), ofs, size);
}
//ENSURE(ofs < size);
if(!fits_on_one_line)
INDENT;
const u8* el_p = p+ofs;
Status err = dump_sym(child_id, el_p, state);
// there was no output for this child; undo its indentation (if any),
// skip everything below and proceed with the next child.
if(err == INFO::SYM_SUPPRESS_OUTPUT)
{
if(!fits_on_one_line)
UNINDENT;
continue;
}
displayed_anything = true;
dump_error(err); // nop if err == INFO::OK
out(fits_on_one_line? L", " : L"\r\n");
if(err == ERR::SYM_SINGLE_SYMBOL_LIMIT)
break;
} // for each child
state.level--;
if(!displayed_anything)
{
out_erase(2); // "{ " or "\r\n"
out(L"(%ls)", type_name);
return INFO::OK;
}
// remove trailing comma separator
// note: we can't avoid writing it by checking if i == numChildren-1:
// each child might be the last valid data member.
if(fits_on_one_line)
{
out_erase(2); // ", "
out(L" }");
}
return INFO::OK;
}
static Status dump_sym_udt(DWORD type_id, const u8* p, DumpState& state)
{
ULONG64 size64 = 0;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_LENGTH, &size64))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const size_t size = (size_t)size64;
// get array of child symbols (members/functions/base classes).
DWORD numChildren;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_CHILDRENCOUNT, &numChildren))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
TI_FINDCHILDREN_PARAMS2 fcp(numChildren);
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_FINDCHILDREN, &fcp))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
numChildren = fcp.p.Count; // was truncated to maxChildren
const DWORD* children = fcp.p.ChildId;
const wchar_t* type_name;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_SYMNAME, &type_name))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
Status ret;
// note: order is important (e.g. STL special-case must come before
// suppressing UDTs, which tosses out most other C++ stdlib classes)
ret = udt_dump_std (type_name, p, size, state, numChildren, children);
if(ret != INFO::CANNOT_HANDLE)
goto done;
ret = udt_dump_suppressed(type_name, p, size, state, numChildren, children);
if(ret != INFO::CANNOT_HANDLE)
goto done;
ret = udt_dump_normal (type_name, p, size, state, numChildren, children);
if(ret != INFO::CANNOT_HANDLE)
goto done;
done:
LocalFree((HLOCAL)type_name);
return ret;
}
//-----------------------------------------------------------------------------
static Status dump_sym_vtable(DWORD UNUSED(type_id), const u8* UNUSED(p), DumpState& UNUSED(state))
{
// unsupported (vtable internals are undocumented; too much work).
return INFO::SYM_SUPPRESS_OUTPUT;
}
//-----------------------------------------------------------------------------
static Status dump_sym_unknown(DWORD type_id, const u8* UNUSED(p), DumpState& state)
{
// redundant (already done in dump_sym), but this is rare.
DWORD type_tag;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_SYMTAG, &type_tag))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
debug_printf("SYM: unknown tag: %d\n", type_tag);
out(L"(unknown symbol type)");
return INFO::OK;
}
//-----------------------------------------------------------------------------
typedef Status (*DumpFunc)(DWORD typeId, const u8* p, DumpState& state);
static DumpFunc DumpFuncFromTypeTag(DWORD typeTag)
{
switch(typeTag)
{
case SymTagArrayType:
return dump_sym_array;
case SymTagBaseType:
return dump_sym_base_type;
case SymTagBaseClass:
return dump_sym_base_class;
case SymTagData:
return dump_sym_data;
case SymTagEnum:
return dump_sym_enum;
case SymTagFunction:
return dump_sym_function;
case SymTagFunctionType:
return dump_sym_function_type;
case SymTagPointerType:
return dump_sym_pointer;
case SymTagTypedef:
return dump_sym_typedef;
case SymTagUDT:
return dump_sym_udt;
case SymTagVTable:
return dump_sym_vtable;
default:
return dump_sym_unknown;
}
}
// write name and value of the symbol <type_id> to the output buffer.
// delegates to dump_sym_* depending on the symbol's tag.
static Status dump_sym(DWORD type_id, const u8* p, DumpState& state)
{
RETURN_STATUS_IF_ERR(out_check_limit());
DWORD typeTag;
if(!pSymGetTypeInfo(hProcess, state.moduleBase, type_id, TI_GET_SYMTAG, &typeTag))
WARN_RETURN(ERR::SYM_TYPE_INFO_UNAVAILABLE);
const DumpFunc dumpFunc = DumpFuncFromTypeTag(typeTag);
return dumpFunc(type_id, p, state);
}
//-----------------------------------------------------------------------------
// stack trace
//-----------------------------------------------------------------------------
static bool ShouldSkipSymbol(const wchar_t* name)
{
if(!wcscmp(name, L"suppress__"))
return true;
if(!wcscmp(name, L"__profile"))
return true;
return false;
}
// output the symbol's name and value via dump_sym*.
// called from dump_frame_cb for each local symbol; lock is held.
static BOOL CALLBACK dump_sym_cb(SYMBOL_INFOW* sym, ULONG UNUSED(size), PVOID userContext)
{
if(ShouldSkipSymbol(sym->Name))
return TRUE; // continue
out_latch_pos(); // see decl
const u8* p = (const u8*)(uintptr_t)sym->Address;
DumpState state((uintptr_t)sym->ModBase, (LPSTACKFRAME64)userContext);
INDENT;
Status err = dump_sym(sym->Index, p, state);
dump_error(err);
if(err == INFO::SYM_SUPPRESS_OUTPUT)
UNINDENT;
else
out(L"\r\n");
return TRUE; // continue
}
// called by wdbg_sym_WalkStack for each stack frame
static Status dump_frame_cb(const STACKFRAME64* sf, uintptr_t UNUSED(userContext))
{
void* func = (void*)(uintptr_t)sf->AddrPC.Offset;
wchar_t func_name[DEBUG_SYMBOL_CHARS]; wchar_t file[DEBUG_FILE_CHARS]; int line;
Status ret = ResolveSymbol_lk(func, func_name, file, &line);
if(ret == INFO::OK)
{
// don't trace back further than the app's entry point
// (no one wants to see this frame). checking for the
// function name isn't future-proof, but not stopping is no big deal.
// an alternative would be to check if module=kernel32, but
// that would cut off callbacks as well.
// note: the stdcall mangled name includes parameter size, which is
// different in 64-bit, so only check the first characters.
if(!wcsncmp(func_name, L"_BaseProcessStart", 17) ||
!wcscmp(func_name, L"BaseThreadInitThunk"))
return INFO::OK;
// skip any mainCRTStartup frames
if(!wcscmp(func_name, L"__tmainCRTStartup"))
return INFO::OK;
if(!wcscmp(func_name, L"mainCRTStartup"))
return INFO::OK;
out(L"%ls (%ls:%d)\r\n", func_name, file, line);
}
else
out(L"%p\r\n", func);
WinScopedPreserveLastError s; // SymSetContext
// only enumerate symbols for this stack frame
// (i.e. its locals and parameters)
// problem: debug info is scope-aware, so we won't see any variables
// declared in sub-blocks. we'd have to pass an address in that block,
// which isn't worth the trouble.
IMAGEHLP_STACK_FRAME isf = PopulateImageStackFrame(*sf);
const PIMAGEHLP_CONTEXT ic = 0; // ignored
// NB: this sometimes fails for reasons unknown in a static
// member function, possibly because the return address is in kernel32
(void)pSymSetContext(hProcess, &isf, ic);
const ULONG64 base = 0; const wchar_t* const mask = 0; // use scope set by pSymSetContext
pSymEnumSymbolsW(hProcess, base, mask, dump_sym_cb, (PVOID)sf);
if(GetLastError() == ERROR_NOT_SUPPORTED) // no debug info present?
SetLastError(0);
out(L"\r\n");
return INFO::OK;
}
Status debug_DumpStack(wchar_t* buf, size_t maxChars, void* pcontext, const wchar_t* lastFuncToSkip)
{
static intptr_t busy;
if(!cpu_CAS(&busy, 0, 1))
return ERR::REENTERED; // NOWARN
out_init(buf, maxChars);
ptr_reset_visited();
wdbg_assert(pcontext != 0);
Status ret = wdbg_sym_WalkStack(dump_frame_cb, 0, *(CONTEXT*)pcontext, lastFuncToSkip);
COMPILER_FENCE;
busy = 0;
return ret;
}
//-----------------------------------------------------------------------------
// write out a "minidump" containing register and stack state; this enables
// examining the crash in a debugger. called by wdbg_exception_filter.
// heavily modified from http://www.codeproject.com/debug/XCrashReportPt3.asp
// lock must be held.
void wdbg_sym_WriteMinidump(EXCEPTION_POINTERS* exception_pointers)
{
sym_init();
WinScopedLock lock(WDBG_SYM_CS);
OsPath path = ah_get_log_dir()/"crashlog.dmp";
HANDLE hFile = CreateFileW(OsString(path).c_str(), GENERIC_WRITE, FILE_SHARE_WRITE, 0, CREATE_ALWAYS, 0, 0);
if(hFile == INVALID_HANDLE_VALUE)
{
DEBUG_DISPLAY_ERROR(L"wdbg_sym_WriteMinidump: unable to create crashlog.dmp.");
return;
}
MINIDUMP_EXCEPTION_INFORMATION mei;
mei.ThreadId = GetCurrentThreadId();
mei.ExceptionPointers = exception_pointers;
mei.ClientPointers = FALSE;
// exception_pointers is not in our address space.
// note: we don't store other crashlog info within the dump file
// (UserStreamParam), since we will need to generate a plain text file on
// non-Windows platforms. users will just have to send us both files.
DWORD pid = GetCurrentProcessId();
if(!pMiniDumpWriteDump || !pMiniDumpWriteDump(GetCurrentProcess(), pid, hFile, MiniDumpNormal, &mei, 0, 0))
DEBUG_DISPLAY_ERROR(L"wdbg_sym_WriteMinidump: unable to generate minidump.");
CloseHandle(hFile);
}
|