src/share/vm/opto/memnode.cpp

*** 2496,2518 ****
  }
  
  //=============================================================================
  // Do we match on this edge? No memory edges
  uint StrCompNode::match_edge(uint idx) const {
!   return idx == 5 || idx == 6;
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
  Node *StrCompNode::Ideal(PhaseGVN *phase, bool can_reshape){
    return remove_dead_region(phase, can_reshape) ? this : NULL;
  }
  
  // Do we match on this edge? No memory edges
  uint StrEqualsNode::match_edge(uint idx) const {
!   return idx == 5 || idx == 6;
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
--- 2496,2519 ----
  }
  
  //=============================================================================
  // Do we match on this edge? No memory edges
  uint StrCompNode::match_edge(uint idx) const {
!   return idx == 2 || idx == 3; // StrComp (Binary str1 cnt1) (Binary str2 cnt2)
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
  Node *StrCompNode::Ideal(PhaseGVN *phase, bool can_reshape){
    return remove_dead_region(phase, can_reshape) ? this : NULL;
  }
  
+ //=============================================================================
  // Do we match on this edge? No memory edges
  uint StrEqualsNode::match_edge(uint idx) const {
!   return idx == 2 || idx == 3; // StrEquals (Binary str1 str2) cnt
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
*** 2521,2540 ****
  }
  
  //=============================================================================
  // Do we match on this edge? No memory edges
  uint StrIndexOfNode::match_edge(uint idx) const {
!   return idx == 5 || idx == 6;
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
  Node *StrIndexOfNode::Ideal(PhaseGVN *phase, bool can_reshape){
    return remove_dead_region(phase, can_reshape) ? this : NULL;
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
  Node *AryEqNode::Ideal(PhaseGVN *phase, bool can_reshape){
    return remove_dead_region(phase, can_reshape) ? this : NULL;
--- 2522,2546 ----
  }
  
  //=============================================================================
  // Do we match on this edge? No memory edges
  uint StrIndexOfNode::match_edge(uint idx) const {
!   return idx == 2 || idx == 3; // StrIndexOf (Binary str1 cnt1) (Binary str2 cnt2)
  }
  
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
  Node *StrIndexOfNode::Ideal(PhaseGVN *phase, bool can_reshape){
    return remove_dead_region(phase, can_reshape) ? this : NULL;
  }
  
+ //=============================================================================
+ // Do we match on this edge? No memory edges
+ uint AryEqNode::match_edge(uint idx) const {
+   return idx == 2 || idx == 3; // StrEquals ary1 ary2
+ }
  //------------------------------Ideal------------------------------------------
  // Return a node which is more "ideal" than the current node.  Strip out
  // control copies
  Node *AryEqNode::Ideal(PhaseGVN *phase, bool can_reshape){
    return remove_dead_region(phase, can_reshape) ? this : NULL;