equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1997, 2014, 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. |
3979 for (uint i = InitializeNode::RawStores; i < req(); i++) { |
3979 for (uint i = InitializeNode::RawStores; i < req(); i++) { |
3980 Node* st = in(i); |
3980 Node* st = in(i); |
3981 intptr_t st_off = get_store_offset(st, phase); |
3981 intptr_t st_off = get_store_offset(st, phase); |
3982 if (st_off < 0) continue; // ignore dead garbage |
3982 if (st_off < 0) continue; // ignore dead garbage |
3983 if (last_off > st_off) { |
3983 if (last_off > st_off) { |
3984 tty->print_cr("*** bad store offset at %d: %d > %d", i, last_off, st_off); |
3984 tty->print_cr("*** bad store offset at %d: " INTX_FORMAT " > " INTX_FORMAT, i, last_off, st_off); |
3985 this->dump(2); |
3985 this->dump(2); |
3986 assert(false, "ascending store offsets"); |
3986 assert(false, "ascending store offsets"); |
3987 return false; |
3987 return false; |
3988 } |
3988 } |
3989 last_off = st_off + st->as_Store()->memory_size(); |
3989 last_off = st_off + st->as_Store()->memory_size(); |