Mercurial > hg > truffle
comparison graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/LoopBeginNode.java @ 11463:93c63975217e
Make ComputeProbabilityClosure more robust to probabilities that to infinity because of loops
author | Gilles Duboscq <duboscq@ssw.jku.at> |
---|---|
date | Thu, 29 Aug 2013 19:09:09 +0200 |
parents | 183d33c76419 |
children | 1aed684853f6 |
comparison
equal
deleted
inserted
replaced
11462:ff122ed4b9fd | 11463:93c63975217e |
---|---|
45 public double loopFrequency() { | 45 public double loopFrequency() { |
46 return loopFrequency; | 46 return loopFrequency; |
47 } | 47 } |
48 | 48 |
49 public void setLoopFrequency(double loopFrequency) { | 49 public void setLoopFrequency(double loopFrequency) { |
50 assert loopFrequency >= 0; | |
50 this.loopFrequency = loopFrequency; | 51 this.loopFrequency = loopFrequency; |
51 } | 52 } |
52 | 53 |
53 /** | 54 /** |
54 * Returns the <b>unordered</b> set of {@link LoopEndNode} that correspond to back-edges for | 55 * Returns the <b>unordered</b> set of {@link LoopEndNode} that correspond to back-edges for |