2 * Copyright (C) 2008, 2014 Apple Inc. All Rights Reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
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.
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.
29 #include "ProfileNode.h"
30 #include <wtf/DataLog.h>
34 PassRefPtr
<Profile
> Profile::create(const String
& title
, unsigned uid
)
36 return adoptRef(new Profile(title
, uid
));
39 Profile::Profile(const String
& title
, unsigned uid
)
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, 0);
53 void Profile::forEach(void (ProfileNode::*function
)())
55 ProfileNode
* currentNode
= m_head
->firstChild();
56 for (ProfileNode
* nextNode
= currentNode
; nextNode
; nextNode
= nextNode
->firstChild())
57 currentNode
= nextNode
;
60 currentNode
= m_head
.get();
62 ProfileNode
* endNode
= m_head
->traverseNextNodePostOrder();
63 while (currentNode
&& currentNode
!= endNode
) {
64 (currentNode
->*function
)();
65 currentNode
= currentNode
->traverseNextNodePostOrder();
70 void Profile::debugPrintData() const
72 dataLogF("Call graph:\n");
73 m_head
->debugPrintData(0);
76 typedef WTF::KeyValuePair
<FunctionCallHashCount::ValueType
, unsigned> NameCountPair
;
78 static inline bool functionNameCountPairComparator(const NameCountPair
& a
, const NameCountPair
& b
)
80 return a
.value
> b
.value
;
83 void Profile::debugPrintDataSampleStyle() const
85 typedef Vector
<NameCountPair
> NameCountPairVector
;
87 FunctionCallHashCount countedFunctions
;
88 dataLogF("Call graph:\n");
89 m_head
->debugPrintDataSampleStyle(0, countedFunctions
);
91 dataLogF("\nTotal number in stack:\n");
92 NameCountPairVector
sortedFunctions(countedFunctions
.size());
93 copyToVector(countedFunctions
, sortedFunctions
);
95 std::sort(sortedFunctions
.begin(), sortedFunctions
.end(), functionNameCountPairComparator
);
96 for (NameCountPairVector::iterator it
= sortedFunctions
.begin(); it
!= sortedFunctions
.end(); ++it
)
97 dataLogF(" %-12d%s\n", (*it
).value
, String((*it
).key
).utf8().data());
99 dataLogF("\nSort by top of stack, same collapsed (when >= 5):\n");