< prev index next >

hotspot/src/share/vm/c1/c1_Instruction.cpp

Print this page
rev 10453 : imported patch update dates

*** 1,7 **** /* ! * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 1999, 2016, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 562,572 **** } #endif for (int s = 0; s < from->number_of_sux();) { BlockBegin* sux = from->sux_at(s); if (sux == to) { ! int index = sux->_predecessors.index_of(from); if (index >= 0) { sux->_predecessors.remove_at(index); } from->_successors.remove_at(s); } else { --- 562,572 ---- } #endif for (int s = 0; s < from->number_of_sux();) { BlockBegin* sux = from->sux_at(s); if (sux == to) { ! int index = sux->_predecessors.find(from); if (index >= 0) { sux->_predecessors.remove_at(index); } from->_successors.remove_at(s); } else {
*** 662,672 **** } void BlockBegin::remove_successor(BlockBegin* pred) { int idx; ! while ((idx = _successors.index_of(pred)) >= 0) { _successors.remove_at(idx); } } --- 662,672 ---- } void BlockBegin::remove_successor(BlockBegin* pred) { int idx; ! while ((idx = _successors.find(pred)) >= 0) { _successors.remove_at(idx); } }
*** 675,685 **** } void BlockBegin::remove_predecessor(BlockBegin* pred) { int idx; ! while ((idx = _predecessors.index_of(pred)) >= 0) { _predecessors.remove_at(idx); } } --- 675,685 ---- } void BlockBegin::remove_predecessor(BlockBegin* pred) { int idx; ! while ((idx = _predecessors.find(pred)) >= 0) { _predecessors.remove_at(idx); } }
*** 720,736 **** } } void BlockBegin::iterate_preorder(BlockClosure* closure) { ! boolArray mark(number_of_blocks(), false); iterate_preorder(mark, closure); } void BlockBegin::iterate_postorder(BlockClosure* closure) { ! boolArray mark(number_of_blocks(), false); iterate_postorder(mark, closure); } void BlockBegin::block_values_do(ValueVisitor* f) { --- 720,738 ---- } } void BlockBegin::iterate_preorder(BlockClosure* closure) { ! int mark_len = number_of_blocks(); ! boolArray mark(mark_len, mark_len, false); iterate_preorder(mark, closure); } void BlockBegin::iterate_postorder(BlockClosure* closure) { ! int mark_len = number_of_blocks(); ! boolArray mark(mark_len, mark_len, false); iterate_postorder(mark, closure); } void BlockBegin::block_values_do(ValueVisitor* f) {
< prev index next >