Thu, 12 Oct 2017 21:27:07 +0800
merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2003, 2012, 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 | #ifndef SHARE_VM_UTILITIES_HASHTABLE_INLINE_HPP |
aoqi@0 | 26 | #define SHARE_VM_UTILITIES_HASHTABLE_INLINE_HPP |
aoqi@0 | 27 | |
aoqi@0 | 28 | #include "memory/allocation.inline.hpp" |
goetz@6911 | 29 | #include "runtime/orderAccess.inline.hpp" |
aoqi@0 | 30 | #include "utilities/hashtable.hpp" |
aoqi@0 | 31 | #include "utilities/dtrace.hpp" |
aoqi@0 | 32 | |
aoqi@0 | 33 | // Inline function definitions for hashtable.hpp. |
aoqi@0 | 34 | |
aoqi@0 | 35 | // -------------------------------------------------------------------------- |
aoqi@0 | 36 | |
aoqi@0 | 37 | // Initialize a table. |
aoqi@0 | 38 | |
aoqi@0 | 39 | template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size) { |
aoqi@0 | 40 | // Called on startup, no locking needed |
aoqi@0 | 41 | initialize(table_size, entry_size, 0); |
aoqi@0 | 42 | _buckets = NEW_C_HEAP_ARRAY2(HashtableBucket<F>, table_size, F, CURRENT_PC); |
aoqi@0 | 43 | for (int index = 0; index < _table_size; index++) { |
aoqi@0 | 44 | _buckets[index].clear(); |
aoqi@0 | 45 | } |
aoqi@0 | 46 | } |
aoqi@0 | 47 | |
aoqi@0 | 48 | |
aoqi@0 | 49 | template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size, |
aoqi@0 | 50 | HashtableBucket<F>* buckets, |
aoqi@0 | 51 | int number_of_entries) { |
aoqi@0 | 52 | // Called on startup, no locking needed |
aoqi@0 | 53 | initialize(table_size, entry_size, number_of_entries); |
aoqi@0 | 54 | _buckets = buckets; |
aoqi@0 | 55 | } |
aoqi@0 | 56 | |
aoqi@0 | 57 | |
aoqi@0 | 58 | template <MEMFLAGS F> inline void BasicHashtable<F>::initialize(int table_size, int entry_size, |
aoqi@0 | 59 | int number_of_entries) { |
aoqi@0 | 60 | // Called on startup, no locking needed |
aoqi@0 | 61 | _table_size = table_size; |
aoqi@0 | 62 | _entry_size = entry_size; |
aoqi@0 | 63 | _free_list = NULL; |
aoqi@0 | 64 | _first_free_entry = NULL; |
aoqi@0 | 65 | _end_block = NULL; |
aoqi@0 | 66 | _number_of_entries = number_of_entries; |
aoqi@0 | 67 | #ifdef ASSERT |
aoqi@0 | 68 | _lookup_count = 0; |
aoqi@0 | 69 | _lookup_length = 0; |
aoqi@0 | 70 | #endif |
aoqi@0 | 71 | } |
aoqi@0 | 72 | |
aoqi@0 | 73 | |
aoqi@0 | 74 | // The following method is MT-safe and may be used with caution. |
aoqi@0 | 75 | template <MEMFLAGS F> inline BasicHashtableEntry<F>* BasicHashtable<F>::bucket(int i) { |
aoqi@0 | 76 | return _buckets[i].get_entry(); |
aoqi@0 | 77 | } |
aoqi@0 | 78 | |
aoqi@0 | 79 | |
aoqi@0 | 80 | template <MEMFLAGS F> inline void HashtableBucket<F>::set_entry(BasicHashtableEntry<F>* l) { |
aoqi@0 | 81 | // Warning: Preserve store ordering. The SystemDictionary is read |
aoqi@0 | 82 | // without locks. The new SystemDictionaryEntry must be |
aoqi@0 | 83 | // complete before other threads can be allowed to see it |
aoqi@0 | 84 | // via a store to _buckets[index]. |
aoqi@0 | 85 | OrderAccess::release_store_ptr(&_entry, l); |
aoqi@0 | 86 | } |
aoqi@0 | 87 | |
aoqi@0 | 88 | |
aoqi@0 | 89 | template <MEMFLAGS F> inline BasicHashtableEntry<F>* HashtableBucket<F>::get_entry() const { |
aoqi@0 | 90 | // Warning: Preserve load ordering. The SystemDictionary is read |
aoqi@0 | 91 | // without locks. The new SystemDictionaryEntry must be |
aoqi@0 | 92 | // complete before other threads can be allowed to see it |
aoqi@0 | 93 | // via a store to _buckets[index]. |
aoqi@0 | 94 | return (BasicHashtableEntry<F>*) OrderAccess::load_ptr_acquire(&_entry); |
aoqi@0 | 95 | } |
aoqi@0 | 96 | |
aoqi@0 | 97 | |
aoqi@0 | 98 | template <MEMFLAGS F> inline void BasicHashtable<F>::set_entry(int index, BasicHashtableEntry<F>* entry) { |
aoqi@0 | 99 | _buckets[index].set_entry(entry); |
aoqi@0 | 100 | } |
aoqi@0 | 101 | |
aoqi@0 | 102 | |
aoqi@0 | 103 | template <MEMFLAGS F> inline void BasicHashtable<F>::add_entry(int index, BasicHashtableEntry<F>* entry) { |
aoqi@0 | 104 | entry->set_next(bucket(index)); |
aoqi@0 | 105 | _buckets[index].set_entry(entry); |
aoqi@0 | 106 | ++_number_of_entries; |
aoqi@0 | 107 | } |
aoqi@0 | 108 | |
aoqi@0 | 109 | template <MEMFLAGS F> inline void BasicHashtable<F>::free_entry(BasicHashtableEntry<F>* entry) { |
aoqi@0 | 110 | entry->set_next(_free_list); |
aoqi@0 | 111 | _free_list = entry; |
aoqi@0 | 112 | --_number_of_entries; |
aoqi@0 | 113 | } |
aoqi@0 | 114 | |
aoqi@0 | 115 | #endif // SHARE_VM_UTILITIES_HASHTABLE_INLINE_HPP |