private void buildRevCallGraph(){
  rev_call_graph=new HashMap<Integer,LinkedList<CgEdge>>();
  for (int i=0; i < n_func; ++i) {
    CgEdge p=call_graph[i];
    while (p != null) {
      LinkedList<CgEdge> list=rev_call_graph.get(p.t);
      if (list == null) {
        list=new LinkedList<CgEdge>();
        rev_call_graph.put(p.t,list);
      }
      list.add(p);
      p=p.next;
    }
  }
}

private void buildRevCallGraph ( ) { rev_call_graph = new HashMap < Integer , LinkedList < CgEdge > > ( ) ; for ( int i = 0 ; i < n_func ; ++ i ) { CgEdge p = call_graph [ i ] ; while ( p != null ) { LinkedList < CgEdge > list = rev_call_graph . get ( p . t ) ; if ( list == null ) { list = new LinkedList < CgEdge > ( ) ; rev_call_graph . put ( p . t , list ) ; } list . add ( p ) ; p = p . next ; } } }
the reversed call graph might be used by evaluating queries .
