Ball-Larus implementation

Question

Is the implementation of the Ball-larus effective profile analysis algorithm available anywhere?

[The implementation in llvm would be more useful]

Here is the Citeseer reference to the original BL96 paper

Answer 1

There is already an implementation for Ball-Larus profile profiling in LLVM . Additional corrections in this area are requested .

Answer 2

All I could find is some pseudo code:

for all node n in reverse topological order do
  if n is a leaf then
     NumPaths(n) ← 1
  else
     NumPaths(n) ← 0
     for all edge e of the form n → m do
        Val(e) ← NumPaths(n)
        NumPaths(n) ← NumPaths(n) + NumPaths(m)
     end for
  end if
end for