src/share/vm/opto/mulnode.cpp

rev 10222 : 8149745: C2 should optimize long accumulations in a counted loop
summary: Look for parallel iv for long adds
Reviewed-by:

*** 168,177 ****
--- 168,187 ----
  #endif
  
    return mul_ring(t1,t2);            // Local flavor of type multiplication
  }
  
+ MulNode* MulNode::make(BasicType bt, Node *in1, Node *in2) {
+   switch(bt) {
+   case T_INT:         return new MulINode(in1, in2);
+   case T_LONG:        return new MulLNode(in1, in2);
+   case T_FLOAT:       return new MulFNode(in1, in2);
+   case T_DOUBLE:      return new MulDNode(in1, in2);
+   }
+   fatal("Bad basic type %s", type2name(bt));
+   return NULL;
+ }
  
  //=============================================================================
  //------------------------------Ideal------------------------------------------
  // Check for power-of-2 multiply, then try the regular MulNode::Ideal
  Node *MulINode::Ideal(PhaseGVN *phase, bool can_reshape) {