24 Jul 2002 01:49:57 -0400

Related articles |
---|

Finding the set of recursive calls jeremy.wright@microfocus.com (Jeremy Wright) (2002-07-21) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-07-24) |

Re: Finding the set of recursive calls dietz@dls.net (Paul F. Dietz) (2002-07-24) |

Re: Finding the set of recursive calls Martin.Ward@durham.ac.uk (Martin Ward) (2002-07-24) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-07-24) |

Re: Finding the set of recursive calls jeremy.wright@microfocus.com (Jeremy Wright) (2002-07-25) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-07-31) |

Re: Finding the set of recursive calls haberg@matematik.su.se (Hans Aberg) (2002-08-04) |

Re: Finding the set of recursive calls vbdis@aol.com (VBDis) (2002-08-10) |

[2 later articles] |

From: | "Paul F. Dietz" <dietz@dls.net> |

Newsgroups: | comp.compilers |

Date: | 24 Jul 2002 01:49:57 -0400 |

Organization: | Giganews.Com - Premium News Outsourcing |

References: | 02-07-084 |

Keywords: | analysis, optimize |

Posted-Date: | 24 Jul 2002 01:49:57 EDT |

Jeremy Wright wrote:

*> Given complete call information, is there an algorithm to determine*

*> which functions can be called recursively ?*

Absent complications like function pointers, these are precisely the

functions that either (1) call themselves, or (2) are in a strongly

connected component in the call graph with more than one node.

SCCs can be computed in linear time by well known algorithms.

Paul

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.