The approach is simple (I've implemented it, and so have many others): It takes three steps. Steps 1 and 3 are parellisable, and 2 should be very quick: 1. Co

The approach is simple (I've implemented it, and so have many others): It takes three steps. Steps 1 and 3 are parellisable, and 2 should be very quick: 1. Convert every file in the repository to an AST, and perform static reflection on that AST. 2. Calcuate the inheritance graph for all the functions, classes etc. you've collected 3. Analyse every file, using the pre-calculated list of functions and classes available in each case.