src/share/vm/opto/node.cpp

*** 314,323 ****
--- 314,326 ----
  
  //------------------------------Node-------------------------------------------
  // Create a Node, with a given number of required edges.
  Node::Node(uint req)
    : _idx(Init(req))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    assert( req < Compile::current()->max_node_limit() - NodeLimitFudgeFactor, "Input limit exceeded" );
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    if (req == 0) {
*** 333,342 ****
--- 336,348 ----
  }
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0)
    : _idx(Init(1))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[0] == this, "Must pass arg count to 'new'" );
*** 345,354 ****
--- 351,363 ----
  }
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0, Node *n1)
    : _idx(Init(2))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[1] == this, "Must pass arg count to 'new'" );
*** 359,368 ****
--- 368,380 ----
  }
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0, Node *n1, Node *n2)
    : _idx(Init(3))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[2] == this, "Must pass arg count to 'new'" );
*** 375,384 ****
--- 387,399 ----
  }
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0, Node *n1, Node *n2, Node *n3)
    : _idx(Init(4))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[3] == this, "Must pass arg count to 'new'" );
*** 393,402 ****
--- 408,420 ----
  }
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0, Node *n1, Node *n2, Node *n3, Node *n4)
    : _idx(Init(5))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[4] == this, "Must pass arg count to 'new'" );
*** 414,423 ****
--- 432,444 ----
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0, Node *n1, Node *n2, Node *n3,
                       Node *n4, Node *n5)
    : _idx(Init(6))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[5] == this, "Must pass arg count to 'new'" );
*** 437,446 ****
--- 458,470 ----
  
  //------------------------------Node-------------------------------------------
  Node::Node(Node *n0, Node *n1, Node *n2, Node *n3,
                       Node *n4, Node *n5, Node *n6)
    : _idx(Init(7))
+ #ifdef ASSERT
+   , _parse_idx(_idx)
+ #endif
  {
    debug_only( verify_construction() );
    NOT_PRODUCT(nodes_created++);
    // Assert we allocated space for input array already
    assert( _in[6] == this, "Must pass arg count to 'new'" );