Mercurial > hg > truffle

comparison src/share/vm/opto/phaseX.hpp @ 4970:33df1aeaebbf

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge with http://hg.openjdk.java.net/hsx/hsx24/hotspot/
author Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
date Mon, 27 Feb 2012 13:10:13 +0100
parents 35acf8f0a2e4
children 5e990493719e
comparison
equal deleted inserted replaced
4703:2cfb7fb2dce7 4970:33df1aeaebbf
253 253
254 // Return whether two Nodes are equivalent. 254 // Return whether two Nodes are equivalent.
255 // Must not be recursive, since the recursive version is built from this. 255 // Must not be recursive, since the recursive version is built from this.
256 // For pessimistic optimizations this is simply pointer equivalence. 256 // For pessimistic optimizations this is simply pointer equivalence.
257 bool eqv(const Node* n1, const Node* n2) const { return n1 == n2; } 257 bool eqv(const Node* n1, const Node* n2) const { return n1 == n2; }
258
259 // Return whether two Nodes are equivalent, after stripping casting.
260 bool eqv_uncast(const Node* n1, const Node* n2) const {
261 return eqv(n1->uncast(), n2->uncast());
262 }
263 258
264 // For pessimistic passes, the return type must monotonically narrow. 259 // For pessimistic passes, the return type must monotonically narrow.
265 // For optimistic passes, the return type must monotonically widen. 260 // For optimistic passes, the return type must monotonically widen.
266 // It is possible to get into a "death march" in either type of pass, 261 // It is possible to get into a "death march" in either type of pass,
267 // where the types are continually moving but it will take 2**31 or 262 // where the types are continually moving but it will take 2**31 or