profiler/Profile.cpp

   1 /*
   2  * Copyright (C) 2008 Apple Inc. All Rights Reserved.
   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  */
  25
  26 #include "config.h"
  27 #include "Profile.h"
  28
  29 #include "ProfileNode.h"
  30 #include <stdio.h>
  31 #include <wtf/DataLog.h>
  32
  33 namespace JSC {
  34
  35 PassRefPtr<Profile> Profile::create(const String& title, unsigned uid)
  36 {
  37     return adoptRef(new Profile(title, uid));
  38 }
  39
  40 Profile::Profile(const String& title, unsigned uid)
  41     : m_title(title)
  42     , m_uid(uid)
  43 {
  44     // FIXME: When multi-threading is supported this will be a vector and calls
  45     // into the profiler will need to know which thread it is executing on.
  46     m_head = ProfileNode::create(0, CallIdentifier("Thread_1", String(), 0), 0, 0);
  47 }
  48
  49 Profile::~Profile()
  50 {
  51 }
  52
  53 void Profile::forEach(void (ProfileNode::*function)())
  54 {
  55     ProfileNode* currentNode = m_head->firstChild();
  56     for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild())
  57         currentNode = nextNode;
  58
  59     if (!currentNode)
  60         currentNode = m_head.get();
  61
  62     ProfileNode* endNode = m_head->traverseNextNodePostOrder();
  63     while (currentNode && currentNode != endNode) {
  64         (currentNode->*function)();
  65         currentNode = currentNode->traverseNextNodePostOrder();
  66     }
  67 }
  68
  69 void Profile::focus(const ProfileNode* profileNode)
  70 {
  71     if (!profileNode || !m_head)
  72         return;
  73
  74     bool processChildren;
  75     const CallIdentifier& callIdentifier = profileNode->callIdentifier();
  76     for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNextNodePreOrder(processChildren))
  77         processChildren = currentNode->focus(callIdentifier);
  78
  79     // Set the visible time of all nodes so that the %s display correctly.
  80     forEach(&ProfileNode::calculateVisibleTotalTime);
  81 }
  82
  83 void Profile::exclude(const ProfileNode* profileNode)
  84 {
  85     if (!profileNode || !m_head)
  86         return;
  87
  88     const CallIdentifier& callIdentifier = profileNode->callIdentifier();
  89
  90     for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNextNodePreOrder())
  91         currentNode->exclude(callIdentifier);
  92
  93     // Set the visible time of the head so the %s display correctly.
  94     m_head->setVisibleTotalTime(m_head->totalTime() - m_head->selfTime());
  95     m_head->setVisibleSelfTime(0.0);
  96 }
  97
  98 void Profile::restoreAll()
  99 {
 100     forEach(&ProfileNode::restore);
 101 }
 102
 103 #ifndef NDEBUG
 104 void Profile::debugPrintData() const
 105 {
 106     dataLogF("Call graph:\n");
 107     m_head->debugPrintData(0);
 108 }
 109
 110 typedef WTF::KeyValuePair<FunctionCallHashCount::ValueType, unsigned> NameCountPair;
 111
 112 static inline bool functionNameCountPairComparator(const NameCountPair& a, const NameCountPair& b)
 113 {
 114     return a.value > b.value;
 115 }
 116
 117 void Profile::debugPrintDataSampleStyle() const
 118 {
 119     typedef Vector<NameCountPair> NameCountPairVector;
 120
 121     FunctionCallHashCount countedFunctions;
 122     dataLogF("Call graph:\n");
 123     m_head->debugPrintDataSampleStyle(0, countedFunctions);
 124
 125     dataLogF("\nTotal number in stack:\n");
 126     NameCountPairVector sortedFunctions(countedFunctions.size());
 127     copyToVector(countedFunctions, sortedFunctions);
 128
 129     std::sort(sortedFunctions.begin(), sortedFunctions.end(), functionNameCountPairComparator);
 130     for (NameCountPairVector::iterator it = sortedFunctions.begin(); it != sortedFunctions.end(); ++it)
 131         dataLogF("        %-12d%s\n", (*it).value, String((*it).key).utf8().data());
 132
 133     dataLogF("\nSort by top of stack, same collapsed (when >= 5):\n");
 134 }
 135 #endif
 136
 137 } // namespace JSC