1000 Reprinted from Proceedings of the ACM SIGPLAN '82 Symposium on Compiler Construction SIGPLAN Notices 17, 6 (June 1982), pp 120-126\*[\(dg\*] .(f \(dgCopyright 1982 ACM 0-89791-074-5/82/006/0120 $00.75

Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and / or specific permission. .)f \s+2gprof: a Call Graph Execution Profiler\s-2\** .(f \**This work was supported by grant MCS80-05144 from the National Science Foundation. .)f by Susan L. Graham Peter B. Kessler Marshall K. McKusick Computer Science Division Electrical Engineering and Computer Science Department University of California, Berkeley Berkeley, California 94720

0 .sh 0 "Abstract" .pp Large complex programs are composed of many small routines that implement abstractions for the routines that call them. To be useful, an execution profiler must attribute execution time in a way that is significant for the logical structure of a program as well as for its textual decomposition. This data must then be displayed to the user in a convenient and informative way. The gprof profiler accounts for the running time of called routines in the running time of the routines that call them. The design and use of this profiler is described.