1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
|
/*
* Copyright (C) 2012-2019 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <wtf/StackStats.h>
#if ENABLE(STACK_STATS)
#include <wtf/Assertions.h>
#include <wtf/DataLog.h>
// Define the following flag if you want to collect stats on every single
// checkpoint. By default, we only log checkpoints that establish new
// max values.
#define ENABLE_VERBOSE_STACK_STATS 1
namespace WTF {
// CheckPoint management:
Lock StackStats::s_sharedMutex;
StackStats::CheckPoint* StackStats::s_topCheckPoint = 0;
StackStats::LayoutCheckPoint* StackStats::s_firstLayoutCheckPoint = 0;
StackStats::LayoutCheckPoint* StackStats::s_topLayoutCheckPoint = 0;
// High watermark stats:
int StackStats::s_maxCheckPointDiff = 0;
int StackStats::s_maxStackHeight = 0;
int StackStats::s_maxReentryDepth = 0;
int StackStats::s_maxLayoutCheckPointDiff = 0;
int StackStats::s_maxTotalLayoutCheckPointDiff = 0;
int StackStats::s_maxLayoutReentryDepth = 0;
StackStats::PerThreadStats::PerThreadStats()
{
const StackBounds& stack = Thread::current().stack();
m_reentryDepth = 0;
m_stackStart = (char*)stack.origin();
m_currentCheckPoint = 0;
dataLogF(" === THREAD new stackStart %p ========\n", m_stackStart);
}
StackStats::CheckPoint::CheckPoint()
{
Locker locker { StackStats::s_sharedMutex };
Thread& thread = Thread::current();
StackStats::PerThreadStats& t = thread.stackStats();
const StackBounds& stack = thread.stack();
bool needToLog = false;
char* current = reinterpret_cast<char*>(this);
char* last = reinterpret_cast<char*>(t.m_currentCheckPoint);
// If there was no previous checkpoint, measure from the start of the stack:
if (!last)
last = t.m_stackStart;
// Update the reentry depth stats:
t.m_reentryDepth++;
if (t.m_reentryDepth > StackStats::s_maxReentryDepth) {
StackStats::s_maxReentryDepth = t.m_reentryDepth;
needToLog = true;
}
// Update the stack height stats:
int height = t.m_stackStart - current;
if (height > StackStats::s_maxStackHeight) {
StackStats::s_maxStackHeight = height;
needToLog = true;
}
// Update the checkpoint diff stats:
int diff = last - current;
if (diff > StackStats::s_maxCheckPointDiff) {
StackStats::s_maxCheckPointDiff = diff;
needToLog = true;
}
// Push this checkpoint:
m_prev = t.m_currentCheckPoint;
t.m_currentCheckPoint = this;
#if ENABLE(VERBOSE_STACK_STATS)
needToLog = true; // always log.
#endif
// Log this checkpoint if needed:
if (needToLog)
dataLogF(" CHECKPOINT %p diff %d/%.1fk/max %.1fk | reentry %d/max %d | height %.1fk/max %.1fk | stack %p size %.1fk\n",
this, diff, diff / 1024.0, StackStats::s_maxCheckPointDiff / 1024.0,
t.m_reentryDepth, StackStats::s_maxReentryDepth,
height / 1024.0, StackStats::s_maxStackHeight / 1024.0,
stack.origin(), stack.size() / 1024.0);
}
StackStats::CheckPoint::~CheckPoint()
{
Locker locker { StackStats::s_sharedMutex };
Thread& thread = Thread::current();
StackStats::PerThreadStats& t = thread.stackStats();
// Pop to previous checkpoint:
t.m_currentCheckPoint = m_prev;
--t.m_reentryDepth;
// Log this checkpoint if needed:
#if ENABLE(VERBOSE_STACK_STATS)
if (!m_prev) {
const StackBounds& stack = thread.stack();
char* current = reinterpret_cast<char*>(this);
int height = t.m_stackStart - current;
dataLogF(" POP to %p diff max %.1fk | reentry %d/%d max | height %.1fk/max %.1fk | stack %p size %.1fk)\n",
this, StackStats::s_maxCheckPointDiff / 1024.0,
t.m_reentryDepth, StackStats::s_maxReentryDepth,
height / 1024.0, StackStats::s_maxStackHeight / 1024.0,
stack.origin(), stack.size() / 1024.0);
}
#endif
}
void StackStats::probe()
{
Locker locker { StackStats::s_sharedMutex };
Thread& thread = Thread::current();
StackStats::PerThreadStats& t = thread.stackStats();
const StackBounds& stack = thread.stack();
bool needToLog = false;
int dummy;
char* current = reinterpret_cast<char*>(&dummy);
char* last = reinterpret_cast<char*>(t.m_currentCheckPoint);
// If there was no previous checkpoint, measure from the start of the stack:
if (!last)
last = t.m_stackStart;
// We did not reach another checkpoint yet. Hence, we do not touch the
// reentry stats.
// Update the stack height stats:
int height = t.m_stackStart - current;
if (height > StackStats::s_maxStackHeight) {
StackStats::s_maxStackHeight = height;
needToLog = true;
}
// Update the checkpoint diff stats:
int diff = last - current;
if (diff > StackStats::s_maxCheckPointDiff) {
StackStats::s_maxCheckPointDiff = diff;
needToLog = true;
}
#if ENABLE(VERBOSE_STACK_STATS)
needToLog = true; // always log.
#endif
if (needToLog)
dataLogF(" PROBE %p diff %d/%.1fk/max %.1fk | reentry %d/max %d | height %.1fk/max %.1fk | stack %p size %.1fk\n",
current, diff, diff / 1024.0, StackStats::s_maxCheckPointDiff / 1024.0,
t.m_reentryDepth, StackStats::s_maxReentryDepth,
height / 1024.0, StackStats::s_maxStackHeight / 1024.0,
stack.origin(), stack.size() / 1024.0);
}
StackStats::LayoutCheckPoint::LayoutCheckPoint()
{
// While a layout checkpoint is not necessarily a checkpoint where we
// we will do a recursion check, it is a convenient spot for doing a
// probe to measure the height of stack usage.
//
// We'll do this probe before we commence with the layout checkpoint.
// This is because the probe also locks the sharedLock. By calling the
// probe first, we can avoid re-entering the lock.
StackStats::probe();
Locker locker { StackStats::s_sharedMutex };
Thread& thread = Thread::current();
StackStats::PerThreadStats& t = thread.stackStats();
const StackBounds& stack = thread.stack();
// Push this checkpoint:
m_prev = StackStats::s_topLayoutCheckPoint;
if (m_prev)
m_depth = m_prev->m_depth + 1;
else {
StackStats::s_firstLayoutCheckPoint = this;
m_depth = 0;
}
StackStats::s_topLayoutCheckPoint = this;
//
char* current = reinterpret_cast<char*>(this);
char* last = reinterpret_cast<char*>(m_prev);
char* root = reinterpret_cast<char*>(StackStats::s_firstLayoutCheckPoint);
bool needToLog = false;
int diff = last - current;
if (!last)
diff = 0;
int totalDiff = root - current;
if (!root)
totalDiff = 0;
// Update the stack height stats:
int height = t.m_stackStart - current;
if (height > StackStats::s_maxStackHeight) {
StackStats::s_maxStackHeight = height;
needToLog = true;
}
// Update the layout checkpoint diff stats:
if (diff > StackStats::s_maxLayoutCheckPointDiff) {
StackStats::s_maxLayoutCheckPointDiff = diff;
needToLog = true;
}
// Update the total layout checkpoint diff stats:
if (totalDiff > StackStats::s_maxTotalLayoutCheckPointDiff) {
StackStats::s_maxTotalLayoutCheckPointDiff = totalDiff;
needToLog = true;
}
#if ENABLE(VERBOSE_STACK_STATS)
needToLog = true; // always log.
#endif
if (needToLog)
dataLogF(" LAYOUT %p diff %d/%.1fk/max %.1fk | reentry %d/max %d | height %.1fk/max %.1fk | stack %p size %.1fk\n",
current, diff, diff / 1024.0, StackStats::s_maxLayoutCheckPointDiff / 1024.0,
m_depth, StackStats::s_maxLayoutReentryDepth,
totalDiff / 1024.0, StackStats::s_maxTotalLayoutCheckPointDiff / 1024.0,
stack.origin(), stack.size() / 1024.0);
}
StackStats::LayoutCheckPoint::~LayoutCheckPoint()
{
Locker locker { StackStats::s_sharedMutex };
// Pop to the previous layout checkpoint:
StackStats::s_topLayoutCheckPoint = m_prev;
if (!m_depth)
StackStats::s_firstLayoutCheckPoint = 0;
}
} // namespace WTF
#endif // ENABLE(STACK_STATS)
|