src/share/vm/utilities/hashtable.cpp

Print this page


   1 /*
   2  * Copyright (c) 2003, 2008, 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 # include "incls/_precompiled.incl"
  26 # include "incls/_hashtable.cpp.incl"






  27 
  28 HS_DTRACE_PROBE_DECL4(hs_private, hashtable__new_entry,
  29   void*, unsigned int, oop, void*);
  30 
  31 // This is a generic hashtable, designed to be used for the symbol
  32 // and string tables.
  33 //
  34 // It is implemented as an open hash table with a fixed number of buckets.
  35 //
  36 // %note:
  37 //  - HashtableEntrys are allocated in blocks to reduce the space overhead.
  38 
  39 BasicHashtableEntry* BasicHashtable::new_entry(unsigned int hashValue) {
  40   BasicHashtableEntry* entry;
  41 
  42   if (_free_list) {
  43     entry = _free_list;
  44     _free_list = _free_list->next();
  45   } else {
  46     if (_first_free_entry + _entry_size >= _end_block) {


   1 /*
   2  * Copyright (c) 2003, 2010, 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 #include "precompiled.hpp"
  26 #include "memory/allocation.inline.hpp"
  27 #include "memory/resourceArea.hpp"
  28 #include "oops/oop.inline.hpp"
  29 #include "runtime/safepoint.hpp"
  30 #include "utilities/dtrace.hpp"
  31 #include "utilities/hashtable.hpp"
  32 #include "utilities/hashtable.inline.hpp"
  33 
  34 HS_DTRACE_PROBE_DECL4(hs_private, hashtable__new_entry,
  35   void*, unsigned int, oop, void*);
  36 
  37 // This is a generic hashtable, designed to be used for the symbol
  38 // and string tables.
  39 //
  40 // It is implemented as an open hash table with a fixed number of buckets.
  41 //
  42 // %note:
  43 //  - HashtableEntrys are allocated in blocks to reduce the space overhead.
  44 
  45 BasicHashtableEntry* BasicHashtable::new_entry(unsigned int hashValue) {
  46   BasicHashtableEntry* entry;
  47 
  48   if (_free_list) {
  49     entry = _free_list;
  50     _free_list = _free_list->next();
  51   } else {
  52     if (_first_free_entry + _entry_size >= _end_block) {