Sun, 23 May 2010 01:38:26 -0700
6939207: refactor constant pool index processing
Summary: Factored cleanup of instruction decode which prepares for enhanced ldc semantics.
Reviewed-by: twisti
duke@435 | 1 | /* |
jrose@1920 | 2 | * Copyright 1997-2010 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | # include "incls/_precompiled.incl" |
duke@435 | 26 | # include "incls/_bytecodeStream.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | Bytecodes::Code RawBytecodeStream::raw_next_special(Bytecodes::Code code) { |
duke@435 | 29 | assert(!is_last_bytecode(), "should have been checked"); |
duke@435 | 30 | // set next bytecode position |
kamg@848 | 31 | address bcp = RawBytecodeStream::bcp(); |
kamg@848 | 32 | address end = method()->code_base() + end_bci(); |
kamg@848 | 33 | int l = Bytecodes::raw_special_length_at(bcp, end); |
duke@435 | 34 | if (l <= 0 || (_bci + l) > _end_bci) { |
duke@435 | 35 | code = Bytecodes::_illegal; |
duke@435 | 36 | } else { |
duke@435 | 37 | _next_bci += l; |
duke@435 | 38 | assert(_bci < _next_bci, "length must be > 0"); |
duke@435 | 39 | // set attributes |
duke@435 | 40 | _is_wide = false; |
duke@435 | 41 | // check for special (uncommon) cases |
duke@435 | 42 | if (code == Bytecodes::_wide) { |
kamg@848 | 43 | if (bcp + 1 >= end) { |
kamg@848 | 44 | code = Bytecodes::_illegal; |
kamg@848 | 45 | } else { |
kamg@848 | 46 | code = (Bytecodes::Code)bcp[1]; |
kamg@848 | 47 | _is_wide = true; |
kamg@848 | 48 | } |
duke@435 | 49 | } |
duke@435 | 50 | } |
jrose@1920 | 51 | _raw_code = code; |
duke@435 | 52 | return code; |
duke@435 | 53 | } |
jrose@1920 | 54 | |
jrose@1920 | 55 | #ifdef ASSERT |
jrose@1920 | 56 | void BaseBytecodeStream::assert_raw_index_size(int size) const { |
jrose@1920 | 57 | if (raw_code() == Bytecodes::_invokedynamic && is_raw()) { |
jrose@1920 | 58 | // in raw mode, pretend indy is "bJJ__" |
jrose@1920 | 59 | assert(size == 2, "raw invokedynamic instruction has 2-byte index only"); |
jrose@1920 | 60 | } else { |
jrose@1920 | 61 | bytecode()->assert_index_size(size, raw_code(), is_wide()); |
jrose@1920 | 62 | } |
jrose@1920 | 63 | } |
jrose@1920 | 64 | |
jrose@1920 | 65 | void BaseBytecodeStream::assert_raw_stream(bool want_raw) const { |
jrose@1920 | 66 | if (want_raw) { |
jrose@1920 | 67 | assert( is_raw(), "this function only works on raw streams"); |
jrose@1920 | 68 | } else { |
jrose@1920 | 69 | assert(!is_raw(), "this function only works on non-raw streams"); |
jrose@1920 | 70 | } |
jrose@1920 | 71 | } |
jrose@1920 | 72 | #endif //ASSERT |