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 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
|
<?php
/**
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
* http://www.gnu.org/copyleft/gpl.html
*
* @file
*/
use Wikimedia\RunningStat;
/**
* Convenience class for working with XHProf profiling data
* <https://github.com/phacility/xhprof>. XHProf can be installed via PECL.
*
* @copyright © 2014 Wikimedia Foundation and contributors
* @since 1.28
*/
class XhprofData {
/**
* @var array
*/
protected $config;
/**
* Hierarchical profiling data returned by xhprof.
* @var array[]
*/
protected $hieraData;
/**
* Per-function inclusive data.
* @var array[][]
*/
protected $inclusive;
/**
* Per-function inclusive and exclusive data.
* @var array[]
*/
protected $complete;
/**
* Configuration data can contain:
* - include: Array of function names to include in profiling.
* - sort: Key to sort per-function reports on.
*
* @param array $data Xhprof profiling data, as returned by xhprof_disable()
* @param array $config
*/
public function __construct( array $data, array $config = [] ) {
$this->config = array_merge( [
'include' => null,
'sort' => 'wt',
], $config );
$this->hieraData = $this->pruneData( $data );
}
/**
* Get raw data collected by xhprof.
*
* Each key in the returned array is an edge label for the call graph in
* the form "caller==>callee". There is once special case edge labeled
* simply "main()" which represents the global scope entry point of the
* application.
*
* XHProf will collect different data depending on the flags that are used:
* - ct: Number of matching events seen.
* - wt: Inclusive elapsed wall time for this event in microseconds.
* - cpu: Inclusive elapsed cpu time for this event in microseconds.
* (XHPROF_FLAGS_CPU)
* - mu: Delta of memory usage from start to end of callee in bytes.
* (XHPROF_FLAGS_MEMORY)
* - pmu: Delta of peak memory usage from start to end of callee in
* bytes. (XHPROF_FLAGS_MEMORY)
* - alloc: Delta of amount memory requested from malloc() by the callee,
* in bytes. (XHPROF_FLAGS_MALLOC)
* - free: Delta of amount of memory passed to free() by the callee, in
* bytes. (XHPROF_FLAGS_MALLOC)
*
* @return array
* @see getInclusiveMetrics()
* @see getCompleteMetrics()
*/
public function getRawData() {
return $this->hieraData;
}
/**
* Convert an xhprof data key into an array of ['parent', 'child']
* function names.
*
* The resulting array is left padded with nulls, so a key
* with no parent (eg 'main()') will return [null, 'function'].
*
* @param string $key
* @return array
*/
public static function splitKey( $key ) {
return array_pad( explode( '==>', $key, 2 ), -2, null );
}
/**
* Remove data for functions that are not included in the 'include'
* configuration array.
*
* @param array[] $data Raw xhprof data
* @return array[]
*/
protected function pruneData( $data ) {
if ( !$this->config['include'] ) {
return $data;
}
$want = array_fill_keys( $this->config['include'], true );
$want['main()'] = true;
$keep = [];
foreach ( $data as $key => $stats ) {
[ $parent, $child ] = self::splitKey( $key );
if ( isset( $want[$parent] ) || isset( $want[$child] ) ) {
$keep[$key] = $stats;
}
}
return $keep;
}
/**
* Get the inclusive metrics for each function call. Inclusive metrics
* for given function include the metrics for all functions that were
* called from that function during the measurement period.
*
* See getRawData() for a description of the metric that are returned for
* each function call. The values for the wt, cpu, mu and pmu metrics are
* arrays with these values:
* - total: Cumulative value
* - min: Minimum value
* - mean: Mean (average) value
* - max: Maximum value
* - variance: Variance (spread) of the values
*
* @return array[][]
* @see getRawData()
* @see getCompleteMetrics()
*/
public function getInclusiveMetrics() {
if ( $this->inclusive === null ) {
$main = $this->hieraData['main()'];
$hasCpu = isset( $main['cpu'] );
$hasMu = isset( $main['mu'] );
$hasAlloc = isset( $main['alloc'] );
$inclusive = [];
foreach ( $this->hieraData as $key => $stats ) {
[ , $child ] = self::splitKey( $key );
if ( !isset( $inclusive[$child] ) ) {
$inclusive[$child] = [
'ct' => 0,
'wt' => new RunningStat(),
];
if ( $hasCpu ) {
$inclusive[$child]['cpu'] = new RunningStat();
}
if ( $hasMu ) {
$inclusive[$child]['mu'] = new RunningStat();
$inclusive[$child]['pmu'] = new RunningStat();
}
if ( $hasAlloc ) {
$inclusive[$child]['alloc'] = new RunningStat();
$inclusive[$child]['free'] = new RunningStat();
}
}
$inclusive[$child]['ct'] += $stats['ct'];
foreach ( $stats as $stat => $value ) {
if ( $stat === 'ct' ) {
continue;
}
if ( !isset( $inclusive[$child][$stat] ) ) {
// Ignore unknown stats
continue;
}
for ( $i = 0; $i < $stats['ct']; $i++ ) {
$inclusive[$child][$stat]->addObservation(
$value / $stats['ct']
);
}
}
}
// Convert RunningStat instances to static arrays and add
// percentage stats.
foreach ( $inclusive as $func => $stats ) {
foreach ( $stats as $name => $value ) {
if ( $value instanceof RunningStat ) {
$total = $value->getMean() * $value->getCount();
$percent = ( isset( $main[$name] ) && $main[$name] )
? 100 * $total / $main[$name]
: 0;
$inclusive[$func][$name] = [
'total' => $total,
'min' => $value->min,
'mean' => $value->getMean(),
'max' => $value->max,
'variance' => $value->m2,
'percent' => $percent,
];
}
}
}
uasort( $inclusive, self::makeSortFunction(
$this->config['sort'], 'total'
) );
$this->inclusive = $inclusive;
}
return $this->inclusive;
}
/**
* Get the inclusive and exclusive metrics for each function call.
*
* In addition to the normal data contained in the inclusive metrics, the
* metrics have an additional 'exclusive' measurement which is the total
* minus the totals of all child function calls.
*
* @return array[]
* @see getRawData()
* @see getInclusiveMetrics()
*/
public function getCompleteMetrics() {
if ( $this->complete === null ) {
// Start with inclusive data
$this->complete = $this->getInclusiveMetrics();
foreach ( $this->complete as $func => $stats ) {
foreach ( $stats as $stat => $value ) {
if ( $stat === 'ct' ) {
continue;
}
// Initialize exclusive data with inclusive totals
$this->complete[$func][$stat]['exclusive'] = $value['total'];
}
// Add space for call tree information to be filled in later
$this->complete[$func]['calls'] = [];
$this->complete[$func]['subcalls'] = [];
}
foreach ( $this->hieraData as $key => $stats ) {
[ $parent, $child ] = self::splitKey( $key );
if ( $parent !== null ) {
// Track call tree information
$this->complete[$child]['calls'][$parent] = $stats;
$this->complete[$parent]['subcalls'][$child] = $stats;
}
if ( isset( $this->complete[$parent] ) ) {
// Deduct child inclusive data from exclusive data
foreach ( $stats as $stat => $value ) {
if ( $stat === 'ct' ) {
continue;
}
if ( !isset( $this->complete[$parent][$stat] ) ) {
// Ignore unknown stats
continue;
}
$this->complete[$parent][$stat]['exclusive'] -= $value;
}
}
}
uasort( $this->complete, self::makeSortFunction(
$this->config['sort'], 'exclusive'
) );
}
return $this->complete;
}
/**
* Get a list of all callers of a given function.
*
* @param string $function Function name
* @return array
* @see getEdges()
*/
public function getCallers( $function ) {
$edges = $this->getCompleteMetrics();
if ( isset( $edges[$function]['calls'] ) ) {
return array_keys( $edges[$function]['calls'] );
} else {
return [];
}
}
/**
* Get a list of all callees from a given function.
*
* @param string $function Function name
* @return array
* @see getEdges()
*/
public function getCallees( $function ) {
$edges = $this->getCompleteMetrics();
if ( isset( $edges[$function]['subcalls'] ) ) {
return array_keys( $edges[$function]['subcalls'] );
} else {
return [];
}
}
/**
* Find the critical path for the given metric.
*
* @param string $metric Metric to find critical path for
* @return array
*/
public function getCriticalPath( $metric = 'wt' ) {
$func = 'main()';
$path = [
$func => $this->hieraData[$func],
];
while ( $func ) {
$callees = $this->getCallees( $func );
$maxCallee = null;
$maxCall = null;
foreach ( $callees as $callee ) {
$call = "{$func}==>{$callee}";
if ( $maxCall === null ||
$this->hieraData[$call][$metric] >
$this->hieraData[$maxCall][$metric]
) {
$maxCallee = $callee;
$maxCall = $call;
}
}
if ( $maxCall !== null ) {
$path[$maxCall] = $this->hieraData[$maxCall];
}
$func = $maxCallee;
}
return $path;
}
/**
* Make a closure to use as a sort function. The resulting function will
* sort by descending numeric values (largest value first).
*
* @param string $key Data key to sort on
* @param string $sub Sub key to sort array values on
* @return Closure
*/
public static function makeSortFunction( $key, $sub ) {
return static function ( $a, $b ) use ( $key, $sub ) {
if ( isset( $a[$key] ) && isset( $b[$key] ) ) {
// Descending sort: larger values will be first in result.
// Values for 'main()' will not have sub keys
$valA = is_array( $a[$key] ) ? $a[$key][$sub] : $a[$key];
$valB = is_array( $b[$key] ) ? $b[$key][$sub] : $b[$key];
return $valB <=> $valA;
} else {
// Sort datum with the key before those without
return isset( $a[$key] ) ? -1 : 1;
}
};
}
}
|