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