#ifndef ProfileNode_h
#define ProfileNode_h
#include "CallIdentifier.h"
#include <wtf/HashCountedSet.h>
#include <wtf/RefCounted.h>
#include <wtf/RefPtr.h>
#include <wtf/Vector.h>
namespace JSC {
class ExecState;
class ProfileNode;
typedef HashCountedSet<StringImpl*> FunctionCallHashCount;
class ProfileNode : public RefCounted<ProfileNode> {
public:
static Ref<ProfileNode> create(ExecState* callerCallFrame, const CallIdentifier& callIdentifier, ProfileNode* parentNode)
{
return adoptRef(*new ProfileNode(callerCallFrame, callIdentifier, parentNode));
}
static Ref<ProfileNode> create(ExecState* callerCallFrame, ProfileNode* node)
{
return adoptRef(*new ProfileNode(callerCallFrame, node));
}
struct Call {
public:
Call(double startTime, double elapsedTime = NAN)
: m_startTime(startTime)
, m_elapsedTime(elapsedTime)
{
}
double startTime() const { return m_startTime; }
void setStartTime(double time)
{
ASSERT_ARG(time, time >= 0.0 || std::isnan(time));
m_startTime = time;
}
double elapsedTime() const { return m_elapsedTime; }
void setElapsedTime(double time)
{
ASSERT_ARG(time, time >= 0.0 || std::isnan(time));
m_elapsedTime = time;
}
private:
double m_startTime;
double m_elapsedTime;
};
bool operator==(ProfileNode* node) { return m_callIdentifier == node->callIdentifier(); }
ExecState* callerCallFrame() const { return m_callerCallFrame; }
const CallIdentifier& callIdentifier() const { return m_callIdentifier; }
unsigned id() const { return m_callIdentifier.hash(); }
const String& functionName() const { return m_callIdentifier.functionName(); }
const String& url() const { return m_callIdentifier.url(); }
unsigned lineNumber() const { return m_callIdentifier.lineNumber(); }
unsigned columnNumber() const { return m_callIdentifier.columnNumber(); }
ProfileNode* parent() const { return m_parent; }
void setParent(ProfileNode* parent) { m_parent = parent; }
const Vector<Call>& calls() const { return m_calls; }
Call& lastCall() { ASSERT(!m_calls.isEmpty()); return m_calls.last(); }
void appendCall(Call call) { m_calls.append(call); }
const Vector<RefPtr<ProfileNode>>& children() const { return m_children; }
ProfileNode* firstChild() const { return m_children.size() ? m_children.first().get() : nullptr; }
ProfileNode* lastChild() const { return m_children.size() ? m_children.last().get() : nullptr; }
void removeChild(ProfileNode*);
void addChild(PassRefPtr<ProfileNode>);
void spliceNode(PassRefPtr<ProfileNode>);
#ifndef NDEBUG
struct ProfileSubtreeData {
HashMap<ProfileNode*, std::pair<double, double>> selfAndTotalTimes;
double rootTotalTime;
};
void debugPrint();
void debugPrintSampleStyle();
template <typename Functor> void forEachNodePostorder(Functor&);
void debugPrintRecursively(int indentLevel, const ProfileSubtreeData&);
double debugPrintSampleStyleRecursively(int indentLevel, FunctionCallHashCount&, const ProfileSubtreeData&);
#endif
private:
typedef Vector<RefPtr<ProfileNode>>::const_iterator StackIterator;
ProfileNode(ExecState* callerCallFrame, const CallIdentifier&, ProfileNode* parentNode);
ProfileNode(ExecState* callerCallFrame, ProfileNode* nodeToCopy);
#ifndef NDEBUG
ProfileNode* nextSibling() const { return m_nextSibling; }
void setNextSibling(ProfileNode* nextSibling) { m_nextSibling = nextSibling; }
ProfileNode* traverseNextNodePostOrder() const;
#endif
ExecState* m_callerCallFrame;
CallIdentifier m_callIdentifier;
ProfileNode* m_parent;
Vector<Call> m_calls;
Vector<RefPtr<ProfileNode>> m_children;
#ifndef NDEBUG
ProfileNode* m_nextSibling;
#endif
};
#ifndef NDEBUG
template <typename Functor> inline void ProfileNode::forEachNodePostorder(Functor& functor)
{
ProfileNode* currentNode = this;
for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild())
currentNode = nextNode;
ProfileNode* endNode = this;
while (currentNode && currentNode != endNode) {
functor(currentNode);
currentNode = currentNode->traverseNextNodePostOrder();
}
functor(endNode);
}
struct CalculateProfileSubtreeDataFunctor {
void operator()(ProfileNode* node)
{
double selfTime = 0.0;
for (const ProfileNode::Call& call : node->calls())
selfTime += call.elapsedTime();
double totalTime = selfTime;
for (RefPtr<ProfileNode> child : node->children()) {
auto it = m_data.selfAndTotalTimes.find(child.get());
if (it != m_data.selfAndTotalTimes.end())
totalTime += it->value.second;
}
ASSERT(node);
m_data.selfAndTotalTimes.set(node, std::make_pair(selfTime, totalTime));
}
ProfileNode::ProfileSubtreeData returnValue() { return WTF::move(m_data); }
ProfileNode::ProfileSubtreeData m_data;
};
#endif
}
#endif // ProfileNode_h