Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/ci/ciConstantPoolCache.cpp@eef07cd490d4 (annotated)
src/share/vm/ci/ciConstantPoolCache.cpp
Wed, 03 Jul 2019 20:42:37 +0800
- author
- aoqi
- date
- Wed, 03 Jul 2019 20:42:37 +0800
- changeset 9637
- eef07cd490d4
- parent 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
Merge
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | * |
| aoqi@0 | 23 | */ |
| aoqi@0 | 24 | |
| aoqi@0 | 25 | #include "precompiled.hpp" |
| aoqi@0 | 26 | #include "ci/ciConstantPoolCache.hpp" |
| aoqi@0 | 27 | #include "ci/ciUtilities.hpp" |
| aoqi@0 | 28 | #include "memory/allocation.hpp" |
| aoqi@0 | 29 | #include "memory/allocation.inline.hpp" |
| aoqi@0 | 30 | |
| aoqi@0 | 31 | // ciConstantPoolCache |
| aoqi@0 | 32 | // |
| aoqi@0 | 33 | // This class caches indexed constant pool lookups. |
| aoqi@0 | 34 | |
| aoqi@0 | 35 | // ------------------------------------------------------------------ |
| aoqi@0 | 36 | // ciConstantPoolCache::ciConstantPoolCache |
| aoqi@0 | 37 | ciConstantPoolCache::ciConstantPoolCache(Arena* arena, |
| aoqi@0 | 38 | int expected_size) { |
| aoqi@0 | 39 | _elements = |
| aoqi@0 | 40 | new (arena) GrowableArray<void*>(arena, expected_size, 0, 0); |
| aoqi@0 | 41 | _keys = new (arena) GrowableArray<intptr_t>(arena, expected_size, 0, 0); |
| aoqi@0 | 42 | } |
| aoqi@0 | 43 | |
| aoqi@0 | 44 | // ------------------------------------------------------------------ |
| aoqi@0 | 45 | // ciConstantPoolCache::get |
| aoqi@0 | 46 | // |
| aoqi@0 | 47 | // Get the entry at some index |
| aoqi@0 | 48 | void* ciConstantPoolCache::get(int index) { |
| aoqi@0 | 49 | ASSERT_IN_VM; |
| aoqi@0 | 50 | int pos = find(index); |
| aoqi@0 | 51 | if (pos >= _keys->length() || |
| aoqi@0 | 52 | _keys->at(pos) != index) { |
| aoqi@0 | 53 | // This element is not present in the cache. |
| aoqi@0 | 54 | return NULL; |
| aoqi@0 | 55 | } |
| aoqi@0 | 56 | return _elements->at(pos); |
| aoqi@0 | 57 | } |
| aoqi@0 | 58 | |
| aoqi@0 | 59 | // ------------------------------------------------------------------ |
| aoqi@0 | 60 | // ciConstantPoolCache::find |
| aoqi@0 | 61 | // |
| aoqi@0 | 62 | // Use binary search to find the position of this index in the cache. |
| aoqi@0 | 63 | // If there is no entry in the cache corresponding to this oop, return |
| aoqi@0 | 64 | // the position at which the index would be inserted. |
| aoqi@0 | 65 | int ciConstantPoolCache::find(int key) { |
| aoqi@0 | 66 | int min = 0; |
| aoqi@0 | 67 | int max = _keys->length()-1; |
| aoqi@0 | 68 | |
| aoqi@0 | 69 | while (max >= min) { |
| aoqi@0 | 70 | int mid = (max + min) / 2; |
| aoqi@0 | 71 | int value = _keys->at(mid); |
| aoqi@0 | 72 | if (value < key) { |
| aoqi@0 | 73 | min = mid + 1; |
| aoqi@0 | 74 | } else if (value > key) { |
| aoqi@0 | 75 | max = mid - 1; |
| aoqi@0 | 76 | } else { |
| aoqi@0 | 77 | return mid; |
| aoqi@0 | 78 | } |
| aoqi@0 | 79 | } |
| aoqi@0 | 80 | return min; |
| aoqi@0 | 81 | } |
| aoqi@0 | 82 | |
| aoqi@0 | 83 | // ------------------------------------------------------------------ |
| aoqi@0 | 84 | // ciConstantPoolCache::insert |
| aoqi@0 | 85 | // |
| aoqi@0 | 86 | // Insert a ciObject into the table at some index. |
| aoqi@0 | 87 | void ciConstantPoolCache::insert(int index, void* elem) { |
| aoqi@0 | 88 | int i; |
| aoqi@0 | 89 | int pos = find(index); |
| aoqi@0 | 90 | for (i = _keys->length()-1; i >= pos; i--) { |
| aoqi@0 | 91 | _keys->at_put_grow(i+1, _keys->at(i)); |
| aoqi@0 | 92 | _elements->at_put_grow(i+1, _elements->at(i)); |
| aoqi@0 | 93 | } |
| aoqi@0 | 94 | _keys->at_put_grow(pos, index); |
| aoqi@0 | 95 | _elements->at_put_grow(pos, elem); |
| aoqi@0 | 96 | } |
| aoqi@0 | 97 | |
| aoqi@0 | 98 | // ------------------------------------------------------------------ |
| aoqi@0 | 99 | // ciConstantPoolCache::print |
| aoqi@0 | 100 | // |
| aoqi@0 | 101 | // Print debugging information about the cache. |
| aoqi@0 | 102 | void ciConstantPoolCache::print() { |
| aoqi@0 | 103 | Unimplemented(); |
| aoqi@0 | 104 | } |
