1 /*

     1 /*

     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

     4  *

     4  *

     5  * This code is free software; you can redistribute it and/or modify it

     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

     6  * under the terms of the GNU General Public License version 2 only, as

     7  * published by the Free Software Foundation.

     7  * published by the Free Software Foundation.

    22  *

    22  *

    23  */

    23  */

    24 

    24 

    25 #include "precompiled.hpp"

    25 #include "precompiled.hpp"

    26 #include "gc/g1/g1CollectedHeap.inline.hpp"

    26 #include "gc/g1/g1CollectedHeap.inline.hpp"

    27 #include "gc/g1/heapRegionRemSet.hpp"

    28 #include "gc/g1/heapRegionRemSet.hpp"

    28 #include "gc/g1/heapRegionSet.inline.hpp"

    29 #include "gc/g1/heapRegionSet.inline.hpp"

    29 

    30 

    30 uint FreeRegionList::_unrealistically_long_length = 0;

    31 uint FreeRegionList::_unrealistically_long_length = 0;

    31 

    32 

    99 

   100 

   100     HeapRegion* next = curr->next();

   101     HeapRegion* next = curr->next();

   101     curr->set_next(NULL);

   102     curr->set_next(NULL);

   102     curr->set_prev(NULL);

   103     curr->set_prev(NULL);

   103     curr->set_containing_set(NULL);

   104     curr->set_containing_set(NULL);

   104     curr = next;

   108     curr = next;

   105   }

   109   }

   106   clear();

   110   clear();

   107 

   111 

   108   verify_optional();

   112   verify_optional();

   115   verify_optional();

   119   verify_optional();

   116   from_list->verify_optional();

   120   from_list->verify_optional();

   117 

   121 

   118   if (from_list->is_empty()) {

   122   if (from_list->is_empty()) {

   119     return;

   123     return;

   120   }

   128   }

   121 

   129 

   122   #ifdef ASSERT

   130   #ifdef ASSERT

   123   FreeRegionListIterator iter(from_list);

   131   FreeRegionListIterator iter(from_list);

   124   while (iter.more_available()) {

   132   while (iter.more_available()) {

   218     curr->set_next(NULL);

   226     curr->set_next(NULL);

   219     curr->set_prev(NULL);

   227     curr->set_prev(NULL);

   220     remove(curr);

   228     remove(curr);

   221 

   229 

   222     count++;

   230     count++;

   223     curr = next;

   234     curr = next;

   224   }

   235   }

   225 

   236 

   226   assert(count == num_regions,

   237   assert(count == num_regions,

   227          "[%s] count: %u should be == num_regions: %u",

   238          "[%s] count: %u should be == num_regions: %u",

   265 void FreeRegionList::clear() {

   276 void FreeRegionList::clear() {

   266   _length = 0;

   277   _length = 0;

   267   _head = NULL;

   278   _head = NULL;

   268   _tail = NULL;

   279   _tail = NULL;

   269   _last = NULL;

   280   _last = NULL;

   270 }

   285 }

   271 

   286 

   272 void FreeRegionList::verify_list() {

   287 void FreeRegionList::verify_list() {

   273   HeapRegion* curr = _head;

   288   HeapRegion* curr = _head;

   274   HeapRegion* prev1 = NULL;

   289   HeapRegion* prev1 = NULL;

   301 

   316 

   302   guarantee(_tail == prev0, "Expected %s to end with %u but it ended with %u.", name(), _tail->hrm_index(), prev0->hrm_index());

   317   guarantee(_tail == prev0, "Expected %s to end with %u but it ended with %u.", name(), _tail->hrm_index(), prev0->hrm_index());

   303   guarantee(_tail == NULL || _tail->next() == NULL, "_tail should not have a next");

   318   guarantee(_tail == NULL || _tail->next() == NULL, "_tail should not have a next");

   304   guarantee(length() == count, "%s count mismatch. Expected %u, actual %u.", name(), length(), count);

   319   guarantee(length() == count, "%s count mismatch. Expected %u, actual %u.", name(), length(), count);

   305 }

   320 }