< prev index next >

src/hotspot/share/opto/node.cpp

Print this page




  62   _debug_orig = NULL;
  63   int old_debug_idx = Compile::debug_idx();
  64   int new_debug_idx = old_debug_idx+1;
  65   if (new_debug_idx > 0) {
  66     // Arrange that the lowest five decimal digits of _debug_idx
  67     // will repeat those of _idx. In case this is somehow pathological,
  68     // we continue to assign negative numbers (!) consecutively.
  69     const int mod = 100000;
  70     int bump = (int)(_idx - new_debug_idx) % mod;
  71     if (bump < 0)  bump += mod;
  72     assert(bump >= 0 && bump < mod, "");
  73     new_debug_idx += bump;
  74   }
  75   Compile::set_debug_idx(new_debug_idx);
  76   set_debug_idx( new_debug_idx );
  77   assert(Compile::current()->unique() < (INT_MAX - 1), "Node limit exceeded INT_MAX");
  78   assert(Compile::current()->live_nodes() < Compile::current()->max_node_limit(), "Live Node limit exceeded limit");
  79   if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) {
  80     tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx);
  81     BREAKPOINT;
  82     os::message_box("xxx", "yyy");
  83   }
  84 #if OPTO_DU_ITERATOR_ASSERT
  85   _last_del = NULL;
  86   _del_tick = 0;
  87 #endif
  88   _hash_lock = 0;
  89 }
  90 
  91 
  92 // #ifdef ASSERT ...
  93 
  94 #if OPTO_DU_ITERATOR_ASSERT
  95 void DUIterator_Common::sample(const Node* node) {
  96   _vdui     = VerifyDUIterators;
  97   _node     = node;
  98   _outcnt   = node->_outcnt;
  99   _del_tick = node->_del_tick;
 100   _last     = NULL;
 101 }
 102 




  62   _debug_orig = NULL;
  63   int old_debug_idx = Compile::debug_idx();
  64   int new_debug_idx = old_debug_idx+1;
  65   if (new_debug_idx > 0) {
  66     // Arrange that the lowest five decimal digits of _debug_idx
  67     // will repeat those of _idx. In case this is somehow pathological,
  68     // we continue to assign negative numbers (!) consecutively.
  69     const int mod = 100000;
  70     int bump = (int)(_idx - new_debug_idx) % mod;
  71     if (bump < 0)  bump += mod;
  72     assert(bump >= 0 && bump < mod, "");
  73     new_debug_idx += bump;
  74   }
  75   Compile::set_debug_idx(new_debug_idx);
  76   set_debug_idx( new_debug_idx );
  77   assert(Compile::current()->unique() < (INT_MAX - 1), "Node limit exceeded INT_MAX");
  78   assert(Compile::current()->live_nodes() < Compile::current()->max_node_limit(), "Live Node limit exceeded limit");
  79   if (BreakAtNode != 0 && (_debug_idx == BreakAtNode || (int)_idx == BreakAtNode)) {
  80     tty->print_cr("BreakAtNode: _idx=%d _debug_idx=%d", _idx, _debug_idx);
  81     BREAKPOINT;

  82   }
  83 #if OPTO_DU_ITERATOR_ASSERT
  84   _last_del = NULL;
  85   _del_tick = 0;
  86 #endif
  87   _hash_lock = 0;
  88 }
  89 
  90 
  91 // #ifdef ASSERT ...
  92 
  93 #if OPTO_DU_ITERATOR_ASSERT
  94 void DUIterator_Common::sample(const Node* node) {
  95   _vdui     = VerifyDUIterators;
  96   _node     = node;
  97   _outcnt   = node->_outcnt;
  98   _del_tick = node->_del_tick;
  99   _last     = NULL;
 100 }
 101 


< prev index next >