/usr/share/pyshared/runsnakerun/pstatsloader.py is in runsnakerun 2.0.4-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | """Module to load cProfile/profile records as a tree of records"""
import pstats, os, logging
log = logging.getLogger(__name__)
from gettext import gettext as _
TREE_CALLS, TREE_FILES = range( 2 )
class PStatsLoader( object ):
"""Load profiler statistics from PStats (cProfile) files"""
def __init__( self, *filenames ):
self.filename = filenames
self.rows = {}
self.roots = {}
self.location_rows = {}
self.stats = pstats.Stats( *filenames )
self.tree = self.load( self.stats.stats )
self.location_tree = l = self.load_location( )
ROOTS = ['functions','location']
def get_root( self, key ):
"""Retrieve a given declared root by root-type-key"""
if key not in self.roots:
function = getattr( self, 'load_%s'%(key,) )()
self.roots[key] = function
return self.roots[key]
def get_rows( self, key ):
"""Get the set of rows for the type-key"""
if key not in self.roots:
self.get_root( key )
if key == 'location':
return self.location_rows
else:
return self.rows
def get_adapter( self, key ):
from runsnakerun import pstatsadapter
if key == 'functions':
return pstatsadapter.PStatsAdapter()
elif key == 'location':
return pstatsadapter.DirectoryViewAdapter()
else:
raise KeyError( """Unknown root type %s"""%( key, ))
def load( self, stats ):
"""Build a squaremap-compatible model from a pstats class"""
rows = self.rows
for func, raw in stats.iteritems():
try:
rows[func] = row = PStatRow( func,raw )
except ValueError, err:
log.info( 'Null row: %s', func )
for row in rows.itervalues():
row.weave( rows )
return self.find_root( rows )
def load_functions( self ):
"""Load function records from the pstats file"""
return self.load()
def find_root( self, rows ):
"""Attempt to find/create a reasonable root node from list/set of rows
rows -- key: PStatRow mapping
TODO: still need more robustness here, particularly in the case of
threaded programs. Should be tracing back each row to root, breaking
cycles by sorting on cumulative time, and then collecting the traced
roots (or, if they are all on the same root, use that).
"""
maxes = sorted( rows.values(), key = lambda x: x.cumulative )
if not maxes:
raise RuntimeError( """Null results!""" )
root = maxes[-1]
roots = [root]
for key,value in rows.items():
if not value.parents:
log.debug( 'Found node root: %s', value )
if value not in roots:
roots.append( value )
if len(roots) > 1:
root = PStatGroup(
directory='*',
filename='*',
name=_("<profiling run>"),
children= roots,
)
root.finalize()
self.rows[ root.key ] = root
self.roots['functions'] = root
return root
def load_location( self ):
"""Load the location root record (loading regular records if necessary)"""
if not self.rows:
self.load()
return self._load_location()
def _load_location( self ):
"""Build a squaremap-compatible model for location-based hierarchy"""
directories = {}
files = {}
root = PStatLocation( '/', 'PYTHONPATH' )
self.location_rows = self.rows.copy()
for child in self.rows.values():
current = directories.get( child.directory )
directory, filename = child.directory, child.filename
if current is None:
if directory == '':
current = root
else:
current = PStatLocation( directory, '' )
self.location_rows[ current.key ] = current
directories[ directory ] = current
if filename == '~':
filename = '<built-in>'
file_current = files.get( (directory,filename) )
if file_current is None:
file_current = PStatLocation( directory, filename )
self.location_rows[ file_current.key ] = file_current
files[ (directory,filename) ] = file_current
current.children.append( file_current )
file_current.children.append( child )
# now link the directories...
for key,value in directories.items():
if value is root:
continue
found = False
while key:
new_key,rest = os.path.split( key )
if new_key == key:
break
key = new_key
parent = directories.get( key )
if parent:
if value is not parent:
parent.children.append( value )
found = True
break
if not found:
root.children.append( value )
# lastly, finalize all of the directory records...
root.finalize()
return root
class BaseStat( object ):
def recursive_distinct( self, already_done=None, attribute='children' ):
if already_done is None:
already_done = {}
for child in getattr(self,attribute,()):
if not already_done.has_key( child ):
already_done[child] = True
yield child
for descendent in child.recursive_distinct( already_done=already_done, attribute=attribute ):
yield descendent
def descendants( self ):
return list( self.recursive_distinct( attribute='children' ))
def ancestors( self ):
return list( self.recursive_distinct( attribute='parents' ))
class PStatRow( BaseStat ):
"""Simulates a HotShot profiler record using PStats module"""
def __init__( self, key, raw ):
self.children = []
self.parents = []
file,line,func = self.key = key
try:
dirname,basename = os.path.dirname(file),os.path.basename(file)
except ValueError, err:
dirname = ''
basename = file
nc, cc, tt, ct, callers = raw
if nc == cc == tt == ct == 0:
raise ValueError( 'Null stats row' )
(
self.calls, self.recursive, self.local, self.localPer,
self.cumulative, self.cumulativePer, self.directory,
self.filename, self.name, self.lineno
) = (
nc,
cc,
tt,
tt/(cc or 0.00000000000001),
ct,
ct/(nc or 0.00000000000001),
dirname,
basename,
func,
line,
)
self.callers = callers
def __repr__( self ):
return 'PStatRow( %r,%r,%r,%r, %s )'%(self.directory, self.filename, self.lineno, self.name, len(self.children))
def add_child( self, child ):
self.children.append( child )
def weave( self, rows ):
for caller,data in self.callers.iteritems():
# data is (cc,nc,tt,ct)
parent = rows.get( caller )
if parent:
self.parents.append( parent )
parent.children.append( self )
def child_cumulative_time( self, child ):
total = self.cumulative
if total:
try:
(cc,nc,tt,ct) = child.callers[ self.key ]
except TypeError, err:
ct = child.callers[ self.key ]
return float(ct)/total
return 0
class PStatGroup( BaseStat ):
"""A node/record that holds a group of children but isn't a raw-record based group"""
# if LOCAL_ONLY then only take the raw-record's local values, not cumulative values
LOCAL_ONLY = False
def __init__( self, directory='', filename='', name='', children=None, local_children=None, tree=TREE_CALLS ):
self.directory = directory
self.filename = filename
self.name = ''
self.key = (directory,filename,name)
self.children = children or []
self.parents = []
self.local_children = local_children or []
self.tree = tree
def __repr__( self ):
return '%s( %r,%r,%s )'%(self.__class__.__name__,self.directory, self.filename, self.name)
def finalize( self, already_done=None ):
"""Finalize our values (recursively) taken from our children"""
if already_done is None:
already_done = {}
if already_done.has_key( self ):
return True
already_done[self] = True
self.filter_children()
children = self.children
for child in children:
if hasattr( child, 'finalize' ):
child.finalize( already_done)
child.parents.append( self )
self.calculate_totals( self.children, self.local_children )
def filter_children( self ):
"""Filter our children into regular and local children sets (if appropriate)"""
def calculate_totals( self, children, local_children=None ):
"""Calculate our cumulative totals from children and/or local children"""
for field,local_field in (('recursive','calls'),('cumulative','local')):
values = []
for child in children:
if isinstance( child, PStatGroup ) or not self.LOCAL_ONLY:
values.append( getattr( child, field, 0 ) )
elif isinstance( child, PStatRow ) and self.LOCAL_ONLY:
values.append( getattr( child, local_field, 0 ) )
value = sum( values )
setattr( self, field, value )
if self.recursive:
self.cumulativePer = self.cumulative/float(self.recursive)
else:
self.recursive = 0
if local_children:
for field in ('local','calls'):
value = sum([ getattr( child, field, 0 ) for child in children] )
setattr( self, field, value )
if self.calls:
self.localPer = self.local / self.calls
else:
self.local = 0
self.calls = 0
self.localPer = 0
class PStatLocation( PStatGroup ):
"""A row that represents a hierarchic structure other than call-patterns
This is used to create a file-based hierarchy for the views
Children with the name <module> are our "empty" space,
our totals are otherwise just the sum of our children.
"""
LOCAL_ONLY = True
def __init__( self, directory, filename, tree=TREE_FILES):
super( PStatLocation, self ).__init__( directory=directory, filename=filename, name='package', tree=tree )
def filter_children( self ):
"""Filter our children into regular and local children sets"""
real_children = []
for child in self.children:
if child.name == '<module>':
self.local_children.append( child )
else:
real_children.append( child )
self.children = real_children
if __name__ == "__main__":
import sys
p = PStatsLoader( sys.argv[1] )
assert p.tree
print p.tree
|