equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
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 |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
134 (load != NULL) && load->is_Load() && |
134 (load != NULL) && load->is_Load() && |
135 (phase->is_IterGVN() != NULL); |
135 (phase->is_IterGVN() != NULL); |
136 if (!(is_instance || is_boxed_value_load)) |
136 if (!(is_instance || is_boxed_value_load)) |
137 return mchain; // don't try to optimize non-instance types |
137 return mchain; // don't try to optimize non-instance types |
138 uint instance_id = t_oop->instance_id(); |
138 uint instance_id = t_oop->instance_id(); |
139 Node *start_mem = phase->C->start()->proj_out(TypeFunc::Memory); |
139 Node *start_mem = phase->C->start()->proj_out_or_null(TypeFunc::Memory); |
140 Node *prev = NULL; |
140 Node *prev = NULL; |
141 Node *result = mchain; |
141 Node *result = mchain; |
142 while (prev != result) { |
142 while (prev != result) { |
143 prev = result; |
143 prev = result; |
144 if (result == start_mem) |
144 if (result == start_mem) |