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