< prev index next >

src/share/vm/gc_implementation/concurrentMarkSweep/freeChunk.cpp

Print this page
rev 8031 : imported patch cms


  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 "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
  27 #include "memory/freeBlockDictionary.hpp"
  28 #include "utilities/copy.hpp"
  29 
  30 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
  31 
  32 #ifndef PRODUCT
  33 
  34 #define baadbabeHeapWord badHeapWordVal
  35 #define deadbeefHeapWord 0xdeadbeef
  36 
  37 size_t const FreeChunk::header_size() {
  38   return sizeof(FreeChunk)/HeapWordSize;
  39 }
  40 
  41 void FreeChunk::mangleAllocated(size_t size) {
  42   // mangle all but the header of a just-allocated block
  43   // of storage
  44   assert(size >= MinChunkSize, "smallest size of object");
  45   // we can't assert that _size == size because this may be an
  46   // allocation out of a linear allocation block
  47   assert(sizeof(FreeChunk) % HeapWordSize == 0,
  48          "shouldn't write beyond chunk");
  49   HeapWord* addr = (HeapWord*)this;
  50   size_t hdr = header_size();
  51   Copy::fill_to_words(addr + hdr, size - hdr, baadbabeHeapWord);


  57   // just prior to passing it to the storage dictionary
  58   assert(sz >= MinChunkSize, "smallest size of object");
  59   assert(sz == size(), "just checking");
  60   HeapWord* addr = (HeapWord*)this;
  61   size_t hdr = header_size();
  62   Copy::fill_to_words(addr + hdr, sz - hdr, deadbeefHeapWord);
  63 }
  64 
  65 void FreeChunk::verifyList() const {
  66   FreeChunk* nextFC = next();
  67   if (nextFC != NULL) {
  68     assert(this == nextFC->prev(), "broken chain");
  69     assert(size() == nextFC->size(), "wrong size");
  70     nextFC->verifyList();
  71   }
  72 }
  73 #endif
  74 
  75 void FreeChunk::print_on(outputStream* st) {
  76   st->print_cr("Next: " PTR_FORMAT " Prev: " PTR_FORMAT " %s",
  77     next(), prev(), cantCoalesce() ? "[can't coalesce]" : "");
  78 }


  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 "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
  27 #include "memory/freeBlockDictionary.hpp"
  28 #include "utilities/copy.hpp"
  29 


  30 #ifndef PRODUCT
  31 
  32 #define baadbabeHeapWord badHeapWordVal
  33 #define deadbeefHeapWord 0xdeadbeef
  34 
  35 size_t const FreeChunk::header_size() {
  36   return sizeof(FreeChunk)/HeapWordSize;
  37 }
  38 
  39 void FreeChunk::mangleAllocated(size_t size) {
  40   // mangle all but the header of a just-allocated block
  41   // of storage
  42   assert(size >= MinChunkSize, "smallest size of object");
  43   // we can't assert that _size == size because this may be an
  44   // allocation out of a linear allocation block
  45   assert(sizeof(FreeChunk) % HeapWordSize == 0,
  46          "shouldn't write beyond chunk");
  47   HeapWord* addr = (HeapWord*)this;
  48   size_t hdr = header_size();
  49   Copy::fill_to_words(addr + hdr, size - hdr, baadbabeHeapWord);


  55   // just prior to passing it to the storage dictionary
  56   assert(sz >= MinChunkSize, "smallest size of object");
  57   assert(sz == size(), "just checking");
  58   HeapWord* addr = (HeapWord*)this;
  59   size_t hdr = header_size();
  60   Copy::fill_to_words(addr + hdr, sz - hdr, deadbeefHeapWord);
  61 }
  62 
  63 void FreeChunk::verifyList() const {
  64   FreeChunk* nextFC = next();
  65   if (nextFC != NULL) {
  66     assert(this == nextFC->prev(), "broken chain");
  67     assert(size() == nextFC->size(), "wrong size");
  68     nextFC->verifyList();
  69   }
  70 }
  71 #endif
  72 
  73 void FreeChunk::print_on(outputStream* st) {
  74   st->print_cr("Next: " PTR_FORMAT " Prev: " PTR_FORMAT " %s",
  75     p2i(next()), p2i(prev()), cantCoalesce() ? "[can't coalesce]" : "");
  76 }
< prev index next >