Parsing branch data from BIT

I've an old article on using data from BIT to examine the behaviour of branches in code, and using that to see whether a training workload is representative of the real work the application does. The article contains a couple of scripts for parsing the output from BIT to generate the appropriate results and graphs.

I've just been helping out in looking at branch data once again, this time breaking down the branch probabilities by the condition codes of the branch. The code to do this is relatively easy, but its annoying to have to write it yourself, this is my code for breaking down branch frequencies by condition code. The output is somewhat cryptic, for each condition code it will print out columns for whether the branch was annulling (a) or not (n), and predicted taken (pt), predicted not taken (pn), or not predicted(no).

Comments:

Post a Comment:
Comments are closed for this entry.
About

Darryl Gove is a senior engineer in the Solaris Studio team, working on optimising applications and benchmarks for current and future processors. He is also the author of the books:
Multicore Application Programming
Solaris Application Programming
The Developer's Edge

Search

Categories
Archives
« April 2014
SunMonTueWedThuFriSat
  
1
2
5
6
8
9
10
12
13
14
15
18
19
20
21
22
23
24
25
26
27
28
29
30
   
       
Today
Bookmarks
The Developer's Edge
Solaris Application Programming
Publications
Webcasts
Presentations
OpenSPARC Book
Multicore Application Programming
Docs