🚀 go-pugleaf

You may want to have a look at qp/qpt.  Here are portion of the README:



	       QPT -- Quick Program Profiler and Tracer

     Copyright (c) 1991-92 by James R. Larus (larus@cs.wisc.edu).
			 ALL RIGHTS RESERVED.

[...]

This directory contains the source of QPT.  The QPT system is a fast
program profiler and tracing system.  A profiler counts the execution
frequency of basic blocks in a program (unlike the Unix commands prof
or gprof, which sample the program counter and obtain approximate
counts).  From these measurements, QPT can calculate the cost of any
statement or procedure in the program.  A tracing system records every
instruction execution and memory reference address.  QPT uses abstract
execution [1] and optimal tracing [2] to greatly reduce the cost of
tracing and the size of the trace files.

[...]

QPT can insert counters for profiling in two ways [2] The first
(called `slow') is to put a counter in every basic block.  The second
(called `quick') only puts counters in a small subset of the blocks.
The two methods usually produce identical results, however they can
differ slightly in some unusual cases.

[...]

Please report any bugs that you find.  I will try to fix them quickly.

James Larus
Computer Sciences Department
1210 West Dayton Street
University of Wisconsin
Madison, WI 53706 USA

608-262-9519
larus@cs.wisc.edu


[1] James R. Larus, "Abstract Execution: A Technique for Efficiently
Tracing Programs," Software Practice & Experience, v20, n12, p.
1241-1258, Dec. 1990.  Available as ae-tr.ps.Z from
primost.cs.wisc.edu:~ftp/pub.

[2] Thomas Ball and James R. Larus, "Optimally Profiling and Tracing
Programs," Principles of Programming Langauges (POPL 19), p. 59-70,
Jan 1992.  Available as opt-prof-trace.ps for from
primost.cs.wisc.edu:~ftp/pub.

-- 
Eric.