src/share/vm/memory/freeList.cpp

rev 5920 : 8035406: Improve data structure for Code Cache remembered sets
Summary: Change the code cache remembered sets data structure from a GrowableArray to a chunked list of nmethods. This makes the data structure more amenable to parallelization, and decreases freeing time.
Reviewed-by:

*** 1,7 ****
  /*
!  * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
--- 1,7 ----
  /*
!  * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
   * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   *
   * This code is free software; you can redistribute it and/or modify it
   * under the terms of the GNU General Public License version 2 only, as
   * published by the Free Software Foundation.
*** 32,41 ****
--- 32,42 ----
  #include "runtime/vmThread.hpp"
  #include "utilities/macros.hpp"
  
  #if INCLUDE_ALL_GCS
  #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
+ #include "gc_implementation/g1/g1CodeCacheRemSet.hpp"
  #endif // INCLUDE_ALL_GCS
  
  // Free list.  A FreeList is used to access a linked list of chunks
  // of space in the heap.  The head and tail are maintained so that
  // items can be (as in the current implementation) added at the
*** 330,335 ****
--- 331,337 ----
  
  template class FreeList<Metablock>;
  template class FreeList<Metachunk>;
  #if INCLUDE_ALL_GCS
  template class FreeList<FreeChunk>;
+ template class FreeList<G1CodeRootChunk>;
  #endif // INCLUDE_ALL_GCS