mirror of
https://github.com/beefytech/Beef.git
synced 2025-06-08 03:28:20 +02:00
Initial checkin
This commit is contained in:
Brian Fiete
parent
c74712dad9
commit
078564ac9e
3242 changed files with 1616395 additions and 0 deletions
350
IDEHelper/HotScanner.cpp
Normal file
350
IDEHelper/HotScanner.cpp
Normal file
|
|
@ -0,0 +1,350 @@
|
|||
#include "HotScanner.h"
|
||||
#include "WinDebugger.h"
|
||||
|
||||
#include "BeefySysLib/util/AllocDebug.h"
|
||||
|
||||
USING_NS_BF_DBG;
|
||||
|
||||
DbgHotScanner::DbgHotScanner(WinDebugger* debugger)
|
||||
{
|
||||
mDebugger = debugger;
|
||||
}
|
||||
|
||||
NS_BF_DBG_BEGIN
|
||||
namespace TCFake
|
||||
{
|
||||
struct Span
|
||||
{
|
||||
addr_target start; // Starting page number
|
||||
addr_target length; // Number of pages in span
|
||||
addr_target next; // Used when in link list
|
||||
addr_target prev; // Used when in link list
|
||||
addr_target objects; // Linked list of free objects
|
||||
addr_target freeingObjects; // BCF- waiting to be freed
|
||||
addr_target freeingObjectsTail; // Note: *((intptr_t*)freeingObjectsTail) is freeingCount
|
||||
unsigned int refcount : 16; // Number of non-free objects
|
||||
unsigned int sizeclass : 8; // Size-class for small objects (or 0)
|
||||
unsigned int location : 2; // Is the span on a freelist, and if so, which?
|
||||
unsigned int decommitDelay : 3;
|
||||
unsigned int sample : 1; // Sampled object?
|
||||
|
||||
#undef SPAN_HISTORY
|
||||
#ifdef SPAN_HISTORY
|
||||
// For debugging, we can keep a log events per span
|
||||
int nexthistory;
|
||||
char history[64];
|
||||
int value[64];
|
||||
#endif
|
||||
|
||||
// What freelist the span is on: IN_USE if on none, or normal or returned
|
||||
enum { IN_USE, ON_NORMAL_FREELIST, ON_RETURNED_FREELIST };
|
||||
};
|
||||
}
|
||||
|
||||
struct Fake_BfObject_WithFlags
|
||||
{
|
||||
union
|
||||
{
|
||||
addr_target mClassVData;
|
||||
struct
|
||||
{
|
||||
BfObjectFlags mObjectFlags;
|
||||
uint8 mClassVDataBytes[sizeof(addr_target) - 1];
|
||||
};
|
||||
};
|
||||
|
||||
union
|
||||
{
|
||||
addr_target mAllocCheckPtr;
|
||||
addr_target mDbgAllocInfo; // Meaning depends on object flags- could be PC at allocation
|
||||
};
|
||||
};
|
||||
|
||||
struct Fake_Type_Data
|
||||
{
|
||||
int32 mSize;
|
||||
int32 mTypeId;
|
||||
int32 mTypeFlags;
|
||||
};
|
||||
|
||||
struct Fake_Delegate_Data
|
||||
{
|
||||
addr_target mFuncPtr;
|
||||
addr_target Target;
|
||||
};
|
||||
|
||||
struct Fake_DbgRawAllocData
|
||||
{
|
||||
addr_target mType;
|
||||
addr_target mMarkFunc;
|
||||
int32 mMaxStackTrace; // Only 0, 1, >1 matters
|
||||
};
|
||||
|
||||
#define BF_OBJECTFLAG_DELETED 0x80
|
||||
|
||||
NS_BF_END
|
||||
|
||||
using namespace TCFake;
|
||||
|
||||
void DbgHotScanner::AddSubProgram(DbgSubprogram* subProgram, bool followInlineParent, const Beefy::StringImpl& prefix)
|
||||
{
|
||||
if ((followInlineParent) && (subProgram->mInlineeInfo != NULL) && (subProgram->mInlineeInfo->mInlineParent != NULL))
|
||||
AddSubProgram(subProgram->mInlineeInfo->mInlineParent, true, prefix);
|
||||
|
||||
subProgram->mCompileUnit->mDbgModule->ParseSymbolData();
|
||||
|
||||
String methodName;
|
||||
addr_target offset;
|
||||
if (mDebugger->mDebugTarget->FindSymbolAt(subProgram->mBlock.mLowPC, &methodName, &offset))
|
||||
{
|
||||
if (offset == 0)
|
||||
{
|
||||
if (!prefix.IsEmpty())
|
||||
methodName.Insert(0, prefix);
|
||||
|
||||
if (subProgram->mCompileUnit->mDbgModule->mHotIdx != 0)
|
||||
methodName += StrFormat("\t%d", subProgram->mCompileUnit->mDbgModule->mHotIdx);
|
||||
mDebugger->mHotResolveData->mBeefCallStackEntries.Add(methodName);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void DbgHotScanner::PopulateHotCallstacks()
|
||||
{
|
||||
auto prevActiveThread = mDebugger->mActiveThread;
|
||||
for (auto threadInfo : mDebugger->mThreadList)
|
||||
{
|
||||
mDebugger->mActiveThread = threadInfo;
|
||||
mDebugger->ClearCallStack();
|
||||
mDebugger->UpdateCallStack(false);
|
||||
|
||||
for (int stackFrameIdx = 0; stackFrameIdx < (int)mDebugger->mCallStack.size(); stackFrameIdx++)
|
||||
mDebugger->UpdateCallStackMethod(stackFrameIdx);
|
||||
|
||||
for (int stackFrameIdx = 0; stackFrameIdx < (int)mDebugger->mCallStack.size(); stackFrameIdx++)
|
||||
{
|
||||
auto stackFrame = mDebugger->mCallStack[stackFrameIdx];
|
||||
if ((stackFrame->mSubProgram != NULL) && (stackFrame->mSubProgram->GetLanguage() == DbgLanguage_Beef))
|
||||
{
|
||||
auto subProgram = stackFrame->mSubProgram;
|
||||
|
||||
if (subProgram->mWasHotReplaced)
|
||||
subProgram = mDebugger->TryFollowHotJump(subProgram, stackFrame->mRegisters.GetPC());
|
||||
|
||||
AddSubProgram(subProgram, false, "");
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
mDebugger->mActiveThread = prevActiveThread;
|
||||
mDebugger->ClearCallStack();
|
||||
}
|
||||
|
||||
void DbgHotScanner::ScanSpan(TCFake::Span* span, int expectedStartPage, int memKind)
|
||||
{
|
||||
if (span->location != TCFake::Span::IN_USE)
|
||||
return;
|
||||
|
||||
if (span->start != expectedStartPage)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
intptr pageSize = (intptr)1 << kPageShift;
|
||||
int spanSize = pageSize * span->length;
|
||||
addr_target spanStart = ((addr_target)span->start << kPageShift);
|
||||
|
||||
if (spanSize > mScanData.size())
|
||||
{
|
||||
mScanData.Resize(spanSize);
|
||||
}
|
||||
void* spanPtr = &mScanData[0];
|
||||
mDebugger->ReadMemory(spanStart, spanSize, spanPtr);
|
||||
void* spanEnd = (void*)((intptr)spanPtr + spanSize);
|
||||
|
||||
//BF_LOGASSERT((spanStart >= TCFake::PageHeap::sAddressStart) && (spanEnd <= TCFake::PageHeap::sAddressEnd));
|
||||
|
||||
int elementSize = mDbgGCData.mSizeClasses[span->sizeclass];
|
||||
if (elementSize == 0)
|
||||
elementSize = spanSize;
|
||||
//BF_LOGASSERT(elementSize >= sizeof(bf::System::Object));
|
||||
|
||||
auto _MarkTypeUsed = [&](int typeId)
|
||||
{
|
||||
while (mDebugger->mHotResolveData->mTypeData.size() <= typeId)
|
||||
mDebugger->mHotResolveData->mTypeData.Add(0);
|
||||
mDebugger->mHotResolveData->mTypeData[typeId] = 1;
|
||||
};
|
||||
|
||||
int objectSize = ((mDbgGCData.mDbgFlags & BfRtFlags_ObjectHasDebugFlags) != 0) ? sizeof(addr_target)*2 : sizeof(addr_target);
|
||||
|
||||
while (spanPtr <= (uint8*)spanEnd - elementSize)
|
||||
{
|
||||
addr_target classVDataAddr = 0;
|
||||
if (memKind == 0)
|
||||
{
|
||||
// Obj
|
||||
Fake_BfObject_WithFlags* obj = (Fake_BfObject_WithFlags*)spanPtr;
|
||||
if (obj->mAllocCheckPtr != 0)
|
||||
{
|
||||
int objectFlags = obj->mObjectFlags;
|
||||
if ((objectFlags & BF_OBJECTFLAG_DELETED) == 0)
|
||||
{
|
||||
classVDataAddr = obj->mClassVData & ~0xFF;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
// Raw
|
||||
addr_target rawAllocDataAddr = *(addr_target*)((uint8*)spanPtr + elementSize - sizeof(addr_target));
|
||||
if (rawAllocDataAddr != 0)
|
||||
{
|
||||
if (rawAllocDataAddr == mDbgGCData.mRawObjectSentinel)
|
||||
{
|
||||
classVDataAddr = *((addr_target*)spanPtr);
|
||||
if ((mDbgGCData.mDbgFlags & BfRtFlags_ObjectHasDebugFlags) != 0)
|
||||
classVDataAddr = classVDataAddr & ~0xFF;
|
||||
}
|
||||
else if (mFoundRawAllocDataAddrs.Add(rawAllocDataAddr))
|
||||
{
|
||||
Fake_DbgRawAllocData rawAllocData = mDebugger->ReadMemory<Fake_DbgRawAllocData>(rawAllocDataAddr);
|
||||
if ((rawAllocData.mType != NULL) && (mFoundTypeAddrs.Add(rawAllocData.mType)))
|
||||
{
|
||||
Fake_Type_Data typeData;
|
||||
if (mDebugger->ReadMemory(rawAllocData.mType + objectSize, sizeof(typeData), &typeData))
|
||||
_MarkTypeUsed(typeData.mTypeId);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if ((classVDataAddr != 0) && (mFoundClassVDataAddrs.Add(classVDataAddr)))
|
||||
{
|
||||
addr_target typeAddr = mDebugger->ReadMemory<addr_target>(classVDataAddr);
|
||||
Fake_Type_Data typeData;
|
||||
mDebugger->ReadMemory(typeAddr + objectSize, sizeof(typeData), &typeData);
|
||||
|
||||
_MarkTypeUsed(typeData.mTypeId);
|
||||
if ((typeData.mTypeFlags & BfTypeFlags_Delegate) != 0)
|
||||
{
|
||||
Fake_Delegate_Data* dlg = (Fake_Delegate_Data*)((uint8*)spanPtr + objectSize);
|
||||
if (mFoundFuncPtrs.Add(dlg->mFuncPtr))
|
||||
{
|
||||
auto subProgram = mDebugger->mDebugTarget->FindSubProgram(dlg->mFuncPtr, DbgOnDemandKind_None);
|
||||
if ((subProgram != NULL) && (subProgram->GetLanguage() == DbgLanguage_Beef))
|
||||
AddSubProgram(subProgram, true, "D ");
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
spanPtr = (void*)((intptr)spanPtr + elementSize);
|
||||
}
|
||||
}
|
||||
|
||||
void DbgHotScanner::ScanRoot(addr_target rootPtr, int memKind)
|
||||
{
|
||||
mDebugger->ReadMemory(rootPtr, sizeof(mRoot), &mRoot);
|
||||
|
||||
#ifdef BF_DBG_32
|
||||
for (int rootIdx = 0; rootIdx < PageHeap::PageMap::ROOT_LENGTH; rootIdx++)
|
||||
{
|
||||
addr_target nodeAddr = mRoot.ptrs[rootIdx];
|
||||
if (nodeAddr == 0)
|
||||
continue;
|
||||
mDebugger->ReadMemory(nodeAddr, sizeof(mNode), &mNode);
|
||||
for (int leafIdx = 0; leafIdx < PageHeap::PageMap::LEAF_LENGTH; leafIdx++)
|
||||
{
|
||||
addr_target spanAddr = mNode.ptrs[leafIdx];
|
||||
if (spanAddr == 0)
|
||||
continue;
|
||||
|
||||
int expectedStartPage = (rootIdx * PageHeap::PageMap::LEAF_LENGTH) + leafIdx;
|
||||
Span span;
|
||||
mDebugger->ReadMemory(spanAddr, sizeof(span), &span);
|
||||
ScanSpan(&span, expectedStartPage, memKind);
|
||||
}
|
||||
}
|
||||
#else
|
||||
int bits = PageHeap::PageMap::BITS;
|
||||
int interiorLen = PageHeap::PageMap::INTERIOR_LENGTH;
|
||||
int leafLen = PageHeap::PageMap::LEAF_LENGTH;
|
||||
|
||||
for (int pageIdx1 = 0; pageIdx1 < PageHeap::PageMap::INTERIOR_LENGTH; pageIdx1++)
|
||||
{
|
||||
addr_target node1Addr = mRoot.ptrs[pageIdx1];
|
||||
if (node1Addr == 0)
|
||||
continue;
|
||||
mDebugger->ReadMemory(node1Addr, sizeof(mNode1), &mNode1);
|
||||
for (int pageIdx2 = 0; pageIdx2 < PageHeap::PageMap::INTERIOR_LENGTH; pageIdx2++)
|
||||
{
|
||||
addr_target node2Addr = mNode1.ptrs[pageIdx2];
|
||||
if (node2Addr == 0)
|
||||
continue;
|
||||
mDebugger->ReadMemory(node2Addr, sizeof(mNode2), &mNode2);
|
||||
for (int pageIdx3 = 0; pageIdx3 < PageHeap::PageMap::LEAF_LENGTH; pageIdx3++)
|
||||
{
|
||||
addr_target spanAddr = mNode2.ptrs[pageIdx3];
|
||||
if (spanAddr == 0)
|
||||
continue;
|
||||
|
||||
int expectedStartPage = ((pageIdx1 * PageHeap::PageMap::INTERIOR_LENGTH) + pageIdx2) * PageHeap::PageMap::LEAF_LENGTH + pageIdx3;
|
||||
Span span;
|
||||
mDebugger->ReadMemory(spanAddr, sizeof(span), &span);
|
||||
ScanSpan(&span, expectedStartPage, memKind);
|
||||
}
|
||||
}
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
||||
void DbgHotScanner::Scan(DbgHotResolveFlags flags)
|
||||
{
|
||||
auto prevRunState = mDebugger->mRunState;
|
||||
if (mDebugger->mRunState == RunState_Running)
|
||||
{
|
||||
mDebugger->ThreadRestorePause(NULL, NULL);
|
||||
mDebugger->mRunState = RunState_Paused;
|
||||
}
|
||||
|
||||
if ((flags & DbgHotResolveFlag_ActiveMethods) != 0)
|
||||
PopulateHotCallstacks();
|
||||
|
||||
if ((flags & DbgHotResolveFlag_Allocations) != 0)
|
||||
{
|
||||
addr_target gcDbgDataAddr = 0;
|
||||
|
||||
for (auto module : mDebugger->mDebugTarget->mDbgModules)
|
||||
{
|
||||
if ((module->mFilePath.Contains("Beef")) && (module->mFilePath.Contains("Dbg")))
|
||||
{
|
||||
module->ParseSymbolData();
|
||||
auto entry = module->mSymbolNameMap.Find("gGCDbgData");
|
||||
if ((entry != NULL) && (entry->mValue != NULL))
|
||||
gcDbgDataAddr = entry->mValue->mAddress;
|
||||
}
|
||||
}
|
||||
|
||||
if (gcDbgDataAddr == 0)
|
||||
return;
|
||||
|
||||
bool success = mDebugger->ReadMemory(gcDbgDataAddr, sizeof(DbgGCData), &mDbgGCData);
|
||||
if (!success)
|
||||
{
|
||||
BF_ASSERT("Failed to read DbgGCData");
|
||||
success = mDebugger->ReadMemory(gcDbgDataAddr, sizeof(DbgGCData), &mDbgGCData);
|
||||
}
|
||||
BF_ASSERT(mDbgGCData.mObjRootPtr != NULL);
|
||||
BF_ASSERT(mDbgGCData.mRawRootPtr != NULL);
|
||||
if (mDbgGCData.mObjRootPtr != NULL)
|
||||
ScanRoot(mDbgGCData.mObjRootPtr, 0);
|
||||
if (mDbgGCData.mRawRootPtr != NULL)
|
||||
ScanRoot(mDbgGCData.mRawRootPtr, 1);
|
||||
}
|
||||
|
||||
if (prevRunState == RunState_Running)
|
||||
{
|
||||
mDebugger->ThreadRestoreUnpause();
|
||||
mDebugger->mRunState = prevRunState;
|
||||
}
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue