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 
  39 template <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 }
  47 
  48 
  49 template <MEMFLAGS F> inline BasicHashtable<F>::BasicHashtable(int table_size, int entry_size,
  50                                       HashtableBucket<F>* buckets,
  51                                       int number_of_entries) {
  52   // Called on startup, no locking needed
  53   initialize(table_size, entry_size, number_of_entries);
  54   _buckets = buckets;
  55 }
  56 
  57 template <MEMFLAGS F> inline BasicHashtable<F>::~BasicHashtable() {
  58   for (int i = 0; i < _entry_blocks->length(); i++) {
  59     FREE_C_HEAP_ARRAY(char, _entry_blocks->at(i));
  60   }
  61   delete _entry_blocks;
  62   free_buckets();
  63 }
  64 
  65 template <MEMFLAGS F> inline void BasicHashtable<F>::initialize(int table_size, int entry_size,
  66                                        int number_of_entries) {
  67   // Called on startup, no locking needed
  68   _table_size = table_size;
  69   _entry_size = entry_size;
  70   _free_list = NULL;
  71   _first_free_entry = NULL;
  72   _end_block = NULL;
  73   _number_of_entries = number_of_entries;
  74   _entry_blocks = new(ResourceObj::C_HEAP, F) GrowableArray<char*>(4, true, F);
  75 }
  76 
  77 
  78 // The following method is MT-safe and may be used with caution.
  79 template <MEMFLAGS F> inline BasicHashtableEntry<F>* BasicHashtable<F>::bucket(int i) const {
  80   return _buckets[i].get_entry();
  81 }
  82 
  83 
  84 template <MEMFLAGS F> inline void HashtableBucket<F>::set_entry(BasicHashtableEntry<F>* l) {
  85   // Warning: Preserve store ordering.  The PackageEntryTable, ModuleEntryTable and
  86   //          SystemDictionary are read without locks.  The new entry must be
  87   //          complete before other threads can be allowed to see it
  88   //          via a store to _buckets[index].
  89   OrderAccess::release_store(&_entry, l);
  90 }
  91 
  92 
  93 template <MEMFLAGS F> inline BasicHashtableEntry<F>* HashtableBucket<F>::get_entry() const {
  94   // Warning: Preserve load ordering.  The PackageEntryTable, ModuleEntryTable and
  95   //          SystemDictionary are read without locks.  The new entry must be
  96   //          complete before other threads can be allowed to see it
  97   //          via a store to _buckets[index].
  98   return OrderAccess::load_acquire(&_entry);
  99 }
 100 
 101 
 102 template <MEMFLAGS F> inline void BasicHashtable<F>::set_entry(int index, BasicHashtableEntry<F>* entry) {
 103   _buckets[index].set_entry(entry);
 104 }
 105 
 106 
 107 template <MEMFLAGS F> inline void BasicHashtable<F>::add_entry(int index, BasicHashtableEntry<F>* entry) {
 108   entry->set_next(bucket(index));
 109   _buckets[index].set_entry(entry);
 110   ++_number_of_entries;
 111 }
 112 
 113 template <MEMFLAGS F> inline void BasicHashtable<F>::free_entry(BasicHashtableEntry<F>* entry) {
 114   entry->set_next(_free_list);
 115   _free_list = entry;
 116   --_number_of_entries;
 117 }
 118 
 119 #endif // SHARE_UTILITIES_HASHTABLE_INLINE_HPP