git.saurik.com Git - apple/javascriptcore.git/blob

1 /*

3 *

4 * Redistribution and use in source and binary forms, with or without

5 * modification, are permitted provided that the following conditions

6 * are met:

7 * 1. Redistributions of source code must retain the above copyright

8 * notice, this list of conditions and the following disclaimer.

9 * 2. Redistributions in binary form must reproduce the above copyright

10 * notice, this list of conditions and the following disclaimer in the

11 * documentation and/or other materials provided with the distribution.

12 *

13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY

14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE

15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR

17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY

21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT

22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE

23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

24 */

26 #include "config.h"

27 #include "Profile.h"

29 #include "ProfileNode.h"

30 #include <wtf/DataLog.h>

32 namespace JSC {

 Ref<Profile> Profile::create(const String& title, unsigned uid, double startTime)

35 {

     return adoptRef(*new Profile(title, uid, startTime));

37 }

 Profile::Profile(const String& title, unsigned uid, double startTime)

40 : m_title(title)

41 , m_uid(uid)

42 {

43 // FIXME: When multi-threading is supported this will be a vector and calls

44 // into the profiler will need to know which thread it is executing on.

     m_rootNode = ProfileNode::create(nullptr, CallIdentifier(ASCIILiteral("Thread_1"), String(), 0, 0), nullptr);

     m_rootNode->appendCall(ProfileNode::Call(startTime));

47 }

49 Profile::~Profile()

50 {

51 }

53 #ifndef NDEBUG

 void Profile::debugPrint()

55 {

56 CalculateProfileSubtreeDataFunctor functor;

57 m_rootNode->forEachNodePostorder(functor);

     ProfileNode::ProfileSubtreeData data = functor.returnValue();

     dataLogF("Call graph:\n");

     m_rootNode->debugPrintRecursively(0, data);

62 }

 typedef WTF::KeyValuePair<FunctionCallHashCount::ValueType, unsigned> NameCountPair;

 static inline bool functionNameCountPairComparator(const NameCountPair& a, const NameCountPair& b)

67 {

     return a.value > b.value;

69 }

 void Profile::debugPrintSampleStyle()

72 {

73 typedef Vector<NameCountPair> NameCountPairVector;

75 CalculateProfileSubtreeDataFunctor functor;

76 m_rootNode->forEachNodePostorder(functor);

     ProfileNode::ProfileSubtreeData data = functor.returnValue();

79 FunctionCallHashCount countedFunctions;

     dataLogF("Call graph:\n");

     m_rootNode->debugPrintSampleStyleRecursively(0, countedFunctions, data);

     dataLogF("\nTotal number in stack:\n");

     NameCountPairVector sortedFunctions(countedFunctions.size());

85 copyToVector(countedFunctions, sortedFunctions);

     std::sort(sortedFunctions.begin(), sortedFunctions.end(), functionNameCountPairComparator);

     for (NameCountPairVector::iterator it = sortedFunctions.begin(); it != sortedFunctions.end(); ++it)

         dataLogF("        %-12d%s\n", (*it).value, String((*it).key).utf8().data());

     dataLogF("\nSort by top of stack, same collapsed (when >= 5):\n");

92 }

93 #endif

95 } // namespace JSC