1 /* 2 * Copyright (c) 2007, 2017, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 */ 23 24 #include "precompiled.hpp" 25 #include "memory/allocation.inline.hpp" 26 #include "opto/connode.hpp" 27 #include "opto/vectornode.hpp" 28 29 //------------------------------VectorNode-------------------------------------- 30 31 // Return the vector operator for the specified scalar operation 32 // and vector length. 33 int VectorNode::opcode(int sopc, BasicType bt) { 34 switch (sopc) { 35 case Op_AddI: 36 switch (bt) { 37 case T_BOOLEAN: 38 case T_BYTE: return Op_AddVB; 39 case T_CHAR: 40 case T_SHORT: return Op_AddVS; 41 case T_INT: return Op_AddVI; 42 default: ShouldNotReachHere(); return 0; 43 } 44 case Op_AddL: 45 assert(bt == T_LONG, "must be"); 46 return Op_AddVL; 47 case Op_AddF: 48 assert(bt == T_FLOAT, "must be"); 49 return Op_AddVF; 50 case Op_AddD: 51 assert(bt == T_DOUBLE, "must be"); 52 return Op_AddVD; 53 case Op_SubI: 54 switch (bt) { 55 case T_BOOLEAN: 56 case T_BYTE: return Op_SubVB; 57 case T_CHAR: 58 case T_SHORT: return Op_SubVS; 59 case T_INT: return Op_SubVI; 60 default: ShouldNotReachHere(); return 0; 61 } 62 case Op_SubL: 63 assert(bt == T_LONG, "must be"); 64 return Op_SubVL; 65 case Op_SubF: 66 assert(bt == T_FLOAT, "must be"); 67 return Op_SubVF; 68 case Op_SubD: 69 assert(bt == T_DOUBLE, "must be"); 70 return Op_SubVD; 71 case Op_MulI: 72 switch (bt) { 73 case T_BOOLEAN: 74 case T_BYTE: return 0; // Unimplemented 75 case T_CHAR: 76 case T_SHORT: return Op_MulVS; 77 case T_INT: return Op_MulVI; 78 default: ShouldNotReachHere(); return 0; 79 } 80 case Op_MulL: 81 assert(bt == T_LONG, "must be"); 82 return Op_MulVL; 83 case Op_MulF: 84 assert(bt == T_FLOAT, "must be"); 85 return Op_MulVF; 86 case Op_MulD: 87 assert(bt == T_DOUBLE, "must be"); 88 return Op_MulVD; 89 case Op_FmaD: 90 assert(bt == T_DOUBLE, "must be"); 91 return Op_FmaVD; 92 case Op_FmaF: 93 assert(bt == T_FLOAT, "must be"); 94 return Op_FmaVF; 95 case Op_CMoveF: 96 assert(bt == T_FLOAT, "must be"); 97 return Op_CMoveVF; 98 case Op_CMoveD: 99 assert(bt == T_DOUBLE, "must be"); 100 return Op_CMoveVD; 101 case Op_DivF: 102 assert(bt == T_FLOAT, "must be"); 103 return Op_DivVF; 104 case Op_DivD: 105 assert(bt == T_DOUBLE, "must be"); 106 return Op_DivVD; 107 case Op_AbsF: 108 assert(bt == T_FLOAT, "must be"); 109 return Op_AbsVF; 110 case Op_AbsD: 111 assert(bt == T_DOUBLE, "must be"); 112 return Op_AbsVD; 113 case Op_NegF: 114 assert(bt == T_FLOAT, "must be"); 115 return Op_NegVF; 116 case Op_NegD: 117 assert(bt == T_DOUBLE, "must be"); 118 return Op_NegVD; 119 case Op_SqrtF: 120 assert(bt == T_FLOAT, "must be"); 121 return Op_SqrtVF; 122 case Op_SqrtD: 123 assert(bt == T_DOUBLE, "must be"); 124 return Op_SqrtVD; 125 case Op_PopCountI: 126 if (bt == T_INT) { 127 return Op_PopCountVI; 128 } 129 // Unimplemented for subword types since bit count changes 130 // depending on size of lane (and sign bit). 131 return 0; 132 case Op_LShiftI: 133 switch (bt) { 134 case T_BOOLEAN: 135 case T_BYTE: return Op_LShiftVB; 136 case T_CHAR: 137 case T_SHORT: return Op_LShiftVS; 138 case T_INT: return Op_LShiftVI; 139 default: ShouldNotReachHere(); return 0; 140 } 141 case Op_LShiftL: 142 assert(bt == T_LONG, "must be"); 143 return Op_LShiftVL; 144 case Op_RShiftI: 145 switch (bt) { 146 case T_BOOLEAN:return Op_URShiftVB; // boolean is unsigned value 147 case T_CHAR: return Op_URShiftVS; // char is unsigned value 148 case T_BYTE: return Op_RShiftVB; 149 case T_SHORT: return Op_RShiftVS; 150 case T_INT: return Op_RShiftVI; 151 default: ShouldNotReachHere(); return 0; 152 } 153 case Op_RShiftL: 154 assert(bt == T_LONG, "must be"); 155 return Op_RShiftVL; 156 case Op_URShiftI: 157 switch (bt) { 158 case T_BOOLEAN:return Op_URShiftVB; 159 case T_CHAR: return Op_URShiftVS; 160 case T_BYTE: 161 case T_SHORT: return 0; // Vector logical right shift for signed short 162 // values produces incorrect Java result for 163 // negative data because java code should convert 164 // a short value into int value with sign 165 // extension before a shift. 166 case T_INT: return Op_URShiftVI; 167 default: ShouldNotReachHere(); return 0; 168 } 169 case Op_URShiftL: 170 assert(bt == T_LONG, "must be"); 171 return Op_URShiftVL; 172 case Op_AndI: 173 case Op_AndL: 174 return Op_AndV; 175 case Op_OrI: 176 case Op_OrL: 177 return Op_OrV; 178 case Op_XorI: 179 case Op_XorL: 180 return Op_XorV; 181 182 case Op_LoadB: 183 case Op_LoadUB: 184 case Op_LoadUS: 185 case Op_LoadS: 186 case Op_LoadI: 187 case Op_LoadL: 188 case Op_LoadF: 189 case Op_LoadD: 190 return Op_LoadVector; 191 192 case Op_StoreB: 193 case Op_StoreC: 194 case Op_StoreI: 195 case Op_StoreL: 196 case Op_StoreF: 197 case Op_StoreD: 198 return Op_StoreVector; 199 200 default: 201 return 0; // Unimplemented 202 } 203 } 204 205 // Also used to check if the code generator 206 // supports the vector operation. 207 bool VectorNode::implemented(int opc, uint vlen, BasicType bt) { 208 if (is_java_primitive(bt) && 209 (vlen > 1) && is_power_of_2(vlen) && 210 Matcher::vector_size_supported(bt, vlen)) { 211 int vopc = VectorNode::opcode(opc, bt); 212 return vopc > 0 && Matcher::match_rule_supported_vector(vopc, vlen); 213 } 214 return false; 215 } 216 217 bool VectorNode::is_shift(Node* n) { 218 switch (n->Opcode()) { 219 case Op_LShiftI: 220 case Op_LShiftL: 221 case Op_RShiftI: 222 case Op_RShiftL: 223 case Op_URShiftI: 224 case Op_URShiftL: 225 return true; 226 default: 227 return false; 228 } 229 } 230 231 // Check if input is loop invariant vector. 232 bool VectorNode::is_invariant_vector(Node* n) { 233 // Only Replicate vector nodes are loop invariant for now. 234 switch (n->Opcode()) { 235 case Op_ReplicateB: 236 case Op_ReplicateS: 237 case Op_ReplicateI: 238 case Op_ReplicateL: 239 case Op_ReplicateF: 240 case Op_ReplicateD: 241 return true; 242 default: 243 return false; 244 } 245 } 246 247 // [Start, end) half-open range defining which operands are vectors 248 void VectorNode::vector_operands(Node* n, uint* start, uint* end) { 249 switch (n->Opcode()) { 250 case Op_LoadB: case Op_LoadUB: 251 case Op_LoadS: case Op_LoadUS: 252 case Op_LoadI: case Op_LoadL: 253 case Op_LoadF: case Op_LoadD: 254 case Op_LoadP: case Op_LoadN: 255 case Op_LoadBarrierSlowReg: 256 case Op_LoadBarrierWeakSlowReg: 257 *start = 0; 258 *end = 0; // no vector operands 259 break; 260 case Op_StoreB: case Op_StoreC: 261 case Op_StoreI: case Op_StoreL: 262 case Op_StoreF: case Op_StoreD: 263 case Op_StoreP: case Op_StoreN: 264 *start = MemNode::ValueIn; 265 *end = MemNode::ValueIn + 1; // 1 vector operand 266 break; 267 case Op_LShiftI: case Op_LShiftL: 268 case Op_RShiftI: case Op_RShiftL: 269 case Op_URShiftI: case Op_URShiftL: 270 *start = 1; 271 *end = 2; // 1 vector operand 272 break; 273 case Op_AddI: case Op_AddL: case Op_AddF: case Op_AddD: 274 case Op_SubI: case Op_SubL: case Op_SubF: case Op_SubD: 275 case Op_MulI: case Op_MulL: case Op_MulF: case Op_MulD: 276 case Op_DivF: case Op_DivD: 277 case Op_AndI: case Op_AndL: 278 case Op_OrI: case Op_OrL: 279 case Op_XorI: case Op_XorL: 280 *start = 1; 281 *end = 3; // 2 vector operands 282 break; 283 case Op_CMoveI: case Op_CMoveL: case Op_CMoveF: case Op_CMoveD: 284 *start = 2; 285 *end = n->req(); 286 break; 287 case Op_FmaD: 288 case Op_FmaF: 289 *start = 1; 290 *end = 4; // 3 vector operands 291 break; 292 default: 293 *start = 1; 294 *end = n->req(); // default is all operands 295 } 296 } 297 298 // Return the vector version of a scalar operation node. 299 VectorNode* VectorNode::make(int opc, Node* n1, Node* n2, uint vlen, BasicType bt) { 300 const TypeVect* vt = TypeVect::make(bt, vlen); 301 int vopc = VectorNode::opcode(opc, bt); 302 // This method should not be called for unimplemented vectors. 303 guarantee(vopc > 0, "Vector for '%s' is not implemented", NodeClassNames[opc]); 304 switch (vopc) { 305 case Op_AddVB: return new AddVBNode(n1, n2, vt); 306 case Op_AddVS: return new AddVSNode(n1, n2, vt); 307 case Op_AddVI: return new AddVINode(n1, n2, vt); 308 case Op_AddVL: return new AddVLNode(n1, n2, vt); 309 case Op_AddVF: return new AddVFNode(n1, n2, vt); 310 case Op_AddVD: return new AddVDNode(n1, n2, vt); 311 312 case Op_SubVB: return new SubVBNode(n1, n2, vt); 313 case Op_SubVS: return new SubVSNode(n1, n2, vt); 314 case Op_SubVI: return new SubVINode(n1, n2, vt); 315 case Op_SubVL: return new SubVLNode(n1, n2, vt); 316 case Op_SubVF: return new SubVFNode(n1, n2, vt); 317 case Op_SubVD: return new SubVDNode(n1, n2, vt); 318 319 case Op_MulVS: return new MulVSNode(n1, n2, vt); 320 case Op_MulVI: return new MulVINode(n1, n2, vt); 321 case Op_MulVL: return new MulVLNode(n1, n2, vt); 322 case Op_MulVF: return new MulVFNode(n1, n2, vt); 323 case Op_MulVD: return new MulVDNode(n1, n2, vt); 324 325 case Op_DivVF: return new DivVFNode(n1, n2, vt); 326 case Op_DivVD: return new DivVDNode(n1, n2, vt); 327 328 case Op_AbsVF: return new AbsVFNode(n1, vt); 329 case Op_AbsVD: return new AbsVDNode(n1, vt); 330 331 case Op_NegVF: return new NegVFNode(n1, vt); 332 case Op_NegVD: return new NegVDNode(n1, vt); 333 334 case Op_SqrtVF: return new SqrtVFNode(n1, vt); 335 case Op_SqrtVD: return new SqrtVDNode(n1, vt); 336 337 case Op_PopCountVI: return new PopCountVINode(n1, vt); 338 339 case Op_LShiftVB: return new LShiftVBNode(n1, n2, vt); 340 case Op_LShiftVS: return new LShiftVSNode(n1, n2, vt); 341 case Op_LShiftVI: return new LShiftVINode(n1, n2, vt); 342 case Op_LShiftVL: return new LShiftVLNode(n1, n2, vt); 343 344 case Op_RShiftVB: return new RShiftVBNode(n1, n2, vt); 345 case Op_RShiftVS: return new RShiftVSNode(n1, n2, vt); 346 case Op_RShiftVI: return new RShiftVINode(n1, n2, vt); 347 case Op_RShiftVL: return new RShiftVLNode(n1, n2, vt); 348 349 case Op_URShiftVB: return new URShiftVBNode(n1, n2, vt); 350 case Op_URShiftVS: return new URShiftVSNode(n1, n2, vt); 351 case Op_URShiftVI: return new URShiftVINode(n1, n2, vt); 352 case Op_URShiftVL: return new URShiftVLNode(n1, n2, vt); 353 354 case Op_AndV: return new AndVNode(n1, n2, vt); 355 case Op_OrV: return new OrVNode (n1, n2, vt); 356 case Op_XorV: return new XorVNode(n1, n2, vt); 357 default: 358 fatal("Missed vector creation for '%s'", NodeClassNames[vopc]); 359 return NULL; 360 } 361 } 362 363 VectorNode* VectorNode::make(int opc, Node* n1, Node* n2, Node* n3, uint vlen, BasicType bt) { 364 const TypeVect* vt = TypeVect::make(bt, vlen); 365 int vopc = VectorNode::opcode(opc, bt); 366 // This method should not be called for unimplemented vectors. 367 guarantee(vopc > 0, "Vector for '%s' is not implemented", NodeClassNames[opc]); 368 switch (vopc) { 369 case Op_FmaVD: return new FmaVDNode(n1, n2, n3, vt); 370 case Op_FmaVF: return new FmaVFNode(n1, n2, n3, vt); 371 default: 372 fatal("Missed vector creation for '%s'", NodeClassNames[vopc]); 373 return NULL; 374 } 375 } 376 377 // Scalar promotion 378 VectorNode* VectorNode::scalar2vector(Node* s, uint vlen, const Type* opd_t) { 379 BasicType bt = opd_t->array_element_basic_type(); 380 const TypeVect* vt = opd_t->singleton() ? TypeVect::make(opd_t, vlen) 381 : TypeVect::make(bt, vlen); 382 switch (bt) { 383 case T_BOOLEAN: 384 case T_BYTE: 385 return new ReplicateBNode(s, vt); 386 case T_CHAR: 387 case T_SHORT: 388 return new ReplicateSNode(s, vt); 389 case T_INT: 390 return new ReplicateINode(s, vt); 391 case T_LONG: 392 return new ReplicateLNode(s, vt); 393 case T_FLOAT: 394 return new ReplicateFNode(s, vt); 395 case T_DOUBLE: 396 return new ReplicateDNode(s, vt); 397 default: 398 fatal("Type '%s' is not supported for vectors", type2name(bt)); 399 return NULL; 400 } 401 } 402 403 VectorNode* VectorNode::shift_count(Node* shift, Node* cnt, uint vlen, BasicType bt) { 404 assert(VectorNode::is_shift(shift) && !cnt->is_Con(), "only variable shift count"); 405 // Match shift count type with shift vector type. 406 const TypeVect* vt = TypeVect::make(bt, vlen); 407 switch (shift->Opcode()) { 408 case Op_LShiftI: 409 case Op_LShiftL: 410 return new LShiftCntVNode(cnt, vt); 411 case Op_RShiftI: 412 case Op_RShiftL: 413 case Op_URShiftI: 414 case Op_URShiftL: 415 return new RShiftCntVNode(cnt, vt); 416 default: 417 fatal("Missed vector creation for '%s'", NodeClassNames[shift->Opcode()]); 418 return NULL; 419 } 420 } 421 422 // Return initial Pack node. Additional operands added with add_opd() calls. 423 PackNode* PackNode::make(Node* s, uint vlen, BasicType bt) { 424 const TypeVect* vt = TypeVect::make(bt, vlen); 425 switch (bt) { 426 case T_BOOLEAN: 427 case T_BYTE: 428 return new PackBNode(s, vt); 429 case T_CHAR: 430 case T_SHORT: 431 return new PackSNode(s, vt); 432 case T_INT: 433 return new PackINode(s, vt); 434 case T_LONG: 435 return new PackLNode(s, vt); 436 case T_FLOAT: 437 return new PackFNode(s, vt); 438 case T_DOUBLE: 439 return new PackDNode(s, vt); 440 default: 441 fatal("Type '%s' is not supported for vectors", type2name(bt)); 442 return NULL; 443 } 444 } 445 446 // Create a binary tree form for Packs. [lo, hi) (half-open) range 447 PackNode* PackNode::binary_tree_pack(int lo, int hi) { 448 int ct = hi - lo; 449 assert(is_power_of_2(ct), "power of 2"); 450 if (ct == 2) { 451 PackNode* pk = PackNode::make(in(lo), 2, vect_type()->element_basic_type()); 452 pk->add_opd(in(lo+1)); 453 return pk; 454 } else { 455 int mid = lo + ct/2; 456 PackNode* n1 = binary_tree_pack(lo, mid); 457 PackNode* n2 = binary_tree_pack(mid, hi ); 458 459 BasicType bt = n1->vect_type()->element_basic_type(); 460 assert(bt == n2->vect_type()->element_basic_type(), "should be the same"); 461 switch (bt) { 462 case T_BOOLEAN: 463 case T_BYTE: 464 return new PackSNode(n1, n2, TypeVect::make(T_SHORT, 2)); 465 case T_CHAR: 466 case T_SHORT: 467 return new PackINode(n1, n2, TypeVect::make(T_INT, 2)); 468 case T_INT: 469 return new PackLNode(n1, n2, TypeVect::make(T_LONG, 2)); 470 case T_LONG: 471 return new Pack2LNode(n1, n2, TypeVect::make(T_LONG, 2)); 472 case T_FLOAT: 473 return new PackDNode(n1, n2, TypeVect::make(T_DOUBLE, 2)); 474 case T_DOUBLE: 475 return new Pack2DNode(n1, n2, TypeVect::make(T_DOUBLE, 2)); 476 default: 477 fatal("Type '%s' is not supported for vectors", type2name(bt)); 478 return NULL; 479 } 480 } 481 } 482 483 // Return the vector version of a scalar load node. 484 LoadVectorNode* LoadVectorNode::make(int opc, Node* ctl, Node* mem, 485 Node* adr, const TypePtr* atyp, 486 uint vlen, BasicType bt, 487 ControlDependency control_dependency) { 488 const TypeVect* vt = TypeVect::make(bt, vlen); 489 return new LoadVectorNode(ctl, mem, adr, atyp, vt, control_dependency); 490 } 491 492 // Return the vector version of a scalar store node. 493 StoreVectorNode* StoreVectorNode::make(int opc, Node* ctl, Node* mem, 494 Node* adr, const TypePtr* atyp, Node* val, 495 uint vlen) { 496 return new StoreVectorNode(ctl, mem, adr, atyp, val); 497 } 498 499 // Extract a scalar element of vector. 500 Node* ExtractNode::make(Node* v, uint position, BasicType bt) { 501 assert((int)position < Matcher::max_vector_size(bt), "pos in range"); 502 ConINode* pos = ConINode::make((int)position); 503 switch (bt) { 504 case T_BOOLEAN: 505 return new ExtractUBNode(v, pos); 506 case T_BYTE: 507 return new ExtractBNode(v, pos); 508 case T_CHAR: 509 return new ExtractCNode(v, pos); 510 case T_SHORT: 511 return new ExtractSNode(v, pos); 512 case T_INT: 513 return new ExtractINode(v, pos); 514 case T_LONG: 515 return new ExtractLNode(v, pos); 516 case T_FLOAT: 517 return new ExtractFNode(v, pos); 518 case T_DOUBLE: 519 return new ExtractDNode(v, pos); 520 default: 521 fatal("Type '%s' is not supported for vectors", type2name(bt)); 522 return NULL; 523 } 524 } 525 526 int ReductionNode::opcode(int opc, BasicType bt) { 527 int vopc = opc; 528 switch (opc) { 529 case Op_AddI: 530 assert(bt == T_INT, "must be"); 531 vopc = Op_AddReductionVI; 532 break; 533 case Op_AddL: 534 assert(bt == T_LONG, "must be"); 535 vopc = Op_AddReductionVL; 536 break; 537 case Op_AddF: 538 assert(bt == T_FLOAT, "must be"); 539 vopc = Op_AddReductionVF; 540 break; 541 case Op_AddD: 542 assert(bt == T_DOUBLE, "must be"); 543 vopc = Op_AddReductionVD; 544 break; 545 case Op_MulI: 546 assert(bt == T_INT, "must be"); 547 vopc = Op_MulReductionVI; 548 break; 549 case Op_MulL: 550 assert(bt == T_LONG, "must be"); 551 vopc = Op_MulReductionVL; 552 break; 553 case Op_MulF: 554 assert(bt == T_FLOAT, "must be"); 555 vopc = Op_MulReductionVF; 556 break; 557 case Op_MulD: 558 assert(bt == T_DOUBLE, "must be"); 559 vopc = Op_MulReductionVD; 560 break; 561 // TODO: add MulL for targets that support it 562 default: 563 break; 564 } 565 return vopc; 566 } 567 568 // Return the appropriate reduction node. 569 ReductionNode* ReductionNode::make(int opc, Node *ctrl, Node* n1, Node* n2, BasicType bt) { 570 571 int vopc = opcode(opc, bt); 572 573 // This method should not be called for unimplemented vectors. 574 guarantee(vopc != opc, "Vector for '%s' is not implemented", NodeClassNames[opc]); 575 576 switch (vopc) { 577 case Op_AddReductionVI: return new AddReductionVINode(ctrl, n1, n2); 578 case Op_AddReductionVL: return new AddReductionVLNode(ctrl, n1, n2); 579 case Op_AddReductionVF: return new AddReductionVFNode(ctrl, n1, n2); 580 case Op_AddReductionVD: return new AddReductionVDNode(ctrl, n1, n2); 581 case Op_MulReductionVI: return new MulReductionVINode(ctrl, n1, n2); 582 case Op_MulReductionVL: return new MulReductionVLNode(ctrl, n1, n2); 583 case Op_MulReductionVF: return new MulReductionVFNode(ctrl, n1, n2); 584 case Op_MulReductionVD: return new MulReductionVDNode(ctrl, n1, n2); 585 default: 586 fatal("Missed vector creation for '%s'", NodeClassNames[vopc]); 587 return NULL; 588 } 589 } 590 591 bool ReductionNode::implemented(int opc, uint vlen, BasicType bt) { 592 if (is_java_primitive(bt) && 593 (vlen > 1) && is_power_of_2(vlen) && 594 Matcher::vector_size_supported(bt, vlen)) { 595 int vopc = ReductionNode::opcode(opc, bt); 596 return vopc != opc && Matcher::match_rule_supported(vopc); 597 } 598 return false; 599 }