wait_tree.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466
  1. // Copyright 2016 Citra Emulator Project
  2. // Licensed under GPLv2 or any later version
  3. // Refer to the license.txt file included.
  4. #include <fmt/format.h>
  5. #include "yuzu/debugger/wait_tree.h"
  6. #include "yuzu/util/util.h"
  7. #include "common/assert.h"
  8. #include "core/arm/arm_interface.h"
  9. #include "core/core.h"
  10. #include "core/hle/kernel/handle_table.h"
  11. #include "core/hle/kernel/mutex.h"
  12. #include "core/hle/kernel/process.h"
  13. #include "core/hle/kernel/readable_event.h"
  14. #include "core/hle/kernel/scheduler.h"
  15. #include "core/hle/kernel/synchronization_object.h"
  16. #include "core/hle/kernel/thread.h"
  17. #include "core/memory.h"
  18. WaitTreeItem::WaitTreeItem() = default;
  19. WaitTreeItem::~WaitTreeItem() = default;
  20. QColor WaitTreeItem::GetColor() const {
  21. return QColor(Qt::GlobalColor::black);
  22. }
  23. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeItem::GetChildren() const {
  24. return {};
  25. }
  26. void WaitTreeItem::Expand() {
  27. if (IsExpandable() && !expanded) {
  28. children = GetChildren();
  29. for (std::size_t i = 0; i < children.size(); ++i) {
  30. children[i]->parent = this;
  31. children[i]->row = i;
  32. }
  33. expanded = true;
  34. }
  35. }
  36. WaitTreeItem* WaitTreeItem::Parent() const {
  37. return parent;
  38. }
  39. const std::vector<std::unique_ptr<WaitTreeItem>>& WaitTreeItem::Children() const {
  40. return children;
  41. }
  42. bool WaitTreeItem::IsExpandable() const {
  43. return false;
  44. }
  45. std::size_t WaitTreeItem::Row() const {
  46. return row;
  47. }
  48. std::vector<std::unique_ptr<WaitTreeThread>> WaitTreeItem::MakeThreadItemList() {
  49. std::vector<std::unique_ptr<WaitTreeThread>> item_list;
  50. std::size_t row = 0;
  51. auto add_threads = [&](const std::vector<std::shared_ptr<Kernel::Thread>>& threads) {
  52. for (std::size_t i = 0; i < threads.size(); ++i) {
  53. if (!threads[i]->IsHLEThread()) {
  54. item_list.push_back(std::make_unique<WaitTreeThread>(*threads[i]));
  55. item_list.back()->row = row;
  56. }
  57. ++row;
  58. }
  59. };
  60. const auto& system = Core::System::GetInstance();
  61. add_threads(system.GlobalScheduler().GetThreadList());
  62. return item_list;
  63. }
  64. WaitTreeText::WaitTreeText(QString t) : text(std::move(t)) {}
  65. WaitTreeText::~WaitTreeText() = default;
  66. QString WaitTreeText::GetText() const {
  67. return text;
  68. }
  69. WaitTreeMutexInfo::WaitTreeMutexInfo(VAddr mutex_address, const Kernel::HandleTable& handle_table)
  70. : mutex_address(mutex_address) {
  71. mutex_value = Core::System::GetInstance().Memory().Read32(mutex_address);
  72. owner_handle = static_cast<Kernel::Handle>(mutex_value & Kernel::Mutex::MutexOwnerMask);
  73. owner = handle_table.Get<Kernel::Thread>(owner_handle);
  74. }
  75. WaitTreeMutexInfo::~WaitTreeMutexInfo() = default;
  76. QString WaitTreeMutexInfo::GetText() const {
  77. return tr("waiting for mutex 0x%1").arg(mutex_address, 16, 16, QLatin1Char{'0'});
  78. }
  79. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeMutexInfo::GetChildren() const {
  80. const bool has_waiters = (mutex_value & Kernel::Mutex::MutexHasWaitersFlag) != 0;
  81. std::vector<std::unique_ptr<WaitTreeItem>> list;
  82. list.push_back(std::make_unique<WaitTreeText>(tr("has waiters: %1").arg(has_waiters)));
  83. list.push_back(std::make_unique<WaitTreeText>(
  84. tr("owner handle: 0x%1").arg(owner_handle, 8, 16, QLatin1Char{'0'})));
  85. if (owner != nullptr) {
  86. list.push_back(std::make_unique<WaitTreeThread>(*owner));
  87. }
  88. return list;
  89. }
  90. WaitTreeCallstack::WaitTreeCallstack(const Kernel::Thread& thread) : thread(thread) {}
  91. WaitTreeCallstack::~WaitTreeCallstack() = default;
  92. QString WaitTreeCallstack::GetText() const {
  93. return tr("Call stack");
  94. }
  95. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeCallstack::GetChildren() const {
  96. std::vector<std::unique_ptr<WaitTreeItem>> list;
  97. if (thread.IsHLEThread()) {
  98. return list;
  99. }
  100. if (thread.GetOwnerProcess() == nullptr || !thread.GetOwnerProcess()->Is64BitProcess()) {
  101. return list;
  102. }
  103. auto backtrace = Core::ARM_Interface::GetBacktraceFromContext(Core::System::GetInstance(), thread.GetContext64());
  104. for (auto& entry : backtrace) {
  105. std::string s = fmt::format("{:20}{:016X} {:016X} {:016X} {}", entry.module, entry.address,
  106. entry.original_address, entry.offset, entry.name);
  107. list.push_back(std::make_unique<WaitTreeText>(QString::fromStdString(s)));
  108. }
  109. return list;
  110. }
  111. WaitTreeSynchronizationObject::WaitTreeSynchronizationObject(const Kernel::SynchronizationObject& o)
  112. : object(o) {}
  113. WaitTreeSynchronizationObject::~WaitTreeSynchronizationObject() = default;
  114. WaitTreeExpandableItem::WaitTreeExpandableItem() = default;
  115. WaitTreeExpandableItem::~WaitTreeExpandableItem() = default;
  116. bool WaitTreeExpandableItem::IsExpandable() const {
  117. return true;
  118. }
  119. QString WaitTreeSynchronizationObject::GetText() const {
  120. return tr("[%1]%2 %3")
  121. .arg(object.GetObjectId())
  122. .arg(QString::fromStdString(object.GetTypeName()),
  123. QString::fromStdString(object.GetName()));
  124. }
  125. std::unique_ptr<WaitTreeSynchronizationObject> WaitTreeSynchronizationObject::make(
  126. const Kernel::SynchronizationObject& object) {
  127. switch (object.GetHandleType()) {
  128. case Kernel::HandleType::ReadableEvent:
  129. return std::make_unique<WaitTreeEvent>(static_cast<const Kernel::ReadableEvent&>(object));
  130. case Kernel::HandleType::Thread:
  131. return std::make_unique<WaitTreeThread>(static_cast<const Kernel::Thread&>(object));
  132. default:
  133. return std::make_unique<WaitTreeSynchronizationObject>(object);
  134. }
  135. }
  136. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeSynchronizationObject::GetChildren() const {
  137. std::vector<std::unique_ptr<WaitTreeItem>> list;
  138. const auto& threads = object.GetWaitingThreads();
  139. if (threads.empty()) {
  140. list.push_back(std::make_unique<WaitTreeText>(tr("waited by no thread")));
  141. } else {
  142. list.push_back(std::make_unique<WaitTreeThreadList>(threads));
  143. }
  144. return list;
  145. }
  146. WaitTreeObjectList::WaitTreeObjectList(
  147. const std::vector<std::shared_ptr<Kernel::SynchronizationObject>>& list, bool w_all)
  148. : object_list(list), wait_all(w_all) {}
  149. WaitTreeObjectList::~WaitTreeObjectList() = default;
  150. QString WaitTreeObjectList::GetText() const {
  151. if (wait_all)
  152. return tr("waiting for all objects");
  153. return tr("waiting for one of the following objects");
  154. }
  155. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeObjectList::GetChildren() const {
  156. std::vector<std::unique_ptr<WaitTreeItem>> list(object_list.size());
  157. std::transform(object_list.begin(), object_list.end(), list.begin(),
  158. [](const auto& t) { return WaitTreeSynchronizationObject::make(*t); });
  159. return list;
  160. }
  161. WaitTreeThread::WaitTreeThread(const Kernel::Thread& thread)
  162. : WaitTreeSynchronizationObject(thread) {}
  163. WaitTreeThread::~WaitTreeThread() = default;
  164. QString WaitTreeThread::GetText() const {
  165. const auto& thread = static_cast<const Kernel::Thread&>(object);
  166. QString status;
  167. switch (thread.GetStatus()) {
  168. case Kernel::ThreadStatus::Running:
  169. status = tr("running");
  170. break;
  171. case Kernel::ThreadStatus::Ready:
  172. if (!thread.IsPaused()) {
  173. if (thread.WasRunning()) {
  174. status = tr("running");
  175. } else {
  176. status = tr("ready");
  177. }
  178. } else {
  179. status = tr("paused");
  180. }
  181. break;
  182. case Kernel::ThreadStatus::Paused:
  183. status = tr("paused");
  184. break;
  185. case Kernel::ThreadStatus::WaitHLEEvent:
  186. status = tr("waiting for HLE return");
  187. break;
  188. case Kernel::ThreadStatus::WaitSleep:
  189. status = tr("sleeping");
  190. break;
  191. case Kernel::ThreadStatus::WaitIPC:
  192. status = tr("waiting for IPC reply");
  193. break;
  194. case Kernel::ThreadStatus::WaitSynch:
  195. status = tr("waiting for objects");
  196. break;
  197. case Kernel::ThreadStatus::WaitMutex:
  198. status = tr("waiting for mutex");
  199. break;
  200. case Kernel::ThreadStatus::WaitCondVar:
  201. status = tr("waiting for condition variable");
  202. break;
  203. case Kernel::ThreadStatus::WaitArb:
  204. status = tr("waiting for address arbiter");
  205. break;
  206. case Kernel::ThreadStatus::Dormant:
  207. status = tr("dormant");
  208. break;
  209. case Kernel::ThreadStatus::Dead:
  210. status = tr("dead");
  211. break;
  212. }
  213. const auto& context = thread.GetContext64();
  214. const QString pc_info = tr(" PC = 0x%1 LR = 0x%2")
  215. .arg(context.pc, 8, 16, QLatin1Char{'0'})
  216. .arg(context.cpu_registers[30], 8, 16, QLatin1Char{'0'});
  217. return QStringLiteral("%1%2 (%3) ")
  218. .arg(WaitTreeSynchronizationObject::GetText(), pc_info, status);
  219. }
  220. QColor WaitTreeThread::GetColor() const {
  221. const auto& thread = static_cast<const Kernel::Thread&>(object);
  222. switch (thread.GetStatus()) {
  223. case Kernel::ThreadStatus::Running:
  224. return QColor(Qt::GlobalColor::darkGreen);
  225. case Kernel::ThreadStatus::Ready:
  226. if (!thread.IsPaused()) {
  227. if (thread.WasRunning()) {
  228. return QColor(Qt::GlobalColor::darkGreen);
  229. } else {
  230. return QColor(Qt::GlobalColor::darkBlue);
  231. }
  232. } else {
  233. return QColor(Qt::GlobalColor::lightGray);
  234. }
  235. case Kernel::ThreadStatus::Paused:
  236. return QColor(Qt::GlobalColor::lightGray);
  237. case Kernel::ThreadStatus::WaitHLEEvent:
  238. case Kernel::ThreadStatus::WaitIPC:
  239. return QColor(Qt::GlobalColor::darkRed);
  240. case Kernel::ThreadStatus::WaitSleep:
  241. return QColor(Qt::GlobalColor::darkYellow);
  242. case Kernel::ThreadStatus::WaitSynch:
  243. case Kernel::ThreadStatus::WaitMutex:
  244. case Kernel::ThreadStatus::WaitCondVar:
  245. case Kernel::ThreadStatus::WaitArb:
  246. return QColor(Qt::GlobalColor::red);
  247. case Kernel::ThreadStatus::Dormant:
  248. return QColor(Qt::GlobalColor::darkCyan);
  249. case Kernel::ThreadStatus::Dead:
  250. return QColor(Qt::GlobalColor::gray);
  251. default:
  252. return WaitTreeItem::GetColor();
  253. }
  254. }
  255. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeThread::GetChildren() const {
  256. std::vector<std::unique_ptr<WaitTreeItem>> list(WaitTreeSynchronizationObject::GetChildren());
  257. const auto& thread = static_cast<const Kernel::Thread&>(object);
  258. QString processor;
  259. switch (thread.GetProcessorID()) {
  260. case Kernel::ThreadProcessorId::THREADPROCESSORID_IDEAL:
  261. processor = tr("ideal");
  262. break;
  263. case Kernel::ThreadProcessorId::THREADPROCESSORID_0:
  264. case Kernel::ThreadProcessorId::THREADPROCESSORID_1:
  265. case Kernel::ThreadProcessorId::THREADPROCESSORID_2:
  266. case Kernel::ThreadProcessorId::THREADPROCESSORID_3:
  267. processor = tr("core %1").arg(thread.GetProcessorID());
  268. break;
  269. default:
  270. processor = tr("Unknown processor %1").arg(thread.GetProcessorID());
  271. break;
  272. }
  273. list.push_back(std::make_unique<WaitTreeText>(tr("processor = %1").arg(processor)));
  274. list.push_back(
  275. std::make_unique<WaitTreeText>(tr("ideal core = %1").arg(thread.GetIdealCore())));
  276. list.push_back(
  277. std::make_unique<WaitTreeText>(tr("affinity mask = %1").arg(thread.GetAffinityMask())));
  278. list.push_back(std::make_unique<WaitTreeText>(tr("thread id = %1").arg(thread.GetThreadID())));
  279. list.push_back(std::make_unique<WaitTreeText>(tr("priority = %1(current) / %2(normal)")
  280. .arg(thread.GetPriority())
  281. .arg(thread.GetNominalPriority())));
  282. list.push_back(std::make_unique<WaitTreeText>(
  283. tr("last running ticks = %1").arg(thread.GetLastRunningTicks())));
  284. const VAddr mutex_wait_address = thread.GetMutexWaitAddress();
  285. if (mutex_wait_address != 0) {
  286. const auto& handle_table = thread.GetOwnerProcess()->GetHandleTable();
  287. list.push_back(std::make_unique<WaitTreeMutexInfo>(mutex_wait_address, handle_table));
  288. } else {
  289. list.push_back(std::make_unique<WaitTreeText>(tr("not waiting for mutex")));
  290. }
  291. if (thread.GetStatus() == Kernel::ThreadStatus::WaitSynch) {
  292. list.push_back(std::make_unique<WaitTreeObjectList>(thread.GetSynchronizationObjects(),
  293. thread.IsSleepingOnWait()));
  294. }
  295. list.push_back(std::make_unique<WaitTreeCallstack>(thread));
  296. return list;
  297. }
  298. WaitTreeEvent::WaitTreeEvent(const Kernel::ReadableEvent& object)
  299. : WaitTreeSynchronizationObject(object) {}
  300. WaitTreeEvent::~WaitTreeEvent() = default;
  301. WaitTreeThreadList::WaitTreeThreadList(const std::vector<std::shared_ptr<Kernel::Thread>>& list)
  302. : thread_list(list) {}
  303. WaitTreeThreadList::~WaitTreeThreadList() = default;
  304. QString WaitTreeThreadList::GetText() const {
  305. return tr("waited by thread");
  306. }
  307. std::vector<std::unique_ptr<WaitTreeItem>> WaitTreeThreadList::GetChildren() const {
  308. std::vector<std::unique_ptr<WaitTreeItem>> list(thread_list.size());
  309. std::transform(thread_list.begin(), thread_list.end(), list.begin(),
  310. [](const auto& t) { return std::make_unique<WaitTreeThread>(*t); });
  311. return list;
  312. }
  313. WaitTreeModel::WaitTreeModel(QObject* parent) : QAbstractItemModel(parent) {}
  314. WaitTreeModel::~WaitTreeModel() = default;
  315. QModelIndex WaitTreeModel::index(int row, int column, const QModelIndex& parent) const {
  316. if (!hasIndex(row, column, parent))
  317. return {};
  318. if (parent.isValid()) {
  319. WaitTreeItem* parent_item = static_cast<WaitTreeItem*>(parent.internalPointer());
  320. parent_item->Expand();
  321. return createIndex(row, column, parent_item->Children()[row].get());
  322. }
  323. return createIndex(row, column, thread_items[row].get());
  324. }
  325. QModelIndex WaitTreeModel::parent(const QModelIndex& index) const {
  326. if (!index.isValid())
  327. return {};
  328. WaitTreeItem* parent_item = static_cast<WaitTreeItem*>(index.internalPointer())->Parent();
  329. if (!parent_item) {
  330. return QModelIndex();
  331. }
  332. return createIndex(static_cast<int>(parent_item->Row()), 0, parent_item);
  333. }
  334. int WaitTreeModel::rowCount(const QModelIndex& parent) const {
  335. if (!parent.isValid())
  336. return static_cast<int>(thread_items.size());
  337. WaitTreeItem* parent_item = static_cast<WaitTreeItem*>(parent.internalPointer());
  338. parent_item->Expand();
  339. return static_cast<int>(parent_item->Children().size());
  340. }
  341. int WaitTreeModel::columnCount(const QModelIndex&) const {
  342. return 1;
  343. }
  344. QVariant WaitTreeModel::data(const QModelIndex& index, int role) const {
  345. if (!index.isValid())
  346. return {};
  347. switch (role) {
  348. case Qt::DisplayRole:
  349. return static_cast<WaitTreeItem*>(index.internalPointer())->GetText();
  350. case Qt::ForegroundRole:
  351. return static_cast<WaitTreeItem*>(index.internalPointer())->GetColor();
  352. default:
  353. return {};
  354. }
  355. }
  356. void WaitTreeModel::ClearItems() {
  357. thread_items.clear();
  358. }
  359. void WaitTreeModel::InitItems() {
  360. thread_items = WaitTreeItem::MakeThreadItemList();
  361. }
  362. WaitTreeWidget::WaitTreeWidget(QWidget* parent) : QDockWidget(tr("Wait Tree"), parent) {
  363. setObjectName(QStringLiteral("WaitTreeWidget"));
  364. view = new QTreeView(this);
  365. view->setHeaderHidden(true);
  366. setWidget(view);
  367. setEnabled(false);
  368. }
  369. WaitTreeWidget::~WaitTreeWidget() = default;
  370. void WaitTreeWidget::OnDebugModeEntered() {
  371. if (!Core::System::GetInstance().IsPoweredOn())
  372. return;
  373. model->InitItems();
  374. view->setModel(model);
  375. setEnabled(true);
  376. }
  377. void WaitTreeWidget::OnDebugModeLeft() {
  378. setEnabled(false);
  379. view->setModel(nullptr);
  380. model->ClearItems();
  381. }
  382. void WaitTreeWidget::OnEmulationStarting(EmuThread* emu_thread) {
  383. model = new WaitTreeModel(this);
  384. view->setModel(model);
  385. setEnabled(false);
  386. }
  387. void WaitTreeWidget::OnEmulationStopping() {
  388. view->setModel(nullptr);
  389. delete model;
  390. setEnabled(false);
  391. }