equal
deleted
inserted
replaced
2115 case Op_AryEq: |
2115 case Op_AryEq: |
2116 case Op_HasNegatives: |
2116 case Op_HasNegatives: |
2117 case Op_StrInflatedCopy: |
2117 case Op_StrInflatedCopy: |
2118 case Op_StrCompressedCopy: |
2118 case Op_StrCompressedCopy: |
2119 case Op_EncodeISOArray: |
2119 case Op_EncodeISOArray: |
|
2120 case Op_FmaD: |
|
2121 case Op_FmaF: |
2120 set_shared(n); // Force result into register (it will be anyways) |
2122 set_shared(n); // Force result into register (it will be anyways) |
2121 break; |
2123 break; |
2122 case Op_ConP: { // Convert pointers above the centerline to NUL |
2124 case Op_ConP: { // Convert pointers above the centerline to NUL |
2123 TypeNode *tn = n->as_Type(); // Constants derive from type nodes |
2125 TypeNode *tn = n->as_Type(); // Constants derive from type nodes |
2124 const TypePtr* tp = tn->type()->is_ptr(); |
2126 const TypePtr* tp = tn->type()->is_ptr(); |
2303 Node* pair = new BinaryNode(n->in(3), n->in(4)); |
2305 Node* pair = new BinaryNode(n->in(3), n->in(4)); |
2304 n->set_req(3, pair); |
2306 n->set_req(3, pair); |
2305 n->del_req(4); |
2307 n->del_req(4); |
2306 break; |
2308 break; |
2307 } |
2309 } |
|
2310 case Op_FmaD: |
|
2311 case Op_FmaF: { |
|
2312 // Restructure into a binary tree for Matching. |
|
2313 Node* pair = new BinaryNode(n->in(1), n->in(2)); |
|
2314 n->set_req(2, pair); |
|
2315 n->set_req(1, n->in(3)); |
|
2316 n->del_req(3); |
|
2317 break; |
|
2318 } |
2308 default: |
2319 default: |
2309 break; |
2320 break; |
2310 } |
2321 } |
2311 } |
2322 } |
2312 else { |
2323 else { |