#include "ProfileNode.h"
#include <stdio.h>
+#include <wtf/DataLog.h>
namespace JSC {
{
// FIXME: When multi-threading is supported this will be a vector and calls
// into the profiler will need to know which thread it is executing on.
- m_head = ProfileNode::create(CallIdentifier("Thread_1", UString(), 0), 0, 0);
+ m_head = ProfileNode::create(0, CallIdentifier("Thread_1", UString(), 0), 0, 0);
}
Profile::~Profile()
#ifndef NDEBUG
void Profile::debugPrintData() const
{
- printf("Call graph:\n");
+ dataLog("Call graph:\n");
m_head->debugPrintData(0);
}
-typedef pair<UString::Rep*, unsigned> NameCountPair;
+typedef pair<StringImpl*, unsigned> NameCountPair;
static inline bool functionNameCountPairComparator(const NameCountPair& a, const NameCountPair& b)
{
typedef Vector<NameCountPair> NameCountPairVector;
FunctionCallHashCount countedFunctions;
- printf("Call graph:\n");
+ dataLog("Call graph:\n");
m_head->debugPrintDataSampleStyle(0, countedFunctions);
- printf("\nTotal number in stack:\n");
+ dataLog("\nTotal number in stack:\n");
NameCountPairVector sortedFunctions(countedFunctions.size());
copyToVector(countedFunctions, sortedFunctions);
std::sort(sortedFunctions.begin(), sortedFunctions.end(), functionNameCountPairComparator);
for (NameCountPairVector::iterator it = sortedFunctions.begin(); it != sortedFunctions.end(); ++it)
- printf(" %-12d%s\n", (*it).second, UString((*it).first).UTF8String().data());
+ dataLog(" %-12d%s\n", (*it).second, UString((*it).first).utf8().data());
- printf("\nSort by top of stack, same collapsed (when >= 5):\n");
+ dataLog("\nSort by top of stack, same collapsed (when >= 5):\n");
}
#endif