Re: Limiting whole-program analysis

[Helge Jensen <jensen@slog.dk>]

Helge Jensen wrote:

> Helge Jensen wrote:
>
> > What should I do? where is it described what I should do to stop the 
> > transitive traversal? any hints appreciated.

I'm wondering about the performance of the Points-to analysis, do these 
timings (on a P4M-1700Mhz, 1G ram) seem reasonable to you?

Analyzing the program "A.java":

  public class A { public static void main(String[] args) { } }

I get the outputs:

$ java -Xmx400m soot.Main -w -p cg safe-forname:false -p cg.spark 
on,field-based:true -app A -src-prec java
Soot started on Thu Jun 03 00:34:26 CEST 2004
[Call Graph] For information on where the call graph may be incomplete, 
use the verbose option to the cg phase.
[Spark] Pointer Assignment Graph in 6.8 seconds.
[Spark] Type masks in 0.8 seconds.
[Spark] Pointer Graph simplified in 0.0 seconds.
[Spark] Propagation in 146.1 seconds.
[Spark] Solution found in 146.1 seconds.
Transforming A...
Soot finished on Thu Jun 03 00:37:05 CEST 2004
Soot has run for 2 min. 39 sec.

$ java -Xmx400m soot.Main -w -p cg.spark on -app A -src-prec java
Soot started on Thu Jun 03 00:40:30 CEST 2004
[Call Graph] For information on where the call graph may be incomplete, 
use the verbose option to the cg phase.
[Spark] Pointer Assignment Graph in 10.3 seconds.
[Spark] Type masks in 1.3 seconds.
[Spark] Pointer Graph simplified in 0.0 seconds.
[Spark] Propagation in 151.6 seconds.
[Spark] Solution found in 151.6 seconds.
Transforming A...
Soot finished on Thu Jun 03 00:43:24 CEST 2004
Soot has run for 2 min. 54 sec.

--
Helge