class-composition.py

Go to the documentation of this file.

#! /usr/bin/env python
from __future__ import print_function
import re
stdcl = re.compile("^std::(.*)[^>]$")
stdptr = re.compile("(.*)_ptr$")
datacl = re.compile("^class ")
bfunc = re.compile("^function ")
mbcl = re.compile("(base|data) class")
farg = re.compile("(.*)\(\w+\)")
nsep = re.compile("\:\:")
topfunc = re.compile("::(produce|analyze|filter|beginLuminosityBlock|beginRun|beginStream)\(")
baseclass = re.compile("edm::(one::|stream::|global::)?ED(Producer|Filter|Analyzer)(Base)?")
getfunc = re.compile("edm::eventsetup::EventSetupRecord::get<.*>\((.*)&\) const")
handle = re.compile("(.*),?class edm::ES(.*)Handle<(.*)>")
statics = set()
toplevelfuncs = set()
onefuncs = set()
dataclassfuncs = set()
virtfuncs = set()
virtclasses = set()
badfuncs = set()
badclasses = set()
esdclasses = set()
dataclasses = set()
flaggedclasses = set()
memberclasses = set()
derivedclasses = set()
 
import networkx as nx
G=nx.DiGraph()
H=nx.DiGraph()
I=nx.DiGraph()
 
 
f = open('classes.txt.dumperall')
for line in f :
    if mbcl.search(line) :
        fields = line.split("'")
        if fields[2] == ' member data class ':
            if not stdcl.search(fields[2]) : H.add_edge(fields[1],fields[3],kind=fields[2])
        if fields[2] == ' templated member data class ':
            H.add_edge(fields[1],fields[5],kind=fields[3])
        if fields[2] == ' base class ':
            H.add_edge(fields[1],fields[3],kind=fields[2])
            I.add_edge(fields[3],fields[1],kind=' derived class')
f.close()
 
f = open('function-calls-db.txt')
 
for line in f :
    if not bfunc.search(line) : continue
    fields = line.split("'")
    if fields[2] == ' calls function ' :
        G.add_edge(fields[1],fields[3],kind=' calls function ')
        if getfunc.search(fields[3]) :
            dataclassfuncs.add(fields[3])
            m = getfunc.match(fields[3])
            n = handle.match(m.group(1))
            if n : o = n.group(3)
            else : o = m.group(1)
            p = re.sub("class ","",o)
            dataclass = re.sub("struct ","",p)
            dataclasses.add(dataclass)
    if fields[2] == ' overrides function ' :
        if baseclass.search(fields[3]) :
            G.add_edge(fields[1],fields[3],kind=' overrides function ')
            if topfunc.search(fields[3]) : toplevelfuncs.add(fields[1])
        else : G.add_edge(fields[3],fields[1], kind=' calls override function ')
    if fields[2] == ' static variable ' :
        G.add_edge(fields[1],fields[3],kind=' static variable ')
        statics.add(fields[3])
f.close()
 
visited = set()
nodes = sorted(dataclasses)
for node in nodes:
    if node in visited:
        continue
    visited.add(node)           
    if node in H : stack = [(node,iter(H[node]))]
    if node in I :
        Q=nx.dfs_preorder_nodes(I,node)
        for q in Q:
            print("class '"+q+"'")
            if q in H : 
                stack.append(  ( q, iter( H[q] ) ) )
    while stack:
        parent,children = stack[-1]
        print("class '"+parent+"'")
        try:
            child = next(children)
            if child not in visited:
                visited.add(child)
                if not stdcl.search(child): 
                    print("class '"+child+"'")
                    stack.append( ( child, iter( H[child] ) ) )
                    kind=H[parent][child]['kind']
                    print(parent, kind, child) 
                    if stdptr.search(kind):
                        if child in I :
                            Q=nx.dfs_preorder_nodes(I,child)
                            for q in Q :
                                print("class '"+q+"'")
                                if q in H : 
                                    stack.append(  ( q, iter( H[q] ) ) )
        except StopIteration:
            stack.pop()