Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/prims/methodComparator.hpp@1d01a7f3a336 (annotated)

src/share/vm/prims/methodComparator.hpp

Wed, 23 Apr 2014 11:18:53 +0200

author
sjohanss
date
Wed, 23 Apr 2014 11:18:53 +0200
changeset 6641
1d01a7f3a336
parent 4037
da91efe96a93
child 6876
710a3c8b516e
permissions
-rw-r--r--

8033426: Scale initial NewSize using NewRatio if not set on command line
Summary: Now using NewRatio to size initial NewSize if not specified on commandline.
Reviewed-by: jmasa, jwilhelm

duke@435 1 /*
coleenp@4037 2 * Copyright (c) 2000, 2012, Oracle and/or its affiliates. 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 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #ifndef SHARE_VM_PRIMS_METHODCOMPARATOR_HPP
stefank@2314 26 #define SHARE_VM_PRIMS_METHODCOMPARATOR_HPP
stefank@2314 27
stefank@2314 28 #include "interpreter/bytecodeStream.hpp"
coleenp@4037 29 #include "oops/constantPool.hpp"
coleenp@4037 30 #include "oops/method.hpp"
stefank@2314 31
duke@435 32 class BciMap;
duke@435 33
duke@435 34 // methodComparator provides an interface for determining if methods of
duke@435 35 // different versions of classes are equivalent or switchable
duke@435 36
duke@435 37 class MethodComparator {
duke@435 38 private:
duke@435 39 static BytecodeStream *_s_old, *_s_new;
coleenp@4037 40 static ConstantPool* _old_cp;
coleenp@4037 41 static ConstantPool* _new_cp;
duke@435 42 static BciMap *_bci_map;
duke@435 43 static bool _switchable_test;
duke@435 44 static GrowableArray<int> *_fwd_jmps;
duke@435 45
duke@435 46 static bool args_same(Bytecodes::Code c_old, Bytecodes::Code c_new);
jrose@2268 47 static bool pool_constants_same(int cpi_old, int cpi_new);
coleenp@4037 48 static int check_stack_and_locals_size(Method* old_method, Method* new_method);
duke@435 49
duke@435 50 public:
duke@435 51 // Check if the new method is equivalent to the old one modulo constant pool (EMCP).
duke@435 52 // Intuitive definition: two versions of the same method are EMCP, if they don't differ
duke@435 53 // on the source code level. Practically, we check whether the only difference between
duke@435 54 // method versions is some constantpool indices embedded into the bytecodes, and whether
duke@435 55 // these indices eventually point to the same constants for both method versions.
coleenp@4037 56 static bool methods_EMCP(Method* old_method, Method* new_method);
duke@435 57
coleenp@4037 58 static bool methods_switchable(Method* old_method, Method* new_method, BciMap &bci_map);
duke@435 59 };
duke@435 60
duke@435 61
duke@435 62 // ByteCode Index Map. For two versions of the same method, where the new version may contain
duke@435 63 // fragments not found in the old version, provides a mapping from an index of a bytecode in
duke@435 64 // the old method to the index of the same bytecode in the new method.
duke@435 65
duke@435 66 class BciMap {
duke@435 67 private:
duke@435 68 int *_old_bci, *_new_st_bci, *_new_end_bci;
duke@435 69 int _cur_size, _cur_pos;
duke@435 70 int _pos;
duke@435 71
duke@435 72 public:
duke@435 73 BciMap() {
duke@435 74 _cur_size = 50;
duke@435 75 _old_bci = (int*) malloc(sizeof(int) * _cur_size);
duke@435 76 _new_st_bci = (int*) malloc(sizeof(int) * _cur_size);
duke@435 77 _new_end_bci = (int*) malloc(sizeof(int) * _cur_size);
duke@435 78 _cur_pos = 0;
duke@435 79 }
duke@435 80
duke@435 81 ~BciMap() {
duke@435 82 free(_old_bci);
duke@435 83 free(_new_st_bci);
duke@435 84 free(_new_end_bci);
duke@435 85 }
duke@435 86
duke@435 87 // Store the position of an added fragment, e.g.
duke@435 88 //
duke@435 89 // |<- old_bci
duke@435 90 // -----------------------------------------
duke@435 91 // Old method |invokevirtual 5|aload 1|...
duke@435 92 // -----------------------------------------
duke@435 93 //
duke@435 94 // |<- new_st_bci |<- new_end_bci
duke@435 95 // --------------------------------------------------------------------
duke@435 96 // New method |invokevirual 5|aload 2|invokevirtual 6|aload 1|...
duke@435 97 // --------------------------------------------------------------------
duke@435 98 // ^^^^^^^^^^^^^^^^^^^^^^^^
duke@435 99 // Added fragment
duke@435 100
duke@435 101 void store_fragment_location(int old_bci, int new_st_bci, int new_end_bci) {
duke@435 102 if (_cur_pos == _cur_size) {
duke@435 103 _cur_size += 10;
duke@435 104 _old_bci = (int*) realloc(_old_bci, sizeof(int) * _cur_size);
duke@435 105 _new_st_bci = (int*) realloc(_new_st_bci, sizeof(int) * _cur_size);
duke@435 106 _new_end_bci = (int*) realloc(_new_end_bci, sizeof(int) * _cur_size);
duke@435 107 }
duke@435 108 _old_bci[_cur_pos] = old_bci;
duke@435 109 _new_st_bci[_cur_pos] = new_st_bci;
duke@435 110 _new_end_bci[_cur_pos] = new_end_bci;
duke@435 111 _cur_pos++;
duke@435 112 }
duke@435 113
duke@435 114 int new_bci_for_old(int old_bci) {
duke@435 115 if (_cur_pos == 0 || old_bci < _old_bci[0]) return old_bci;
duke@435 116 _pos = 1;
duke@435 117 while (_pos < _cur_pos && old_bci >= _old_bci[_pos])
duke@435 118 _pos++;
duke@435 119 return _new_end_bci[_pos-1] + (old_bci - _old_bci[_pos-1]);
duke@435 120 }
duke@435 121
duke@435 122 // Test if two indexes - one in the old method and another in the new one - correspond
duke@435 123 // to the same bytecode
duke@435 124 bool old_and_new_locations_same(int old_dest_bci, int new_dest_bci) {
duke@435 125 if (new_bci_for_old(old_dest_bci) == new_dest_bci)
duke@435 126 return true;
duke@435 127 else if (_old_bci[_pos-1] == old_dest_bci)
duke@435 128 return (new_dest_bci == _new_st_bci[_pos-1]);
duke@435 129 else return false;
duke@435 130 }
duke@435 131 };
stefank@2314 132
stefank@2314 133 #endif // SHARE_VM_PRIMS_METHODCOMPARATOR_HPP

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial