1.1 --- a/src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.cpp Wed Sep 01 00:40:05 2010 -0700
1.2 +++ b/src/share/vm/gc_implementation/concurrentMarkSweep/binaryTreeDictionary.cpp Fri Sep 10 17:07:55 2010 -0700
1.3 @@ -256,7 +256,7 @@
1.4 }
1.5
1.6 TreeChunk* TreeList::first_available() {
1.7 - guarantee(head() != NULL, "The head of the list cannot be NULL");
1.8 + assert(head() != NULL, "The head of the list cannot be NULL");
1.9 FreeChunk* fc = head()->next();
1.10 TreeChunk* retTC;
1.11 if (fc == NULL) {
1.12 @@ -272,7 +272,7 @@
1.13 // those in the list for this size; potentially slow and expensive,
1.14 // use with caution!
1.15 TreeChunk* TreeList::largest_address() {
1.16 - guarantee(head() != NULL, "The head of the list cannot be NULL");
1.17 + assert(head() != NULL, "The head of the list cannot be NULL");
1.18 FreeChunk* fc = head()->next();
1.19 TreeChunk* retTC;
1.20 if (fc == NULL) {
