|Regions in Program Flow email@example.com (K.Shyam) (2005-10-20)|
|Re: Regions in Program Flow firstname.lastname@example.org (shrey) (2005-10-23)|
|Re: Regions in Program Flow email@example.com (dz) (2005-10-26)|
|Date:||23 Oct 2005 00:33:01 -0400|
Given a CFG this should not be hard to implement inside a compiler. If
you are looking to avoid the effort...
I dont know of any commercial compilers dumping anything like
this. I have read abt ORC (link is below) using such information. The
other option might be using compilers dump of call graph and loop tree
for each function. Any compiler with even some basic loop optimizations
unrolling should dump such information example ORCE,SUIF, Gcc assuming
you are looking for free solutions. Your other chance might be to find
researchers who have used such region graphs for their research. A
couple of papers that i myself have come across are
3. Some speculative precomputation paper ( there arent many
even if u search every1, but this stuff is old,)
The first one comes from the ORC guys, that I wud say is u;r best bet
> I am intrested in finding out regions of a program, those which are
> atomic units of execution. I was thinking of using the concept of
> "phases". Loop nest is also another way. Are there some other ways of
> obtaining these regions ?
Return to the
Search the comp.compilers archives again.