1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/ci/ciConstantPoolCache.cpp Wed Apr 27 01:25:04 2016 +0800
1.3 @@ -0,0 +1,104 @@
1.4 +/*
1.5 + * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.23 + * or visit www.oracle.com if you need additional information or have any
1.24 + * questions.
1.25 + *
1.26 + */
1.27 +
1.28 +#include "precompiled.hpp"
1.29 +#include "ci/ciConstantPoolCache.hpp"
1.30 +#include "ci/ciUtilities.hpp"
1.31 +#include "memory/allocation.hpp"
1.32 +#include "memory/allocation.inline.hpp"
1.33 +
1.34 +// ciConstantPoolCache
1.35 +//
1.36 +// This class caches indexed constant pool lookups.
1.37 +
1.38 +// ------------------------------------------------------------------
1.39 +// ciConstantPoolCache::ciConstantPoolCache
1.40 +ciConstantPoolCache::ciConstantPoolCache(Arena* arena,
1.41 + int expected_size) {
1.42 + _elements =
1.43 + new (arena) GrowableArray<void*>(arena, expected_size, 0, 0);
1.44 + _keys = new (arena) GrowableArray<intptr_t>(arena, expected_size, 0, 0);
1.45 +}
1.46 +
1.47 +// ------------------------------------------------------------------
1.48 +// ciConstantPoolCache::get
1.49 +//
1.50 +// Get the entry at some index
1.51 +void* ciConstantPoolCache::get(int index) {
1.52 + ASSERT_IN_VM;
1.53 + int pos = find(index);
1.54 + if (pos >= _keys->length() ||
1.55 + _keys->at(pos) != index) {
1.56 + // This element is not present in the cache.
1.57 + return NULL;
1.58 + }
1.59 + return _elements->at(pos);
1.60 +}
1.61 +
1.62 +// ------------------------------------------------------------------
1.63 +// ciConstantPoolCache::find
1.64 +//
1.65 +// Use binary search to find the position of this index in the cache.
1.66 +// If there is no entry in the cache corresponding to this oop, return
1.67 +// the position at which the index would be inserted.
1.68 +int ciConstantPoolCache::find(int key) {
1.69 + int min = 0;
1.70 + int max = _keys->length()-1;
1.71 +
1.72 + while (max >= min) {
1.73 + int mid = (max + min) / 2;
1.74 + int value = _keys->at(mid);
1.75 + if (value < key) {
1.76 + min = mid + 1;
1.77 + } else if (value > key) {
1.78 + max = mid - 1;
1.79 + } else {
1.80 + return mid;
1.81 + }
1.82 + }
1.83 + return min;
1.84 +}
1.85 +
1.86 +// ------------------------------------------------------------------
1.87 +// ciConstantPoolCache::insert
1.88 +//
1.89 +// Insert a ciObject into the table at some index.
1.90 +void ciConstantPoolCache::insert(int index, void* elem) {
1.91 + int i;
1.92 + int pos = find(index);
1.93 + for (i = _keys->length()-1; i >= pos; i--) {
1.94 + _keys->at_put_grow(i+1, _keys->at(i));
1.95 + _elements->at_put_grow(i+1, _elements->at(i));
1.96 + }
1.97 + _keys->at_put_grow(pos, index);
1.98 + _elements->at_put_grow(pos, elem);
1.99 +}
1.100 +
1.101 +// ------------------------------------------------------------------
1.102 +// ciConstantPoolCache::print
1.103 +//
1.104 +// Print debugging information about the cache.
1.105 +void ciConstantPoolCache::print() {
1.106 + Unimplemented();
1.107 +}
