3 # Class for profiling python code. rev 1.0 6/2/94
5 # Based on prior profile module by Sjoerd Mullender...
6 # which was hacked somewhat by: Guido van Rossum
8 # See profile.doc for more information
10 """Class for profiling Python code."""
12 # Copyright 1994, by InfoSeek Corporation, all rights reserved.
13 # Written by James Roskind
15 # Permission to use, copy, modify, and distribute this Python software
16 # and its associated documentation for any purpose (subject to the
17 # restriction in the following sentence) without fee is hereby granted,
18 # provided that the above copyright notice appears in all copies, and
19 # that both that copyright notice and this permission notice appear in
20 # supporting documentation, and that the name of InfoSeek not be used in
21 # advertising or publicity pertaining to distribution of the software
22 # without specific, written prior permission. This permission is
23 # explicitly restricted to the copying and modification of the software
24 # to remain in Python, compiled Python, or other languages (such as C)
25 # wherein the modified or derived code is exclusively imported into a
28 # INFOSEEK CORPORATION DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
29 # SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
30 # FITNESS. IN NO EVENT SHALL INFOSEEK CORPORATION BE LIABLE FOR ANY
31 # SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER
32 # RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF
33 # CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
34 # CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
43 __all__
= ["run","help","Profile"]
45 # Sample timer for use with
49 # i_count = i_count + 1
51 #itimes = integer_timer # replace with C coded timer returning integers
53 #**************************************************************************
54 # The following are the static member functions for the profiler class
55 # Note that an instance of Profile() is *not* needed to call them.
56 #**************************************************************************
58 def run(statement
, filename
=None):
59 """Run statement under profiler optionally saving results in filename
61 This function takes a single argument that can be passed to the
62 "exec" statement, and an optional file name. In all cases this
63 routine attempts to "exec" its first argument and gather profiling
64 statistics from the execution. If no file name is present, then this
65 function automatically prints a simple profiling report, sorted by the
66 standard name string (file/line/function-name) that is presented in
71 prof
= prof
.run(statement
)
74 if filename
is not None:
75 prof
.dump_stats(filename
)
77 return prof
.print_stats()
81 for dirname
in sys
.path
:
82 fullname
= os
.path
.join(dirname
, 'profile.doc')
83 if os
.path
.exists(fullname
):
84 sts
= os
.system('${PAGER-more} '+fullname
)
85 if sts
: print '*** Pager exit status:', sts
88 print 'Sorry, can\'t find the help file "profile.doc"',
89 print 'along the Python search path'
95 self.cur is always a tuple. Each such tuple corresponds to a stack
96 frame that is currently active (self.cur[-2]). The following are the
97 definitions of its members. We use this external "parallel stack" to
98 avoid contaminating the program that we are profiling. (old profiler
99 used to write into the frames local dictionary!!) Derived classes
100 can change the definition of some entries, as long as they leave
103 [ 0] = Time that needs to be charged to the parent frame's function.
104 It is used so that a function call will not have to access the
105 timing data for the parent frame.
106 [ 1] = Total time spent in this frame's function, excluding time in
107 subfunctions (this latter is tallied in cur[2]).
108 [ 2] = Total time spent in subfunctions, excluding time executing the
109 frame's function (this latter is tallied in cur[1]).
110 [-3] = Name of the function that corresponds to this frame.
111 [-2] = Actual frame that we correspond to (used to sync exception handling)
112 [-1] = Our parent 6-tuple (corresponds to frame.f_back)
114 Timing data for each function is stored as a 5-tuple in the dictionary
115 self.timings[]. The index is always the name stored in self.cur[4].
116 The following are the definitions of the members:
118 [0] = The number of times this function was called, not counting direct
119 or indirect recursion,
120 [1] = Number of times this function appears on the stack, minus one
121 [2] = Total time spent internal to this function
122 [3] = Cumulative time that this function was present on the stack. In
123 non-recursive functions, this is the total execution time from start
124 to finish of each invocation of a function, including time spent in
126 [4] = A dictionary indicating for each function name, the number of times
130 def __init__(self
, timer
=None):
136 'call' : self
.trace_dispatch_call
, \
137 'return' : self
.trace_dispatch_return
, \
138 'exception': self
.trace_dispatch_exception
, \
144 self
.timer
= MacOS
.GetTicks
145 self
.dispatcher
= self
.trace_dispatch_mac
146 self
.get_time
= self
.get_time_mac
147 elif hasattr(time
, 'clock'):
148 self
.timer
= time
.clock
149 self
.dispatcher
= self
.trace_dispatch_i
150 elif hasattr(os
, 'times'):
151 self
.timer
= os
.times
152 self
.dispatcher
= self
.trace_dispatch
154 self
.timer
= time
.time
155 self
.dispatcher
= self
.trace_dispatch_i
158 t
= self
.timer() # test out timer function
161 self
.dispatcher
= self
.trace_dispatch
163 self
.dispatcher
= self
.trace_dispatch_l
165 self
.dispatcher
= self
.trace_dispatch_i
166 self
.t
= self
.get_time()
167 self
.simulate_call('profiler')
170 def get_time(self
): # slow simulation of method to acquire time
172 if type(t
) == type(()) or type(t
) == type([]):
173 t
= reduce(lambda x
,y
: x
+y
, t
, 0)
176 def get_time_mac(self
):
177 return self
.timer()/60.0
179 # Heavily optimized dispatch routine for os.times() timer
181 def trace_dispatch(self
, frame
, event
, arg
):
183 t
= t
[0] + t
[1] - self
.t
# No Calibration constant
184 # t = t[0] + t[1] - self.t - .00053 # Calibration constant
186 if self
.dispatch
[event
](frame
,t
):
191 self
.t
= r
[0] + r
[1] - t
# put back unrecorded delta
196 # Dispatch routine for best timer program (return = scalar integer)
198 def trace_dispatch_i(self
, frame
, event
, arg
):
199 t
= self
.timer() - self
.t
# - 1 # Integer calibration constant
200 if self
.dispatch
[event
](frame
,t
):
201 self
.t
= self
.timer()
203 self
.t
= self
.timer() - t
# put back unrecorded delta
206 # Dispatch routine for macintosh (timer returns time in ticks of 1/60th second)
208 def trace_dispatch_mac(self
, frame
, event
, arg
):
209 t
= self
.timer()/60.0 - self
.t
# - 1 # Integer calibration constant
210 if self
.dispatch
[event
](frame
,t
):
211 self
.t
= self
.timer()/60.0
213 self
.t
= self
.timer()/60.0 - t
# put back unrecorded delta
217 # SLOW generic dispatch routine for timer returning lists of numbers
219 def trace_dispatch_l(self
, frame
, event
, arg
):
220 t
= self
.get_time() - self
.t
222 if self
.dispatch
[event
](frame
,t
):
223 self
.t
= self
.get_time()
225 self
.t
= self
.get_time()-t
# put back unrecorded delta
229 def trace_dispatch_exception(self
, frame
, t
):
230 rt
, rtt
, rct
, rfn
, rframe
, rcur
= self
.cur
231 if (rframe
is not frame
) and rcur
:
232 return self
.trace_dispatch_return(rframe
, t
)
233 self
.cur
= rt
, rtt
+t
, rct
, rfn
, rframe
, rcur
237 def trace_dispatch_call(self
, frame
, t
):
238 if self
.cur
and frame
.f_back
is not self
.cur
[-2]:
239 rt
, rtt
, rct
, rfn
, rframe
, rcur
= self
.cur
240 if not isinstance(rframe
, Profile
.fake_frame
):
241 if rframe
.f_back
is not frame
.f_back
:
242 print rframe
, rframe
.f_back
243 print frame
, frame
.f_back
244 raise "Bad call", self
.cur
[-3]
245 self
.trace_dispatch_return(rframe
, 0)
246 if self
.cur
and frame
.f_back
is not self
.cur
[-2]:
247 raise "Bad call[2]", self
.cur
[-3]
249 fn
= (fcode
.co_filename
, fcode
.co_firstlineno
, fcode
.co_name
)
250 self
.cur
= (t
, 0, 0, fn
, frame
, self
.cur
)
251 timings
= self
.timings
252 if timings
.has_key(fn
):
253 cc
, ns
, tt
, ct
, callers
= timings
[fn
]
254 timings
[fn
] = cc
, ns
+ 1, tt
, ct
, callers
256 timings
[fn
] = 0, 0, 0, 0, {}
259 def trace_dispatch_return(self
, frame
, t
):
260 if frame
is not self
.cur
[-2]:
261 if frame
is self
.cur
[-2].f_back
:
262 self
.trace_dispatch_return(self
.cur
[-2], 0)
264 raise "Bad return", self
.cur
[-3]
266 # Prefix "r" means part of the Returning or exiting frame
267 # Prefix "p" means part of the Previous or older frame
269 rt
, rtt
, rct
, rfn
, frame
, rcur
= self
.cur
273 pt
, ptt
, pct
, pfn
, pframe
, pcur
= rcur
274 self
.cur
= pt
, ptt
+rt
, pct
+sft
, pfn
, pframe
, pcur
276 timings
= self
.timings
277 cc
, ns
, tt
, ct
, callers
= timings
[rfn
]
281 if callers
.has_key(pfn
):
282 callers
[pfn
] = callers
[pfn
] + 1 # hack: gather more
283 # stats such as the amount of time added to ct courtesy
284 # of this specific call, and the contribution to cc
285 # courtesy of this call.
288 timings
[rfn
] = cc
, ns
- 1, tt
+rtt
, ct
, callers
292 # The next few function play with self.cmd. By carefully preloading
293 # our parallel stack, we can force the profiled result to include
294 # an arbitrary string as the name of the calling function.
295 # We use self.cmd as that string, and the resulting stats look
298 def set_cmd(self
, cmd
):
299 if self
.cur
[-1]: return # already set
301 self
.simulate_call(cmd
)
304 def __init__(self
, filename
, line
, name
):
305 self
.co_filename
= filename
308 self
.co_firstlineno
= 0
311 return repr((self
.co_filename
, self
.co_line
, self
.co_name
))
314 def __init__(self
, code
, prior
):
318 def simulate_call(self
, name
):
319 code
= self
.fake_code('profile', 0, name
)
321 pframe
= self
.cur
[-2]
324 frame
= self
.fake_frame(code
, pframe
)
325 a
= self
.dispatch
['call'](frame
, 0)
328 # collect stats from pending stack, including getting final
329 # timings for self.cmd frame.
331 def simulate_cmd_complete(self
):
332 t
= self
.get_time() - self
.t
334 # We *can* cause assertion errors here if
335 # dispatch_trace_return checks for a frame match!
336 a
= self
.dispatch
['return'](self
.cur
[-2], t
)
338 self
.t
= self
.get_time() - t
341 def print_stats(self
):
343 pstats
.Stats(self
).strip_dirs().sort_stats(-1). \
346 def dump_stats(self
, file):
349 marshal
.dump(self
.stats
, f
)
352 def create_stats(self
):
353 self
.simulate_cmd_complete()
354 self
.snapshot_stats()
356 def snapshot_stats(self
):
358 for func
in self
.timings
.keys():
359 cc
, ns
, tt
, ct
, callers
= self
.timings
[func
]
360 callers
= callers
.copy()
362 for func_caller
in callers
.keys():
363 nc
= nc
+ callers
[func_caller
]
364 self
.stats
[func
] = cc
, nc
, tt
, ct
, callers
367 # The following two methods can be called by clients to use
368 # a profiler to profile a statement, given as a string.
372 dict = __main__
.__dict
__
373 return self
.runctx(cmd
, dict, dict)
375 def runctx(self
, cmd
, globals, locals):
377 sys
.setprofile(self
.dispatcher
)
379 exec cmd
in globals, locals
384 # This method is more useful to profile a single function call.
385 def runcall(self
, func
, *args
):
387 sys
.setprofile(self
.dispatcher
)
389 return apply(func
, args
)
394 #******************************************************************
395 # The following calculates the overhead for using a profiler. The
396 # problem is that it takes a fair amount of time for the profiler
397 # to stop the stopwatch (from the time it receives an event).
398 # Similarly, there is a delay from the time that the profiler
399 # re-starts the stopwatch before the user's code really gets to
400 # continue. The following code tries to measure the difference on
401 # a per-event basis. The result can the be placed in the
402 # Profile.dispatch_event() routine for the given platform. Note
403 # that this difference is only significant if there are a lot of
404 # events, and relatively little user code per event. For example,
405 # code with small functions will typically benefit from having the
406 # profiler calibrated for the current platform. This *could* be
407 # done on the fly during init() time, but it is not worth the
408 # effort. Also note that if too large a value specified, then
409 # execution time on some functions will actually appear as a
410 # negative number. It is *normal* for some functions (with very
411 # low call counts) to have such negative stats, even if the
412 # calibration figure is "correct."
414 # One alternative to profile-time calibration adjustments (i.e.,
415 # adding in the magic little delta during each event) is to track
416 # more carefully the number of events (and cumulatively, the number
417 # of events during sub functions) that are seen. If this were
418 # done, then the arithmetic could be done after the fact (i.e., at
419 # display time). Currently, we track only call/return events.
420 # These values can be deduced by examining the callees and callers
421 # vectors for each functions. Hence we *can* almost correct the
422 # internal time figure at print time (note that we currently don't
423 # track exception event processing counts). Unfortunately, there
424 # is currently no similar information for cumulative sub-function
425 # time. It would not be hard to "get all this info" at profiler
426 # time. Specifically, we would have to extend the tuples to keep
427 # counts of this in each frame, and then extend the defs of timing
428 # tuples to include the significant two figures. I'm a bit fearful
429 # that this additional feature will slow the heavily optimized
430 # event/time ratio (i.e., the profiler would run slower, fur a very
431 # low "value added" feature.)
433 # Plugging in the calibration constant doesn't slow down the
434 # profiler very much, and the accuracy goes way up.
435 #**************************************************************
437 def calibrate(self
, m
):
438 # Modified by Tim Peters
446 #print "Simple =", my_simple,
455 # print "Instrumented =", my_inst
456 avg_cost
= (my_inst
- my_simple
)/m
457 #print "Delta/call =", avg_cost, "(profiler fixup constant)"
460 # simulate a program with no profiler activity
465 # simulate a program with call/return event processing
466 def instrumented(self
):
468 self
.profiler_simulation(a
, a
, a
)
470 # simulate an event processing activity (from user's perspective)
471 def profiler_simulation(self
, x
, y
, z
):
478 class OldProfile(Profile
):
479 """A derived profiler that simulates the old style profile, providing
480 errant results on recursive functions. The reason for the usefulness of
481 this profiler is that it runs faster (i.e., less overhead). It still
482 creates all the caller stats, and is quite useful when there is *no*
483 recursion in the user's code.
485 This code also shows how easy it is to create a modified profiler.
488 def trace_dispatch_exception(self
, frame
, t
):
489 rt
, rtt
, rct
, rfn
, rframe
, rcur
= self
.cur
490 if rcur
and not rframe
is frame
:
491 return self
.trace_dispatch_return(rframe
, t
)
494 def trace_dispatch_call(self
, frame
, t
):
497 self
.cur
= (t
, 0, 0, fn
, frame
, self
.cur
)
498 if self
.timings
.has_key(fn
):
499 tt
, ct
, callers
= self
.timings
[fn
]
500 self
.timings
[fn
] = tt
, ct
, callers
502 self
.timings
[fn
] = 0, 0, {}
505 def trace_dispatch_return(self
, frame
, t
):
506 rt
, rtt
, rct
, rfn
, frame
, rcur
= self
.cur
510 pt
, ptt
, pct
, pfn
, pframe
, pcur
= rcur
511 self
.cur
= pt
, ptt
+rt
, pct
+sft
, pfn
, pframe
, pcur
513 tt
, ct
, callers
= self
.timings
[rfn
]
514 if callers
.has_key(pfn
):
515 callers
[pfn
] = callers
[pfn
] + 1
518 self
.timings
[rfn
] = tt
+rtt
, ct
+ sft
, callers
523 def snapshot_stats(self
):
525 for func
in self
.timings
.keys():
526 tt
, ct
, callers
= self
.timings
[func
]
527 callers
= callers
.copy()
529 for func_caller
in callers
.keys():
530 nc
= nc
+ callers
[func_caller
]
531 self
.stats
[func
] = nc
, nc
, tt
, ct
, callers
535 class HotProfile(Profile
):
536 """The fastest derived profile example. It does not calculate
537 caller-callee relationships, and does not calculate cumulative
538 time under a function. It only calculates time spent in a
539 function, so it runs very quickly due to its very low overhead.
542 def trace_dispatch_exception(self
, frame
, t
):
543 rt
, rtt
, rfn
, rframe
, rcur
= self
.cur
544 if rcur
and not rframe
is frame
:
545 return self
.trace_dispatch_return(rframe
, t
)
548 def trace_dispatch_call(self
, frame
, t
):
549 self
.cur
= (t
, 0, frame
, self
.cur
)
552 def trace_dispatch_return(self
, frame
, t
):
553 rt
, rtt
, frame
, rcur
= self
.cur
557 pt
, ptt
, pframe
, pcur
= rcur
558 self
.cur
= pt
, ptt
+rt
, pframe
, pcur
560 if self
.timings
.has_key(rfn
):
561 nc
, tt
= self
.timings
[rfn
]
562 self
.timings
[rfn
] = nc
+ 1, rt
+ rtt
+ tt
564 self
.timings
[rfn
] = 1, rt
+ rtt
569 def snapshot_stats(self
):
571 for func
in self
.timings
.keys():
572 nc
, tt
= self
.timings
[func
]
573 self
.stats
[func
] = nc
, nc
, tt
, 0, {}
577 #****************************************************************************
579 print 'Report generating functions are in the "pstats" module\a'
582 # When invoked as main program, invoke the profiler on a script
583 if __name__
== '__main__':
587 print "usage: profile.py scriptfile [arg] ..."
590 filename
= sys
.argv
[1] # Get script filename
592 del sys
.argv
[0] # Hide "profile.py" from argument list
594 # Insert script directory in front of module search path
595 sys
.path
.insert(0, os
.path
.dirname(filename
))
597 run('execfile(' + `filename`
+ ')')