hotspot/src/share/vm/opto/split_if.cpp

@@ -253,11 +253,11 @@
 // the appropriate false-arm or true-arm values.  If some path leads to the
 // original IF, then insert a Phi recursively.
 Node *PhaseIdealLoop::spinup( Node *iff_dom, Node *new_false, Node *new_true, Node *use_blk, Node *def, small_cache *cache ) {
   if (use_blk->is_top())        // Handle dead uses
     return use_blk;
-  Node *prior_n = (Node*)0xdeadbeef;
+  Node *prior_n = (Node*)(uintptr_t)0xdeadbeef;
   Node *n = use_blk;            // Get path input
   assert( use_blk != iff_dom, "" );
   // Here's the "spinup" the dominator tree loop.  Do a cache-check
   // along the way, in case we've come this way before.
   while( n != iff_dom ) {       // Found post-dominating point?

@@ -300,11 +300,11 @@
       }
     }
   }
 
   // Update cache everywhere
-  prior_n = (Node*)0xdeadbeef;  // Reset IDOM walk
+  prior_n = (Node*)(uintptr_t)0xdeadbeef;  // Reset IDOM walk
   n = use_blk;                  // Get path input
   // Spin-up the idom tree again, basically doing path-compression.
   // Insert cache entries along the way, so that if we ever hit this
   // point in the IDOM tree again we'll stop immediately on a cache hit.
   while( n != iff_dom ) {       // Found post-dominating point?