#include "config.h"
#include "ProfileNode.h"
#include "LegacyProfiler.h"
#include <wtf/DateMath.h>
#include <wtf/DataLog.h>
#include <wtf/text/StringHash.h>
using namespace WTF;
namespace JSC {
ProfileNode::ProfileNode(ExecState* callerCallFrame, const CallIdentifier& callIdentifier, ProfileNode* parentNode)
: m_callerCallFrame(callerCallFrame)
, m_callIdentifier(callIdentifier)
, m_parent(parentNode)
#ifndef NDEBUG
, m_nextSibling(nullptr)
#endif
{
}
ProfileNode::ProfileNode(ExecState* callerCallFrame, ProfileNode* nodeToCopy)
: m_callerCallFrame(callerCallFrame)
, m_callIdentifier(nodeToCopy->callIdentifier())
, m_parent(nodeToCopy->parent())
, m_calls(nodeToCopy->calls())
#ifndef NDEBUG
, m_nextSibling(nullptr)
#endif
{
}
void ProfileNode::addChild(PassRefPtr<ProfileNode> prpChild)
{
RefPtr<ProfileNode> child = prpChild;
child->setParent(this);
#ifndef NDEBUG
if (m_children.size())
m_children.last()->setNextSibling(child.get());
#endif
m_children.append(child.release());
}
void ProfileNode::removeChild(ProfileNode* node)
{
if (!node)
return;
m_children.removeFirstMatching([node] (const RefPtr<ProfileNode>& current) {
return *node == current.get();
});
#ifndef NDEBUG
size_t size = m_children.size();
for (size_t i = 0; i < size; ++i)
m_children[i]->setNextSibling(i + 1 == size ? nullptr : m_children[i + 1].get());
#endif
}
void ProfileNode::spliceNode(PassRefPtr<ProfileNode> prpNode)
{
RefPtr<ProfileNode> node = prpNode;
for (unsigned i = 0; i < m_children.size(); ++i)
node->addChild(m_children[i].release());
m_children.clear();
m_children.append(node.release());
}
#ifndef NDEBUG
ProfileNode* ProfileNode::traverseNextNodePostOrder() const
{
ProfileNode* next = m_nextSibling;
if (!next)
return m_parent;
while (ProfileNode* firstChild = next->firstChild())
next = firstChild;
return next;
}
void ProfileNode::debugPrint()
{
CalculateProfileSubtreeDataFunctor functor;
forEachNodePostorder(functor);
ProfileNode::ProfileSubtreeData data = functor.returnValue();
debugPrintRecursively(0, data);
}
void ProfileNode::debugPrintSampleStyle()
{
FunctionCallHashCount countedFunctions;
CalculateProfileSubtreeDataFunctor functor;
forEachNodePostorder(functor);
ProfileNode::ProfileSubtreeData data = functor.returnValue();
debugPrintSampleStyleRecursively(0, countedFunctions, data);
}
void ProfileNode::debugPrintRecursively(int indentLevel, const ProfileSubtreeData& data)
{
for (int i = 0; i < indentLevel; ++i)
dataLogF(" ");
auto it = data.selfAndTotalTimes.find(this);
ASSERT(it != data.selfAndTotalTimes.end());
double nodeSelfTime = it->value.first;
double nodeTotalTime = it->value.second;
double rootTotalTime = data.rootTotalTime;
dataLogF("Function Name %s %zu SelfTime %.3fms/%.3f%% TotalTime %.3fms/%.3f%% Next Sibling %s\n",
functionName().utf8().data(),
m_calls.size(), nodeSelfTime, nodeSelfTime / rootTotalTime * 100.0, nodeTotalTime, nodeTotalTime / rootTotalTime * 100.0,
m_nextSibling ? m_nextSibling->functionName().utf8().data() : "");
++indentLevel;
for (StackIterator currentChild = m_children.begin(); currentChild != m_children.end(); ++currentChild)
(*currentChild)->debugPrintRecursively(indentLevel, data);
}
double ProfileNode::debugPrintSampleStyleRecursively(int indentLevel, FunctionCallHashCount& countedFunctions, const ProfileSubtreeData& data)
{
dataLogF(" ");
auto it = data.selfAndTotalTimes.find(this);
ASSERT(it != data.selfAndTotalTimes.end());
double nodeTotalTime = it->value.second;
const char* name = functionName().utf8().data();
double sampleCount = nodeTotalTime * 1000;
if (indentLevel) {
for (int i = 0; i < indentLevel; ++i)
dataLogF(" ");
countedFunctions.add(functionName().impl());
dataLogF("%.0f %s\n", sampleCount ? sampleCount : 1, name);
} else
dataLogF("%s\n", name);
++indentLevel;
double sumOfChildrensCount = 0.0;
for (StackIterator currentChild = m_children.begin(); currentChild != m_children.end(); ++currentChild)
sumOfChildrensCount += (*currentChild)->debugPrintSampleStyleRecursively(indentLevel, countedFunctions, data);
sumOfChildrensCount *= 1000; if (sumOfChildrensCount < sampleCount) {
dataLogF(" ");
while (indentLevel--)
dataLogF(" ");
dataLogF("%.0f %s\n", sampleCount - sumOfChildrensCount, functionName().utf8().data());
}
return nodeTotalTime;
}
#endif
}