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.png Comments welcome. Dan Sheridan. -- Daniel Sheridan (djs@xxxxxxxxxxx), 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 - To unsubscribe from this list: send the line "unsubscribe linux-sparse" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
