< prev index next >

src/share/vm/gc/g1/g1CodeCacheRemSet.cpp

Print this page
rev 8362 : [mq]: hotspot
   1 /*
   2  * Copyright (c) 2014, 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 "code/codeCache.hpp"
  27 #include "code/nmethod.hpp"
  28 #include "gc_implementation/g1/g1CodeCacheRemSet.hpp"
  29 #include "gc_implementation/g1/heapRegion.hpp"
  30 #include "memory/heap.hpp"
  31 #include "memory/iterator.hpp"
  32 #include "oops/oop.inline.hpp"
  33 #include "utilities/hashtable.inline.hpp"
  34 #include "utilities/stack.inline.hpp"
  35 
  36 class CodeRootSetTable : public Hashtable<nmethod*, mtGC> {
  37   friend class G1CodeRootSetTest;
  38   typedef HashtableEntry<nmethod*, mtGC> Entry;
  39 
  40   static CodeRootSetTable* volatile _purge_list;
  41 
  42   CodeRootSetTable* _purge_next;
  43 
  44   unsigned int compute_hash(nmethod* nm) {
  45     uintptr_t hash = (uintptr_t)nm;
  46     return hash ^ (hash >> 7); // code heap blocks are 128byte aligned
  47   }
  48 
  49   void remove_entry(Entry* e, Entry* previous);


   1 /*
   2  * Copyright (c) 2014, 2015, 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 "code/codeCache.hpp"
  27 #include "code/nmethod.hpp"
  28 #include "gc/g1/g1CodeCacheRemSet.hpp"
  29 #include "gc/g1/heapRegion.hpp"
  30 #include "memory/heap.hpp"
  31 #include "memory/iterator.hpp"
  32 #include "oops/oop.inline.hpp"
  33 #include "utilities/hashtable.inline.hpp"
  34 #include "utilities/stack.inline.hpp"
  35 
  36 class CodeRootSetTable : public Hashtable<nmethod*, mtGC> {
  37   friend class G1CodeRootSetTest;
  38   typedef HashtableEntry<nmethod*, mtGC> Entry;
  39 
  40   static CodeRootSetTable* volatile _purge_list;
  41 
  42   CodeRootSetTable* _purge_next;
  43 
  44   unsigned int compute_hash(nmethod* nm) {
  45     uintptr_t hash = (uintptr_t)nm;
  46     return hash ^ (hash >> 7); // code heap blocks are 128byte aligned
  47   }
  48 
  49   void remove_entry(Entry* e, Entry* previous);


< prev index next >