2
* Copyright (c) 1999, 2024, Oracle and/or its affiliates. All rights reserved.
3
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5
* This code is free software; you can redistribute it and/or modify it
6
* under the terms of the GNU General Public License version 2 only, as
7
* published by the Free Software Foundation.
9
* This code is distributed in the hope that it will be useful, but WITHOUT
10
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12
* version 2 for more details (a copy is included in the LICENSE file that
13
* accompanied this code).
15
* You should have received a copy of the GNU General Public License version
16
* 2 along with this work; if not, write to the Free Software Foundation,
17
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20
* or visit www.oracle.com if you need additional information or have any
25
#include "precompiled.hpp"
26
#include "ci/ciConstantPoolCache.hpp"
27
#include "ci/ciUtilities.inline.hpp"
28
#include "memory/allocation.hpp"
29
#include "memory/allocation.inline.hpp"
33
// This class caches indexed constant pool lookups.
35
// ------------------------------------------------------------------
36
// ciConstantPoolCache::ciConstantPoolCache
37
ciConstantPoolCache::ciConstantPoolCache(Arena* arena,
40
new (arena) GrowableArray<void*>(arena, expected_size, 0, nullptr);
41
_keys = new (arena) GrowableArray<int>(arena, expected_size, 0, 0);
44
int ciConstantPoolCache::key_compare(const int& key, const int& elt) {
45
if (key < elt) return -1;
46
else if (key > elt) return 1;
50
// ------------------------------------------------------------------
51
// ciConstantPoolCache::get
53
// Get the entry at some index
54
void* ciConstantPoolCache::get(int index) {
57
int pos = _keys->find_sorted<int, ciConstantPoolCache::key_compare>(index, found);
59
// This element is not present in the cache.
62
return _elements->at(pos);
65
// ------------------------------------------------------------------
66
// ciConstantPoolCache::insert
68
// Insert a ciObject into the table at some index.
69
void ciConstantPoolCache::insert(int index, void* elem) {
71
int pos = _keys->find_sorted<int, ciConstantPoolCache::key_compare>(index, found);
72
assert(!found, "duplicate");
73
_keys->insert_before(pos, index);
74
_elements->insert_before(pos, elem);
77
// ------------------------------------------------------------------
78
// ciConstantPoolCache::print
80
// Print debugging information about the cache.
81
void ciConstantPoolCache::print() {