Call Graph in C

Help with Interprocedural analysis in C ....


I'm looking for an algorithm which would be able to decide if a C program
contains recursion (static or dynamic) and to define the call graph.


It seems to be a hard job because of the dynamic function parameter
capabilities offered by C.


Ex :


int foo (ft, f)
int (* f)(); /* A pointer to function */
int (* ft[])(); /* An array of pointers to functions that return int */
{
int i = 0;


........
i = ....... ;
f( ..., ... ,..);
ft[i]( ..., ..., ...) ;
........
}


Someone who could give me some pointers ?


Gilles
--
Gilles Menez
Laboratoire d'informatique Signaux et Systemes
Universite de Nice Sophia Antipolis-CNRS
41, Bd Napoleon III
06041 Nice Cedex ---- France


E-mail: menez@mimosa.unice.fr
Ph: +33 93 21 79 54 Fax: +33 93 21 20 54
--

Return to the comp.compilers page.
Search the comp.compilers archives again.