1/*
2 * Copyright (c) 2003, 2019, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
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.
8 *
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).
14 *
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.
18 *
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
21 * questions.
22 *
23 */
24
25#ifndef SHARE_UTILITIES_HASHTABLE_INLINE_HPP
26#define SHARE_UTILITIES_HASHTABLE_INLINE_HPP
27
28#include "memory/allocation.inline.hpp"
29#include "runtime/orderAccess.hpp"
30#include "utilities/hashtable.hpp"
31#include "utilities/dtrace.hpp"
32
33// Inline function definitions for hashtable.hpp.
34
35// --------------------------------------------------------------------------
36
37// Initialize a table.
38
39template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size) {
40 // Called on startup, no locking needed
41 initialize(table_size, entry_size, 0);
42 _buckets = NEW_C_HEAP_ARRAY2(HashtableBucket<F>, table_size, F, CURRENT_PC);
43 for (int index = 0; index < _table_size; index++) {
44 _buckets[index].clear();
45 }
46 _stats_rate = TableRateStatistics();
47}
48
49
50template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size,
51 HashtableBucket<F>* buckets,
52 int number_of_entries) {
53 // Called on startup, no locking needed
54 initialize(table_size, entry_size, number_of_entries);
55 _buckets = buckets;
56 _stats_rate = TableRateStatistics();
57}
58
59template <MEMFLAGS F> inline BasicHashtable<F>::~BasicHashtable() {
60 for (int i = 0; i < _entry_blocks->length(); i++) {
61 FREE_C_HEAP_ARRAY(char, _entry_blocks->at(i));
62 }
63 delete _entry_blocks;
64 free_buckets();
65}
66
67template <MEMFLAGS F> inline void BasicHashtable<F>::initialize(int table_size, int entry_size,
68 int number_of_entries) {
69 // Called on startup, no locking needed
70 _table_size = table_size;
71 _entry_size = entry_size;
72 _free_list = NULL;
73 _first_free_entry = NULL;
74 _end_block = NULL;
75 _number_of_entries = number_of_entries;
76 _entry_blocks = new(ResourceObj::C_HEAP, F) GrowableArray<char*>(4, true, F);
77}
78
79
80// The following method is MT-safe and may be used with caution.
81template <MEMFLAGS F> inline BasicHashtableEntry<F>* BasicHashtable<F>::bucket(int i) const {
82 return _buckets[i].get_entry();
83}
84
85
86template <MEMFLAGS F> inline void HashtableBucket<F>::set_entry(BasicHashtableEntry<F>* l) {
87 // Warning: Preserve store ordering. The PackageEntryTable, ModuleEntryTable and
88 // SystemDictionary are read without locks. The new entry must be
89 // complete before other threads can be allowed to see it
90 // via a store to _buckets[index].
91 OrderAccess::release_store(&_entry, l);
92}
93
94
95template <MEMFLAGS F> inline BasicHashtableEntry<F>* HashtableBucket<F>::get_entry() const {
96 // Warning: Preserve load ordering. The PackageEntryTable, ModuleEntryTable and
97 // SystemDictionary are read without locks. The new entry must be
98 // complete before other threads can be allowed to see it
99 // via a store to _buckets[index].
100 return OrderAccess::load_acquire(&_entry);
101}
102
103
104template <MEMFLAGS F> inline void BasicHashtable<F>::set_entry(int index, BasicHashtableEntry<F>* entry) {
105 _buckets[index].set_entry(entry);
106 if (entry != NULL) {
107 JFR_ONLY(_stats_rate.add();)
108 } else {
109 JFR_ONLY(_stats_rate.remove();)
110 }
111}
112
113
114template <MEMFLAGS F> inline void BasicHashtable<F>::add_entry(int index, BasicHashtableEntry<F>* entry) {
115 entry->set_next(bucket(index));
116 _buckets[index].set_entry(entry);
117 ++_number_of_entries;
118 JFR_ONLY(_stats_rate.add();)
119}
120
121template <MEMFLAGS F> inline void BasicHashtable<F>::free_entry(BasicHashtableEntry<F>* entry) {
122 entry->set_next(_free_list);
123 _free_list = entry;
124 --_number_of_entries;
125 JFR_ONLY(_stats_rate.remove();)
126}
127
128#endif // SHARE_UTILITIES_HASHTABLE_INLINE_HPP
129