Improved flow graphs
Get series with b4
b4 am [email protected]Versions newest first
- v1 Latest0 of 2 patches 3 repliesIn review
Patches in v1 No applies recorded yet
None of the 2 patches the cover letter announces are in this archive.
Reviews trailers per patch
No Reviewed-by, Acked-by or Tested-by trailers for v1 yet.
Cover letter [PATCH 0/2] Improved flow graphs
Dear all,
It doesn't look like this 0/2 made it the first time round...
These two patches are the first of several implementing improved graph generation for Sparse. Initially, I am dealing with straight-forward control flow. Forthcoming patches will add program dependency graphs (a control and data flow representation suitable for program slicing) and simple pointer alias analysis (for handling indirect calls).
I've tried to keep the C part of the flow graph relatively simple, and put the hard stuff (like return edges and subgraph processing) in post-processing scripts.
Example graph can be seen at
http://www.postman.org.uk/djs52/example.png, generated with
./graph validation/context.c | gvpr -f gvpr/return-paths | \
gvpr -f gvpr/subg-fwd -a good_while3 | dot -Tpng > /tmp/example.pngComments welcome.
Dan Sheridan.
Signature · 4 lines
Daniel Sheridan ([email protected]), Consultant Adelard LLP, College Building, Northampton Square, London EC1V 0HB, UK Tel: +44 (0)20 7490 9455, Fax: +44 (0)20 7490 9451, Web: http://www.adelard.com