• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/vm/opto/vectornode.cpp@710a3c8b516e (annotated)

src/share/vm/opto/vectornode.cpp

Tue, 08 Aug 2017 15:57:29 +0800

author

aoqi

date

Tue, 08 Aug 2017 15:57:29 +0800

changeset 6876

710a3c8b516e

parent 4204

b2c669fd8114

parent 0

f90c822e73f8

child 7994

04ff2f6cd0eb

permissions

-rw-r--r--

merge

aoqi@0	1	/*
aoqi@0	2	* Copyright (c) 2007, 2012, Oracle and/or its affiliates. All rights reserved.
aoqi@0	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0	4	*
aoqi@0	5	* This code is free software; you can redistribute it and/or modify it
aoqi@0	6	* under the terms of the GNU General Public License version 2 only, as
aoqi@0	7	* published by the Free Software Foundation.
aoqi@0	8	*
aoqi@0	9	* This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0	10	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0	11	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0	12	* version 2 for more details (a copy is included in the LICENSE file that
aoqi@0	13	* accompanied this code).
aoqi@0	14	*
aoqi@0	15	* You should have received a copy of the GNU General Public License version
aoqi@0	16	* 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0	17	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0	18	*
aoqi@0	19	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0	20	* or visit www.oracle.com if you need additional information or have any
aoqi@0	21	* questions.
aoqi@0	22	*/
aoqi@0	23
aoqi@0	24	#include "precompiled.hpp"
aoqi@0	25	#include "memory/allocation.inline.hpp"
aoqi@0	26	#include "opto/connode.hpp"
aoqi@0	27	#include "opto/vectornode.hpp"
aoqi@0	28
aoqi@0	29	//------------------------------VectorNode--------------------------------------
aoqi@0	30
aoqi@0	31	// Return the vector operator for the specified scalar operation
aoqi@0	32	// and vector length.
aoqi@0	33	int VectorNode::opcode(int sopc, BasicType bt) {
aoqi@0	34	switch (sopc) {
aoqi@0	35	case Op_AddI:
aoqi@0	36	switch (bt) {
aoqi@0	37	case T_BOOLEAN:
aoqi@0	38	case T_BYTE: return Op_AddVB;
aoqi@0	39	case T_CHAR:
aoqi@0	40	case T_SHORT: return Op_AddVS;
aoqi@0	41	case T_INT: return Op_AddVI;
aoqi@0	42	}
aoqi@0	43	ShouldNotReachHere();
aoqi@0	44	case Op_AddL:
aoqi@0	45	assert(bt == T_LONG, "must be");
aoqi@0	46	return Op_AddVL;
aoqi@0	47	case Op_AddF:
aoqi@0	48	assert(bt == T_FLOAT, "must be");
aoqi@0	49	return Op_AddVF;
aoqi@0	50	case Op_AddD:
aoqi@0	51	assert(bt == T_DOUBLE, "must be");
aoqi@0	52	return Op_AddVD;
aoqi@0	53	case Op_SubI:
aoqi@0	54	switch (bt) {
aoqi@0	55	case T_BOOLEAN:
aoqi@0	56	case T_BYTE: return Op_SubVB;
aoqi@0	57	case T_CHAR:
aoqi@0	58	case T_SHORT: return Op_SubVS;
aoqi@0	59	case T_INT: return Op_SubVI;
aoqi@0	60	}
aoqi@0	61	ShouldNotReachHere();
aoqi@0	62	case Op_SubL:
aoqi@0	63	assert(bt == T_LONG, "must be");
aoqi@0	64	return Op_SubVL;
aoqi@0	65	case Op_SubF:
aoqi@0	66	assert(bt == T_FLOAT, "must be");
aoqi@0	67	return Op_SubVF;
aoqi@0	68	case Op_SubD:
aoqi@0	69	assert(bt == T_DOUBLE, "must be");
aoqi@0	70	return Op_SubVD;
aoqi@0	71	case Op_MulI:
aoqi@0	72	switch (bt) {
aoqi@0	73	case T_BOOLEAN:
aoqi@0	74	case T_BYTE: return 0; // Unimplemented
aoqi@0	75	case T_CHAR:
aoqi@0	76	case T_SHORT: return Op_MulVS;
aoqi@0	77	case T_INT: return Op_MulVI;
aoqi@0	78	}
aoqi@0	79	ShouldNotReachHere();
aoqi@0	80	case Op_MulF:
aoqi@0	81	assert(bt == T_FLOAT, "must be");
aoqi@0	82	return Op_MulVF;
aoqi@0	83	case Op_MulD:
aoqi@0	84	assert(bt == T_DOUBLE, "must be");
aoqi@0	85	return Op_MulVD;
aoqi@0	86	case Op_DivF:
aoqi@0	87	assert(bt == T_FLOAT, "must be");
aoqi@0	88	return Op_DivVF;
aoqi@0	89	case Op_DivD:
aoqi@0	90	assert(bt == T_DOUBLE, "must be");
aoqi@0	91	return Op_DivVD;
aoqi@0	92	case Op_LShiftI:
aoqi@0	93	switch (bt) {
aoqi@0	94	case T_BOOLEAN:
aoqi@0	95	case T_BYTE: return Op_LShiftVB;
aoqi@0	96	case T_CHAR:
aoqi@0	97	case T_SHORT: return Op_LShiftVS;
aoqi@0	98	case T_INT: return Op_LShiftVI;
aoqi@0	99	}
aoqi@0	100	ShouldNotReachHere();
aoqi@0	101	case Op_LShiftL:
aoqi@0	102	assert(bt == T_LONG, "must be");
aoqi@0	103	return Op_LShiftVL;
aoqi@0	104	case Op_RShiftI:
aoqi@0	105	switch (bt) {
aoqi@0	106	case T_BOOLEAN:return Op_URShiftVB; // boolean is unsigned value
aoqi@0	107	case T_CHAR: return Op_URShiftVS; // char is unsigned value
aoqi@0	108	case T_BYTE: return Op_RShiftVB;
aoqi@0	109	case T_SHORT: return Op_RShiftVS;
aoqi@0	110	case T_INT: return Op_RShiftVI;
aoqi@0	111	}
aoqi@0	112	ShouldNotReachHere();
aoqi@0	113	case Op_RShiftL:
aoqi@0	114	assert(bt == T_LONG, "must be");
aoqi@0	115	return Op_RShiftVL;
aoqi@0	116	case Op_URShiftI:
aoqi@0	117	switch (bt) {
aoqi@0	118	case T_BOOLEAN:return Op_URShiftVB;
aoqi@0	119	case T_CHAR: return Op_URShiftVS;
aoqi@0	120	case T_BYTE:
aoqi@0	121	case T_SHORT: return 0; // Vector logical right shift for signed short
aoqi@0	122	// values produces incorrect Java result for
aoqi@0	123	// negative data because java code should convert
aoqi@0	124	// a short value into int value with sign
aoqi@0	125	// extension before a shift.
aoqi@0	126	case T_INT: return Op_URShiftVI;
aoqi@0	127	}
aoqi@0	128	ShouldNotReachHere();
aoqi@0	129	case Op_URShiftL:
aoqi@0	130	assert(bt == T_LONG, "must be");
aoqi@0	131	return Op_URShiftVL;
aoqi@0	132	case Op_AndI:
aoqi@0	133	case Op_AndL:
aoqi@0	134	return Op_AndV;
aoqi@0	135	case Op_OrI:
aoqi@0	136	case Op_OrL:
aoqi@0	137	return Op_OrV;
aoqi@0	138	case Op_XorI:
aoqi@0	139	case Op_XorL:
aoqi@0	140	return Op_XorV;
aoqi@0	141
aoqi@0	142	case Op_LoadB:
aoqi@0	143	case Op_LoadUB:
aoqi@0	144	case Op_LoadUS:
aoqi@0	145	case Op_LoadS:
aoqi@0	146	case Op_LoadI:
aoqi@0	147	case Op_LoadL:
aoqi@0	148	case Op_LoadF:
aoqi@0	149	case Op_LoadD:
aoqi@0	150	return Op_LoadVector;
aoqi@0	151
aoqi@0	152	case Op_StoreB:
aoqi@0	153	case Op_StoreC:
aoqi@0	154	case Op_StoreI:
aoqi@0	155	case Op_StoreL:
aoqi@0	156	case Op_StoreF:
aoqi@0	157	case Op_StoreD:
aoqi@0	158	return Op_StoreVector;
aoqi@0	159	}
aoqi@0	160	return 0; // Unimplemented
aoqi@0	161	}
aoqi@0	162
aoqi@0	163	// Also used to check if the code generator
aoqi@0	164	// supports the vector operation.
aoqi@0	165	bool VectorNode::implemented(int opc, uint vlen, BasicType bt) {
aoqi@0	166	if (is_java_primitive(bt) &&
aoqi@0	167	(vlen > 1) && is_power_of_2(vlen) &&
aoqi@0	168	Matcher::vector_size_supported(bt, vlen)) {
aoqi@0	169	int vopc = VectorNode::opcode(opc, bt);
aoqi@0	170	return vopc > 0 && Matcher::match_rule_supported(vopc);
aoqi@0	171	}
aoqi@0	172	return false;
aoqi@0	173	}
aoqi@0	174
aoqi@0	175	bool VectorNode::is_shift(Node* n) {
aoqi@0	176	switch (n->Opcode()) {
aoqi@0	177	case Op_LShiftI:
aoqi@0	178	case Op_LShiftL:
aoqi@0	179	case Op_RShiftI:
aoqi@0	180	case Op_RShiftL:
aoqi@0	181	case Op_URShiftI:
aoqi@0	182	case Op_URShiftL:
aoqi@0	183	return true;
aoqi@0	184	}
aoqi@0	185	return false;
aoqi@0	186	}
aoqi@0	187
aoqi@0	188	// Check if input is loop invariant vector.
aoqi@0	189	bool VectorNode::is_invariant_vector(Node* n) {
aoqi@0	190	// Only Replicate vector nodes are loop invariant for now.
aoqi@0	191	switch (n->Opcode()) {
aoqi@0	192	case Op_ReplicateB:
aoqi@0	193	case Op_ReplicateS:
aoqi@0	194	case Op_ReplicateI:
aoqi@0	195	case Op_ReplicateL:
aoqi@0	196	case Op_ReplicateF:
aoqi@0	197	case Op_ReplicateD:
aoqi@0	198	return true;
aoqi@0	199	}
aoqi@0	200	return false;
aoqi@0	201	}
aoqi@0	202
aoqi@0	203	// [Start, end) half-open range defining which operands are vectors
aoqi@0	204	void VectorNode::vector_operands(Node* n, uint* start, uint* end) {
aoqi@0	205	switch (n->Opcode()) {
aoqi@0	206	case Op_LoadB: case Op_LoadUB:
aoqi@0	207	case Op_LoadS: case Op_LoadUS:
aoqi@0	208	case Op_LoadI: case Op_LoadL:
aoqi@0	209	case Op_LoadF: case Op_LoadD:
aoqi@0	210	case Op_LoadP: case Op_LoadN:
aoqi@0	211	*start = 0;
aoqi@0	212	*end = 0; // no vector operands
aoqi@0	213	break;
aoqi@0	214	case Op_StoreB: case Op_StoreC:
aoqi@0	215	case Op_StoreI: case Op_StoreL:
aoqi@0	216	case Op_StoreF: case Op_StoreD:
aoqi@0	217	case Op_StoreP: case Op_StoreN:
aoqi@0	218	*start = MemNode::ValueIn;
aoqi@0	219	*end = MemNode::ValueIn + 1; // 1 vector operand
aoqi@0	220	break;
aoqi@0	221	case Op_LShiftI: case Op_LShiftL:
aoqi@0	222	case Op_RShiftI: case Op_RShiftL:
aoqi@0	223	case Op_URShiftI: case Op_URShiftL:
aoqi@0	224	*start = 1;
aoqi@0	225	*end = 2; // 1 vector operand
aoqi@0	226	break;
aoqi@0	227	case Op_AddI: case Op_AddL: case Op_AddF: case Op_AddD:
aoqi@0	228	case Op_SubI: case Op_SubL: case Op_SubF: case Op_SubD:
aoqi@0	229	case Op_MulI: case Op_MulL: case Op_MulF: case Op_MulD:
aoqi@0	230	case Op_DivF: case Op_DivD:
aoqi@0	231	case Op_AndI: case Op_AndL:
aoqi@0	232	case Op_OrI: case Op_OrL:
aoqi@0	233	case Op_XorI: case Op_XorL:
aoqi@0	234	*start = 1;
aoqi@0	235	*end = 3; // 2 vector operands
aoqi@0	236	break;
aoqi@0	237	case Op_CMoveI: case Op_CMoveL: case Op_CMoveF: case Op_CMoveD:
aoqi@0	238	*start = 2;
aoqi@0	239	*end = n->req();
aoqi@0	240	break;
aoqi@0	241	default:
aoqi@0	242	*start = 1;
aoqi@0	243	*end = n->req(); // default is all operands
aoqi@0	244	}
aoqi@0	245	}
aoqi@0	246
aoqi@0	247	// Return the vector version of a scalar operation node.
aoqi@0	248	VectorNode* VectorNode::make(Compile* C, int opc, Node* n1, Node* n2, uint vlen, BasicType bt) {
aoqi@0	249	const TypeVect* vt = TypeVect::make(bt, vlen);
aoqi@0	250	int vopc = VectorNode::opcode(opc, bt);
aoqi@0	251	// This method should not be called for unimplemented vectors.
aoqi@0	252	guarantee(vopc > 0, err_msg_res("Vector for '%s' is not implemented", NodeClassNames[opc]));
aoqi@0	253
aoqi@0	254	switch (vopc) {
aoqi@0	255	case Op_AddVB: return new (C) AddVBNode(n1, n2, vt);
aoqi@0	256	case Op_AddVS: return new (C) AddVSNode(n1, n2, vt);
aoqi@0	257	case Op_AddVI: return new (C) AddVINode(n1, n2, vt);
aoqi@0	258	case Op_AddVL: return new (C) AddVLNode(n1, n2, vt);
aoqi@0	259	case Op_AddVF: return new (C) AddVFNode(n1, n2, vt);
aoqi@0	260	case Op_AddVD: return new (C) AddVDNode(n1, n2, vt);
aoqi@0	261
aoqi@0	262	case Op_SubVB: return new (C) SubVBNode(n1, n2, vt);
aoqi@0	263	case Op_SubVS: return new (C) SubVSNode(n1, n2, vt);
aoqi@0	264	case Op_SubVI: return new (C) SubVINode(n1, n2, vt);
aoqi@0	265	case Op_SubVL: return new (C) SubVLNode(n1, n2, vt);
aoqi@0	266	case Op_SubVF: return new (C) SubVFNode(n1, n2, vt);
aoqi@0	267	case Op_SubVD: return new (C) SubVDNode(n1, n2, vt);
aoqi@0	268
aoqi@0	269	case Op_MulVS: return new (C) MulVSNode(n1, n2, vt);
aoqi@0	270	case Op_MulVI: return new (C) MulVINode(n1, n2, vt);
aoqi@0	271	case Op_MulVF: return new (C) MulVFNode(n1, n2, vt);
aoqi@0	272	case Op_MulVD: return new (C) MulVDNode(n1, n2, vt);
aoqi@0	273
aoqi@0	274	case Op_DivVF: return new (C) DivVFNode(n1, n2, vt);
aoqi@0	275	case Op_DivVD: return new (C) DivVDNode(n1, n2, vt);
aoqi@0	276
aoqi@0	277	case Op_LShiftVB: return new (C) LShiftVBNode(n1, n2, vt);
aoqi@0	278	case Op_LShiftVS: return new (C) LShiftVSNode(n1, n2, vt);
aoqi@0	279	case Op_LShiftVI: return new (C) LShiftVINode(n1, n2, vt);
aoqi@0	280	case Op_LShiftVL: return new (C) LShiftVLNode(n1, n2, vt);
aoqi@0	281
aoqi@0	282	case Op_RShiftVB: return new (C) RShiftVBNode(n1, n2, vt);
aoqi@0	283	case Op_RShiftVS: return new (C) RShiftVSNode(n1, n2, vt);
aoqi@0	284	case Op_RShiftVI: return new (C) RShiftVINode(n1, n2, vt);
aoqi@0	285	case Op_RShiftVL: return new (C) RShiftVLNode(n1, n2, vt);
aoqi@0	286
aoqi@0	287	case Op_URShiftVB: return new (C) URShiftVBNode(n1, n2, vt);
aoqi@0	288	case Op_URShiftVS: return new (C) URShiftVSNode(n1, n2, vt);
aoqi@0	289	case Op_URShiftVI: return new (C) URShiftVINode(n1, n2, vt);
aoqi@0	290	case Op_URShiftVL: return new (C) URShiftVLNode(n1, n2, vt);
aoqi@0	291
aoqi@0	292	case Op_AndV: return new (C) AndVNode(n1, n2, vt);
aoqi@0	293	case Op_OrV: return new (C) OrVNode (n1, n2, vt);
aoqi@0	294	case Op_XorV: return new (C) XorVNode(n1, n2, vt);
aoqi@0	295	}
aoqi@0	296	fatal(err_msg_res("Missed vector creation for '%s'", NodeClassNames[vopc]));
aoqi@0	297	return NULL;
aoqi@0	298
aoqi@0	299	}
aoqi@0	300
aoqi@0	301	// Scalar promotion
aoqi@0	302	VectorNode* VectorNode::scalar2vector(Compile* C, Node* s, uint vlen, const Type* opd_t) {
aoqi@0	303	BasicType bt = opd_t->array_element_basic_type();
aoqi@0	304	const TypeVect* vt = opd_t->singleton() ? TypeVect::make(opd_t, vlen)
aoqi@0	305	: TypeVect::make(bt, vlen);
aoqi@0	306	switch (bt) {
aoqi@0	307	case T_BOOLEAN:
aoqi@0	308	case T_BYTE:
aoqi@0	309	return new (C) ReplicateBNode(s, vt);
aoqi@0	310	case T_CHAR:
aoqi@0	311	case T_SHORT:
aoqi@0	312	return new (C) ReplicateSNode(s, vt);
aoqi@0	313	case T_INT:
aoqi@0	314	return new (C) ReplicateINode(s, vt);
aoqi@0	315	case T_LONG:
aoqi@0	316	return new (C) ReplicateLNode(s, vt);
aoqi@0	317	case T_FLOAT:
aoqi@0	318	return new (C) ReplicateFNode(s, vt);
aoqi@0	319	case T_DOUBLE:
aoqi@0	320	return new (C) ReplicateDNode(s, vt);
aoqi@0	321	}
aoqi@0	322	fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
aoqi@0	323	return NULL;
aoqi@0	324	}
aoqi@0	325
aoqi@0	326	VectorNode* VectorNode::shift_count(Compile* C, Node* shift, Node* cnt, uint vlen, BasicType bt) {
aoqi@0	327	assert(VectorNode::is_shift(shift) && !cnt->is_Con(), "only variable shift count");
aoqi@0	328	// Match shift count type with shift vector type.
aoqi@0	329	const TypeVect* vt = TypeVect::make(bt, vlen);
aoqi@0	330	switch (shift->Opcode()) {
aoqi@0	331	case Op_LShiftI:
aoqi@0	332	case Op_LShiftL:
aoqi@0	333	return new (C) LShiftCntVNode(cnt, vt);
aoqi@0	334	case Op_RShiftI:
aoqi@0	335	case Op_RShiftL:
aoqi@0	336	case Op_URShiftI:
aoqi@0	337	case Op_URShiftL:
aoqi@0	338	return new (C) RShiftCntVNode(cnt, vt);
aoqi@0	339	}
aoqi@0	340	fatal(err_msg_res("Missed vector creation for '%s'", NodeClassNames[shift->Opcode()]));
aoqi@0	341	return NULL;
aoqi@0	342	}
aoqi@0	343
aoqi@0	344	// Return initial Pack node. Additional operands added with add_opd() calls.
aoqi@0	345	PackNode* PackNode::make(Compile* C, Node* s, uint vlen, BasicType bt) {
aoqi@0	346	const TypeVect* vt = TypeVect::make(bt, vlen);
aoqi@0	347	switch (bt) {
aoqi@0	348	case T_BOOLEAN:
aoqi@0	349	case T_BYTE:
aoqi@0	350	return new (C) PackBNode(s, vt);
aoqi@0	351	case T_CHAR:
aoqi@0	352	case T_SHORT:
aoqi@0	353	return new (C) PackSNode(s, vt);
aoqi@0	354	case T_INT:
aoqi@0	355	return new (C) PackINode(s, vt);
aoqi@0	356	case T_LONG:
aoqi@0	357	return new (C) PackLNode(s, vt);
aoqi@0	358	case T_FLOAT:
aoqi@0	359	return new (C) PackFNode(s, vt);
aoqi@0	360	case T_DOUBLE:
aoqi@0	361	return new (C) PackDNode(s, vt);
aoqi@0	362	}
aoqi@0	363	fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
aoqi@0	364	return NULL;
aoqi@0	365	}
aoqi@0	366
aoqi@0	367	// Create a binary tree form for Packs. [lo, hi) (half-open) range
aoqi@0	368	PackNode* PackNode::binary_tree_pack(Compile* C, int lo, int hi) {
aoqi@0	369	int ct = hi - lo;
aoqi@0	370	assert(is_power_of_2(ct), "power of 2");
aoqi@0	371	if (ct == 2) {
aoqi@0	372	PackNode* pk = PackNode::make(C, in(lo), 2, vect_type()->element_basic_type());
aoqi@0	373	pk->add_opd(in(lo+1));
aoqi@0	374	return pk;
aoqi@0	375
aoqi@0	376	} else {
aoqi@0	377	int mid = lo + ct/2;
aoqi@0	378	PackNode* n1 = binary_tree_pack(C, lo, mid);
aoqi@0	379	PackNode* n2 = binary_tree_pack(C, mid, hi );
aoqi@0	380
aoqi@0	381	BasicType bt = n1->vect_type()->element_basic_type();
aoqi@0	382	assert(bt == n2->vect_type()->element_basic_type(), "should be the same");
aoqi@0	383	switch (bt) {
aoqi@0	384	case T_BOOLEAN:
aoqi@0	385	case T_BYTE:
aoqi@0	386	return new (C) PackSNode(n1, n2, TypeVect::make(T_SHORT, 2));
aoqi@0	387	case T_CHAR:
aoqi@0	388	case T_SHORT:
aoqi@0	389	return new (C) PackINode(n1, n2, TypeVect::make(T_INT, 2));
aoqi@0	390	case T_INT:
aoqi@0	391	return new (C) PackLNode(n1, n2, TypeVect::make(T_LONG, 2));
aoqi@0	392	case T_LONG:
aoqi@0	393	return new (C) Pack2LNode(n1, n2, TypeVect::make(T_LONG, 2));
aoqi@0	394	case T_FLOAT:
aoqi@0	395	return new (C) PackDNode(n1, n2, TypeVect::make(T_DOUBLE, 2));
aoqi@0	396	case T_DOUBLE:
aoqi@0	397	return new (C) Pack2DNode(n1, n2, TypeVect::make(T_DOUBLE, 2));
aoqi@0	398	}
aoqi@0	399	fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
aoqi@0	400	}
aoqi@0	401	return NULL;
aoqi@0	402	}
aoqi@0	403
aoqi@0	404	// Return the vector version of a scalar load node.
aoqi@0	405	LoadVectorNode* LoadVectorNode::make(Compile* C, int opc, Node* ctl, Node* mem,
aoqi@0	406	Node* adr, const TypePtr* atyp, uint vlen, BasicType bt) {
aoqi@0	407	const TypeVect* vt = TypeVect::make(bt, vlen);
aoqi@0	408	return new (C) LoadVectorNode(ctl, mem, adr, atyp, vt);
aoqi@0	409	}
aoqi@0	410
aoqi@0	411	// Return the vector version of a scalar store node.
aoqi@0	412	StoreVectorNode* StoreVectorNode::make(Compile* C, int opc, Node* ctl, Node* mem,
aoqi@0	413	Node* adr, const TypePtr* atyp, Node* val,
aoqi@0	414	uint vlen) {
aoqi@0	415	return new (C) StoreVectorNode(ctl, mem, adr, atyp, val);
aoqi@0	416	}
aoqi@0	417
aoqi@0	418	// Extract a scalar element of vector.
aoqi@0	419	Node* ExtractNode::make(Compile* C, Node* v, uint position, BasicType bt) {
aoqi@0	420	assert((int)position < Matcher::max_vector_size(bt), "pos in range");
aoqi@0	421	ConINode* pos = ConINode::make(C, (int)position);
aoqi@0	422	switch (bt) {
aoqi@0	423	case T_BOOLEAN:
aoqi@0	424	return new (C) ExtractUBNode(v, pos);
aoqi@0	425	case T_BYTE:
aoqi@0	426	return new (C) ExtractBNode(v, pos);
aoqi@0	427	case T_CHAR:
aoqi@0	428	return new (C) ExtractCNode(v, pos);
aoqi@0	429	case T_SHORT:
aoqi@0	430	return new (C) ExtractSNode(v, pos);
aoqi@0	431	case T_INT:
aoqi@0	432	return new (C) ExtractINode(v, pos);
aoqi@0	433	case T_LONG:
aoqi@0	434	return new (C) ExtractLNode(v, pos);
aoqi@0	435	case T_FLOAT:
aoqi@0	436	return new (C) ExtractFNode(v, pos);
aoqi@0	437	case T_DOUBLE:
aoqi@0	438	return new (C) ExtractDNode(v, pos);
aoqi@0	439	}
aoqi@0	440	fatal(err_msg_res("Type '%s' is not supported for vectors", type2name(bt)));
aoqi@0	441	return NULL;
aoqi@0	442	}
aoqi@0	443