/library/gprof2dot.py
Python | 3328 lines | 3065 code | 156 blank | 107 comment | 122 complexity | d10c47dd3925b07702e5a0f427773ad4 MD5 | raw file
Large files files are truncated, but you can click here to view the full file
- #!/usr/bin/env python3
- #
- # Copyright 2008-2017 Jose Fonseca
- #
- # This program is free software: you can redistribute it and/or modify it
- # under the terms of the GNU Lesser General Public License as published
- # by the Free Software Foundation, either version 3 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 Lesser General Public License for more details.
- #
- # You should have received a copy of the GNU Lesser General Public License
- # along with this program. If not, see <http://www.gnu.org/licenses/>.
- #
- """Generate a dot graph from the output of several profilers."""
- __author__ = "Jose Fonseca et al"
- import sys
- import math
- import os.path
- import re
- import textwrap
- import optparse
- import xml.parsers.expat
- import collections
- import locale
- import json
- import fnmatch
- # Python 2.x/3.x compatibility
- if sys.version_info[0] >= 3:
- PYTHON_3 = True
- def compat_iteritems(x): return x.items() # No iteritems() in Python 3
- def compat_itervalues(x): return x.values() # No itervalues() in Python 3
- def compat_keys(x): return list(x.keys()) # keys() is a generator in Python 3
- basestring = str # No class basestring in Python 3
- unichr = chr # No unichr in Python 3
- xrange = range # No xrange in Python 3
- else:
- PYTHON_3 = False
- def compat_iteritems(x): return x.iteritems()
- def compat_itervalues(x): return x.itervalues()
- def compat_keys(x): return x.keys()
- ########################################################################
- # Model
- MULTIPLICATION_SIGN = unichr(0xd7)
- def times(x):
- return "%u%s" % (x, MULTIPLICATION_SIGN)
- def percentage(p):
- return "%.02f%%" % (p*100.0,)
- def add(a, b):
- return a + b
- def fail(a, b):
- assert False
- tol = 2 ** -23
- def ratio(numerator, denominator):
- try:
- ratio = float(numerator)/float(denominator)
- except ZeroDivisionError:
- # 0/0 is undefined, but 1.0 yields more useful results
- return 1.0
- if ratio < 0.0:
- if ratio < -tol:
- sys.stderr.write('warning: negative ratio (%s/%s)\n' % (numerator, denominator))
- return 0.0
- if ratio > 1.0:
- if ratio > 1.0 + tol:
- sys.stderr.write('warning: ratio greater than one (%s/%s)\n' % (numerator, denominator))
- return 1.0
- return ratio
- class UndefinedEvent(Exception):
- """Raised when attempting to get an event which is undefined."""
- def __init__(self, event):
- Exception.__init__(self)
- self.event = event
- def __str__(self):
- return 'unspecified event %s' % self.event.name
- class Event(object):
- """Describe a kind of event, and its basic operations."""
- def __init__(self, name, null, aggregator, formatter = str):
- self.name = name
- self._null = null
- self._aggregator = aggregator
- self._formatter = formatter
- def __eq__(self, other):
- return self is other
- def __hash__(self):
- return id(self)
- def null(self):
- return self._null
- def aggregate(self, val1, val2):
- """Aggregate two event values."""
- assert val1 is not None
- assert val2 is not None
- return self._aggregator(val1, val2)
- def format(self, val):
- """Format an event value."""
- assert val is not None
- return self._formatter(val)
- CALLS = Event("Calls", 0, add, times)
- SAMPLES = Event("Samples", 0, add, times)
- SAMPLES2 = Event("Samples", 0, add, times)
- # Count of samples where a given function was either executing or on the stack.
- # This is used to calculate the total time ratio according to the
- # straightforward method described in Mike Dunlavey's answer to
- # stackoverflow.com/questions/1777556/alternatives-to-gprof, item 4 (the myth
- # "that recursion is a tricky confusing issue"), last edited 2012-08-30: it's
- # just the ratio of TOTAL_SAMPLES over the number of samples in the profile.
- #
- # Used only when totalMethod == callstacks
- TOTAL_SAMPLES = Event("Samples", 0, add, times)
- TIME = Event("Time", 0.0, add, lambda x: '(' + str(x) + ')')
- TIME_RATIO = Event("Time ratio", 0.0, add, lambda x: '(' + percentage(x) + ')')
- TOTAL_TIME = Event("Total time", 0.0, fail)
- TOTAL_TIME_RATIO = Event("Total time ratio", 0.0, fail, percentage)
- totalMethod = 'callratios'
- class Object(object):
- """Base class for all objects in profile which can store events."""
- def __init__(self, events=None):
- if events is None:
- self.events = {}
- else:
- self.events = events
- def __hash__(self):
- return id(self)
- def __eq__(self, other):
- return self is other
- def __lt__(self, other):
- return id(self) < id(other)
- def __contains__(self, event):
- return event in self.events
- def __getitem__(self, event):
- try:
- return self.events[event]
- except KeyError:
- raise UndefinedEvent(event)
- def __setitem__(self, event, value):
- if value is None:
- if event in self.events:
- del self.events[event]
- else:
- self.events[event] = value
- class Call(Object):
- """A call between functions.
- There should be at most one call object for every pair of functions.
- """
- def __init__(self, callee_id):
- Object.__init__(self)
- self.callee_id = callee_id
- self.ratio = None
- self.weight = None
- class Function(Object):
- """A function."""
- def __init__(self, id, name):
- Object.__init__(self)
- self.id = id
- self.name = name
- self.module = None
- self.process = None
- self.calls = {}
- self.called = None
- self.weight = None
- self.cycle = None
- self.filename = None
- def add_call(self, call):
- if call.callee_id in self.calls:
- sys.stderr.write('warning: overwriting call from function %s to %s\n' % (str(self.id), str(call.callee_id)))
- self.calls[call.callee_id] = call
- def get_call(self, callee_id):
- if not callee_id in self.calls:
- call = Call(callee_id)
- call[SAMPLES] = 0
- call[SAMPLES2] = 0
- call[CALLS] = 0
- self.calls[callee_id] = call
- return self.calls[callee_id]
- _parenthesis_re = re.compile(r'\([^()]*\)')
- _angles_re = re.compile(r'<[^<>]*>')
- _const_re = re.compile(r'\s+const$')
- def stripped_name(self):
- """Remove extraneous information from C++ demangled function names."""
- name = self.name
- # Strip function parameters from name by recursively removing paired parenthesis
- while True:
- name, n = self._parenthesis_re.subn('', name)
- if not n:
- break
- # Strip const qualifier
- name = self._const_re.sub('', name)
- # Strip template parameters from name by recursively removing paired angles
- while True:
- name, n = self._angles_re.subn('', name)
- if not n:
- break
- return name
- # TODO: write utility functions
- def __repr__(self):
- return self.name
- class Cycle(Object):
- """A cycle made from recursive function calls."""
- def __init__(self):
- Object.__init__(self)
- self.functions = set()
- def add_function(self, function):
- assert function not in self.functions
- self.functions.add(function)
- if function.cycle is not None:
- for other in function.cycle.functions:
- if function not in self.functions:
- self.add_function(other)
- function.cycle = self
- class Profile(Object):
- """The whole profile."""
- def __init__(self):
- Object.__init__(self)
- self.functions = {}
- self.cycles = []
- def add_function(self, function):
- if function.id in self.functions:
- sys.stderr.write('warning: overwriting function %s (id %s)\n' % (function.name, str(function.id)))
- self.functions[function.id] = function
- def add_cycle(self, cycle):
- self.cycles.append(cycle)
- def validate(self):
- """Validate the edges."""
- for function in compat_itervalues(self.functions):
- for callee_id in compat_keys(function.calls):
- assert function.calls[callee_id].callee_id == callee_id
- if callee_id not in self.functions:
- sys.stderr.write('warning: call to undefined function %s from function %s\n' % (str(callee_id), function.name))
- del function.calls[callee_id]
- def find_cycles(self):
- """Find cycles using Tarjan's strongly connected components algorithm."""
- # Apply the Tarjan's algorithm successively until all functions are visited
- stack = []
- data = {}
- order = 0
- for function in compat_itervalues(self.functions):
- order = self._tarjan(function, order, stack, data)
- cycles = []
- for function in compat_itervalues(self.functions):
- if function.cycle is not None and function.cycle not in cycles:
- cycles.append(function.cycle)
- self.cycles = cycles
- if 0:
- for cycle in cycles:
- sys.stderr.write("Cycle:\n")
- for member in cycle.functions:
- sys.stderr.write("\tFunction %s\n" % member.name)
- def prune_root(self, roots, depth=-1):
- visited = set()
- frontier = set([(root_node, depth) for root_node in roots])
- while len(frontier) > 0:
- node, node_depth = frontier.pop()
- visited.add(node)
- if node_depth == 0:
- continue
- f = self.functions[node]
- newNodes = set(f.calls.keys()) - visited
- frontier = frontier.union({(new_node, node_depth - 1) for new_node in newNodes})
- subtreeFunctions = {}
- for n in visited:
- f = self.functions[n]
- newCalls = {}
- for c in f.calls.keys():
- if c in visited:
- newCalls[c] = f.calls[c]
- f.calls = newCalls
- subtreeFunctions[n] = f
- self.functions = subtreeFunctions
- def prune_leaf(self, leafs, depth=-1):
- edgesUp = collections.defaultdict(set)
- for f in self.functions.keys():
- for n in self.functions[f].calls.keys():
- edgesUp[n].add(f)
- # build the tree up
- visited = set()
- frontier = set([(leaf_node, depth) for leaf_node in leafs])
- while len(frontier) > 0:
- node, node_depth = frontier.pop()
- visited.add(node)
- if node_depth == 0:
- continue
- newNodes = edgesUp[node] - visited
- frontier = frontier.union({(new_node, node_depth - 1) for new_node in newNodes})
- downTree = set(self.functions.keys())
- upTree = visited
- path = downTree.intersection(upTree)
- pathFunctions = {}
- for n in path:
- f = self.functions[n]
- newCalls = {}
- for c in f.calls.keys():
- if c in path:
- newCalls[c] = f.calls[c]
- f.calls = newCalls
- pathFunctions[n] = f
- self.functions = pathFunctions
- def getFunctionIds(self, funcName):
- function_names = {v.name: k for (k, v) in self.functions.items()}
- return [function_names[name] for name in fnmatch.filter(function_names.keys(), funcName)]
- def getFunctionId(self, funcName):
- for f in self.functions:
- if self.functions[f].name == funcName:
- return f
- return False
- class _TarjanData:
- def __init__(self, order):
- self.order = order
- self.lowlink = order
- self.onstack = False
- def _tarjan(self, function, order, stack, data):
- """Tarjan's strongly connected components algorithm.
- See also:
- - http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm
- """
- try:
- func_data = data[function.id]
- return order
- except KeyError:
- func_data = self._TarjanData(order)
- data[function.id] = func_data
- order += 1
- pos = len(stack)
- stack.append(function)
- func_data.onstack = True
- for call in compat_itervalues(function.calls):
- try:
- callee_data = data[call.callee_id]
- if callee_data.onstack:
- func_data.lowlink = min(func_data.lowlink, callee_data.order)
- except KeyError:
- callee = self.functions[call.callee_id]
- order = self._tarjan(callee, order, stack, data)
- callee_data = data[call.callee_id]
- func_data.lowlink = min(func_data.lowlink, callee_data.lowlink)
- if func_data.lowlink == func_data.order:
- # Strongly connected component found
- members = stack[pos:]
- del stack[pos:]
- if len(members) > 1:
- cycle = Cycle()
- for member in members:
- cycle.add_function(member)
- data[member.id].onstack = False
- else:
- for member in members:
- data[member.id].onstack = False
- return order
- def call_ratios(self, event):
- # Aggregate for incoming calls
- cycle_totals = {}
- for cycle in self.cycles:
- cycle_totals[cycle] = 0.0
- function_totals = {}
- for function in compat_itervalues(self.functions):
- function_totals[function] = 0.0
- # Pass 1: function_total gets the sum of call[event] for all
- # incoming arrows. Same for cycle_total for all arrows
- # that are coming into the *cycle* but are not part of it.
- for function in compat_itervalues(self.functions):
- for call in compat_itervalues(function.calls):
- if call.callee_id != function.id:
- callee = self.functions[call.callee_id]
- if event in call.events:
- function_totals[callee] += call[event]
- if callee.cycle is not None and callee.cycle is not function.cycle:
- cycle_totals[callee.cycle] += call[event]
- else:
- sys.stderr.write("call_ratios: No data for " + function.name + " call to " + callee.name + "\n")
- # Pass 2: Compute the ratios. Each call[event] is scaled by the
- # function_total of the callee. Calls into cycles use the
- # cycle_total, but not calls within cycles.
- for function in compat_itervalues(self.functions):
- for call in compat_itervalues(function.calls):
- assert call.ratio is None
- if call.callee_id != function.id:
- callee = self.functions[call.callee_id]
- if event in call.events:
- if callee.cycle is not None and callee.cycle is not function.cycle:
- total = cycle_totals[callee.cycle]
- else:
- total = function_totals[callee]
- call.ratio = ratio(call[event], total)
- else:
- # Warnings here would only repeat those issued above.
- call.ratio = 0.0
- def integrate(self, outevent, inevent):
- """Propagate function time ratio along the function calls.
- Must be called after finding the cycles.
- See also:
- - http://citeseer.ist.psu.edu/graham82gprof.html
- """
- # Sanity checking
- assert outevent not in self
- for function in compat_itervalues(self.functions):
- assert outevent not in function
- assert inevent in function
- for call in compat_itervalues(function.calls):
- assert outevent not in call
- if call.callee_id != function.id:
- assert call.ratio is not None
- # Aggregate the input for each cycle
- for cycle in self.cycles:
- total = inevent.null()
- for function in compat_itervalues(self.functions):
- total = inevent.aggregate(total, function[inevent])
- self[inevent] = total
- # Integrate along the edges
- total = inevent.null()
- for function in compat_itervalues(self.functions):
- total = inevent.aggregate(total, function[inevent])
- self._integrate_function(function, outevent, inevent)
- self[outevent] = total
- def _integrate_function(self, function, outevent, inevent):
- if function.cycle is not None:
- return self._integrate_cycle(function.cycle, outevent, inevent)
- else:
- if outevent not in function:
- total = function[inevent]
- for call in compat_itervalues(function.calls):
- if call.callee_id != function.id:
- total += self._integrate_call(call, outevent, inevent)
- function[outevent] = total
- return function[outevent]
- def _integrate_call(self, call, outevent, inevent):
- assert outevent not in call
- assert call.ratio is not None
- callee = self.functions[call.callee_id]
- subtotal = call.ratio *self._integrate_function(callee, outevent, inevent)
- call[outevent] = subtotal
- return subtotal
- def _integrate_cycle(self, cycle, outevent, inevent):
- if outevent not in cycle:
- # Compute the outevent for the whole cycle
- total = inevent.null()
- for member in cycle.functions:
- subtotal = member[inevent]
- for call in compat_itervalues(member.calls):
- callee = self.functions[call.callee_id]
- if callee.cycle is not cycle:
- subtotal += self._integrate_call(call, outevent, inevent)
- total += subtotal
- cycle[outevent] = total
- # Compute the time propagated to callers of this cycle
- callees = {}
- for function in compat_itervalues(self.functions):
- if function.cycle is not cycle:
- for call in compat_itervalues(function.calls):
- callee = self.functions[call.callee_id]
- if callee.cycle is cycle:
- try:
- callees[callee] += call.ratio
- except KeyError:
- callees[callee] = call.ratio
- for member in cycle.functions:
- member[outevent] = outevent.null()
- for callee, call_ratio in compat_iteritems(callees):
- ranks = {}
- call_ratios = {}
- partials = {}
- self._rank_cycle_function(cycle, callee, ranks)
- self._call_ratios_cycle(cycle, callee, ranks, call_ratios, set())
- partial = self._integrate_cycle_function(cycle, callee, call_ratio, partials, ranks, call_ratios, outevent, inevent)
- # Ensure `partial == max(partials.values())`, but with round-off tolerance
- max_partial = max(partials.values())
- assert abs(partial - max_partial) <= 1e-7*max_partial
- assert abs(call_ratio*total - partial) <= 0.001*call_ratio*total
- return cycle[outevent]
- def _rank_cycle_function(self, cycle, function, ranks):
- """Dijkstra's shortest paths algorithm.
- See also:
- - http://en.wikipedia.org/wiki/Dijkstra's_algorithm
- """
- import heapq
- Q = []
- Qd = {}
- p = {}
- visited = set([function])
- ranks[function] = 0
- for call in compat_itervalues(function.calls):
- if call.callee_id != function.id:
- callee = self.functions[call.callee_id]
- if callee.cycle is cycle:
- ranks[callee] = 1
- item = [ranks[callee], function, callee]
- heapq.heappush(Q, item)
- Qd[callee] = item
- while Q:
- cost, parent, member = heapq.heappop(Q)
- if member not in visited:
- p[member]= parent
- visited.add(member)
- for call in compat_itervalues(member.calls):
- if call.callee_id != member.id:
- callee = self.functions[call.callee_id]
- if callee.cycle is cycle:
- member_rank = ranks[member]
- rank = ranks.get(callee)
- if rank is not None:
- if rank > 1 + member_rank:
- rank = 1 + member_rank
- ranks[callee] = rank
- Qd_callee = Qd[callee]
- Qd_callee[0] = rank
- Qd_callee[1] = member
- heapq._siftdown(Q, 0, Q.index(Qd_callee))
- else:
- rank = 1 + member_rank
- ranks[callee] = rank
- item = [rank, member, callee]
- heapq.heappush(Q, item)
- Qd[callee] = item
- def _call_ratios_cycle(self, cycle, function, ranks, call_ratios, visited):
- if function not in visited:
- visited.add(function)
- for call in compat_itervalues(function.calls):
- if call.callee_id != function.id:
- callee = self.functions[call.callee_id]
- if callee.cycle is cycle:
- if ranks[callee] > ranks[function]:
- call_ratios[callee] = call_ratios.get(callee, 0.0) + call.ratio
- self._call_ratios_cycle(cycle, callee, ranks, call_ratios, visited)
- def _integrate_cycle_function(self, cycle, function, partial_ratio, partials, ranks, call_ratios, outevent, inevent):
- if function not in partials:
- partial = partial_ratio*function[inevent]
- for call in compat_itervalues(function.calls):
- if call.callee_id != function.id:
- callee = self.functions[call.callee_id]
- if callee.cycle is not cycle:
- assert outevent in call
- partial += partial_ratio*call[outevent]
- else:
- if ranks[callee] > ranks[function]:
- callee_partial = self._integrate_cycle_function(cycle, callee, partial_ratio, partials, ranks, call_ratios, outevent, inevent)
- call_ratio = ratio(call.ratio, call_ratios[callee])
- call_partial = call_ratio*callee_partial
- try:
- call[outevent] += call_partial
- except UndefinedEvent:
- call[outevent] = call_partial
- partial += call_partial
- partials[function] = partial
- try:
- function[outevent] += partial
- except UndefinedEvent:
- function[outevent] = partial
- return partials[function]
- def aggregate(self, event):
- """Aggregate an event for the whole profile."""
- total = event.null()
- for function in compat_itervalues(self.functions):
- try:
- total = event.aggregate(total, function[event])
- except UndefinedEvent:
- return
- self[event] = total
- def ratio(self, outevent, inevent):
- assert outevent not in self
- assert inevent in self
- for function in compat_itervalues(self.functions):
- assert outevent not in function
- assert inevent in function
- function[outevent] = ratio(function[inevent], self[inevent])
- for call in compat_itervalues(function.calls):
- assert outevent not in call
- if inevent in call:
- call[outevent] = ratio(call[inevent], self[inevent])
- self[outevent] = 1.0
- def prune(self, node_thres, edge_thres, paths, color_nodes_by_selftime):
- """Prune the profile"""
- # compute the prune ratios
- for function in compat_itervalues(self.functions):
- try:
- function.weight = function[TOTAL_TIME_RATIO]
- except UndefinedEvent:
- pass
- for call in compat_itervalues(function.calls):
- callee = self.functions[call.callee_id]
- if TOTAL_TIME_RATIO in call:
- # handle exact cases first
- call.weight = call[TOTAL_TIME_RATIO]
- else:
- try:
- # make a safe estimate
- call.weight = min(function[TOTAL_TIME_RATIO], callee[TOTAL_TIME_RATIO])
- except UndefinedEvent:
- pass
- # prune the nodes
- for function_id in compat_keys(self.functions):
- function = self.functions[function_id]
- if function.weight is not None:
- if function.weight < node_thres:
- del self.functions[function_id]
- # prune file paths
- for function_id in compat_keys(self.functions):
- function = self.functions[function_id]
- if paths and not any(function.filename.startswith(path) for path in paths):
- del self.functions[function_id]
- # prune the egdes
- for function in compat_itervalues(self.functions):
- for callee_id in compat_keys(function.calls):
- call = function.calls[callee_id]
- if callee_id not in self.functions or call.weight is not None and call.weight < edge_thres:
- del function.calls[callee_id]
- if color_nodes_by_selftime:
- weights = []
- for function in compat_itervalues(self.functions):
- try:
- weights.append(function[TIME_RATIO])
- except UndefinedEvent:
- pass
- max_ratio = max(weights or [1])
- # apply rescaled weights for coloriung
- for function in compat_itervalues(self.functions):
- try:
- function.weight = function[TIME_RATIO] / max_ratio
- except (ZeroDivisionError, UndefinedEvent):
- pass
- def dump(self):
- for function in compat_itervalues(self.functions):
- sys.stderr.write('Function %s:\n' % (function.name,))
- self._dump_events(function.events)
- for call in compat_itervalues(function.calls):
- callee = self.functions[call.callee_id]
- sys.stderr.write(' Call %s:\n' % (callee.name,))
- self._dump_events(call.events)
- for cycle in self.cycles:
- sys.stderr.write('Cycle:\n')
- self._dump_events(cycle.events)
- for function in cycle.functions:
- sys.stderr.write(' Function %s\n' % (function.name,))
- def _dump_events(self, events):
- for event, value in compat_iteritems(events):
- sys.stderr.write(' %s: %s\n' % (event.name, event.format(value)))
- ########################################################################
- # Parsers
- class Struct:
- """Masquerade a dictionary with a structure-like behavior."""
- def __init__(self, attrs = None):
- if attrs is None:
- attrs = {}
- self.__dict__['_attrs'] = attrs
- def __getattr__(self, name):
- try:
- return self._attrs[name]
- except KeyError:
- raise AttributeError(name)
- def __setattr__(self, name, value):
- self._attrs[name] = value
- def __str__(self):
- return str(self._attrs)
- def __repr__(self):
- return repr(self._attrs)
- class ParseError(Exception):
- """Raised when parsing to signal mismatches."""
- def __init__(self, msg, line):
- Exception.__init__(self)
- self.msg = msg
- # TODO: store more source line information
- self.line = line
- def __str__(self):
- return '%s: %r' % (self.msg, self.line)
- class Parser:
- """Parser interface."""
- stdinInput = True
- multipleInput = False
- def __init__(self):
- pass
- def parse(self):
- raise NotImplementedError
- class JsonParser(Parser):
- """Parser for a custom JSON representation of profile data.
- See schema.json for details.
- """
- def __init__(self, stream):
- Parser.__init__(self)
- self.stream = stream
- def parse(self):
- obj = json.load(self.stream)
- assert obj['version'] == 0
- profile = Profile()
- profile[SAMPLES] = 0
- fns = obj['functions']
- for functionIndex in range(len(fns)):
- fn = fns[functionIndex]
- function = Function(functionIndex, fn['name'])
- try:
- function.module = fn['module']
- except KeyError:
- pass
- try:
- function.process = fn['process']
- except KeyError:
- pass
- function[SAMPLES] = 0
- profile.add_function(function)
- for event in obj['events']:
- callchain = []
- for functionIndex in event['callchain']:
- function = profile.functions[functionIndex]
- callchain.append(function)
- cost = event['cost'][0]
- callee = callchain[0]
- callee[SAMPLES] += cost
- profile[SAMPLES] += cost
- for caller in callchain[1:]:
- try:
- call = caller.calls[callee.id]
- except KeyError:
- call = Call(callee.id)
- call[SAMPLES2] = cost
- caller.add_call(call)
- else:
- call[SAMPLES2] += cost
- callee = caller
- if False:
- profile.dump()
- # compute derived data
- profile.validate()
- profile.find_cycles()
- profile.ratio(TIME_RATIO, SAMPLES)
- profile.call_ratios(SAMPLES2)
- profile.integrate(TOTAL_TIME_RATIO, TIME_RATIO)
- return profile
- class LineParser(Parser):
- """Base class for parsers that read line-based formats."""
- def __init__(self, stream):
- Parser.__init__(self)
- self._stream = stream
- self.__line = None
- self.__eof = False
- self.line_no = 0
- def readline(self):
- line = self._stream.readline()
- if not line:
- self.__line = ''
- self.__eof = True
- else:
- self.line_no += 1
- line = line.rstrip('\r\n')
- if not PYTHON_3:
- encoding = self._stream.encoding
- if encoding is None:
- encoding = locale.getpreferredencoding()
- line = line.decode(encoding)
- self.__line = line
- def lookahead(self):
- assert self.__line is not None
- return self.__line
- def consume(self):
- assert self.__line is not None
- line = self.__line
- self.readline()
- return line
- def eof(self):
- assert self.__line is not None
- return self.__eof
- XML_ELEMENT_START, XML_ELEMENT_END, XML_CHARACTER_DATA, XML_EOF = range(4)
- class XmlToken:
- def __init__(self, type, name_or_data, attrs = None, line = None, column = None):
- assert type in (XML_ELEMENT_START, XML_ELEMENT_END, XML_CHARACTER_DATA, XML_EOF)
- self.type = type
- self.name_or_data = name_or_data
- self.attrs = attrs
- self.line = line
- self.column = column
- def __str__(self):
- if self.type == XML_ELEMENT_START:
- return '<' + self.name_or_data + ' ...>'
- if self.type == XML_ELEMENT_END:
- return '</' + self.name_or_data + '>'
- if self.type == XML_CHARACTER_DATA:
- return self.name_or_data
- if self.type == XML_EOF:
- return 'end of file'
- assert 0
- class XmlTokenizer:
- """Expat based XML tokenizer."""
- def __init__(self, fp, skip_ws = True):
- self.fp = fp
- self.tokens = []
- self.index = 0
- self.final = False
- self.skip_ws = skip_ws
- self.character_pos = 0, 0
- self.character_data = ''
- self.parser = xml.parsers.expat.ParserCreate()
- self.parser.StartElementHandler = self.handle_element_start
- self.parser.EndElementHandler = self.handle_element_end
- self.parser.CharacterDataHandler = self.handle_character_data
- def handle_element_start(self, name, attributes):
- self.finish_character_data()
- line, column = self.pos()
- token = XmlToken(XML_ELEMENT_START, name, attributes, line, column)
- self.tokens.append(token)
- def handle_element_end(self, name):
- self.finish_character_data()
- line, column = self.pos()
- token = XmlToken(XML_ELEMENT_END, name, None, line, column)
- self.tokens.append(token)
- def handle_character_data(self, data):
- if not self.character_data:
- self.character_pos = self.pos()
- self.character_data += data
- def finish_character_data(self):
- if self.character_data:
- if not self.skip_ws or not self.character_data.isspace():
- line, column = self.character_pos
- token = XmlToken(XML_CHARACTER_DATA, self.character_data, None, line, column)
- self.tokens.append(token)
- self.character_data = ''
- def next(self):
- size = 16*1024
- while self.index >= len(self.tokens) and not self.final:
- self.tokens = []
- self.index = 0
- data = self.fp.read(size)
- self.final = len(data) < size
- self.parser.Parse(data, self.final)
- if self.index >= len(self.tokens):
- line, column = self.pos()
- token = XmlToken(XML_EOF, None, None, line, column)
- else:
- token = self.tokens[self.index]
- self.index += 1
- return token
- def pos(self):
- return self.parser.CurrentLineNumber, self.parser.CurrentColumnNumber
- class XmlTokenMismatch(Exception):
- def __init__(self, expected, found):
- Exception.__init__(self)
- self.expected = expected
- self.found = found
- def __str__(self):
- return '%u:%u: %s expected, %s found' % (self.found.line, self.found.column, str(self.expected), str(self.found))
- class XmlParser(Parser):
- """Base XML document parser."""
- def __init__(self, fp):
- Parser.__init__(self)
- self.tokenizer = XmlTokenizer(fp)
- self.consume()
- def consume(self):
- self.token = self.tokenizer.next()
- def match_element_start(self, name):
- return self.token.type == XML_ELEMENT_START and self.token.name_or_data == name
- def match_element_end(self, name):
- return self.token.type == XML_ELEMENT_END and self.token.name_or_data == name
- def element_start(self, name):
- while self.token.type == XML_CHARACTER_DATA:
- self.consume()
- if self.token.type != XML_ELEMENT_START:
- raise XmlTokenMismatch(XmlToken(XML_ELEMENT_START, name), self.token)
- if self.token.name_or_data != name:
- raise XmlTokenMismatch(XmlToken(XML_ELEMENT_START, name), self.token)
- attrs = self.token.attrs
- self.consume()
- return attrs
- def element_end(self, name):
- while self.token.type == XML_CHARACTER_DATA:
- self.consume()
- if self.token.type != XML_ELEMENT_END:
- raise XmlTokenMismatch(XmlToken(XML_ELEMENT_END, name), self.token)
- if self.token.name_or_data != name:
- raise XmlTokenMismatch(XmlToken(XML_ELEMENT_END, name), self.token)
- self.consume()
- def character_data(self, strip = True):
- data = ''
- while self.token.type == XML_CHARACTER_DATA:
- data += self.token.name_or_data
- self.consume()
- if strip:
- data = data.strip()
- return data
- class GprofParser(Parser):
- """Parser for GNU gprof output.
- See also:
- - Chapter "Interpreting gprof's Output" from the GNU gprof manual
- http://sourceware.org/binutils/docs-2.18/gprof/Call-Graph.html#Call-Graph
- - File "cg_print.c" from the GNU gprof source code
- http://sourceware.org/cgi-bin/cvsweb.cgi/~checkout~/src/gprof/cg_print.c?rev=1.12&cvsroot=src
- """
- def __init__(self, fp):
- Parser.__init__(self)
- self.fp = fp
- self.functions = {}
- self.cycles = {}
- def readline(self):
- line = self.fp.readline()
- if not line:
- sys.stderr.write('error: unexpected end of file\n')
- sys.exit(1)
- line = line.rstrip('\r\n')
- return line
- _int_re = re.compile(r'^\d+$')
- _float_re = re.compile(r'^\d+\.\d+$')
- def translate(self, mo):
- """Extract a structure from a match object, while translating the types in the process."""
- attrs = {}
- groupdict = mo.groupdict()
- for name, value in compat_iteritems(groupdict):
- if value is None:
- value = None
- elif self._int_re.match(value):
- value = int(value)
- elif self._float_re.match(value):
- value = float(value)
- attrs[name] = (value)
- return Struct(attrs)
- _cg_header_re = re.compile(
- # original gprof header
- r'^\s+called/total\s+parents\s*$|' +
- r'^index\s+%time\s+self\s+descendents\s+called\+self\s+name\s+index\s*$|' +
- r'^\s+called/total\s+children\s*$|' +
- # GNU gprof header
- r'^index\s+%\s+time\s+self\s+children\s+called\s+name\s*$'
- )
- _cg_ignore_re = re.compile(
- # spontaneous
- r'^\s+<spontaneous>\s*$|'
- # internal calls (such as "mcount")
- r'^.*\((\d+)\)$'
- )
- _cg_primary_re = re.compile(
- r'^\[(?P<index>\d+)\]?' +
- r'\s+(?P<percentage_time>\d+\.\d+)' +
- r'\s+(?P<self>\d+\.\d+)' +
- r'\s+(?P<descendants>\d+\.\d+)' +
- r'\s+(?:(?P<called>\d+)(?:\+(?P<called_self>\d+))?)?' +
- r'\s+(?P<name>\S.*?)' +
- r'(?:\s+<cycle\s(?P<cycle>\d+)>)?' +
- r'\s\[(\d+)\]$'
- )
- _cg_parent_re = re.compile(
- r'^\s+(?P<self>\d+\.\d+)?' +
- r'\s+(?P<descendants>\d+\.\d+)?' +
- r'\s+(?P<called>\d+)(?:/(?P<called_total>\d+))?' +
- r'\s+(?P<name>\S.*?)' +
- r'(?:\s+<cycle\s(?P<cycle>\d+)>)?' +
- r'\s\[(?P<index>\d+)\]$'
- )
- _cg_child_re = _cg_parent_re
- _cg_cycle_header_re = re.compile(
- r'^\[(?P<index>\d+)\]?' +
- r'\s+(?P<percentage_time>\d+\.\d+)' +
- r'\s+(?P<self>\d+\.\d+)' +
- r'\s+(?P<descendants>\d+\.\d+)' +
- r'\s+(?:(?P<called>\d+)(?:\+(?P<called_self>\d+))?)?' +
- r'\s+<cycle\s(?P<cycle>\d+)\sas\sa\swhole>' +
- r'\s\[(\d+)\]$'
- )
- _cg_cycle_member_re = re.compile(
- r'^\s+(?P<self>\d+\.\d+)?' +
- r'\s+(?P<descendants>\d+\.\d+)?' +
- r'\s+(?P<called>\d+)(?:\+(?P<called_self>\d+))?' +
- r'\s+(?P<name>\S.*?)' +
- r'(?:\s+<cycle\s(?P<cycle>\d+)>)?' +
- r'\s\[(?P<index>\d+)\]$'
- )
- _cg_sep_re = re.compile(r'^--+$')
- def parse_function_entry(self, lines):
- parents = []
- children = []
- while True:
- if not lines:
- sys.stderr.write('warning: unexpected end of entry\n')
- line = lines.pop(0)
- if line.startswith('['):
- break
- # read function parent line
- mo = self._cg_parent_re.match(line)
- if not mo:
- if self._cg_ignore_re.match(line):
- continue
- sys.stderr.write('warning: unrecognized call graph entry: %r\n' % line)
- else:
- parent = self.translate(mo)
- parents.append(parent)
- # read primary line
- mo = self._cg_primary_re.match(line)
- if not mo:
- sys.stderr.write('warning: unrecognized call graph entry: %r\n' % line)
- return
- else:
- function = self.translate(mo)
- while lines:
- line = lines.pop(0)
- # read function subroutine line
- mo = self._cg_child_re.match(line)
- if not mo:
- if self._cg_ignore_re.match(line):
- continue
- sys.stderr.write('warning: unrecognized call graph entry: %r\n' % line)
- else:
- child = self.translate(mo)
- children.append(child)
- function.parents = parents
- function.children = children
- self.functions[function.index] = function
- def parse_cycle_entry(self, lines):
- # read cycle header line
- line = lines[0]
- mo = self._cg_cycle_header_re.match(line)
- if not mo:
- sys.stderr.write('warning: unrecognized call graph entry: %r\n' % line)
- return
- cycle = self.translate(mo)
- # read cycle member lines
- cycle.functions = []
- for line in lines[1:]:
- mo = self._cg_cycle_member_re.match(line)
- if not mo:
- sys.stderr.write('warning: unrecognized call graph entry: %r\n' % line)
- continue
- call = self.translate(mo)
- cycle.functions.append(call)
- self.cycles[cycle.cycle] = cycle
- def parse_cg_entry(self, lines):
- if lines[0].startswith("["):
- self.parse_cycle_entry(lines)
- else:
- self.parse_function_entry(lines)
- def parse_cg(self):
- """Parse the call graph."""
- # skip call graph header
- while not self._cg_header_re.match(self.readline()):
- pass
- line = self.readline()
- while self._cg_header_re.match(line):
- line = self.readline()
- # process call graph entries
- entry_lines = []
- while line != '\014': # form feed
- if line and not line.isspace():
- if self._cg_sep_re.match(line):
- self.parse_cg_entry(entry_lines)
- entry_lines = []
- else:
- entry_lines.append(line)
- line = self.readline()
- def parse(self):
- self.parse_cg()
- self.fp.close()
- profile = Profile()
- profile[TIME] = 0.0
- cycles = {}
- for index in self.cycles:
- cycles[index] = Cycle()
- for entry in compat_itervalues(self.functions):
- # populate the function
- function = Function(entry.index, entry.name)
- function[TIME] = entry.self
- if entry.called is not None:
- function.called = entry.called
- if entry.called_self is not None:
- call = Call(entry.index)
- call[CALLS] = entry.called_self
- function.called += entry.called_self
- # populate the function calls
- for child in entry.children:
- call = Call(child.index)
- assert child.called is not None
- call[CALLS] = child.called
- if child.index not in self.functions:
- # NOTE: functions that were never called but were discovered by gprof's
- # static call graph analysis dont have a call graph entry so we need
- # to add them here
- missing = Function(child.index, child.name)
- function[TIME] = 0.0
- function.called = 0
- profile.add_function(missing)
- function.add_call(call)
- profile.add_function(function)
- if entry.cycle is not None:
- try:
- cycle = cycles[entry.cycle]
- except KeyError:
- sys.stderr.write('warning: <cycle %u as a whole> entry missing\n' % entry.cycle)
- cycle = Cycle()
- cycles[entry.cycle] = cycle
- cycle.add_function(function)
- profile[TIME] = profile[TIME] + function[TIME]
- for cycle in compat_itervalues(cycles):
- profile.add_cycle(cycle)
- # Compute derived events
- profile.validate()
- profile.ratio(TIME_RATIO, TIME)
- profile.call_ratios(CALLS)
- profile.integrate(TOTAL_TIME, TIME)
- profile.ratio(TOTAL_TIME_RATIO, TOTAL_TIME)
- return profile
- # Clone&hack of GprofParser for VTune Amplifier XE 2013 gprof-cc output.
- # Tested only with AXE 2013 for Windows.
- # - Use total times as reported by AXE.
- # - In the absence of call counts, call ratios are faked from the relative
- # proportions of total time. This affects only the weighting of the calls.
- # - Different header, separator, and end marker.
- # - Extra whitespace after function names.
- # - You get a full entry for <spontaneous>, which does not have parents.
- # - Cycles do have parents. These are saved but unused (as they are
- # for functions).
- # - Disambiguated "unrecognized call graph entry" error messages.
- # Notes:
- # - Total time of functions as reported by AXE passes the val3 test.
- # - CPU Time:Children in the input is sometimes a negative number. This
- # value goes to the variable descendants, which is unused.
- # - The format of gprof-cc reports is unaffected by the use of
- # -knob enable-call-counts=true (no call counts, ever), or
- # -show-as=samples (results are quoted in seconds regardless).
- class AXEParser(Parser):
- "Parser for VTune Amplifier XE 2013 gprof-cc report output."
- def __init__(self, fp):
- Parser.__init__(self)
- self.fp = fp
- self.functions = {}
- self.cycles = {}
- def readline(self):
- line = self.fp.readline()
- if not line:
- sys.stderr.write('error: unexpected end of file\n')
- sys.exit(1)
- line = line.rstrip('\r\n')
- return line
- _int_re = re.compile(r'^\d+$')
- _float_re = re.compile(r'^\d+\.\d+$')
- def translate(self, mo):
- """Extract a structure from a match object, while translating the types in the process."""
- attrs = {}
- groupdict = mo.groupdict()
- for name, value in compat_iteritems(groupdict):
- if value is None:
- value = None
- elif self._int_re.match(value):
- value = int(value)
- elif self._float_re.match(value):
- value = float(value)
- attrs[name] = (value)
- return Struct(attrs)
- _cg_header_re = re.compile(
- '^Index |'
- '^-----+ '
- )
- _cg_footer_re = re.compile(r'^Index\s+Function\s*$')
- _cg_primary_re = re.compile(
- r'^\[(?P<index>\d+)\]?' +
- r'\s+(?P<percentage_time>\d+\.\d+)' +
- r'\s+(?P<self>\d+\.\d+)' +
- r'\s+(?P<descendants>\d+\.\d+)' +
- r'\s+(?P<name>\S.*?)' +
- r'(?:\s+<cycle\s(?P<cycle>\d+)>)?' +
- r'\s+\[(\d+)\]' +
- r'\s*$'
- )
- _cg_parent_re = re.compile(
- r'^\s+(?P<self>\d+\.\d+)?' +
- r'\s+(?P<descendants>\d+\.\d+)?' +
- r'\s+(?P<name>\S.*?)' +
- r'(?:\s+<cycle\s(?P<cycle>\d+)>)?' +
- r'(?:\s+\[(?P<index>\d+)\]\s*)?' +
- r'\s*$'
- )
- _cg_child_re = _cg_parent_re
- _cg_cycle_header_re = re.compile(
- r'^\[(?P<index>\d+)\]?' +
- r'\s+(?P<percentage_time>\d+\.\d+)' +
- r'\s+(?P<self>\d+\.\d+)' +
- r'\s+(?P<descendants>\d+\.\d+)' +
- r'\s+<cycle\s(?P<cycle>\d+)\sas\sa\swhole>' +
- r'\s+\[(\d+)\]' +
- r'\s*$'
- )
- _cg_cycle_member_re = re.compile(
- r'^\s+(?P<self>\d+\.\d+)?' +
- r'\s+(?P<descendants>\d+\.\d+)?' +
- r'\s+(?P<name>\S.*?)' +
- r'(?:\s+<cycle\s(?P<cycle>\d+)>)?' +
- r'\s+\[(?P<index>\d+)\]' +
- r'\s*$'
- )
- def parse_function_entry(self, lines):
- parents = []
- children = []
- while True:
- if not lines:
- sys.stderr.write('warning: unexpected end of entry\n')
- return
- line = lines.pop(0)
- if line.startswith('['):
- break
- # read function parent line
- mo = self._cg_parent_re.match(line)
- if not mo:
- sys.stderr.write('warning: unrecognized call graph entry (1): %r\n' % line)
- else:
- parent = self.translate(mo)
- if parent.name != '<spontaneous>':
- parents.append(parent)
- # read primary line
- mo = self._cg_primary_re.match(line)
- if not mo:
- sys.stderr.write('warning: unrecognized call graph entry (2): %r\n' % line)
- return
- else:
- function = self.translate(mo)
- while lines:
- line = lines.pop(0)
- # read function subroutine line
- mo = self._cg_child_re.match(line)
- if not mo:
- sys.stderr.writ…
Large files files are truncated, but you can click here to view the full file