duke@435: /*
kvn@3882:  * Copyright (c) 2007, 2012, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "memory/allocation.inline.hpp"
stefank@2314: #include "opto/connode.hpp"
stefank@2314: #include "opto/vectornode.hpp"
duke@435: 
duke@435: //------------------------------VectorNode--------------------------------------
duke@435: 
duke@435: // Return the vector operator for the specified scalar operation
dlong@4201: // and vector length.
kvn@4006: int VectorNode::opcode(int sopc, BasicType bt) {
duke@435:   switch (sopc) {
duke@435:   case Op_AddI:
duke@435:     switch (bt) {
duke@435:     case T_BOOLEAN:
duke@435:     case T_BYTE:      return Op_AddVB;
kvn@3882:     case T_CHAR:
duke@435:     case T_SHORT:     return Op_AddVS;
duke@435:     case T_INT:       return Op_AddVI;
duke@435:     }
duke@435:     ShouldNotReachHere();
duke@435:   case Op_AddL:
duke@435:     assert(bt == T_LONG, "must be");
duke@435:     return Op_AddVL;
duke@435:   case Op_AddF:
duke@435:     assert(bt == T_FLOAT, "must be");
duke@435:     return Op_AddVF;
duke@435:   case Op_AddD:
duke@435:     assert(bt == T_DOUBLE, "must be");
duke@435:     return Op_AddVD;
duke@435:   case Op_SubI:
duke@435:     switch (bt) {
duke@435:     case T_BOOLEAN:
duke@435:     case T_BYTE:   return Op_SubVB;
kvn@3882:     case T_CHAR:
duke@435:     case T_SHORT:  return Op_SubVS;
duke@435:     case T_INT:    return Op_SubVI;
duke@435:     }
duke@435:     ShouldNotReachHere();
duke@435:   case Op_SubL:
duke@435:     assert(bt == T_LONG, "must be");
duke@435:     return Op_SubVL;
duke@435:   case Op_SubF:
duke@435:     assert(bt == T_FLOAT, "must be");
duke@435:     return Op_SubVF;
duke@435:   case Op_SubD:
duke@435:     assert(bt == T_DOUBLE, "must be");
duke@435:     return Op_SubVD;
kvn@4001:   case Op_MulI:
kvn@4001:     switch (bt) {
kvn@4001:     case T_BOOLEAN:
kvn@4001:     case T_BYTE:   return 0;   // Unimplemented
kvn@4001:     case T_CHAR:
kvn@4001:     case T_SHORT:  return Op_MulVS;
dlong@4201:     case T_INT:    return Op_MulVI;
kvn@4001:     }
kvn@4001:     ShouldNotReachHere();
duke@435:   case Op_MulF:
duke@435:     assert(bt == T_FLOAT, "must be");
duke@435:     return Op_MulVF;
duke@435:   case Op_MulD:
duke@435:     assert(bt == T_DOUBLE, "must be");
duke@435:     return Op_MulVD;
duke@435:   case Op_DivF:
duke@435:     assert(bt == T_FLOAT, "must be");
duke@435:     return Op_DivVF;
duke@435:   case Op_DivD:
duke@435:     assert(bt == T_DOUBLE, "must be");
duke@435:     return Op_DivVD;
duke@435:   case Op_LShiftI:
duke@435:     switch (bt) {
duke@435:     case T_BOOLEAN:
duke@435:     case T_BYTE:   return Op_LShiftVB;
kvn@3882:     case T_CHAR:
duke@435:     case T_SHORT:  return Op_LShiftVS;
duke@435:     case T_INT:    return Op_LShiftVI;
duke@435:     }
duke@435:     ShouldNotReachHere();
kvn@4001:   case Op_LShiftL:
kvn@4001:     assert(bt == T_LONG, "must be");
kvn@4001:     return Op_LShiftVL;
kvn@3882:   case Op_RShiftI:
duke@435:     switch (bt) {
kvn@4204:     case T_BOOLEAN:return Op_URShiftVB; // boolean is unsigned value
kvn@4204:     case T_CHAR:   return Op_URShiftVS; // char is unsigned value
kvn@3882:     case T_BYTE:   return Op_RShiftVB;
kvn@3882:     case T_SHORT:  return Op_RShiftVS;
kvn@3882:     case T_INT:    return Op_RShiftVI;
duke@435:     }
duke@435:     ShouldNotReachHere();
kvn@4001:   case Op_RShiftL:
kvn@4001:     assert(bt == T_LONG, "must be");
kvn@4001:     return Op_RShiftVL;
kvn@4001:   case Op_URShiftI:
kvn@4001:     switch (bt) {
kvn@4204:     case T_BOOLEAN:return Op_URShiftVB;
kvn@4204:     case T_CHAR:   return Op_URShiftVS;
kvn@4204:     case T_BYTE:
kvn@4204:     case T_SHORT:  return 0; // Vector logical right shift for signed short
kvn@4204:                              // values produces incorrect Java result for
kvn@4204:                              // negative data because java code should convert
kvn@4204:                              // a short value into int value with sign
kvn@4204:                              // extension before a shift.
kvn@4001:     case T_INT:    return Op_URShiftVI;
kvn@4001:     }
kvn@4001:     ShouldNotReachHere();
kvn@4001:   case Op_URShiftL:
kvn@4001:     assert(bt == T_LONG, "must be");
kvn@4001:     return Op_URShiftVL;
duke@435:   case Op_AndI:
duke@435:   case Op_AndL:
duke@435:     return Op_AndV;
duke@435:   case Op_OrI:
duke@435:   case Op_OrL:
duke@435:     return Op_OrV;
duke@435:   case Op_XorI:
duke@435:   case Op_XorL:
duke@435:     return Op_XorV;
duke@435: 
duke@435:   case Op_LoadB:
kvn@3882:   case Op_LoadUB:
twisti@993:   case Op_LoadUS:
duke@435:   case Op_LoadS:
duke@435:   case Op_LoadI:
duke@435:   case Op_LoadL:
duke@435:   case Op_LoadF:
duke@435:   case Op_LoadD:
kvn@3882:     return Op_LoadVector;
duke@435: 
duke@435:   case Op_StoreB:
duke@435:   case Op_StoreC:
duke@435:   case Op_StoreI:
duke@435:   case Op_StoreL:
duke@435:   case Op_StoreF:
duke@435:   case Op_StoreD:
kvn@3882:     return Op_StoreVector;
duke@435:   }
duke@435:   return 0; // Unimplemented
duke@435: }
duke@435: 
dlong@4201: // Also used to check if the code generator
dlong@4201: // supports the vector operation.
kvn@3882: bool VectorNode::implemented(int opc, uint vlen, BasicType bt) {
kvn@3882:   if (is_java_primitive(bt) &&
kvn@3882:       (vlen > 1) && is_power_of_2(vlen) &&
kvn@3882:       Matcher::vector_size_supported(bt, vlen)) {
kvn@4006:     int vopc = VectorNode::opcode(opc, bt);
dlong@4201:     return vopc > 0 && Matcher::match_rule_supported(vopc);
duke@435:   }
kvn@3882:   return false;
duke@435: }
duke@435: 
kvn@4001: bool VectorNode::is_shift(Node* n) {
kvn@4001:   switch (n->Opcode()) {
kvn@4001:   case Op_LShiftI:
kvn@4001:   case Op_LShiftL:
kvn@4001:   case Op_RShiftI:
kvn@4001:   case Op_RShiftL:
kvn@4001:   case Op_URShiftI:
kvn@4001:   case Op_URShiftL:
kvn@4001:     return true;
kvn@4001:   }
kvn@4001:   return false;
kvn@4001: }
kvn@4001: 
kvn@4004: // Check if input is loop invariant vector.
kvn@4001: bool VectorNode::is_invariant_vector(Node* n) {
kvn@4004:   // Only Replicate vector nodes are loop invariant for now.
kvn@4001:   switch (n->Opcode()) {
kvn@4001:   case Op_ReplicateB:
kvn@4001:   case Op_ReplicateS:
kvn@4001:   case Op_ReplicateI:
kvn@4001:   case Op_ReplicateL:
kvn@4001:   case Op_ReplicateF:
kvn@4001:   case Op_ReplicateD:
kvn@4001:     return true;
kvn@4001:   }
kvn@4001:   return false;
kvn@4001: }
kvn@4001: 
kvn@4006: // [Start, end) half-open range defining which operands are vectors
kvn@4006: void VectorNode::vector_operands(Node* n, uint* start, uint* end) {
kvn@4006:   switch (n->Opcode()) {
kvn@4006:   case Op_LoadB:   case Op_LoadUB:
kvn@4006:   case Op_LoadS:   case Op_LoadUS:
kvn@4006:   case Op_LoadI:   case Op_LoadL:
kvn@4006:   case Op_LoadF:   case Op_LoadD:
kvn@4006:   case Op_LoadP:   case Op_LoadN:
kvn@4006:     *start = 0;
kvn@4006:     *end   = 0; // no vector operands
kvn@4006:     break;
kvn@4006:   case Op_StoreB:  case Op_StoreC:
kvn@4006:   case Op_StoreI:  case Op_StoreL:
kvn@4006:   case Op_StoreF:  case Op_StoreD:
kvn@4006:   case Op_StoreP:  case Op_StoreN:
kvn@4006:     *start = MemNode::ValueIn;
kvn@4006:     *end   = MemNode::ValueIn + 1; // 1 vector operand
kvn@4006:     break;
kvn@4006:   case Op_LShiftI:  case Op_LShiftL:
kvn@4006:   case Op_RShiftI:  case Op_RShiftL:
kvn@4006:   case Op_URShiftI: case Op_URShiftL:
kvn@4006:     *start = 1;
kvn@4006:     *end   = 2; // 1 vector operand
kvn@4006:     break;
kvn@4006:   case Op_AddI: case Op_AddL: case Op_AddF: case Op_AddD:
kvn@4006:   case Op_SubI: case Op_SubL: case Op_SubF: case Op_SubD:
kvn@4006:   case Op_MulI: case Op_MulL: case Op_MulF: case Op_MulD:
kvn@4006:   case Op_DivF: case Op_DivD:
kvn@4006:   case Op_AndI: case Op_AndL:
kvn@4006:   case Op_OrI:  case Op_OrL:
kvn@4006:   case Op_XorI: case Op_XorL:
kvn@4006:     *start = 1;
kvn@4006:     *end   = 3; // 2 vector operands
kvn@4006:     break;
kvn@4006:   case Op_CMoveI:  case Op_CMoveL:  case Op_CMoveF:  case Op_CMoveD:
kvn@4006:     *start = 2;
kvn@4006:     *end   = n->req();
kvn@4006:     break;
kvn@4006:   default:
kvn@4006:     *start = 1;
kvn@4006:     *end   = n->req(); // default is all operands
kvn@4006:   }
kvn@4006: }
kvn@4006: 
duke@435: // Return the vector version of a scalar operation node.
kvn@3882: VectorNode* VectorNode::make(Compile* C, int opc, Node* n1, Node* n2, uint vlen, BasicType bt) {
kvn@3882:   const TypeVect* vt = TypeVect::make(bt, vlen);
kvn@4006:   int vopc = VectorNode::opcode(opc, bt);
kvn@4134:   // This method should not be called for unimplemented vectors.
kvn@4134:   guarantee(vopc > 0, err_msg_res("Vector for '%s' is not implemented", NodeClassNames[opc]));
duke@435: 
duke@435:   switch (vopc) {
kvn@4115:   case Op_AddVB: return new (C) AddVBNode(n1, n2, vt);
kvn@4115:   case Op_AddVS: return new (C) AddVSNode(n1, n2, vt);
kvn@4115:   case Op_AddVI: return new (C) AddVINode(n1, n2, vt);
kvn@4115:   case Op_AddVL: return new (C) AddVLNode(n1, n2, vt);
kvn@4115:   case Op_AddVF: return new (C) AddVFNode(n1, n2, vt);
kvn@4115:   case Op_AddVD: return new (C) AddVDNode(n1, n2, vt);
duke@435: 
kvn@4115:   case Op_SubVB: return new (C) SubVBNode(n1, n2, vt);
kvn@4115:   case Op_SubVS: return new (C) SubVSNode(n1, n2, vt);
kvn@4115:   case Op_SubVI: return new (C) SubVINode(n1, n2, vt);
kvn@4115:   case Op_SubVL: return new (C) SubVLNode(n1, n2, vt);
kvn@4115:   case Op_SubVF: return new (C) SubVFNode(n1, n2, vt);
kvn@4115:   case Op_SubVD: return new (C) SubVDNode(n1, n2, vt);
duke@435: 
kvn@4115:   case Op_MulVS: return new (C) MulVSNode(n1, n2, vt);
kvn@4115:   case Op_MulVI: return new (C) MulVINode(n1, n2, vt);
kvn@4115:   case Op_MulVF: return new (C) MulVFNode(n1, n2, vt);
kvn@4115:   case Op_MulVD: return new (C) MulVDNode(n1, n2, vt);
duke@435: 
kvn@4115:   case Op_DivVF: return new (C) DivVFNode(n1, n2, vt);
kvn@4115:   case Op_DivVD: return new (C) DivVDNode(n1, n2, vt);
duke@435: 
kvn@4115:   case Op_LShiftVB: return new (C) LShiftVBNode(n1, n2, vt);
kvn@4115:   case Op_LShiftVS: return new (C) LShiftVSNode(n1, n2, vt);
kvn@4115:   case Op_LShiftVI: return new (C) LShiftVINode(n1, n2, vt);
kvn@4115:   case Op_LShiftVL: return new (C) LShiftVLNode(n1, n2, vt);
duke@435: 
kvn@4115:   case Op_RShiftVB: return new (C) RShiftVBNode(n1, n2, vt);
kvn@4115:   case Op_RShiftVS: return new (C) RShiftVSNode(n1, n2, vt);
kvn@4115:   case Op_RShiftVI: return new (C) RShiftVINode(n1, n2, vt);
kvn@4115:   case Op_RShiftVL: return new (C) RShiftVLNode(n1, n2, vt);
kvn@4001: 
kvn@4115:   case Op_URShiftVB: return new (C) URShiftVBNode(n1, n2, vt);
kvn@4115:   case Op_URShiftVS: return new (C) URShiftVSNode(n1, n2, vt);
kvn@4115:   case Op_URShiftVI: return new (C) URShiftVINode(n1, n2, vt);
kvn@4115:   case Op_URShiftVL: return new (C) URShiftVLNode(n1, n2, vt);
duke@435: 
kvn@4115:   case Op_AndV: return new (C) AndVNode(n1, n2, vt);
kvn@4115:   case Op_OrV:  return new (C) OrVNode (n1, n2, vt);
kvn@4115:   case Op_XorV: return new (C) XorVNode(n1, n2, vt);
kvn@3882:   }
kvn@4134:   fatal(err_msg_res("Missed vector creation for '%s'", NodeClassNames[vopc]));
kvn@3882:   return NULL;
kvn@3882: 
kvn@3882: }
kvn@3882: 
kvn@3882: // Scalar promotion
kvn@3882: VectorNode* VectorNode::scalar2vector(Compile* C, Node* s, uint vlen, const Type* opd_t) {
kvn@3882:   BasicType bt = opd_t->array_element_basic_type();
kvn@3882:   const TypeVect* vt = opd_t->singleton() ? TypeVect::make(opd_t, vlen)
kvn@3882:                                           : TypeVect::make(bt, vlen);
kvn@3882:   switch (bt) {
kvn@3882:   case T_BOOLEAN:
kvn@3882:   case T_BYTE:
kvn@4115:     return new (C) ReplicateBNode(s, vt);
kvn@3882:   case T_CHAR:
kvn@3882:   case T_SHORT:
kvn@4115:     return new (C) ReplicateSNode(s, vt);
kvn@3882:   case T_INT:
kvn@4115:     return new (C) ReplicateINode(s, vt);
kvn@3882:   case T_LONG:
kvn@4115:     return new (C) ReplicateLNode(s, vt);
kvn@3882:   case T_FLOAT:
kvn@4115:     return new (C) ReplicateFNode(s, vt);
kvn@3882:   case T_DOUBLE:
kvn@4115:     return new (C) ReplicateDNode(s, vt);
duke@435:   }
kvn@4134:   fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
kvn@4134:   return NULL;
kvn@4134: }
kvn@4134: 
kvn@4134: VectorNode* VectorNode::shift_count(Compile* C, Node* shift, Node* cnt, uint vlen, BasicType bt) {
kvn@4134:   assert(VectorNode::is_shift(shift) && !cnt->is_Con(), "only variable shift count");
kvn@4134:   // Match shift count type with shift vector type.
kvn@4134:   const TypeVect* vt = TypeVect::make(bt, vlen);
kvn@4134:   switch (shift->Opcode()) {
kvn@4134:   case Op_LShiftI:
kvn@4134:   case Op_LShiftL:
kvn@4134:     return new (C) LShiftCntVNode(cnt, vt);
kvn@4134:   case Op_RShiftI:
kvn@4134:   case Op_RShiftL:
kvn@4134:   case Op_URShiftI:
kvn@4134:   case Op_URShiftL:
kvn@4134:     return new (C) RShiftCntVNode(cnt, vt);
kvn@4134:   }
kvn@4134:   fatal(err_msg_res("Missed vector creation for '%s'", NodeClassNames[shift->Opcode()]));
duke@435:   return NULL;
duke@435: }
duke@435: 
kvn@3882: // Return initial Pack node. Additional operands added with add_opd() calls.
kvn@3882: PackNode* PackNode::make(Compile* C, Node* s, uint vlen, BasicType bt) {
kvn@3882:   const TypeVect* vt = TypeVect::make(bt, vlen);
kvn@3882:   switch (bt) {
kvn@3882:   case T_BOOLEAN:
kvn@3882:   case T_BYTE:
kvn@4115:     return new (C) PackBNode(s, vt);
kvn@3882:   case T_CHAR:
kvn@3882:   case T_SHORT:
kvn@4115:     return new (C) PackSNode(s, vt);
kvn@3882:   case T_INT:
kvn@4115:     return new (C) PackINode(s, vt);
kvn@3882:   case T_LONG:
kvn@4115:     return new (C) PackLNode(s, vt);
kvn@3882:   case T_FLOAT:
kvn@4115:     return new (C) PackFNode(s, vt);
kvn@3882:   case T_DOUBLE:
kvn@4115:     return new (C) PackDNode(s, vt);
duke@435:   }
kvn@4134:   fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
duke@435:   return NULL;
duke@435: }
duke@435: 
kvn@3882: // Create a binary tree form for Packs. [lo, hi) (half-open) range
kvn@4006: PackNode* PackNode::binary_tree_pack(Compile* C, int lo, int hi) {
kvn@3882:   int ct = hi - lo;
kvn@3882:   assert(is_power_of_2(ct), "power of 2");
kvn@3882:   if (ct == 2) {
kvn@3882:     PackNode* pk = PackNode::make(C, in(lo), 2, vect_type()->element_basic_type());
kvn@4006:     pk->add_opd(in(lo+1));
kvn@3882:     return pk;
duke@435: 
kvn@3882:   } else {
kvn@3882:     int mid = lo + ct/2;
kvn@4006:     PackNode* n1 = binary_tree_pack(C, lo,  mid);
kvn@4006:     PackNode* n2 = binary_tree_pack(C, mid, hi );
duke@435: 
kvn@4006:     BasicType bt = n1->vect_type()->element_basic_type();
kvn@4006:     assert(bt == n2->vect_type()->element_basic_type(), "should be the same");
kvn@3882:     switch (bt) {
kvn@3882:     case T_BOOLEAN:
kvn@3882:     case T_BYTE:
kvn@4115:       return new (C) PackSNode(n1, n2, TypeVect::make(T_SHORT, 2));
kvn@3882:     case T_CHAR:
kvn@3882:     case T_SHORT:
kvn@4115:       return new (C) PackINode(n1, n2, TypeVect::make(T_INT, 2));
kvn@3882:     case T_INT:
kvn@4115:       return new (C) PackLNode(n1, n2, TypeVect::make(T_LONG, 2));
kvn@3882:     case T_LONG:
kvn@4115:       return new (C) Pack2LNode(n1, n2, TypeVect::make(T_LONG, 2));
kvn@3882:     case T_FLOAT:
kvn@4115:       return new (C) PackDNode(n1, n2, TypeVect::make(T_DOUBLE, 2));
kvn@3882:     case T_DOUBLE:
kvn@4115:       return new (C) Pack2DNode(n1, n2, TypeVect::make(T_DOUBLE, 2));
kvn@3882:     }
kvn@4134:     fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
duke@435:   }
duke@435:   return NULL;
duke@435: }
duke@435: 
kvn@3882: // Return the vector version of a scalar load node.
kvn@3882: LoadVectorNode* LoadVectorNode::make(Compile* C, int opc, Node* ctl, Node* mem,
kvn@3882:                                      Node* adr, const TypePtr* atyp, uint vlen, BasicType bt) {
kvn@3882:   const TypeVect* vt = TypeVect::make(bt, vlen);
kvn@4115:   return new (C) LoadVectorNode(ctl, mem, adr, atyp, vt);
kvn@3882: }
kvn@3882: 
kvn@3882: // Return the vector version of a scalar store node.
kvn@3882: StoreVectorNode* StoreVectorNode::make(Compile* C, int opc, Node* ctl, Node* mem,
kvn@3882:                                        Node* adr, const TypePtr* atyp, Node* val,
kvn@3882:                                        uint vlen) {
kvn@4115:   return new (C) StoreVectorNode(ctl, mem, adr, atyp, val);
kvn@3882: }
kvn@3882: 
duke@435: // Extract a scalar element of vector.
kvn@3882: Node* ExtractNode::make(Compile* C, Node* v, uint position, BasicType bt) {
kvn@3882:   assert((int)position < Matcher::max_vector_size(bt), "pos in range");
duke@435:   ConINode* pos = ConINode::make(C, (int)position);
duke@435:   switch (bt) {
duke@435:   case T_BOOLEAN:
kvn@4115:     return new (C) ExtractUBNode(v, pos);
duke@435:   case T_BYTE:
kvn@4115:     return new (C) ExtractBNode(v, pos);
duke@435:   case T_CHAR:
kvn@4115:     return new (C) ExtractCNode(v, pos);
duke@435:   case T_SHORT:
kvn@4115:     return new (C) ExtractSNode(v, pos);
duke@435:   case T_INT:
kvn@4115:     return new (C) ExtractINode(v, pos);
duke@435:   case T_LONG:
kvn@4115:     return new (C) ExtractLNode(v, pos);
duke@435:   case T_FLOAT:
kvn@4115:     return new (C) ExtractFNode(v, pos);
duke@435:   case T_DOUBLE:
kvn@4115:     return new (C) ExtractDNode(v, pos);
duke@435:   }
kvn@4134:   fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
duke@435:   return NULL;
duke@435: }
kvn@3882: