Mon, 26 Sep 2011 10:24:05 -0700
7081933: Use zeroing elimination optimization for large array
Summary: Don't zero new typeArray during runtime call if the allocation is followed by arraycopy into it.
Reviewed-by: twisti
duke@435 | 1 | /* |
stefank@2314 | 2 | * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | */ |
duke@435 | 23 | |
stefank@2314 | 24 | #include "precompiled.hpp" |
stefank@2314 | 25 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 26 | #include "opto/connode.hpp" |
stefank@2314 | 27 | #include "opto/vectornode.hpp" |
duke@435 | 28 | |
duke@435 | 29 | //------------------------------VectorNode-------------------------------------- |
duke@435 | 30 | |
duke@435 | 31 | // Return vector type for an element type and vector length. |
duke@435 | 32 | const Type* VectorNode::vect_type(BasicType elt_bt, uint len) { |
duke@435 | 33 | assert(len <= VectorNode::max_vlen(elt_bt), "len in range"); |
duke@435 | 34 | switch(elt_bt) { |
duke@435 | 35 | case T_BOOLEAN: |
duke@435 | 36 | case T_BYTE: |
duke@435 | 37 | switch(len) { |
duke@435 | 38 | case 2: return TypeInt::CHAR; |
duke@435 | 39 | case 4: return TypeInt::INT; |
duke@435 | 40 | case 8: return TypeLong::LONG; |
duke@435 | 41 | } |
duke@435 | 42 | break; |
duke@435 | 43 | case T_CHAR: |
duke@435 | 44 | case T_SHORT: |
duke@435 | 45 | switch(len) { |
duke@435 | 46 | case 2: return TypeInt::INT; |
duke@435 | 47 | case 4: return TypeLong::LONG; |
duke@435 | 48 | } |
duke@435 | 49 | break; |
duke@435 | 50 | case T_INT: |
duke@435 | 51 | switch(len) { |
duke@435 | 52 | case 2: return TypeLong::LONG; |
duke@435 | 53 | } |
duke@435 | 54 | break; |
duke@435 | 55 | case T_LONG: |
duke@435 | 56 | break; |
duke@435 | 57 | case T_FLOAT: |
duke@435 | 58 | switch(len) { |
duke@435 | 59 | case 2: return Type::DOUBLE; |
duke@435 | 60 | } |
duke@435 | 61 | break; |
duke@435 | 62 | case T_DOUBLE: |
duke@435 | 63 | break; |
duke@435 | 64 | } |
duke@435 | 65 | ShouldNotReachHere(); |
duke@435 | 66 | return NULL; |
duke@435 | 67 | } |
duke@435 | 68 | |
duke@435 | 69 | // Scalar promotion |
duke@435 | 70 | VectorNode* VectorNode::scalar2vector(Compile* C, Node* s, uint vlen, const Type* opd_t) { |
duke@435 | 71 | BasicType bt = opd_t->array_element_basic_type(); |
duke@435 | 72 | assert(vlen <= VectorNode::max_vlen(bt), "vlen in range"); |
duke@435 | 73 | switch (bt) { |
duke@435 | 74 | case T_BOOLEAN: |
duke@435 | 75 | case T_BYTE: |
duke@435 | 76 | if (vlen == 16) return new (C, 2) Replicate16BNode(s); |
duke@435 | 77 | if (vlen == 8) return new (C, 2) Replicate8BNode(s); |
duke@435 | 78 | if (vlen == 4) return new (C, 2) Replicate4BNode(s); |
duke@435 | 79 | break; |
duke@435 | 80 | case T_CHAR: |
duke@435 | 81 | if (vlen == 8) return new (C, 2) Replicate8CNode(s); |
duke@435 | 82 | if (vlen == 4) return new (C, 2) Replicate4CNode(s); |
duke@435 | 83 | if (vlen == 2) return new (C, 2) Replicate2CNode(s); |
duke@435 | 84 | break; |
duke@435 | 85 | case T_SHORT: |
duke@435 | 86 | if (vlen == 8) return new (C, 2) Replicate8SNode(s); |
duke@435 | 87 | if (vlen == 4) return new (C, 2) Replicate4SNode(s); |
duke@435 | 88 | if (vlen == 2) return new (C, 2) Replicate2SNode(s); |
duke@435 | 89 | break; |
duke@435 | 90 | case T_INT: |
duke@435 | 91 | if (vlen == 4) return new (C, 2) Replicate4INode(s); |
duke@435 | 92 | if (vlen == 2) return new (C, 2) Replicate2INode(s); |
duke@435 | 93 | break; |
duke@435 | 94 | case T_LONG: |
duke@435 | 95 | if (vlen == 2) return new (C, 2) Replicate2LNode(s); |
duke@435 | 96 | break; |
duke@435 | 97 | case T_FLOAT: |
duke@435 | 98 | if (vlen == 4) return new (C, 2) Replicate4FNode(s); |
duke@435 | 99 | if (vlen == 2) return new (C, 2) Replicate2FNode(s); |
duke@435 | 100 | break; |
duke@435 | 101 | case T_DOUBLE: |
duke@435 | 102 | if (vlen == 2) return new (C, 2) Replicate2DNode(s); |
duke@435 | 103 | break; |
duke@435 | 104 | } |
duke@435 | 105 | ShouldNotReachHere(); |
duke@435 | 106 | return NULL; |
duke@435 | 107 | } |
duke@435 | 108 | |
duke@435 | 109 | // Return initial Pack node. Additional operands added with add_opd() calls. |
duke@435 | 110 | PackNode* PackNode::make(Compile* C, Node* s, const Type* opd_t) { |
duke@435 | 111 | BasicType bt = opd_t->array_element_basic_type(); |
duke@435 | 112 | switch (bt) { |
duke@435 | 113 | case T_BOOLEAN: |
duke@435 | 114 | case T_BYTE: |
duke@435 | 115 | return new (C, 2) PackBNode(s); |
duke@435 | 116 | case T_CHAR: |
duke@435 | 117 | return new (C, 2) PackCNode(s); |
duke@435 | 118 | case T_SHORT: |
duke@435 | 119 | return new (C, 2) PackSNode(s); |
duke@435 | 120 | case T_INT: |
duke@435 | 121 | return new (C, 2) PackINode(s); |
duke@435 | 122 | case T_LONG: |
duke@435 | 123 | return new (C, 2) PackLNode(s); |
duke@435 | 124 | case T_FLOAT: |
duke@435 | 125 | return new (C, 2) PackFNode(s); |
duke@435 | 126 | case T_DOUBLE: |
duke@435 | 127 | return new (C, 2) PackDNode(s); |
duke@435 | 128 | } |
duke@435 | 129 | ShouldNotReachHere(); |
duke@435 | 130 | return NULL; |
duke@435 | 131 | } |
duke@435 | 132 | |
duke@435 | 133 | // Create a binary tree form for Packs. [lo, hi) (half-open) range |
duke@435 | 134 | Node* PackNode::binaryTreePack(Compile* C, int lo, int hi) { |
duke@435 | 135 | int ct = hi - lo; |
duke@435 | 136 | assert(is_power_of_2(ct), "power of 2"); |
duke@435 | 137 | int mid = lo + ct/2; |
duke@435 | 138 | Node* n1 = ct == 2 ? in(lo) : binaryTreePack(C, lo, mid); |
duke@435 | 139 | Node* n2 = ct == 2 ? in(lo+1) : binaryTreePack(C, mid, hi ); |
kvn@464 | 140 | int rslt_bsize = ct * type2aelembytes(elt_basic_type()); |
duke@435 | 141 | if (bottom_type()->is_floatingpoint()) { |
duke@435 | 142 | switch (rslt_bsize) { |
duke@435 | 143 | case 8: return new (C, 3) PackFNode(n1, n2); |
duke@435 | 144 | case 16: return new (C, 3) PackDNode(n1, n2); |
duke@435 | 145 | } |
duke@435 | 146 | } else { |
duke@435 | 147 | assert(bottom_type()->isa_int() || bottom_type()->isa_long(), "int or long"); |
duke@435 | 148 | switch (rslt_bsize) { |
duke@435 | 149 | case 2: return new (C, 3) Pack2x1BNode(n1, n2); |
duke@435 | 150 | case 4: return new (C, 3) Pack2x2BNode(n1, n2); |
duke@435 | 151 | case 8: return new (C, 3) PackINode(n1, n2); |
duke@435 | 152 | case 16: return new (C, 3) PackLNode(n1, n2); |
duke@435 | 153 | } |
duke@435 | 154 | } |
duke@435 | 155 | ShouldNotReachHere(); |
duke@435 | 156 | return NULL; |
duke@435 | 157 | } |
duke@435 | 158 | |
duke@435 | 159 | // Return the vector operator for the specified scalar operation |
duke@435 | 160 | // and vector length. One use is to check if the code generator |
duke@435 | 161 | // supports the vector operation. |
duke@435 | 162 | int VectorNode::opcode(int sopc, uint vlen, const Type* opd_t) { |
duke@435 | 163 | BasicType bt = opd_t->array_element_basic_type(); |
duke@435 | 164 | if (!(is_power_of_2(vlen) && vlen <= max_vlen(bt))) |
duke@435 | 165 | return 0; // unimplemented |
duke@435 | 166 | switch (sopc) { |
duke@435 | 167 | case Op_AddI: |
duke@435 | 168 | switch (bt) { |
duke@435 | 169 | case T_BOOLEAN: |
duke@435 | 170 | case T_BYTE: return Op_AddVB; |
duke@435 | 171 | case T_CHAR: return Op_AddVC; |
duke@435 | 172 | case T_SHORT: return Op_AddVS; |
duke@435 | 173 | case T_INT: return Op_AddVI; |
duke@435 | 174 | } |
duke@435 | 175 | ShouldNotReachHere(); |
duke@435 | 176 | case Op_AddL: |
duke@435 | 177 | assert(bt == T_LONG, "must be"); |
duke@435 | 178 | return Op_AddVL; |
duke@435 | 179 | case Op_AddF: |
duke@435 | 180 | assert(bt == T_FLOAT, "must be"); |
duke@435 | 181 | return Op_AddVF; |
duke@435 | 182 | case Op_AddD: |
duke@435 | 183 | assert(bt == T_DOUBLE, "must be"); |
duke@435 | 184 | return Op_AddVD; |
duke@435 | 185 | case Op_SubI: |
duke@435 | 186 | switch (bt) { |
duke@435 | 187 | case T_BOOLEAN: |
duke@435 | 188 | case T_BYTE: return Op_SubVB; |
duke@435 | 189 | case T_CHAR: return Op_SubVC; |
duke@435 | 190 | case T_SHORT: return Op_SubVS; |
duke@435 | 191 | case T_INT: return Op_SubVI; |
duke@435 | 192 | } |
duke@435 | 193 | ShouldNotReachHere(); |
duke@435 | 194 | case Op_SubL: |
duke@435 | 195 | assert(bt == T_LONG, "must be"); |
duke@435 | 196 | return Op_SubVL; |
duke@435 | 197 | case Op_SubF: |
duke@435 | 198 | assert(bt == T_FLOAT, "must be"); |
duke@435 | 199 | return Op_SubVF; |
duke@435 | 200 | case Op_SubD: |
duke@435 | 201 | assert(bt == T_DOUBLE, "must be"); |
duke@435 | 202 | return Op_SubVD; |
duke@435 | 203 | case Op_MulF: |
duke@435 | 204 | assert(bt == T_FLOAT, "must be"); |
duke@435 | 205 | return Op_MulVF; |
duke@435 | 206 | case Op_MulD: |
duke@435 | 207 | assert(bt == T_DOUBLE, "must be"); |
duke@435 | 208 | return Op_MulVD; |
duke@435 | 209 | case Op_DivF: |
duke@435 | 210 | assert(bt == T_FLOAT, "must be"); |
duke@435 | 211 | return Op_DivVF; |
duke@435 | 212 | case Op_DivD: |
duke@435 | 213 | assert(bt == T_DOUBLE, "must be"); |
duke@435 | 214 | return Op_DivVD; |
duke@435 | 215 | case Op_LShiftI: |
duke@435 | 216 | switch (bt) { |
duke@435 | 217 | case T_BOOLEAN: |
duke@435 | 218 | case T_BYTE: return Op_LShiftVB; |
duke@435 | 219 | case T_CHAR: return Op_LShiftVC; |
duke@435 | 220 | case T_SHORT: return Op_LShiftVS; |
duke@435 | 221 | case T_INT: return Op_LShiftVI; |
duke@435 | 222 | } |
duke@435 | 223 | ShouldNotReachHere(); |
duke@435 | 224 | case Op_URShiftI: |
duke@435 | 225 | switch (bt) { |
duke@435 | 226 | case T_BOOLEAN: |
duke@435 | 227 | case T_BYTE: return Op_URShiftVB; |
duke@435 | 228 | case T_CHAR: return Op_URShiftVC; |
duke@435 | 229 | case T_SHORT: return Op_URShiftVS; |
duke@435 | 230 | case T_INT: return Op_URShiftVI; |
duke@435 | 231 | } |
duke@435 | 232 | ShouldNotReachHere(); |
duke@435 | 233 | case Op_AndI: |
duke@435 | 234 | case Op_AndL: |
duke@435 | 235 | return Op_AndV; |
duke@435 | 236 | case Op_OrI: |
duke@435 | 237 | case Op_OrL: |
duke@435 | 238 | return Op_OrV; |
duke@435 | 239 | case Op_XorI: |
duke@435 | 240 | case Op_XorL: |
duke@435 | 241 | return Op_XorV; |
duke@435 | 242 | |
duke@435 | 243 | case Op_LoadB: |
twisti@993 | 244 | case Op_LoadUS: |
duke@435 | 245 | case Op_LoadS: |
duke@435 | 246 | case Op_LoadI: |
duke@435 | 247 | case Op_LoadL: |
duke@435 | 248 | case Op_LoadF: |
duke@435 | 249 | case Op_LoadD: |
duke@435 | 250 | return VectorLoadNode::opcode(sopc, vlen); |
duke@435 | 251 | |
duke@435 | 252 | case Op_StoreB: |
duke@435 | 253 | case Op_StoreC: |
duke@435 | 254 | case Op_StoreI: |
duke@435 | 255 | case Op_StoreL: |
duke@435 | 256 | case Op_StoreF: |
duke@435 | 257 | case Op_StoreD: |
duke@435 | 258 | return VectorStoreNode::opcode(sopc, vlen); |
duke@435 | 259 | } |
duke@435 | 260 | return 0; // Unimplemented |
duke@435 | 261 | } |
duke@435 | 262 | |
duke@435 | 263 | // Helper for above. |
duke@435 | 264 | int VectorLoadNode::opcode(int sopc, uint vlen) { |
duke@435 | 265 | switch (sopc) { |
duke@435 | 266 | case Op_LoadB: |
duke@435 | 267 | switch (vlen) { |
duke@435 | 268 | case 2: return 0; // Unimplemented |
duke@435 | 269 | case 4: return Op_Load4B; |
duke@435 | 270 | case 8: return Op_Load8B; |
duke@435 | 271 | case 16: return Op_Load16B; |
duke@435 | 272 | } |
duke@435 | 273 | break; |
twisti@993 | 274 | case Op_LoadUS: |
duke@435 | 275 | switch (vlen) { |
duke@435 | 276 | case 2: return Op_Load2C; |
duke@435 | 277 | case 4: return Op_Load4C; |
duke@435 | 278 | case 8: return Op_Load8C; |
duke@435 | 279 | } |
duke@435 | 280 | break; |
duke@435 | 281 | case Op_LoadS: |
duke@435 | 282 | switch (vlen) { |
duke@435 | 283 | case 2: return Op_Load2S; |
duke@435 | 284 | case 4: return Op_Load4S; |
duke@435 | 285 | case 8: return Op_Load8S; |
duke@435 | 286 | } |
duke@435 | 287 | break; |
duke@435 | 288 | case Op_LoadI: |
duke@435 | 289 | switch (vlen) { |
duke@435 | 290 | case 2: return Op_Load2I; |
duke@435 | 291 | case 4: return Op_Load4I; |
duke@435 | 292 | } |
duke@435 | 293 | break; |
duke@435 | 294 | case Op_LoadL: |
duke@435 | 295 | if (vlen == 2) return Op_Load2L; |
duke@435 | 296 | break; |
duke@435 | 297 | case Op_LoadF: |
duke@435 | 298 | switch (vlen) { |
duke@435 | 299 | case 2: return Op_Load2F; |
duke@435 | 300 | case 4: return Op_Load4F; |
duke@435 | 301 | } |
duke@435 | 302 | break; |
duke@435 | 303 | case Op_LoadD: |
duke@435 | 304 | if (vlen == 2) return Op_Load2D; |
duke@435 | 305 | break; |
duke@435 | 306 | } |
duke@435 | 307 | return 0; // Unimplemented |
duke@435 | 308 | } |
duke@435 | 309 | |
duke@435 | 310 | // Helper for above |
duke@435 | 311 | int VectorStoreNode::opcode(int sopc, uint vlen) { |
duke@435 | 312 | switch (sopc) { |
duke@435 | 313 | case Op_StoreB: |
duke@435 | 314 | switch (vlen) { |
duke@435 | 315 | case 2: return 0; // Unimplemented |
duke@435 | 316 | case 4: return Op_Store4B; |
duke@435 | 317 | case 8: return Op_Store8B; |
duke@435 | 318 | case 16: return Op_Store16B; |
duke@435 | 319 | } |
duke@435 | 320 | break; |
duke@435 | 321 | case Op_StoreC: |
duke@435 | 322 | switch (vlen) { |
duke@435 | 323 | case 2: return Op_Store2C; |
duke@435 | 324 | case 4: return Op_Store4C; |
duke@435 | 325 | case 8: return Op_Store8C; |
duke@435 | 326 | } |
duke@435 | 327 | break; |
duke@435 | 328 | case Op_StoreI: |
duke@435 | 329 | switch (vlen) { |
duke@435 | 330 | case 2: return Op_Store2I; |
duke@435 | 331 | case 4: return Op_Store4I; |
duke@435 | 332 | } |
duke@435 | 333 | break; |
duke@435 | 334 | case Op_StoreL: |
duke@435 | 335 | if (vlen == 2) return Op_Store2L; |
duke@435 | 336 | break; |
duke@435 | 337 | case Op_StoreF: |
duke@435 | 338 | switch (vlen) { |
duke@435 | 339 | case 2: return Op_Store2F; |
duke@435 | 340 | case 4: return Op_Store4F; |
duke@435 | 341 | } |
duke@435 | 342 | break; |
duke@435 | 343 | case Op_StoreD: |
duke@435 | 344 | if (vlen == 2) return Op_Store2D; |
duke@435 | 345 | break; |
duke@435 | 346 | } |
duke@435 | 347 | return 0; // Unimplemented |
duke@435 | 348 | } |
duke@435 | 349 | |
duke@435 | 350 | // Return the vector version of a scalar operation node. |
duke@435 | 351 | VectorNode* VectorNode::make(Compile* C, int sopc, Node* n1, Node* n2, uint vlen, const Type* opd_t) { |
duke@435 | 352 | int vopc = opcode(sopc, vlen, opd_t); |
duke@435 | 353 | |
duke@435 | 354 | switch (vopc) { |
duke@435 | 355 | case Op_AddVB: return new (C, 3) AddVBNode(n1, n2, vlen); |
duke@435 | 356 | case Op_AddVC: return new (C, 3) AddVCNode(n1, n2, vlen); |
duke@435 | 357 | case Op_AddVS: return new (C, 3) AddVSNode(n1, n2, vlen); |
duke@435 | 358 | case Op_AddVI: return new (C, 3) AddVINode(n1, n2, vlen); |
duke@435 | 359 | case Op_AddVL: return new (C, 3) AddVLNode(n1, n2, vlen); |
duke@435 | 360 | case Op_AddVF: return new (C, 3) AddVFNode(n1, n2, vlen); |
duke@435 | 361 | case Op_AddVD: return new (C, 3) AddVDNode(n1, n2, vlen); |
duke@435 | 362 | |
duke@435 | 363 | case Op_SubVB: return new (C, 3) SubVBNode(n1, n2, vlen); |
duke@435 | 364 | case Op_SubVC: return new (C, 3) SubVCNode(n1, n2, vlen); |
duke@435 | 365 | case Op_SubVS: return new (C, 3) SubVSNode(n1, n2, vlen); |
duke@435 | 366 | case Op_SubVI: return new (C, 3) SubVINode(n1, n2, vlen); |
duke@435 | 367 | case Op_SubVL: return new (C, 3) SubVLNode(n1, n2, vlen); |
duke@435 | 368 | case Op_SubVF: return new (C, 3) SubVFNode(n1, n2, vlen); |
duke@435 | 369 | case Op_SubVD: return new (C, 3) SubVDNode(n1, n2, vlen); |
duke@435 | 370 | |
duke@435 | 371 | case Op_MulVF: return new (C, 3) MulVFNode(n1, n2, vlen); |
duke@435 | 372 | case Op_MulVD: return new (C, 3) MulVDNode(n1, n2, vlen); |
duke@435 | 373 | |
duke@435 | 374 | case Op_DivVF: return new (C, 3) DivVFNode(n1, n2, vlen); |
duke@435 | 375 | case Op_DivVD: return new (C, 3) DivVDNode(n1, n2, vlen); |
duke@435 | 376 | |
duke@435 | 377 | case Op_LShiftVB: return new (C, 3) LShiftVBNode(n1, n2, vlen); |
duke@435 | 378 | case Op_LShiftVC: return new (C, 3) LShiftVCNode(n1, n2, vlen); |
duke@435 | 379 | case Op_LShiftVS: return new (C, 3) LShiftVSNode(n1, n2, vlen); |
duke@435 | 380 | case Op_LShiftVI: return new (C, 3) LShiftVINode(n1, n2, vlen); |
duke@435 | 381 | |
duke@435 | 382 | case Op_URShiftVB: return new (C, 3) URShiftVBNode(n1, n2, vlen); |
duke@435 | 383 | case Op_URShiftVC: return new (C, 3) URShiftVCNode(n1, n2, vlen); |
duke@435 | 384 | case Op_URShiftVS: return new (C, 3) URShiftVSNode(n1, n2, vlen); |
duke@435 | 385 | case Op_URShiftVI: return new (C, 3) URShiftVINode(n1, n2, vlen); |
duke@435 | 386 | |
duke@435 | 387 | case Op_AndV: return new (C, 3) AndVNode(n1, n2, vlen, opd_t->array_element_basic_type()); |
duke@435 | 388 | case Op_OrV: return new (C, 3) OrVNode (n1, n2, vlen, opd_t->array_element_basic_type()); |
duke@435 | 389 | case Op_XorV: return new (C, 3) XorVNode(n1, n2, vlen, opd_t->array_element_basic_type()); |
duke@435 | 390 | } |
duke@435 | 391 | ShouldNotReachHere(); |
duke@435 | 392 | return NULL; |
duke@435 | 393 | } |
duke@435 | 394 | |
duke@435 | 395 | // Return the vector version of a scalar load node. |
duke@435 | 396 | VectorLoadNode* VectorLoadNode::make(Compile* C, int opc, Node* ctl, Node* mem, |
duke@435 | 397 | Node* adr, const TypePtr* atyp, uint vlen) { |
duke@435 | 398 | int vopc = opcode(opc, vlen); |
duke@435 | 399 | |
duke@435 | 400 | switch(vopc) { |
duke@435 | 401 | case Op_Load16B: return new (C, 3) Load16BNode(ctl, mem, adr, atyp); |
duke@435 | 402 | case Op_Load8B: return new (C, 3) Load8BNode(ctl, mem, adr, atyp); |
duke@435 | 403 | case Op_Load4B: return new (C, 3) Load4BNode(ctl, mem, adr, atyp); |
duke@435 | 404 | |
duke@435 | 405 | case Op_Load8C: return new (C, 3) Load8CNode(ctl, mem, adr, atyp); |
duke@435 | 406 | case Op_Load4C: return new (C, 3) Load4CNode(ctl, mem, adr, atyp); |
duke@435 | 407 | case Op_Load2C: return new (C, 3) Load2CNode(ctl, mem, adr, atyp); |
duke@435 | 408 | |
duke@435 | 409 | case Op_Load8S: return new (C, 3) Load8SNode(ctl, mem, adr, atyp); |
duke@435 | 410 | case Op_Load4S: return new (C, 3) Load4SNode(ctl, mem, adr, atyp); |
duke@435 | 411 | case Op_Load2S: return new (C, 3) Load2SNode(ctl, mem, adr, atyp); |
duke@435 | 412 | |
duke@435 | 413 | case Op_Load4I: return new (C, 3) Load4INode(ctl, mem, adr, atyp); |
duke@435 | 414 | case Op_Load2I: return new (C, 3) Load2INode(ctl, mem, adr, atyp); |
duke@435 | 415 | |
duke@435 | 416 | case Op_Load2L: return new (C, 3) Load2LNode(ctl, mem, adr, atyp); |
duke@435 | 417 | |
duke@435 | 418 | case Op_Load4F: return new (C, 3) Load4FNode(ctl, mem, adr, atyp); |
duke@435 | 419 | case Op_Load2F: return new (C, 3) Load2FNode(ctl, mem, adr, atyp); |
duke@435 | 420 | |
duke@435 | 421 | case Op_Load2D: return new (C, 3) Load2DNode(ctl, mem, adr, atyp); |
duke@435 | 422 | } |
duke@435 | 423 | ShouldNotReachHere(); |
duke@435 | 424 | return NULL; |
duke@435 | 425 | } |
duke@435 | 426 | |
duke@435 | 427 | // Return the vector version of a scalar store node. |
duke@435 | 428 | VectorStoreNode* VectorStoreNode::make(Compile* C, int opc, Node* ctl, Node* mem, |
kvn@3040 | 429 | Node* adr, const TypePtr* atyp, Node* val, |
duke@435 | 430 | uint vlen) { |
duke@435 | 431 | int vopc = opcode(opc, vlen); |
duke@435 | 432 | |
duke@435 | 433 | switch(vopc) { |
duke@435 | 434 | case Op_Store16B: return new (C, 4) Store16BNode(ctl, mem, adr, atyp, val); |
duke@435 | 435 | case Op_Store8B: return new (C, 4) Store8BNode(ctl, mem, adr, atyp, val); |
duke@435 | 436 | case Op_Store4B: return new (C, 4) Store4BNode(ctl, mem, adr, atyp, val); |
duke@435 | 437 | |
duke@435 | 438 | case Op_Store8C: return new (C, 4) Store8CNode(ctl, mem, adr, atyp, val); |
duke@435 | 439 | case Op_Store4C: return new (C, 4) Store4CNode(ctl, mem, adr, atyp, val); |
duke@435 | 440 | case Op_Store2C: return new (C, 4) Store2CNode(ctl, mem, adr, atyp, val); |
duke@435 | 441 | |
duke@435 | 442 | case Op_Store4I: return new (C, 4) Store4INode(ctl, mem, adr, atyp, val); |
duke@435 | 443 | case Op_Store2I: return new (C, 4) Store2INode(ctl, mem, adr, atyp, val); |
duke@435 | 444 | |
duke@435 | 445 | case Op_Store2L: return new (C, 4) Store2LNode(ctl, mem, adr, atyp, val); |
duke@435 | 446 | |
duke@435 | 447 | case Op_Store4F: return new (C, 4) Store4FNode(ctl, mem, adr, atyp, val); |
duke@435 | 448 | case Op_Store2F: return new (C, 4) Store2FNode(ctl, mem, adr, atyp, val); |
duke@435 | 449 | |
duke@435 | 450 | case Op_Store2D: return new (C, 4) Store2DNode(ctl, mem, adr, atyp, val); |
duke@435 | 451 | } |
duke@435 | 452 | ShouldNotReachHere(); |
duke@435 | 453 | return NULL; |
duke@435 | 454 | } |
duke@435 | 455 | |
duke@435 | 456 | // Extract a scalar element of vector. |
duke@435 | 457 | Node* ExtractNode::make(Compile* C, Node* v, uint position, const Type* opd_t) { |
duke@435 | 458 | BasicType bt = opd_t->array_element_basic_type(); |
duke@435 | 459 | assert(position < VectorNode::max_vlen(bt), "pos in range"); |
duke@435 | 460 | ConINode* pos = ConINode::make(C, (int)position); |
duke@435 | 461 | switch (bt) { |
duke@435 | 462 | case T_BOOLEAN: |
duke@435 | 463 | case T_BYTE: |
duke@435 | 464 | return new (C, 3) ExtractBNode(v, pos); |
duke@435 | 465 | case T_CHAR: |
duke@435 | 466 | return new (C, 3) ExtractCNode(v, pos); |
duke@435 | 467 | case T_SHORT: |
duke@435 | 468 | return new (C, 3) ExtractSNode(v, pos); |
duke@435 | 469 | case T_INT: |
duke@435 | 470 | return new (C, 3) ExtractINode(v, pos); |
duke@435 | 471 | case T_LONG: |
duke@435 | 472 | return new (C, 3) ExtractLNode(v, pos); |
duke@435 | 473 | case T_FLOAT: |
duke@435 | 474 | return new (C, 3) ExtractFNode(v, pos); |
duke@435 | 475 | case T_DOUBLE: |
duke@435 | 476 | return new (C, 3) ExtractDNode(v, pos); |
duke@435 | 477 | } |
duke@435 | 478 | ShouldNotReachHere(); |
duke@435 | 479 | return NULL; |
duke@435 | 480 | } |